{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"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":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"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":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"reader-shell.ReaderShell (cyclomatic 225): reader-shell.ReaderShell has cyclomatic complexity 225 (threshold 15). Of this number, 109 points are the body\u0027s own statements and 116 belong to 40 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a25cf626fc23f511c45f1490a7bd76203f1a46ecefeadad437e5323b1e63546"}},{"ruleId":"D1","level":"warning","message":{"text":"audio-playback-provider.AudioPlaybackProvider (cyclomatic 201): audio-playback-provider.AudioPlaybackProvider has cyclomatic complexity 201 (threshold 15). Most of this is not in the body itself: 5 of the 201 points are its own statements and the rest belongs to 58 function literals inside it that branch (lines 337, 400, 821, \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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dded947bf46907df6442b6dc13f25ca19b12db112c96692d9602fe65c5fb14"}},{"ruleId":"D1","level":"warning","message":{"text":"app-shell.AppShell (cyclomatic 186): app-shell.AppShell has cyclomatic complexity 186 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 149 belong to 56 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":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41c4e3cf782901e182eb5d83a9d54a15abb32d48273151bac711925a4b30f99"}},{"ruleId":"D1","level":"warning","message":{"text":"book-detail-page.BookDetailPage (cyclomatic 156): book-detail-page.BookDetailPage has cyclomatic complexity 156 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 98 belong to 32 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3cca05d79c30fd7824c85e49a1858d8ca8d24f88f38f5d9dcf2454f045da83"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-reader-safety-policy.validate_policy (cyclomatic 130): generate-reader-safety-policy.validate_policy has cyclomatic complexity 130 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/reader-contracts/generate-reader-safety-policy.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"42133ced74c9670b313a8d5ccd72dda80fee4e235d4529eee7fc9b86e6e8a222"}},{"ruleId":"D1","level":"warning","message":{"text":"shelves-page.ShelvesPage (cyclomatic 125): shelves-page.ShelvesPage has cyclomatic complexity 125 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (shelves-page.ShelvesPage::openShelf) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"145742ca228c4d3f16ef5b62e940cd6542df629d9f49bbebff72167c4c1a7f34"}},{"ruleId":"D1","level":"warning","message":{"text":"library-page.LibraryPage (cyclomatic 119): library-page.LibraryPage has cyclomatic complexity 119 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 69 belong to 32 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":"apps/web/features/library/library-page.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca41945b9623d63c8dc561ce090710d053cb7eaa599e0b802c6456b3fdf3950b"}},{"ruleId":"D1","level":"warning","message":{"text":"update-operations.UpdateOperations (cyclomatic 100): update-operations.UpdateOperations has cyclomatic complexity 100 (threshold 15). Of this number, 84 points are the body\u0027s own statements and 16 belong to 4 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":"apps/web/features/updates/ui/update-operations.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fa815a68d13ba9d0c6d9268a8e49abaee5c96d25509560fab2344ad85e0f27"}},{"ruleId":"D1","level":"warning","message":{"text":"feedback-dialog.FeedbackDialog (cyclomatic 97): feedback-dialog.FeedbackDialog has cyclomatic complexity 97 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 62 belong to 21 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":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e3b890e77fafbd706377877642b5cc00fb997fc01100946e09553ddeab91c7"}},{"ruleId":"D1","level":"warning","message":{"text":"library-batch-actions.LibraryBatchDialog (cyclomatic 94): library-batch-actions.LibraryBatchDialog has cyclomatic complexity 94 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 44 belong to 20 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":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9814bcf69bd25debf4a8d0005df3d277e1aafa000ea31984899a88421a6f4552"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-engine-runtime.ReaderEngineRuntime (cyclomatic 89): reader-engine-runtime.ReaderEngineRuntime has cyclomatic complexity 89 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 73 belong to 27 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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5c4d0670f1a787a3284246b4942f4c1324227b0b9d74890229ae90f13a83d7"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiDownloadSheetKt.MultiDownloadSheet (cyclomatic 84): MultiDownloadSheetKt.MultiDownloadSheet has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c57beb98aa33bb739d1ef5fccc93e1c7a76198001857dd5bc7d92eb34a24a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanLibrarySourceTree._walk (cyclomatic 80): ScanLibrarySourceTree._walk has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b83f27c1f2b666501f741e444f6e95de6d6bdc3d59b894d5120989a69b3f59a"}},{"ruleId":"D1","level":"warning","message":{"text":"audio-mini-player.AudioMiniPlayer (cyclomatic 75): audio-mini-player.AudioMiniPlayer has cyclomatic complexity 75 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 18 belong to 9 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":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad57f00560eb0c953fc7cc9c6b301ea7caa0108f682e3212f1a3ef41379eab2"}},{"ruleId":"D1","level":"warning","message":{"text":"settings-page.SettingsPage (cyclomatic 74): settings-page.SettingsPage has cyclomatic complexity 74 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 57 belong to 20 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":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a43810484b870984bcffdf41197e6b523c8ff78f460f19a051dfdbbd55381c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessReadableResourceImportTask._execute_directory (cyclomatic 73): ProcessReadableResourceImportTask._execute_directory has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f35d50799555b390b8d4b05f84f374298dfe8c648b78f3e651d86d07638c757"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-reader-safety-conformance.evaluateFactCase (cyclomatic 71): generate-reader-safety-conformance.evaluateFactCase has cyclomatic complexity 71 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba924a32e3bc9869cf240abedeb1a8c3e87db1c6a1d2f6702d09219f3fbe85c"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-engine-runtime.readerErrorMessage (cyclomatic 67): reader-engine-runtime.readerErrorMessage has cyclomatic complexity 67 (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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc99f3efb18cc097baffc6a72303e0dbe920edf30f6e328b84044cf08899eee"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderSourceNodeMetadataRecognition.search (cyclomatic 65): ProviderSourceNodeMetadataRecognition.search has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e75f05f6a46c1a2585d4b60d9e612ad64432b1f533cff94ffe21acc9c159d2"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencySet.validate_set (cyclomatic 65): DependencySet.validate_set has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/updates/application/dependency_release.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ad153bdd66d4393cdef877ca7d7f126bd1e8638da637beb78e3bffe3f56e6c"}},{"ruleId":"D1","level":"warning","message":{"text":"target-directory-picker.TargetDirectoryPicker (cyclomatic 65): target-directory-picker.TargetDirectoryPicker has cyclomatic complexity 65 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 40 belong to 8 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":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8720d16667e73f46d67f32266ca81f5dbbb71895418209fe51a067e2ded125ca"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata_lookup_queue._prepare_candidate_application (cyclomatic 64): metadata_lookup_queue._prepare_candidate_application has cyclomatic complexity 64 (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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"924c4e26c66673803e89167e15a25f98390bba1a74ab7335ba7388e8d0423487"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-v3-page.ReaderV5Page (cyclomatic 62): reader-v3-page.ReaderV5Page has cyclomatic complexity 62 (threshold 15). Most of this is not in the body itself: 9 of the 62 points are its own statements and the rest belongs to 18 function literals inside it that branch (lines 292, 474, 370, \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":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc592e02da2e05e80875d930391f7a51f7a5d2e3173dcd6c004545b011c9230"}},{"ruleId":"D1","level":"warning","message":{"text":"directory-path-picker.DirectoryPathPicker (cyclomatic 61): directory-path-picker.DirectoryPathPicker has cyclomatic complexity 61 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 36 belong to 13 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f3d5710f2538f8986367e041b00e425485c56adddc7fc7a1584d3a38a3e030"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata-providers-panel.MetadataProvidersPanel (cyclomatic 61): metadata-providers-panel.MetadataProvidersPanel has cyclomatic complexity 61 (threshold 15). Most of this is not in the body itself: 10 of the 61 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 234, testProvider, a function literal at line 219, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"004c94521a50ca4603ddf07b4c1db225edde425f260005d7eb8e40ef9fdeffa9"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata_lookup_queue.process_metadata_lookup_task (cyclomatic 60): metadata_lookup_queue.process_metadata_lookup_task 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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"d072712ed6ebd97e3bc4cdf9991811cffaf4630e9086b8448c261524112bb35b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 60): main.main 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":"apps/api-python/app/worker/main.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bebc1c8581f58e9a7797d319c37981c928d6f4aeef8e5d995e1e24e5e2d93a5"}},{"ruleId":"D1","level":"warning","message":{"text":"users-permissions-page.UsersPermissionsPage (cyclomatic 60): users-permissions-page.UsersPermissionsPage has cyclomatic complexity 60 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 39 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cd6648f54c6ef106e51b10b8a1bdfc3421af04f822d61e8d606f8de0590ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"MainShellKt.MainShell (cyclomatic 58): MainShellKt.MainShell has cyclomatic complexity 58 (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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"496d830d1e47f62b75e5c7137c7afc70cc8e66a08351295824d2628a7695d445"}},{"ruleId":"D1","level":"warning","message":{"text":"readium-publication.openEpub (cyclomatic 57): readium-publication.openEpub has cyclomatic complexity 57 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 27 belong to 9 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c914e22dbc084e59029f2a2dd41eef0e9bb7f67ea8c881e00402c78775aea48a"}},{"ruleId":"D1","level":"warning","message":{"text":"management-logs-page.ManagementLogsPage (cyclomatic 53): management-logs-page.ManagementLogsPage has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 14 of the 53 points are its own statements and the rest belongs to 12 function items inside it that branch (saveLogLimit, a function literal at line 317, a function literal at line 358, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87335f883f8462f48c281f491c9074b5089349d12a0720f059beb07f806e0ac"}},{"ruleId":"D1","level":"warning","message":{"text":"resource-detail-view.ResourceDetailView (cyclomatic 51): resource-detail-view.ResourceDetailView has cyclomatic complexity 51 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 16 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/resource-detail-view.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ede396aff06fe8e33388a39fec0a3619691a4f8d80df0fccbe37a6ae582e98"}},{"ruleId":"D1","level":"warning","message":{"text":"import-tasks-page.ImportTasksPage (cyclomatic 50): import-tasks-page.ImportTasksPage has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 15 of the 50 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 143, a function literal at line 317, continueTask, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e61ae78f3b58e45603ad7d7ff8bd53f03c91151d1c5e03d12ef826815e053e"}},{"ruleId":"D1","level":"warning","message":{"text":"pwa-client.PwaClient (cyclomatic 49): pwa-client.PwaClient has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 4 of the 49 points are its own statements and the rest belongs to 21 function items inside it that branch (a function literal at line 172, a function literal at line 96, a function literal at line 132, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92001ff348732e3bd497e5fa62a1051e0eb64f1eddd28bf246a2d7f0c2615eb"}},{"ruleId":"D1","level":"warning","message":{"text":"BookManagementKt.ManagementPresentation (cyclomatic 47): BookManagementKt.ManagementPresentation has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7772119a7253cb7c54fdf1a14e6329c4d547f41b7a044cadec9a598fa772834e"}},{"ruleId":"D1","level":"warning","message":{"text":"book-table.BookTable (cyclomatic 47): book-table.BookTable has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 4 of the 47 points are its own statements and the rest belongs to 12 function items inside it that branch (sortableHeader, beginRowSelection, a function literal at line 221, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-table.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"136bfc0722a0378660277a3e7eaabc5184c73269cc7cd9dcef7d2d58b9a6f699"}},{"ruleId":"D1","level":"warning","message":{"text":"setup-page.SetupPage (cyclomatic 47): setup-page.SetupPage has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 7 of the 47 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 53, createAccount, addLibrary, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8f56ca624cd0b3f3a0882787b30f689555234fe32433b0cbe821575d1d16fa"}},{"ruleId":"D1","level":"warning","message":{"text":"api.fetchReaderBootstrap (cyclomatic 46): api.fetchReaderBootstrap has cyclomatic complexity 46 (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":"apps/web/features/reader/v3/api.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecc1b8ceed097181de7c7da94500143142c77caad0b653cec4c9474363edf1b"}},{"ruleId":"D1","level":"warning","message":{"text":"system-health-settings-page.SystemHealthSettingsPage (cyclomatic 45): system-health-settings-page.SystemHealthSettingsPage has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 11 of the 45 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 198, execute, a function literal at line 286, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/system-health-settings-page.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"18adcc116116c22818821098b20aa061bad5f914de1237c90bdf4a6f98465a05"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderPreferenceChangesKt.changedReaderControls (cyclomatic 44): ReaderPreferenceChangesKt.changedReaderControls has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderPreferenceChanges.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9c0fe75ea592ba876a1a164c8b76d70f6ec4913abc2705779786997c5f99b7"}},{"ruleId":"D1","level":"warning","message":{"text":"IosReaderComposition.bootstrap (cyclomatic 43): IosReaderComposition.bootstrap 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4f0960c0ec606719d22280322ebd9985df9cba834574bc44efc17373fa968e"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfReaderAdapter.execute (cyclomatic 43): PdfReaderAdapter.execute 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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63e585096ea51301c65bad83156e48395bc783b2f32eb832d9c0b8fddb49729"}},{"ruleId":"D1","level":"warning","message":{"text":"email-settings-page.EmailSettingsPage (cyclomatic 43): email-settings-page.EmailSettingsPage has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 14 of the 43 points are its own statements and the rest belongs to 8 function items inside it that branch (saveSmtp, a function literal at line 85, a function literal at line 106, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/email-settings-page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba823e6135780145e21359f47d143a8b0a890e27d51152bd5b3f4cfa28d56655"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessReadableResourceImportTask._process_prepared_resource (cyclomatic 42): ProcessReadableResourceImportTask._process_prepared_resource has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4553b8e5eb03eeba55f1216b461a89faa1d71124e16dc1bc099647873fb6c023"}},{"ruleId":"D1","level":"warning","message":{"text":"book_list.list_books (cyclomatic 42): book_list.list_books has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/book_list.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"655cab37b900255b1ba5f6283130a71a45a931391cedf8381c10361526ef4c48"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderScreenKt.ReaderScreen (cyclomatic 42): ReaderScreenKt.ReaderScreen has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ReaderScreenKt.ReaderOpenError (cyclomatic 45) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace9a4d5f8b1ce4f771fe1e9d73e93dcd31b973e54c50d1a7639d408c03b010d"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryResourceAdapterExecutor.parse_file (cyclomatic 41): RegistryResourceAdapterExecutor.parse_file 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cd3dbeb286116161253383f5e14cae0a5726aa7bb4732a348580ebd1ccb95a"}},{"ruleId":"D1","level":"warning","message":{"text":"AdministrativeSettingsUiKt.AdministrativeSettingsDestination (cyclomatic 41): AdministrativeSettingsUiKt.AdministrativeSettingsDestination has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0935c97d9670cb5d389ffd2df5b29793be3eecc879c3354d008165121f475c"}},{"ruleId":"D1","level":"warning","message":{"text":"http_streaming._file_response (cyclomatic 39): http_streaming._file_response has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/media/infrastructure/http_streaming.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a12073853e12d7d4b0a6b526e7679250d0bd8c4d356f9dad32662adef94878"}},{"ruleId":"D1","level":"warning","message":{"text":"select.Select (cyclomatic 39): select.Select has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 10 of the 39 points are its own statements and the rest belongs to 10 function items inside it that branch (onKeyDown, a function literal at line 248, a function literal at line 143, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/select.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142bfd692e32eb62850acc222a03d9d88ecdac5f7912187b27925864938d1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"combobox.Combobox (cyclomatic 39): combobox.Combobox has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 10 of the 39 points are its own statements and the rest belongs to 11 function items inside it that branch (onKeyDown, a function literal at line 199, a function literal at line 81, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd5fa58fc992c073d345b07efbd8760e9fe5fa694678a4e0a895620d1aeaed4"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfReaderAdapter.renderPage (cyclomatic 39): PdfReaderAdapter.renderPage has cyclomatic complexity 39 (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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b482fa28e4254e3895e78f8716f821a3690f09d28b6b9743f7560846c7e5a1"}},{"ruleId":"D1","level":"warning","message":{"text":"matching.match_metadata_candidates (cyclomatic 38): matching.match_metadata_candidates has cyclomatic complexity 38 (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":"apps/api-python/app/modules/metadata/infrastructure/matching.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"17407a9f5ec545961680c48c2ba0da35a01b56e5d5066a423ef2b3c8e9b81393"}},{"ruleId":"D1","level":"warning","message":{"text":"http.update_shelf (cyclomatic 38): http.update_shelf 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":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"20601cde56c82a4c696113bb9ad4ab5fe252451b0103fb21ab1ce73998fd2338"}},{"ruleId":"D1","level":"warning","message":{"text":"dependency_preparation.verify_dependency_artifact (cyclomatic 38): dependency_preparation.verify_dependency_artifact 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":"apps/api-python/app/modules/updates/infrastructure/dependency_preparation.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c5a08844fd9d6be2ab40fefd242b3595085eb73958973afffca4deae83d0f1"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-reader-safety-policy.validate_fixture_manifest (cyclomatic 38): generate-reader-safety-policy.validate_fixture_manifest 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":"packages/reader-contracts/generate-reader-safety-policy.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8a0f0fc914172349149195229537cbe69320f44132783324c2ee6f68cc12a9"}},{"ruleId":"D1","level":"warning","message":{"text":"organize-page.OrganizePage (cyclomatic 37): organize-page.OrganizePage has cyclomatic complexity 37 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 21 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eb6ba24ee5a576342f490870418816086ffb3685727cce3f4daf868971ed1f"}},{"ruleId":"D1","level":"warning","message":{"text":"ComicReaderAdapter.execute (cyclomatic 37): ComicReaderAdapter.execute 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4185ce55d333c9abee38baa2ff94b1624bdcaf40a4f4ec8003cc6136c0fe01b4"}},{"ruleId":"D1","level":"warning","message":{"text":"http.create_kindle_send_task (cyclomatic 36): http.create_kindle_send_task has cyclomatic complexity 36 (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":"apps/api-python/app/modules/kindle/presentation/http.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bfbe970144fbe099035bd7e234cbb8220e2906af2145e524d43e73f335e8b3"}},{"ruleId":"D1","level":"warning","message":{"text":"IosImageDirectoryBundle.init (cyclomatic 36): IosImageDirectoryBundle.init has cyclomatic complexity 36 (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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d03fe69e92d99cdcb9522fd11281bb95e61752064cdc5bf24837181d59c45b"}},{"ruleId":"D1","level":"warning","message":{"text":"book-content-browser.BookContentBrowser (cyclomatic 36): book-content-browser.BookContentBrowser has cyclomatic complexity 36 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 10 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"612cec118f9d98fd8ece22feb78dac8e6a6e6f3281bf040cda826c72753f18f2"}},{"ruleId":"D1","level":"warning","message":{"text":"prototype.app.addEventListener(\u0022click\u0022) (cyclomatic 36): prototype.app.addEventListener(\u0022click\u0022) has cyclomatic complexity 36 (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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef09d816929bb212974db20f1fe6dd137c8b80b324049161b1e217cf433899b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 36): (anonymous) has cyclomatic complexity 36 (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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c66c28bed9e4bea0d9ccbc0297ceb6a84a86cd1e9b0f364e2ad9e69f967ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyRecognizedMetadata.execute (cyclomatic 35): ApplyRecognizedMetadata.execute 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":"apps/api-python/app/modules/library/application/recognized_metadata.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7cbb268fcb4a890013dea3fa67b4533b890ee13e606cb8995e16079ba8fee0"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy_views._resource_view (cyclomatic 35): legacy_views._resource_view has cyclomatic complexity 35 (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":"apps/api-python/app/modules/library/infrastructure/legacy_views.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"753ddbb02e83f030db447b4084a949c47341a19b96c4dd6a367126431e4602c6"}},{"ruleId":"D1","level":"warning","message":{"text":"generation.complete_missing_metadata (cyclomatic 35): generation.complete_missing_metadata has cyclomatic complexity 35 (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":"apps/api-python/app/modules/metadata/infrastructure/generation.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5808c311bd9cbc2016ec9327e0f532c04f5e513f3b713c3ebf5f04179ecc998f"}},{"ruleId":"D1","level":"warning","message":{"text":"context-action-menu.ContextActionMenu (cyclomatic 35): context-action-menu.ContextActionMenu has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 9 of the 35 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 129, 65, 52, \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":"apps/web/components/ui/context-action-menu.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2122c2e41dcb430c7903404aeccce5a93265512d3e8ff81eefe062902818c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"api.normalizeAudioBootstrap (cyclomatic 35): api.normalizeAudioBootstrap has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/api.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba8cd702cc1db394213c29faf2912c35c35a9016c0f84c7fc1dfa5bade2c683"}},{"ruleId":"D1","level":"warning","message":{"text":"automation-settings-page.GrantsPanel (cyclomatic 35): automation-settings-page.GrantsPanel has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 9 of the 35 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 161, a function literal at line 159, a function literal at line 174, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"26125b497c9acd95b7b7b12b9c881aaa788bb3ba1dc2d41dd3acb81cb1128c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"file_writeback._publication (cyclomatic 34): file_writeback._publication has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/file_writeback.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"036c840d5fd2e010bcacde390e3e3ff5226950e7f532c07daced84772517b7d6"}},{"ruleId":"D1","level":"warning","message":{"text":"selective_opf.patch_opf_metadata (cyclomatic 34): selective_opf.patch_opf_metadata 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":"apps/api-python/app/modules/metadata/infrastructure/selective_opf.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"db53e528676fe586048ed7c8e6538819eda5701951fea90cbfa545dc10774bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"writeback_queue.prepare_targets_from_snapshot (cyclomatic 34): writeback_queue.prepare_targets_from_snapshot 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":"apps/api-python/app/modules/metadata/infrastructure/writeback_queue.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f4c8a5ddaec902aad92a3c3b8298fd1f5f90cf0da9771471023be549ca2631"}},{"ruleId":"D1","level":"warning","message":{"text":"BookManagementKt.ManagementAnchor (cyclomatic 34): BookManagementKt.ManagementAnchor 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4589daefa9bc12b28d80d1601c8727a18ba1c99396be396fdb0fc9c6b97f76c1"}},{"ruleId":"D1","level":"warning","message":{"text":"account-panel.AccountPanel (cyclomatic 34): account-panel.AccountPanel has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 7 of the 34 points are its own statements and the rest belongs to 7 function items inside it that branch (uploadAvatar, savePassword, saveName, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22ae8ac0be5cb972adc80c5aa2c167072d02129eca082aadb3acdf603a1c906"}},{"ruleId":"D1","level":"warning","message":{"text":"strict-fb2-parser.parseStrictFb2.openElement (cyclomatic 34): strict-fb2-parser.parseStrictFb2.openElement has cyclomatic complexity 34 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54408c0c1b9cc8671cced4455dea7d1a96f36926d12119014dadafc80c9b461"}},{"ruleId":"D1","level":"warning","message":{"text":"mobi-publication.openMobiPublication (cyclomatic 33): mobi-publication.openMobiPublication has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 11 of the 33 points are its own statements and the rest belongs to 12 function items inside it that branch (resolveAssetUrl, a function literal at line 185, a function literal at line 152, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-publication.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e97682288b2b44109cb639ac16fff7fb2bf54031b4a328b631e559b8a2e7d52"}},{"ruleId":"D1","level":"warning","message":{"text":"automation-settings-page.AutomationSettingsPage (cyclomatic 33): automation-settings-page.AutomationSettingsPage has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 13 of the 33 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 225, feedback, a function literal at line 232, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f606b9f2143c16b6e070988b93ffc79e7138d5fcfee68f0cd0216502dce3f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessReadableResourceImportTask._refresh_single_file_metadata (cyclomatic 32): ProcessReadableResourceImportTask._refresh_single_file_metadata 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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"728364ba1cf11acbc364b5be374a72494938513260567f8a227b009dec94198a"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecuteFileMoveOperation.execute (cyclomatic 32): ExecuteFileMoveOperation.execute 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":"apps/api-python/app/modules/library/application/execute_file_moves.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea099a66471a873e36a2f3db18756e11104472b5971c2ce9271f64e4d4d21c6"}},{"ruleId":"D1","level":"warning","message":{"text":"http.get_cover (cyclomatic 32): http.get_cover 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":"apps/api-python/app/modules/media/presentation/http.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a186744a8b406316bb423a49219a2d807a4c0401c394ece319f1cd6b39ea03ff"}},{"ruleId":"D1","level":"warning","message":{"text":"archive.extract_package (cyclomatic 32): archive.extract_package 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":"apps/api-python/app/modules/updates/infrastructure/archive.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d70094cfc734f28e6931742d85cbeb66250b599c9cc3d38c92daf2c616797"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderScreenKt.ReaderContentsPanel (cyclomatic 32): ReaderScreenKt.ReaderContentsPanel 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. This is NOT this file\u0027s highest cyclomatic complexity: ReaderScreenKt.ReaderOpenError (cyclomatic 45) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a893284c3de2e6c05416267d5d494a25164270a1ad8f740c327aa37e5ca7cf02"}},{"ruleId":"D1","level":"warning","message":{"text":"smart-filter-builder.SmartFilterBuilder (cyclomatic 32): smart-filter-builder.SmartFilterBuilder has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 9 of the 32 points are its own statements and the rest belongs to 7 function items inside it that branch (valueEditor, changeOperator, changeField, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1694f1222d25d1844749f3385effaf4c1a8b91e116bd300804168085caa7181"}},{"ruleId":"D1","level":"warning","message":{"text":"CentralDirectoryReader.read (cyclomatic 31): CentralDirectoryReader.read has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df70cb00c9563e1b48e3a558a1cb341b095488606bc0a335fa467d31b81e99e"}},{"ruleId":"D1","level":"warning","message":{"text":"comic_archives.inspect_comic_archive (cyclomatic 30): comic_archives.inspect_comic_archive 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":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e092023e4e6243d51b31a1e282a4b3b48446a882fb98a0980c0403b98bb2a4"}},{"ruleId":"D1","level":"warning","message":{"text":"http._organize_job_view (cyclomatic 30): http._organize_job_view 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":"apps/api-python/app/modules/organize/presentation/http.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf159d14f1a9c1158434216d8b4d0edd01c0f018262f12035f50b86bb0ca34f"}},{"ruleId":"D1","level":"warning","message":{"text":"epub_adapter._index_epub (cyclomatic 30): epub_adapter._index_epub 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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bb0f83df9a9f99869fb54f670b5f84f67f747593f227b2389e971451c83dc7"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-reader-safety-conformance.load_suite_and_expected (cyclomatic 30): verify-reader-safety-conformance.load_suite_and_expected 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":"packages/reader-contracts/verify-reader-safety-conformance.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c01932e284ec98a580e3fe23943cd8639d9d48f63c6b824ab4e92ec6ee7056e"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadManagementPolicy.project (cyclomatic 30): DownloadManagementPolicy.project has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/domain/DownloadManagement.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3d5ad6cbb6df9cb244a25ea1ef1be963696d8460c5a04b6636a78729e618e5"}},{"ruleId":"D1","level":"warning","message":{"text":"IosEpubArchiveSafetyPreflight.verifyMetadata (cyclomatic 30): IosEpubArchiveSafetyPreflight.verifyMetadata 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"683da1abb315cca9594c096cbb3fa1c2c7dad1a5fc1bda0689543bac7cf64ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-safety-policy.rewriteAuthoredDocumentReferencesWithProfile (cyclomatic 30): reader-safety-policy.rewriteAuthoredDocumentReferencesWithProfile has cyclomatic complexity 30 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 15 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f703620003c31cfa63cc75390bbe885394faabaa62a4a5b54f2630f7b5eb3d"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-shell.ResourceNavigationPanel (cyclomatic 30): reader-shell.ResourceNavigationPanel has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 14 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1436, 1413, 1396). 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"142caf8b5a52311fb68ed48c1e695ee6442958c46b64987b72ce6e2b39559701"}},{"ruleId":"D1","level":"warning","message":{"text":"classification-management-panel.ClassificationManagementPanel (cyclomatic 30): classification-management-panel.ClassificationManagementPanel has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 10 function items inside it that branch (rename, merge, removeCategory, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cb62de7fad2f6b67632037c4b1bf24cac5c44ae95c0ce06bbca35d86edc4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationUploads.complete (cyclomatic 29): AutomationUploads.complete 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":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce8566aa5fea9dbf83e0e79e421f5f1c99908b89673b82dc38ef381a3fc340"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanLibrarySourceTree._execute_scopes (cyclomatic 29): ScanLibrarySourceTree._execute_scopes 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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a0e11caf88576760e50ce0fe0ef1b1873010836851fcc0bb1704b48c8aedc7"}},{"ruleId":"D1","level":"warning","message":{"text":"reflowable_metadata._inspect_mobi_family (cyclomatic 29): reflowable_metadata._inspect_mobi_family has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0103f0e5b29ed918ab6dfb428565728cc85f0f5d62b2d20fdaf34d2ebf464c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailScreenKt.WorkDetailActionRow (cyclomatic 29): WorkDetailScreenKt.WorkDetailActionRow has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a02b65c87ddd5d350f2d38ed24332e910613e081673edeb581b8d9f27ebd20d"}},{"ruleId":"D1","level":"warning","message":{"text":"use-update-operations.useUpdateOperations (cyclomatic 29): use-update-operations.useUpdateOperations has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 6 of the 29 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 38, 33, 24, \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":"apps/web/features/updates/application/use-update-operations.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bfa6ff0e8ce0ca268e4abe99e87fd6f3f7a068e49dbfa9308df2293d3f02bc"}},{"ruleId":"D1","level":"warning","message":{"text":"recognition-settings-panel.RecognitionSettingsPanel (cyclomatic 29): recognition-settings-panel.RecognitionSettingsPanel has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 86, save, a function literal at line 145, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/recognition-settings-panel.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71a10d95f44785d8df134712bc4986c4152bc675f91072de29854ccf9e14ff"}},{"ruleId":"D1","level":"warning","message":{"text":"0037_single_import_execution.upgrade (cyclomatic 28): 0037_single_import_execution.upgrade 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":"apps/api-python/app/db/alembic/versions/0037_single_import_execution.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a0f15002d417785e9561eedf02b6829da5425a20f576e6b3fe3ceb7e48f7de"}},{"ruleId":"D1","level":"warning","message":{"text":"inspection.inspect_backup (cyclomatic 28): inspection.inspect_backup has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/backup/infrastructure/inspection.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4643c18b3a9892884635b4f2570ad95efced545c8a7fd71e7e57bbb0904605b"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_metadata._read_with_ffprobe (cyclomatic 28): audio_metadata._read_with_ffprobe has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eaaedab79d6963128019f943932c309e5524ceee8892aed29a6e13e3cc51a3"}},{"ruleId":"D1","level":"warning","message":{"text":"records.installed_records (cyclomatic 28): records.installed_records 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":"apps/api-python/shuku_dependencies/records.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"647051cdd3818cc06b2ab38a7b69fb708a5ea534e81a7f120a08c14becd2e9e1"}},{"ruleId":"D1","level":"warning","message":{"text":"LoginScreenKt.LoginScreen (cyclomatic 28): LoginScreenKt.LoginScreen has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9dbc9bfde2ad710af814358aed4b8ba022c424ab28eb257f596b8ec8dcd1bd"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailScreenKt.WorkDetailScreen (cyclomatic 28): WorkDetailScreenKt.WorkDetailScreen has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e215f087614f9bb06c896b4daa5e303d48843aa0287d79415425aac0d1e5ba2"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderPreferenceSheet.settingRow (cyclomatic 28): ReaderPreferenceSheet.settingRow has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSheets.swift"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b12fc7c26e7785ea9a4a0cc65b6621b87c72673e57be83d72223feae44d7db"}},{"ruleId":"D1","level":"warning","message":{"text":"kindle-send-modal.KindleSendModal (cyclomatic 28): kindle-send-modal.KindleSendModal has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 9 of the 28 points are its own statements and the rest belongs to 6 function items inside it that branch (enqueue, a function literal at line 47, a function literal at line 110, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/kindle-send-modal.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1564b9cbabdee5e1a7a0c62aa97ce5abb965aa48923d275b8d80f8670e30af2"}},{"ruleId":"D1","level":"warning","message":{"text":"kindle-send-queue-page.KindleSendQueuePage (cyclomatic 28): kindle-send-queue-page.KindleSendQueuePage has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 5 of the 28 points are its own statements and the rest belongs to 4 function items inside it that branch (mutate, a function literal at line 179, a function literal at line 100, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcd0c9ae0cd126ec4f4552a6af05bef2c079ad45a75ddca25d1517e86ad343e"}},{"ruleId":"D1","level":"warning","message":{"text":"OsSourceTreeFilesystem.probe_directory (cyclomatic 27): OsSourceTreeFilesystem.probe_directory 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/filesystem.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"903417fdc6316fbf3c147d588583e286983bd92c9944a4386ba6d216d4962b71"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyBulkBookOperations.update_metadata (cyclomatic 27): SqlAlchemyBulkBookOperations.update_metadata 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":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaa0bf737404916bdd2ed583167918aed61d053af66f8c7dce345b9ce3cd40e"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyBookResourceRepository.save_directory_assets (cyclomatic 27): SqlAlchemyBookResourceRepository.save_directory_assets 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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40133db9c3191f1013be8eb2b605bad33da1b417a8fe34895defc06a031fed2"}},{"ruleId":"D1","level":"warning","message":{"text":"opf.parse_opf_metadata (cyclomatic 27): opf.parse_opf_metadata 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":"apps/api-python/app/modules/metadata/application/opf.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aeff6b78f6eef599e708835badfed50ae154bf52ce49718c61fe19ba29f2ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderScreenKt.ReaderBottomConsole (cyclomatic 27): ReaderScreenKt.ReaderBottomConsole 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. This is NOT this file\u0027s highest cyclomatic complexity: ReaderScreenKt.ReaderOpenError (cyclomatic 45) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd961dda85188d4f8ce12e54d2cd21b4aafbcaea7e2b0806d23172d9b5dd7a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ShelfCatalogScreenKt.ShelfCatalogScreen (cyclomatic 27): ShelfCatalogScreenKt.ShelfCatalogScreen 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shelves/ui/ShelfCatalogScreen.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8536889b0e11c0a240944da2d3ed99f2574edbe6d70f9426866d0f9471a1c047"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedDownloadStore.verifiedPageSetBytes (cyclomatic 27): ManagedDownloadStore.verifiedPageSetBytes has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12d52f4d332ce4ce19b4a933b390b889b98918e6b3a9de05700b2fae43e6db1"}},{"ruleId":"D1","level":"warning","message":{"text":"session.readerSessionReducer (cyclomatic 27): session.readerSessionReducer 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":"packages/reader-core/src/session.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd269b6e0d3e7952063f8c4e74ea0c3588abe43e4df7676af3edac2f0d598d9"}},{"ruleId":"D1","level":"warning","message":{"text":"http.update_download_task (cyclomatic 26): http.update_download_task 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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e78d0e1ffa883c97d0259099df7551d8159ca11096a8bc442b8b1f061202ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadableResourceWorkerProcessor._execute_book (cyclomatic 26): ReadableResourceWorkerProcessor._execute_book 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc7a4e5b87b4df42df53d9b10049474c0cd02fa3e4f00cc5438fc11d0bc2cee"}},{"ruleId":"D1","level":"warning","message":{"text":"move_companions.move_companion_paths (cyclomatic 26): move_companions.move_companion_paths 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":"apps/api-python/app/modules/library/infrastructure/move_companions.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29518bb1f83d1eab60bf002d00956be0a990dde9d75a671cadb74cfcc5f8edb"}},{"ruleId":"D1","level":"warning","message":{"text":"StandardMetadataPublication.prepare (cyclomatic 26): StandardMetadataPublication.prepare 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":"apps/api-python/app/modules/metadata/infrastructure/standard_publication.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2297ca100147242d965172436f62701223fd0511ed7aa8768120e49d55c948"}},{"ruleId":"D1","level":"warning","message":{"text":"organize_service.bangumi_candidates (cyclomatic 26): organize_service.bangumi_candidates 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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"516a2234b1348ca867a94038195d392a201deecfed3ed1580b20b0de4c092db6"}},{"ruleId":"D1","level":"warning","message":{"text":"packages.node_packages (cyclomatic 26): packages.node_packages 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":"apps/api-python/shuku_dependencies/packages.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"695190ec887af061f45300e22c52ee3b1c34a802ce7eca166fc982fdb71cd614"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadCenterStore.removeManagementDownload (cyclomatic 26): DownloadCenterStore.removeManagementDownload 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdc59f5d51f4696f96fecb24b041328bb8d5530e2879744b99fb0dfa562040a"}},{"ruleId":"D1","level":"warning","message":{"text":"book-action-controller.BookActionController::invoke (cyclomatic 26): book-action-controller.BookActionController::invoke 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":"apps/web/features/books/ui/book-action-controller.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"114027b216308c4bf5cc2a895bcc7cd956817754c0ded9ce62f2033d798b8ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"automation-settings-page.ConfigurationPanel (cyclomatic 26): automation-settings-page.ConfigurationPanel has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (copy, download, a function literal at line 137, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d3981019718df0ad9f2058a12466425b948238325e9dadf123630ee89ca0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateUser.execute (cyclomatic 25): UpdateUser.execute 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":"apps/api-python/app/modules/auth/application/user_management.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"870e3ba3fc11bdfc878a794465462d20331a4468f2b02acf311c3a255a585c67"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessBookResources.execute (cyclomatic 25): ProcessBookResources.execute 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":"apps/api-python/app/modules/imports/application/readable_resource/process_book_resources.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94b90e32e7524ed5f19493ddae7e318c2577a3903b3bd94e685015039385b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyBulkBookOperations.prepare_covers (cyclomatic 25): SqlAlchemyBulkBookOperations.prepare_covers 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":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a496db073497b5af68ddba01612cfcee8d3b730fbb522118274211413f4f32d"}},{"ruleId":"D1","level":"warning","message":{"text":"selective_comicinfo.patch_comicinfo (cyclomatic 25): selective_comicinfo.patch_comicinfo 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":"apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f3bd8edfee2b36185ded6e65d49a153197cfcde8239ee38f1587482da3619"}},{"ruleId":"D1","level":"warning","message":{"text":"organize_service.run_douban_crawler_provider (cyclomatic 25): organize_service.run_douban_crawler_provider 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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a9317f8c40ceca2e812f6d1a4c32bf2cde93613976e316e1225a18d1f73eb9"}},{"ruleId":"D1","level":"warning","message":{"text":"AdministrativePeopleAndQueueScreensKt.UserEditScreen (cyclomatic 25): AdministrativePeopleAndQueueScreensKt.UserEditScreen 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"151dd483880d0a9d8de1c3a20808a4aca0864d06b17f691f26a81b226068d664"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailScreenKt.WorkDetailBody (cyclomatic 25): WorkDetailScreenKt.WorkDetailBody 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b612f6f7019b95a6ef31d0bbf76bc9ccfd3324834d09fb05614c37bc4533a61"}},{"ruleId":"D1","level":"warning","message":{"text":"organize-job-detail-page.OrganizeJobDetailPage (cyclomatic 25): organize-job-detail-page.OrganizeJobDetailPage has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-job-detail-page.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ce6b8ec004f3d2366432c0093de6ab55fd450f3c07cd868edbb10309c8caa8"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadiumWebReaderAdapter.execute (cyclomatic 25): ReadiumWebReaderAdapter.execute 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":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3053110aceeb5850d6021a726e56a03db0ab243154aea503fa7a446f881796ff"}},{"ruleId":"D1","level":"warning","message":{"text":"library_paths.library_directory_tree_node (cyclomatic 24): library_paths.library_directory_tree_node 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":"apps/api-python/app/modules/imports/application/library_paths.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"241fc8fae122cfe4cc9d782ee69ce6446dc637aedac6ae6e3f3ee6b13365d474"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemySourceNodeRepository.reconcile_batch (cyclomatic 24): SqlAlchemySourceNodeRepository.reconcile_batch 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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb8264ad017ac0c29a7c6f1779e92c3f7f3c900a8f86aeb18c70ebf73386892"}},{"ruleId":"D1","level":"warning","message":{"text":"AnchoredStandardMetadataReader._read_one (cyclomatic 24): AnchoredStandardMetadataReader._read_one 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":"apps/api-python/app/modules/metadata/infrastructure/standard_files.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c63c54f5486ad663762a9b85f29423e6fd6a43ec16c02d5b6a0d41df9bbd6d"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidEpubArchiveSafetyPreflight.verifyMetadata (cyclomatic 24): AndroidEpubArchiveSafetyPreflight.verifyMetadata 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/AndroidEpubArchiveSafetyPreflight.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfad7c1f53ea1d9c23d894acd3422afbd57fc83f85df57ec5cf4110f693bc63"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata-lookup-modal.MetadataLookupModal (cyclomatic 24): metadata-lookup-modal.MetadataLookupModal has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (metadata-lookup-modal.MetadataLookupModal::applySelected) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35cdd0915257adfc3eab15a1b70cb63ee494ada04122dfb8a9c2549e296f745"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryResourceAdapterExecutor._epub_navigation (cyclomatic 23): RegistryResourceAdapterExecutor._epub_navigation 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d107da1a282736173006825288eb78aae4c80cd4e097dde2163f7ef81e3da203"}},{"ruleId":"D1","level":"warning","message":{"text":"reflowable_metadata._inspect_fb2 (cyclomatic 23): reflowable_metadata._inspect_fb2 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":"apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f121f5b6e995e03b9df5829af464ee599948996204889c539c95e98c5c15b4"}},{"ruleId":"D1","level":"warning","message":{"text":"writes.import_book_files (cyclomatic 23): writes.import_book_files has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/presentation/writes.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"665bcf1aa841a15c060c478291688cf39ca05b7096b3169247efefe0cb3f5b79"}},{"ruleId":"D1","level":"warning","message":{"text":"filter_query._condition (cyclomatic 23): filter_query._condition 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":"apps/api-python/app/modules/library/infrastructure/filter_query.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31676873895795ca1821bf5695cca1bfa9f8282eb25e23043950c3a91bf5529"}},{"ruleId":"D1","level":"warning","message":{"text":"resource_reader._derive_display_percent (cyclomatic 23): resource_reader._derive_display_percent 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":"apps/api-python/app/modules/reader/application/resource_reader.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a909c0b9c30faf608ea0ed5f2f59c2bb225228665acde65c8160131968b810"}},{"ruleId":"D1","level":"warning","message":{"text":"kindle_queue._send_task (cyclomatic 23): kindle_queue._send_task has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/kindle_queue.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff4aa4788fed87f2b28d76f46eea46e1150a120726cc538c6616b1ddc66a007"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailViewModel.loadMultiDownloadFolder (cyclomatic 23): WorkDetailViewModel.loadMultiDownloadFolder 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b1ec84362fb19f6e42a9554e60868474eb68b26cc29f6395496a6868ed1fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagementTagEditorKt.ManagementTagEditor (cyclomatic 23): ManagementTagEditorKt.ManagementTagEditor has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/ManagementTagEditor.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca6f0aaeafb923b916bd34ce1937ab916c455c39d0637722342a05ead3de5d3"}},{"ruleId":"D1","level":"warning","message":{"text":"use-reader-session.useReaderSession (cyclomatic 23): use-reader-session.useReaderSession has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 226, 286, 283, \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":"apps/web/features/reader/v3/use-reader-session.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3e0a194e9659e839b7cfc27b3198d53e1f9752ae70dffb8ebb13624f060ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"book-card.BookCard (cyclomatic 23): book-card.BookCard has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-card.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cc43a58ebd56b6e1fe354a53e0db4495972b272b36aaf7285e4e0a714daa8a"}},{"ruleId":"D1","level":"warning","message":{"text":"strict-fb2-parser.namespacesForElement (cyclomatic 23): strict-fb2-parser.namespacesForElement 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a455595477eacc68435902f6ad25679b525f081c03006b58c9fd5c2b1e1d731e"}},{"ruleId":"D1","level":"warning","message":{"text":"strict-fb2-parser.parseStrictFb2 (cyclomatic 23): strict-fb2-parser.parseStrictFb2 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7bed7be1c4cfda612a22a80f5db008c8f1be0743f92b2ad53090a801434c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"text-publication.worker.materializeFb2Chapter (cyclomatic 23): text-publication.worker.materializeFb2Chapter 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":"apps/web/features/reader/v3/original-publication/text-publication.worker.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8535ce84e58c8540e7409de200b64bad763f74dcfcb686bfb0a0d1a2a61e529"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-reader-api.typeExpression (cyclomatic 23): generate-reader-api.typeExpression has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"apps/web/scripts/generate-reader-api.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b307c6f1c29c8a33d3f41c1922c866b0f2f3a3100850231a7cbc8e74b95e1561"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationWrites.book_tags (cyclomatic 22): AutomationWrites.book_tags 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":"apps/api-python/app/modules/automation/application/writes.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4f7ecf65d3a799cd55745d2a08791ac7d3058a7fada7a753391d15d89232f0"}},{"ruleId":"D1","level":"warning","message":{"text":"http_streaming._send_zip_entry (cyclomatic 22): http_streaming._send_zip_entry 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":"apps/api-python/app/modules/media/infrastructure/http_streaming.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4d5f59c1136bd7c09df37b53257f51eaec5fb7c6f84135effc0fbc84e0af9d"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_writeback.write_audio_metadata (cyclomatic 22): audio_writeback.write_audio_metadata 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":"apps/api-python/app/modules/metadata/infrastructure/audio_writeback.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f8a313e312c53061fa352da57a0cb2c1a2fcbe7ce3b435bf475c578d576cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadiumComicSession.prepare (cyclomatic 22): ReadiumComicSession.prepare 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70d937d0536f6d35c23b7e11588ec0eada7cbc01c70ed60fbcbec53870d7453"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiClient.execute (cyclomatic 22): ApiClient.execute 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a8f7df407c29ea217a819a01e56ac9b3f4a4640f7b6629383e236a8f347b23"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedDownloadRecord.verifiedSharedArtifact (cyclomatic 22): ManagedDownloadRecord.verifiedSharedArtifact has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadModels.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"623db75f5c486625b9d16a13abb69da12fbd217548d6f451d233bc9584153665"}},{"ruleId":"D1","level":"warning","message":{"text":"IosPdfiumNavigatorViewController.startRender (cyclomatic 22): IosPdfiumNavigatorViewController.startRender 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumNavigator.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db1ea1038a5ba2bbb834a75200b43b6b3033520f3629a4057527d54601a5c53"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-safety-policy.findDoctype (cyclomatic 22): reader-safety-policy.findDoctype 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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5706eb0b3f7193a8456edbf03b1d4e20d0a9df8ab8de0361706289a4b6ccb348"}},{"ruleId":"D1","level":"warning","message":{"text":"ComicSpreadTrackDriver.renderSlot (cyclomatic 22): ComicSpreadTrackDriver.renderSlot has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"60472327dc676089a4c53869c09bb07f41aaf3af8268f89569b2b0565c8f0753"}},{"ruleId":"D1","level":"warning","message":{"text":"opds-settings-page.OpdsSettingsPage (cyclomatic 22): opds-settings-page.OpdsSettingsPage has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to 5 function items inside it that branch (toggleEnabled, savePublicBaseUrl, a function literal at line 28, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/opds-settings-page.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea89626f1f696b99e6fce5bce03929bac50567e078b138f2b200b6bcd8fb548"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationUploads.begin_upload (cyclomatic 21): AutomationUploads.begin_upload has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3e53090c1b68cb8dfd794f5c846157d706ff1d3e8281a75b95df3bc1e4379f"}},{"ruleId":"D1","level":"warning","message":{"text":"application.prepare_preview (cyclomatic 21): application.prepare_preview 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":"apps/api-python/app/modules/feedback/application.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0a9431742f8f8af9fcfb920e85c87ef4eff939f7d190532e5272b8c574aaca"}},{"ruleId":"D1","level":"warning","message":{"text":"BookWork.__post_init__ (cyclomatic 21): BookWork.__post_init__ has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/book_work.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9940a8ddaf981a303c51a5898ce2e83ae3c08eaeeb407f3e820a91286f8b3a4"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanLibrarySourceTree._process_regular_file (cyclomatic 21): ScanLibrarySourceTree._process_regular_file 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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fc362493989f5b5f5e32937eef396f758ece9f31db7dcc049591dc3cfe4111"}},{"ruleId":"D1","level":"warning","message":{"text":"http.update_library (cyclomatic 21): http.update_library has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/presentation/http.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebed23d073044e235f9626979b9014d1dade3621c83dd488e810b37d88e0b46"}},{"ruleId":"D1","level":"warning","message":{"text":"filter_ast.parse_filter_expression (cyclomatic 21): filter_ast.parse_filter_expression 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":"apps/api-python/app/modules/library/application/filter_ast.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc34fb2f160673749e8ce3dba146185d45fbe581f2fd4e48b31c5808d3b41d"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyMetadataPatches.execute (cyclomatic 21): ApplyMetadataPatches.execute 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":"apps/api-python/app/modules/library/application/metadata_patches.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c490fdf548afb50db9da0a45d5b97eaa82a051347d13994faf2fb6184e293f87"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateSourceNodePresentation.execute (cyclomatic 21): UpdateSourceNodePresentation.execute has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/application/source_node_commands.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acfd5f32bf6791a7ed53d53090913eb2152745a9a177761119d8b3171f03fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyMetadataPatches.snapshot (cyclomatic 21): SqlAlchemyMetadataPatches.snapshot 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":"apps/api-python/app/modules/library/infrastructure/metadata_patches.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a412acdc3282854c079dccfd6c5970592d09aa61cb524de4ef2672fce641791"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyMetadataPatches.apply (cyclomatic 21): SqlAlchemyMetadataPatches.apply 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":"apps/api-python/app/modules/library/infrastructure/metadata_patches.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec404440e0181df7f309b3f563f9a3e674afd950731fa54f9c0b632acc0850f1"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemySourceNodeMetadata.update_metadata (cyclomatic 21): SqlAlchemySourceNodeMetadata.update_metadata 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":"apps/api-python/app/modules/library/infrastructure/source_node_commands.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f6de946d512dae7c7d06df4e3558cb8e14f2cbb5bc603f06c67002e9681cc4"}},{"ruleId":"D1","level":"warning","message":{"text":"library_filters.normalize_filter_rules (cyclomatic 21): library_filters.normalize_filter_rules 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":"apps/api-python/app/services/library_filters.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b01ce6ca0e8f92508b280519c658283b00ecbf59711615a4c177c0c29054609"}},{"ruleId":"D1","level":"warning","message":{"text":"ErmaoLibraryRootKt.ErmaoLibraryRoot (cyclomatic 21): ErmaoLibraryRootKt.ErmaoLibraryRoot has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/ErmaoLibraryRoot.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"20daa31c254d899ae737f1bb6326cbffbe1e8326f8a737836f22a7f5b4ab471b"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadiumPreferencesMapper.toReadium (cyclomatic 21): ReadiumPreferencesMapper.toReadium has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPreferencesMapper.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4979546829e76e0c8d3c46a3cbfd17e7c83c00b1dab0cea2ce9ae8468cf36140"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderActivity.dispatchKeyEvent (cyclomatic 21): ReaderActivity.dispatchKeyEvent has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd8f2b3575121a0fa7e8dd1fe34404e16e65b19bccdbbe404537532e94901bc"}},{"ruleId":"D1","level":"warning","message":{"text":"XmlControlPreprocessor.expandInternalEntity (cyclomatic 21): XmlControlPreprocessor.expandInternalEntity 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSafetyFacade.kt"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"79abd021f9fa0f06356f61ec08d5ee09d8bb56219552d4029cac54d0fa626ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"BookManagementSession.select (cyclomatic 21): BookManagementSession.select has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/BookManagementSession.kt"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadecbeaab9312514299f55afbf917f0b11731210bfd6c6d9d65b34cefc5d309"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-safety-policy.parseEntityDefinitions (cyclomatic 21): reader-safety-policy.parseEntityDefinitions 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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e68208d274ab901efeffb222f7280115f5441daf59be32e21effde2c7bc276d"}},{"ruleId":"D1","level":"warning","message":{"text":"upload-book-dialog.UploadBookDialog (cyclomatic 21): upload-book-dialog.UploadBookDialog has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 5 function items inside it that branch (saveFiles, a function literal at line 37, a function literal at line 35, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/upload-book-dialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba162e0436626f840e6ea5fe04895904d9806c63320f0d82e92080f44223bda"}},{"ruleId":"D1","level":"warning","message":{"text":"client.mapBookView (cyclomatic 21): client.mapBookView has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc7a7801093bf1199ee825095f1b29ad9c848c0f803632a33e0664fe574efc7"}},{"ruleId":"D1","level":"warning","message":{"text":"client.searchSourceNodeMetadata (cyclomatic 21): client.searchSourceNodeMetadata has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9525738e4402d2084fb56e5e04c7c17a8e679933044ee44907ba8295af2f41"}},{"ruleId":"D1","level":"warning","message":{"text":"book-metadata-editor.BookMetadataEditor (cyclomatic 21): book-metadata-editor.BookMetadataEditor has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 5 function items inside it that branch (save, a function literal at line 117, a function literal at line 149, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-metadata-editor.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5096e62baa6ff91d6c7820e3e3c77f76a61f554286d3e65ef9bcaec122802c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexedDbPublicationStorage.read (cyclomatic 21): IndexedDbPublicationStorage.read has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to one function literal inside it that branches (line 169). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b72e38d0d48a5eaa8bf46a5dfe827ce7bf2d34f29edd512a383de7bc0cf384"}},{"ruleId":"D1","level":"warning","message":{"text":"settings-secondary-nav.SettingsSecondaryNav (cyclomatic 21): settings-secondary-nav.SettingsSecondaryNav has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 101, beginNavigation, a function literal at line 83, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/settings-secondary-nav.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bba6ada72ef720d2f269b0d4f5d7317b3312e9981668e4cf13520f0e94ed784"}},{"ruleId":"D1","level":"warning","message":{"text":"dashboard-page.DashboardPage (cyclomatic 21): dashboard-page.DashboardPage has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 58, 131, 140). 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":"apps/web/features/dashboard/dashboard-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"12114df23a9e71e9a67d836640497aad27f2027048a99410846bbfded4efc509"}},{"ruleId":"D1","level":"warning","message":{"text":"automation-settings-page.GrantForm (cyclomatic 21): automation-settings-page.GrantForm has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34c684f31f742581753219efb8f84ba20a42e701c06c3e0406a6771d2b526d7"}},{"ruleId":"D1","level":"warning","message":{"text":"server-exceptions.writeServerLog (cyclomatic 21): server-exceptions.writeServerLog has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/server-exceptions.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a430a0a2c03f9417d388204bbe612dd052f72c28a4b30a96f663d65789feb7ef"}},{"ruleId":"D1","level":"warning","message":{"text":"0031_book_import_task_backfill.backfill_book_tasks (cyclomatic 20): 0031_book_import_task_backfill.backfill_book_tasks 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":"apps/api-python/app/db/alembic/versions/0031_book_import_task_backfill.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dfec12f6f6779dc3537a330e3d7f30406ccd5f142ec67550b3bad74f0ad309"}},{"ruleId":"D1","level":"warning","message":{"text":"FileDeletions.execute (cyclomatic 20): FileDeletions.execute 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":"apps/api-python/app/modules/library/application/file_deletions.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfaceb1bf22a5bed6900477d74733e3694333f3ca04fd818556c67cf0f37d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyBookResourceRepository.apply_local_metadata (cyclomatic 20): SqlAlchemyBookResourceRepository.apply_local_metadata 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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3532ad71f46f68cd43b1a3fd0f1bc7079fc1bc9d18820f9324e299350b140cb"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_structure.mp3_structure (cyclomatic 20): audio_structure.mp3_structure 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":"apps/api-python/app/modules/metadata/infrastructure/audio_structure.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3df7684effef8eb46ff0f4aa5219b406534354da101be200c31feaa0fe7f27"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceLocatorIndex.validate (cyclomatic 20): ResourceLocatorIndex.validate 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":"apps/api-python/app/modules/reader/infrastructure/resource_locator_index.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"206343838580b64a2439e6052c04c786bcb60d28097c21fd644a027c38e48d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"health_runs._run_health_checks (cyclomatic 20): health_runs._run_health_checks 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":"apps/api-python/app/modules/system/infrastructure/health_runs.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"348abb4f6a62e562ad133aac75e722c16bcf6a2c511b68e701d798c15f380613"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-reader-safety-conformance.validate_report (cyclomatic 20): verify-reader-safety-conformance.validate_report 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":"packages/reader-contracts/verify-reader-safety-conformance.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"041a56706e3d160cca83142e036fdb88c9df16cd6e776b03497c94a1979c017f"}},{"ruleId":"D1","level":"warning","message":{"text":"AdministrativeSettingsViewModel.execute (cyclomatic 20): AdministrativeSettingsViewModel.execute 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. This is NOT this file\u0027s highest cyclomatic complexity: AdministrativeSettingsViewModelKt.supports (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2389dd6be554f2a50435adb0c197b6c4a0aa6eaaa4b9bccff43209bc2234efeb"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidAudioPlaybackRuntime.launchRemote (cyclomatic 20): AndroidAudioPlaybackRuntime.launchRemote has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"918f18a48b814fc7d8f25cbd7398f09f21604a8058306e6fb015434b3cbeb273"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadResourceRowKt.DownloadResourceRow (cyclomatic 20): DownloadResourceRowKt.DownloadResourceRow 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/DownloadResourceRow.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d626f231f87adf6c05c0e0e266c74bfae4a5ea7d3982c2388b123a729073b2"}},{"ruleId":"D1","level":"warning","message":{"text":"FacetViewModel.load (cyclomatic 20): FacetViewModel.load 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7be29de7177a3d79f3139e7ab6e78297f53534960fff5d903572f04f7582da"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadiumEpubSession.openLocalPublication (cyclomatic 20): ReadiumEpubSession.openLocalPublication has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcd000bf0685b82c646dd7cd3925a8276bae41bb5e36f42645057821a407acd"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiClient.loadAuthenticatedAsset (cyclomatic 20): ApiClient.loadAuthenticatedAsset 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5505fb913e23603969b58e874bad8a41f50d814bcc698266a2ba2de14217023"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiClient.loadAuthenticatedBinary (cyclomatic 20): ApiClient.loadAuthenticatedBinary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f65bad7aab512f1b43572c9ed2437f7c602c2cd517823869849ea1c28c6ae7c"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadResourceRuntime.ensure (cyclomatic 20): DownloadResourceRuntime.ensure 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d55e51faf04beaa0d7eaf5550cb4fc657d2da4d3b09abe6a00f1d00146aee5"}},{"ruleId":"D1","level":"warning","message":{"text":"IosReaderBootstrapHost.beginDownload (cyclomatic 20): IosReaderBootstrapHost.beginDownload 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ff3c322016b33c0b08b7894e16dd74bf1bf37bdd4a8f4cdc84a539b985bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"IosReaderBootstrapView.body (cyclomatic 20): IosReaderBootstrapView.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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc944642d1dde35b5c98e1cf6f9f53a8cae2d99cafdf4ac4f51b2b514b74cc8"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiDownloadSheet.perform (cyclomatic 20): MultiDownloadSheet.perform 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"8182d384d80be5d9015d703ce6616529fc7bc788e09b63e143c2829b5504c855"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.translateDomNode (cyclomatic 20): provider.translateDomNode 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":"apps/web/i18n/provider.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63fa84912517beafe8c8be7dfc9f081ed97e7188724bbf9e2fbc468ba8853bd"}},{"ruleId":"D1","level":"warning","message":{"text":"PagedTrackController.pointerUp (cyclomatic 20): PagedTrackController.pointerUp has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/paged-track/paged-track-controller.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"085dc71bae333bdc1a5f9f85b28fee0ae2f2e062a36b8aeb9e8be6e388f498da"}},{"ruleId":"D1","level":"warning","message":{"text":"bounded-response.readBoundedResponse (cyclomatic 20): bounded-response.readBoundedResponse 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":"apps/web/shared/api/bounded-response.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24b47408a4faa3435ece86ccb40c7606887e3548aea5f6083e5e8ef034a934b"}},{"ruleId":"D1","level":"warning","message":{"text":"strict-fb2-parser.parseStrictFb2.closeElement (cyclomatic 20): strict-fb2-parser.parseStrictFb2.closeElement 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd502ce37ca28e68d94aeb4cc66870e5638175166c451abad9512174ad98d8c"}},{"ruleId":"D1","level":"warning","message":{"text":"exception_diagnostics._exception_facts (cyclomatic 19): exception_diagnostics._exception_facts 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":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e727acb36530416a6afba1969b648a64d10f39eba92b44be7b8a3126f11893f6"}},{"ruleId":"D1","level":"warning","message":{"text":"exception_diagnostics.format_exception_diagnostics (cyclomatic 19): exception_diagnostics.format_exception_diagnostics 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":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac236cd34393f999bbbf06f6c2a80aed88acd14fbfe358c4c76bbef15b51453"}},{"ruleId":"D1","level":"warning","message":{"text":"persistence._converted_column_value (cyclomatic 19): persistence._converted_column_value 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":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e3a6d47210cbfe1f96dff51dfd5e2d0b4cc2a72016df9ddb79c185ce4c8754"}},{"ruleId":"D1","level":"warning","message":{"text":"identity_policy.parse_bracketed_series_identity (cyclomatic 19): identity_policy.parse_bracketed_series_identity 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":"apps/api-python/app/modules/imports/application/identity_policy.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a6b74026a70df5c5cfa3fa8e483f299634d57bab9765308c21e146aeacd038"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadableResourceWorkerProcessor._finish (cyclomatic 19): ReadableResourceWorkerProcessor._finish 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"712aa6452be9f0ed4cb765bcde538f332ed0a99f621fe4c2dedc4756d9e53139"}},{"ruleId":"D1","level":"warning","message":{"text":"PrepareFileMovePlan.execute (cyclomatic 19): PrepareFileMovePlan.execute 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":"apps/api-python/app/modules/library/application/file_move_plans.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cadf93cb7bf8bdac0761a4b4350e32b921c0d97d8414101e288f2e73bb9e35f"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata_patch.validate_value (cyclomatic 19): metadata_patch.validate_value 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":"apps/api-python/app/modules/library/domain/metadata_patch.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffdeb635a95d3fd5ace6db5c685e5d38324802bb9d537095ff923feb6f48e40"}},{"ruleId":"D1","level":"warning","message":{"text":"books._book_record (cyclomatic 19): books._book_record 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":"apps/api-python/app/modules/library/infrastructure/books.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d17863c7445b5c97e19c4b873cc0c2a4387dfcf4435d81a0dfaefbb7fa3330"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyBulkBookOperations.apply_find_replace (cyclomatic 19): SqlAlchemyBulkBookOperations.apply_find_replace 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":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7ab07115e56a8a86972aa08e31842493d6bc999b325ed1a2a501c75e9149d"}},{"ruleId":"D1","level":"warning","message":{"text":"commands.prepare_organize_policy_update (cyclomatic 19): commands.prepare_organize_policy_update 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":"apps/api-python/app/modules/organize/application/commands.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecda43cc010094e004a0c867bb4ea975065cf56cc6bf1355670ba71e5ebd9c70"}},{"ruleId":"D1","level":"warning","message":{"text":"smart_rules.normalize_smart_shelf_rules (cyclomatic 19): smart_rules.normalize_smart_shelf_rules 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":"apps/api-python/app/modules/shelf/application/smart_rules.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbe43b2bcd1efdac02c990a97db716dee11817dc1428253648c06c8820e9a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"http.create_shelf (cyclomatic 19): http.create_shelf 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":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"069ce76ccb828c339963978052619eabd62ffe79fc64731115e6a88cd27a3f34"}},{"ruleId":"D1","level":"warning","message":{"text":"AdministrativeSettingsUiKt.failureText (cyclomatic 19): AdministrativeSettingsUiKt.failureText has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AdministrativeSettingsUiKt.administrativeSuccessText (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e83a72e8f3a2838394586f27e32f3461debb703f8bde663c531e9fcf89e2fe"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidAudioPlaybackRuntime.publishFromController (cyclomatic 19): AndroidAudioPlaybackRuntime.publishFromController 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e65bebd05a18d0a4e2b8568a6549c4120fbf9082723fb7e0fa781fc5882615"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiClient.loadAuthenticatedJson (cyclomatic 19): ApiClient.loadAuthenticatedJson 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54e7c6f7e3d38ce1c7e0494b97898fc8645fe8a1110431a054f1078335429fd"}},{"ruleId":"D1","level":"warning","message":{"text":"recognized-metadata.currentMetadataValue (cyclomatic 19): recognized-metadata.currentMetadataValue 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":"apps/web/features/books/model/recognized-metadata.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8b00ee899899214ffbafc55b77b1d5e103346af904a8149f8bbd2dca68399f"}},{"ruleId":"D1","level":"warning","message":{"text":"source-node-metadata-dialogs.SourceNodeMetadataRecognitionDialog::apply (cyclomatic 19): source-node-metadata-dialogs.SourceNodeMetadataRecognitionDialog::apply 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":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f3173aa09300234885df33b8b3facf12fd9fa67dca3fdcfb6b0c7df63ea911"}},{"ruleId":"D1","level":"warning","message":{"text":"login-page.LoginPage (cyclomatic 19): login-page.LoginPage has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (submit, a function literal at line 51, a function literal at line 60). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/login-page.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bb71f59e15129077554d713e34614e6148491496aa46011400e500ccfc8d2e"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-shell.ReaderPreferencesPanel::control (cyclomatic 19): reader-shell.ReaderPreferencesPanel::control 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad083066a3b7cb321d173c0085a8f327909eb14a99d974f6bc598b525b602f6"}},{"ruleId":"D1","level":"warning","message":{"text":"import-preferences-panel.ImportPreferencesPanel (cyclomatic 19): import-preferences-panel.ImportPreferencesPanel has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 73, savePreferences, a function literal at line 141, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/import-preferences-panel.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff8038902d400bd1d7c412ed2223938f4b6113e3834dea3ffbd94a747585203"}},{"ruleId":"D1","level":"warning","message":{"text":"presentation.submit_feedback (cyclomatic 18): presentation.submit_feedback 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":"apps/api-python/app/modules/feedback/presentation.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2bb272b887fe91809c40de57372887f2b322da29addfbf72a0235f044b482c"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportAttachmentUploads.target (cyclomatic 18): ImportAttachmentUploads.target 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":"apps/api-python/app/modules/imports/infrastructure/automation_uploads.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e79a7d8be947017746e1a2691283a4264b25474c202a8a12fd55589c63c76d9"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyLibraryImportTaskQueue.continue_book_task (cyclomatic 18): SqlAlchemyLibraryImportTaskQueue.continue_book_task 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5e8161578636cf98491d706e5d13f8d0a7bf78e07ced85d3dd0aa515ba13a2"}},{"ruleId":"D1","level":"warning","message":{"text":"file_moves.validate_move_set (cyclomatic 18): file_moves.validate_move_set 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":"apps/api-python/app/modules/library/domain/file_moves.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"846f9510ea92bb063b5c31e29491e0a3b72c7bfe7893d1d255e91c657fd6a2f1"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyCatalogQueries._resource (cyclomatic 18): SqlAlchemyCatalogQueries._resource 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":"apps/api-python/app/modules/library/infrastructure/catalog.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fea89869616c2e71e0733f5103bb7f6a63fd5cb942fa7cd943cc6e01d1f8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_writeback.write_pdf_metadata (cyclomatic 18): pdf_writeback.write_pdf_metadata 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":"apps/api-python/app/modules/metadata/infrastructure/pdf_writeback.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f046ee74d84f5f31cbf4a8e31a105817403aa60c5614133172778b7be6e2783"}},{"ruleId":"D1","level":"warning","message":{"text":"epub_adapter._validated_entries (cyclomatic 18): epub_adapter._validated_entries 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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d3936b414ac273fd3f376c1928832025c96c81c9c7b73265aba7bbad81fc0b"}},{"ruleId":"D1","level":"warning","message":{"text":"install_plan.validate_prepared (cyclomatic 18): install_plan.validate_prepared 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":"apps/api-python/app/modules/updates/infrastructure/install_plan.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"852ca638f9904b9e4204e137f356187a5b23bdcf5ce97e9cc7d64aa21b119231"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_metadata.parse_audio_metadata (cyclomatic 18): audio_metadata.parse_audio_metadata 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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"95778e38c8948e6ad71cf026181369094928fe1507d36a1e64af9caf5429e6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_metadata._read_with_mutagen (cyclomatic 18): audio_metadata._read_with_mutagen 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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e38b1307c6d5713350d21e6b5cb1fbc19dd9e6113d0d14d7aaad8bd9a0a286a"}},{"ruleId":"D1","level":"warning","message":{"text":"organize_service.douban_candidates (cyclomatic 18): organize_service.douban_candidates 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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aaa26c447a496e6de2111396c46c8c1bdc8d776ced57c84e3cf9e4cc3c103c"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidAvatarSanitizer.sanitize (cyclomatic 18): AndroidAvatarSanitizer.sanitize 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/me/platform/AndroidMePlatform.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d70d26fbaa151f2609580c6cbf39a7a4c08483126ff458380cdda693edb617"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderActivity.onCreate (cyclomatic 18): ReaderActivity.onCreate 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec6ae1af29eb8033d66519956e9b2d784360f4893b803c848e24e04f1673f78"}},{"ruleId":"D1","level":"warning","message":{"text":"BookContentNavigationKt.BookContentNavigation (cyclomatic 18): BookContentNavigationKt.BookContentNavigation 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/BookContentNavigation.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6ec7a00668552a894d13b708ede45d767c507fc3cf6e0280f364af763b6f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"LoadBookContentKt.loadBookContent (cyclomatic 18): LoadBookContentKt.loadBookContent 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/application/LoadBookContent.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b817bd6e1b1fc1fd11ba85c54218194f74f4dd1e9abe1de6cd86f8cb7075b2"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioPlaybackRuntime.receive (cyclomatic 18): AudioPlaybackRuntime.receive has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f6f1660c12166d15a56b737d64672dc2ba09ae934d63ef580530c407b18df7"}},{"ruleId":"D1","level":"warning","message":{"text":"IosReaderPreferences.readium (cyclomatic 18): IosReaderPreferences.readium has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"158e552c25df2e5276ebac8de9465c5b85dd897e18c775e64a3228131f3ba77b"}},{"ruleId":"D1","level":"warning","message":{"text":"IosMobiPublicationPath.resourcePath (cyclomatic 18): IosMobiPublicationPath.resourcePath 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiLazyContainer.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb61f835321c7e9f5ee48d36046e2f967b44f144dcc99d52bafc88dab1d350a"}},{"ruleId":"D1","level":"warning","message":{"text":"IosPdfiumDownloadMaterializer.materialize (cyclomatic 18): IosPdfiumDownloadMaterializer.materialize 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc9bf465e0c487cc6b53eef2a71f9c698bb0cfb7a52417bd39e0ce774c40831"}},{"ruleId":"D1","level":"warning","message":{"text":"IosPdfiumDocument.render (cyclomatic 18): IosPdfiumDocument.render 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f832e4ed1c9eb86096d8e27baf61b0599282cd4ebb7229f108cbd82f774a4"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeManagementSheet.body (cyclomatic 18): NativeManagementSheet.body 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"18391643b82ab174bda9d2cc035ae644aa8ac388766a3798cce6cac748421771"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailView.detailActions (cyclomatic 18): WorkDetailView.detailActions 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"be696c39c7bb8cb811976e1798862dd2c0af24bc1c3b1f160f72441a597d8e7e"}},{"ruleId":"D1","level":"warning","message":{"text":"multi-value-combobox.MultiValueCombobox (cyclomatic 18): multi-value-combobox.MultiValueCombobox 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. This shape REPEATS in the file: one other method here (multi-value-combobox.MultiValueCombobox::onInputKeyDown) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f043aea6ebe75adea53624fcbd874e9549e7e55b4dd77c3cd7dae9d4734281cd"}},{"ruleId":"D1","level":"warning","message":{"text":"pwa-client.PwaDebugPanel (cyclomatic 18): pwa-client.PwaDebugPanel has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 620, 481, 495, \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":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35db18ce4a49792835e00eabd6ad29c2e8d2d0a4c4245952fe6da57dd9f0824"}},{"ruleId":"D1","level":"warning","message":{"text":"input-router.readerKeyIntent (cyclomatic 18): input-router.readerKeyIntent 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":"apps/web/features/reader/v3/input-router.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc0b994e7ed258d6967510ed4bd0cdabdd96923a5c77aa5313be6075893666f"}},{"ruleId":"D1","level":"warning","message":{"text":"epub-archive-safety.preflightEpubArchiveEntries (cyclomatic 18): epub-archive-safety.preflightEpubArchiveEntries 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":"apps/web/features/reader/v3/security/epub-archive-safety.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acf4587b1e556d4ac2917520b040c6fe353d70eca237784132f64a4ef14ce0d"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-v3-page.OpeningCover (cyclomatic 18): reader-v3-page.OpeningCover has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9435c9a2ca1c337d77043b563a58cdc7760b1aaab4392f95b0884328ac9d246a"}},{"ruleId":"D1","level":"warning","message":{"text":"problems.failure_problem (cyclomatic 17): problems.failure_problem 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":"apps/api-python/app/modules/backup/infrastructure/problems.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09d3e7ce3a5788ddb7061925e32c1d7213388aaf00a84584b6cd79352859a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportAttachmentUploads.progress (cyclomatic 17): ImportAttachmentUploads.progress 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":"apps/api-python/app/modules/imports/infrastructure/automation_uploads.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc86ff59ef88427470f5a8d04b274d219c2e0faf1cf5b84ca26ff59dde133da1"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata_patch.prepare_metadata_patch (cyclomatic 17): metadata_patch.prepare_metadata_patch 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":"apps/api-python/app/modules/library/domain/metadata_patch.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e01238357ea766dbdcb95a1a4602a098e4ec0937e75a249567156d3f772046"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyFileMoveIndex.apply (cyclomatic 17): SqlAlchemyFileMoveIndex.apply has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/file_move_index.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"099bb898d3b92b1db10095db9b69b52f6740b24abd68cc3beee144f4c1637fa5"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemLocalMetadataCoverParser.extract_cover (cyclomatic 17): FilesystemLocalMetadataCoverParser.extract_cover 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":"apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0628577ceb5acaf36071dfc0ceffa9676ec2735800ecef05abcb6620abcced6b"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyRecognizedMetadata.apply_changes (cyclomatic 17): SqlAlchemyRecognizedMetadata.apply_changes 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":"apps/api-python/app/modules/library/infrastructure/recognized_metadata.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5232ec9fbededf481bdcc1a98a592db1c9a60edd25034d673a2a6eca1694f9be"}},{"ruleId":"D1","level":"warning","message":{"text":"StandardMetadataPublication.inspect (cyclomatic 17): StandardMetadataPublication.inspect has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/standard_publication.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"539faf240bae74efa35a530435d40b7dfe6dd4df8404105e2a4f0cdc7c63f40a"}},{"ruleId":"D1","level":"warning","message":{"text":"xml_policy._scan_entity_declarations (cyclomatic 17): xml_policy._scan_entity_declarations 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":"apps/api-python/app/modules/publications/infrastructure/xml_policy.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca7df3e034b27d330dc8eea365637d9673d127741a2ffc624fe4e9c457fa1da"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateShelf.execute (cyclomatic 17): UpdateShelf.execute 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":"apps/api-python/app/modules/shelf/application/commands.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0964c6e83f52f9b5fd14bd149e912ba921646f42d94d2c2aee1ccf9c2fda8cf"}},{"ruleId":"D1","level":"warning","message":{"text":"dependency_preparation.check_wheel_platform (cyclomatic 17): dependency_preparation.check_wheel_platform 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":"apps/api-python/app/modules/updates/infrastructure/dependency_preparation.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15973bf50ff37999db0207d65bc347700527f4c65588d673bada7ab65fa4402"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata_file_writeback.process_next_metadata_writeback (cyclomatic 17): metadata_file_writeback.process_next_metadata_writeback 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":"apps/api-python/app/services/metadata_file_writeback.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda5386bc5e486b5c241e8cee458b4774d997e53bfd323116595fb19e8ef3b21"}},{"ruleId":"D1","level":"warning","message":{"text":"organize_service.parse_douban_subject_html (cyclomatic 17): organize_service.parse_douban_subject_html 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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bab1ed2d6b9db2ba6a756abe7bd2946ae447c5671d0cb900a6089534f9e738"}},{"ruleId":"D1","level":"warning","message":{"text":"BookDetailStore.loadContentBrowser (cyclomatic 17): BookDetailStore.loadContentBrowser 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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ad21d46158aeaa2ca918ce704db195d6bbf3dcbfa1553b84cf44073857a19a"}},{"ruleId":"D1","level":"warning","message":{"text":"AdministrativeCopyCatalog.userFailure (cyclomatic 17): AdministrativeCopyCatalog.userFailure 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":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsCopy.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcc6b67188c60a346979d3bf996fcf853bd7740d963720f3366b1a670ab934e"}},{"ruleId":"D1","level":"warning","message":{"text":"UserEditorView.body (cyclomatic 17): UserEditorView.body 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":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c41d0752a89e788d0c69c56cb35d0cdce027ff2f1954a32053ca5ac7fc1b4e"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadCenterStore.awaitVerifiedReaderDownloadOperation (cyclomatic 17): DownloadCenterStore.awaitVerifiedReaderDownloadOperation 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bacd24ca0772cda5323a7895a244b9592cb32842cebcb4f5657136f2695642f"}},{"ruleId":"D1","level":"warning","message":{"text":"IosReflowableReaderSession.open (cyclomatic 17): IosReflowableReaderSession.open 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfba097db1778aca885211b892a9d2fb3756bf87929253c61344a146b65c3853"}},{"ruleId":"D1","level":"warning","message":{"text":"IosManagedPublicationStore.resolve (cyclomatic 17): IosManagedPublicationStore.resolve 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd107ecd10bb9e66e618e4a5552b4da191fd4ceec92ab87b4a881ef099483ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailView.observedScreen (cyclomatic 17): WorkDetailView.observedScreen 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"759c023f3c8bdfb44836ef34317cbd70bdfbd893d67724e203e8929146c4a940"}},{"ruleId":"D1","level":"warning","message":{"text":"reader-safety-policy.rewriteReferences::expandEntity (cyclomatic 17): reader-safety-policy.rewriteReferences::expandEntity 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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2868054bf35273f96ad73630210c361e311fcc5ad911a289ce8e9b9260648f7"}},{"ruleId":"D1","level":"warning","message":{"text":"multi-value-combobox.MultiValueCombobox::onInputKeyDown (cyclomatic 17): multi-value-combobox.MultiValueCombobox::onInputKeyDown 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. This shape REPEATS in the file: one other method here (multi-value-combobox.MultiValueCombobox) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd329656017c91f8263615c11984e15e69ccc98b9948cc632c6285bf9fa16ce0"}},{"ruleId":"D1","level":"warning","message":{"text":"book-shelf-dialog.BookShelfDialog (cyclomatic 17): book-shelf-dialog.BookShelfDialog has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (save, a function literal at line 33, a function literal at line 42, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-shelf-dialog.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"429357f54351da32502210b8661ddd7aa70a765ca8cf8180aa523b6e420f0a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"book-detail-page.ResourceEditor (cyclomatic 17): book-detail-page.ResourceEditor has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (save, a function literal at line 143). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89a3cc6584649efcdf5817cef5e59d7098444ff3307420c2c02123ac85d598c"}},{"ruleId":"D1","level":"warning","message":{"text":"password-reset-pages.ResetPasswordPage (cyclomatic 17): password-reset-pages.ResetPasswordPage has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (submit, a function literal at line 91). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/password-reset-pages.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e93352fa55df3739dcf8d71cda6f630d3587d4f805816c450eb93baff524efd"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfRangeByteSource.fetchChunkGroup (cyclomatic 17): PdfRangeByteSource.fetchChunkGroup 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":"apps/web/features/reader/v3/adapters/pdf-range-transport.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"79793c8efadf4447ab7e6b864079d4ee2eb5ccd8390f7aa9e896f0886ba3fd1b"}},{"ruleId":"D1","level":"warning","message":{"text":"directory-path-picker.DirectoryNodeRow (cyclomatic 17): directory-path-picker.DirectoryNodeRow 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":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5038816e5ef57a8f6cc709ac49fec04833c1e8efd132782fa77aca878b2527d"}},{"ruleId":"D1","level":"warning","message":{"text":"library-scan-settings-panel.LibraryScanSettingsPanel (cyclomatic 17): library-scan-settings-panel.LibraryScanSettingsPanel has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/library-scan-settings-panel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4021176dac2747a03bf872d67f9860a3daf7505b2d806c4707b997d1317ea11"}},{"ruleId":"D1","level":"warning","message":{"text":"users._validate_preference (cyclomatic 16): users._validate_preference 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":"apps/api-python/app/modules/auth/presentation/users.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c579bfb316545bb7e7d1d528fbe6b95d4f1e44b1d16c0bfd9bf5e9cc2b58da"}},{"ruleId":"D1","level":"warning","message":{"text":"writeback_plans._destination (cyclomatic 16): writeback_plans._destination 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":"apps/api-python/app/modules/automation/application/writeback_plans.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bca91ae53c53e7d382849bcf7d4eab3de927bcecffeed320144119fd6abccc8"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessReadableResourceImportTask.prepare_resource_covers (cyclomatic 16): ProcessReadableResourceImportTask.prepare_resource_covers 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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"66682072a8feeb5ef082a4d19c1bd7dad5eaae371aba0c8fc263f14f78a1276f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessReadableResourceImportTask.finalize_resource (cyclomatic 16): ProcessReadableResourceImportTask.finalize_resource 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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4828d3878f00caf2565ea8429f0220a6b8885ed6a1936fb97fd16b0bede112bf"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourcePreviewCache.prune (cyclomatic 16): ResourcePreviewCache.prune 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":"apps/api-python/app/modules/media/infrastructure/resource_preview_cache.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9bd2eb4dfd3958f205ccd954ab4968ff8f284c3a00fb4d7b03e511dc1e4b44"}},{"ruleId":"D1","level":"warning","message":{"text":"local_metadata._parse_local_metadata (cyclomatic 16): local_metadata._parse_local_metadata 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":"apps/api-python/app/modules/metadata/application/local_metadata.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"705479801b0f843d992859ae5174b7f5664898df26b8a17e4ca57d4f6fc7f4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"archive_writeback.preview_archive_metadata (cyclomatic 16): archive_writeback.preview_archive_metadata 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":"apps/api-python/app/modules/metadata/infrastructure/archive_writeback.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2076f01b46348822fec93d9f717693e6dc5e9c64e28903e7e3f36473e1b941ce"}},{"ruleId":"D1","level":"warning","message":{"text":"file_writeback.cleanup_orphan_prepared_files (cyclomatic 16): file_writeback.cleanup_orphan_prepared_files 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":"apps/api-python/app/modules/metadata/infrastructure/file_writeback.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7a036ff1596af1b9341bcd22c98dd1a52ac4dceeb552084bf0d39a235b281f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_writeback.patch_xmp (cyclomatic 16): pdf_writeback.patch_xmp 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":"apps/api-python/app/modules/metadata/infrastructure/pdf_writeback.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bace06dacfa219aac60f052d4215546f7d7d5a97b772b5645804269f7063a4"}},{"ruleId":"D1","level":"warning","message":{"text":"fb2_adapter._render_element (cyclomatic 16): fb2_adapter._render_element 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":"apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df5cdec702905df8e55d5ffc8682949d0be52a2b90b2ff49ae77bc999102e05"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicationSnapshotCache.lease (cyclomatic 16): PublicationSnapshotCache.lease 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":"apps/api-python/app/modules/publications/infrastructure/snapshot_cache.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9207bb7da2b506930a9e1ae4fca2a69dad078ad5418e046666184555b89ed57"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlAlchemyReaderV5Repository.save_v5_progress (cyclomatic 16): SqlAlchemyReaderV5Repository.save_v5_progress 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":"apps/api-python/app/modules/reader/infrastructure/v5_repository.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"535364d72ed128317cdca50011f75485473104e5823c74e55cedc08fd67ac614"}},{"ruleId":"D1","level":"warning","message":{"text":"events.list_system_events_page (cyclomatic 16): events.list_system_events_page has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/system/infrastructure/events.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ae98a33cd07c1d4dd1895ab35dbc0dbf8acc2fb860d8a39c52a83316de7e6"}},{"ruleId":"D1","level":"warning","message":{"text":"OfficialReleases.releases (cyclomatic 16): OfficialReleases.releases has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/updates/infrastructure/official_source.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3237fc160f58d9be82c54e0f623ead30a7f4f482bfc37fbfec38e2ce90bfcd"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparationWorker._run (cyclomatic 16): PreparationWorker._run 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":"apps/api-python/app/modules/updates/infrastructure/preparation_worker.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"26431b3233cb7bf4bc974930b97d58e338a608e6358c8260e945c68242117a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_metadata._repair_misdecoded_text (cyclomatic 16): audio_metadata._repair_misdecoded_text 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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bbd2e3103b083d1c5d5db7df1c9148c04c007abbbb3a70d47178389b0c970a"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_metadata._normalize_audio_codec (cyclomatic 16): audio_metadata._normalize_audio_codec has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb88d86c06b8d4de21ef811d2fe3344365e91eadc31e6757a2a77bc012544f9"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataLookupWorker._run (cyclomatic 16): MetadataLookupWorker._run 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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4342f53c1a572260fee5091202a9d48e3aab6acf2f47cc93ade1ae0c9f2c2637"}},{"ruleId":"D1","level":"warning","message":{"text":"AdministrativeCoreScreensKt.EmailKindleSettingsScreen (cyclomatic 16): AdministrativeCoreScreensKt.EmailKindleSettingsScreen has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: AdministrativeCoreScreensKt.group (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab679ac4a68268fd0a47f28a5a53b10aa2306a8af0a65e0c2c399a91a7e452"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidAudioPlaybackRuntime.launchLocal (cyclomatic 16): AndroidAudioPlaybackRuntime.launchLocal 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac76d2750215bca7c8604af8ffb847fda20c9a80039bcce31f2bb4ad38f8d33"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioPlayerUiKt.AudioNowPlayingScreen (cyclomatic 16): AudioPlayerUiKt.AudioNowPlayingScreen 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fe0b21177f0fdc546fd5ce3ed982a891a716392e0d8e7cfca4d872a92d26d0"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailViewModel.load (cyclomatic 16): WorkDetailViewModel.load 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"805bd8d641bc95b1fe80be2fdb3ea8741031dff9d7991e74cf43c0a229b58146"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryViewModel.loadScope (cyclomatic 16): LibraryViewModel.loadScope 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a791ce4d1a39a6fb426ffb68ddb2c3b817c43fdec6c9662e5d461d05a571fc91"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailScreenKt.WorkIdentityText (cyclomatic 16): WorkDetailScreenKt.WorkIdentityText has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4374e1f388cdc2f0e5ef906c5457ad63d1f3435fea1510dfecccc0238998b1a"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkDetailScreenKt.WorkContentEntryCard (cyclomatic 16): WorkDetailScreenKt.WorkContentEntryCard 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1297157c9a4993457e8319ff9cb8373c9be57dc7ac42e27fc220e5544273c2"}},{"ruleId":"D1","level":"warning","message":{"text":"EpubContentSecurityPolicy.prepareResourceBytes (cyclomatic 16): EpubContentSecurityPolicy.prepareResourceBytes has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/EpubContentSecurityPolicy.kt"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d16d3ccc1f695176c7404d07c24cf6cfdf4d71834b2c0229f128372d60a013"}},{"ruleId":"D1","level":"warning","message":{"text":"ReaderActivity.openServerReader (cyclomatic 16): ReaderActivity.openServerReader has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d808ead2d8760c6250074993e3a9e309fa90ca88d5f5308d02542d608f1209"}},{"ruleId":"D1","level":"warning","message":{"text":"KtorAudioMediaTransportKt.validate (cyclomatic 16): KtorAudioMediaTransportKt.validate 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/infrastructure/KtorAudioMediaTransport.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5200aa5ab080c661808a3679457ac354c15ac06d247a47b4f2bd36107dd2c39"}},{"ruleId":"D1","level":"warning","message":{"text":"KtorReaderBootstrapGateway.validateBeforeSecondaryRequest (cyclomatic 16): KtorReaderBootstrapGateway.validateBeforeSecondaryRequest 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7135f60077eda48166b2125ed188c7ca940b0f877dab0e7d10a1cc06fc9ce49a"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerBaseUrl.normalizeAuthority (cyclomatic 16): ServerBaseUrl.normalizeAuthority 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/servers/domain/ServerBaseUrl.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afbe7ac31d9d4238cc0ba4c8783d46a42efeb83c0411c305e9179712c9693d8"}},{"ruleId":"D1","level":"warning","message":{"text":"KtorWorkManagementRepository.loadManagementSnapshot (cyclomatic 16): KtorWorkManagementRepository.loadManagementSnapshot 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/infrastructure/KtorWorkManagementRepository.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e756d9f8202c377e4d5067f23289093f30a0697c02ab7ca04a2d3627acb4e03"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioPlaybackRuntime.execute (cyclomatic 16): AudioPlaybackRuntime.execute has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"078ff83b22d9f768f01ff1d8a7203d94f399760e38cd13071e10fb1af4796d7e"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadCenterStore.executeManagement (cyclomatic 16): DownloadCenterStore.executeManagement 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"65582fc7b138223a818e80e5e333e7dcd7c982aa09bd56c6d83161ff8807e851"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadCenterStore.executeApplicableManagementAction (cyclomatic 16): DownloadCenterStore.executeApplicableManagementAction 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e6190dacc6136ef430009d9b387d038b42f90a5f3648b056520aa390247e52"}},{"ruleId":"D1","level":"warning","message":{"text":"IosMobiPublicationFactory.build (cyclomatic 16): IosMobiPublicationFactory.build 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiPublicationFactory.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"442baeb198cdd79550a2ae03caad48668f017d33eb0f21d5f420714bd3d2788b"}},{"ruleId":"D1","level":"warning","message":{"text":"IosReadiumRuntime.openEPUB (cyclomatic 16): IosReadiumRuntime.openEPUB has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e59f3f5bd7fb0e04ecb8bcf6143ec7a89b324c1d8a963d22f41a0168630731"}},{"ruleId":"D1","level":"warning","message":{"text":"ShelfCatalogView.resultContent (cyclomatic 16): ShelfCatalogView.resultContent 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogView.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"572ed52bea41388d3bdfe3c6474aa93068712758b9c5f5432a0d2eae15ba93a8"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.I18nProvider (cyclomatic 16): provider.I18nProvider has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 170, 145, 158, \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":"apps/web/i18n/provider.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"087ac7756ea11af8d6217e8559bdd7a0f850ad83f679e5fb74fd4040f579ed1f"}},{"ruleId":"D1","level":"warning","message":{"text":"v5-wire.isJsonValue (cyclomatic 16): v5-wire.isJsonValue 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":"apps/web/lib/reader/v5-wire.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc1693cacaa3a0699f281b81b192a20632d1cde6358081b33e6cb1c48121b78"}},{"ruleId":"D1","level":"warning","message":{"text":"recognized-metadata.candidateMetadataValue (cyclomatic 16): recognized-metadata.candidateMetadataValue 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":"apps/web/features/books/model/recognized-metadata.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"972579683a5b58fc766aaf6a88484046356307656e0a6f8b116ed44641a2b5be"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata-lookup-modal.MetadataLookupModal::applySelected (cyclomatic 16): metadata-lookup-modal.MetadataLookupModal::applySelected has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (metadata-lookup-modal.MetadataLookupModal) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"71628cd8286904088c679a753aef07bf21b3a32bbdf3e57d04d5bbaad7253374"}},{"ruleId":"D1","level":"warning","message":{"text":"readium-navigation.readiumTotalProgression (cyclomatic 16): readium-navigation.readiumTotalProgression 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":"apps/web/features/reader/v3/adapters/readium-navigation.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e06d72e4288077009a75061e41ea47780e9083e4ff8c202c7893ef63eaaee6"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserPublicationStore.download (cyclomatic 16): BrowserPublicationStore.download 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":"apps/web/features/reader/v3/original-publication/browser-publication-store.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"676d8a1811138dd2d83575a89badc50318c77898cb38cf4604302aa7ee1d6ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"paged-track-physics.resolvePagedTrackSettle (cyclomatic 16): paged-track-physics.resolvePagedTrackSettle has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/paged-track/paged-track-physics.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"11813dafd61a817e3e52340144ae001a11b6d81592e6b239a956944d013a7acc"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf-layout.detectPdfCropBox (cyclomatic 16): pdf-layout.detectPdfCropBox has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-layout.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dee8e14755838e67e8d581875e53e7874f847a13be8d836f8f4d139b93e12ae"}},{"ruleId":"D1","level":"warning","message":{"text":"backups-client.parseBackup (cyclomatic 16): backups-client.parseBackup 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":"apps/web/features/settings/api/backups-client.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca41cbed3d08bc1bb34c4878a382b6a3a54ab1be1be6f56736faad7ca1c07e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"shelves-page.ShelvesPage::openShelf (cyclomatic 16): shelves-page.ShelvesPage::openShelf has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (shelves-page.ShelvesPage) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5f59228a4eff77e3cce77fdab1d4faaf2538a8c6f2e58466bdbb860ab41fcd"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-reader-safety-conformance.evaluateMarkupCase (cyclomatic 16): generate-reader-safety-conformance.evaluateMarkupCase 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":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1357b9d532d4ae289afdb7d22f8ed096b3ca66a7c01ef6a71fb2412d3599aba"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-shell.ReaderShell (cognitive 309): reader-shell.ReaderShell has cognitive complexity 309 (threshold 15). Drivers by points: ternaries 95 (185 pts), if/else 73 (76 pts), boolean chains 48 (nesting depth added 93). Of this number, 169 points are the body\u0027s own statements and 140 belong to 40 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee5ea1907e2defcbc7727d86cddc064882177e15ae4111ffc4da15836ddcb43"}},{"ruleId":"D2","level":"warning","message":{"text":"shelves-page.ShelvesPage (cognitive 244): shelves-page.ShelvesPage has cognitive complexity 244 (threshold 15). Drivers by points: ternaries 116 (292 pts), if/else 40 (45 pts), boolean chains 43, error handling 3, match/switch 1 (nesting depth added 181). 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. This shape REPEATS in the file: 2 other methods here (shelves-page.ShelvesPage::openShelf, shelves-page.ShelvesPage::saveShelf) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e604a8a1268c9a15454118bfb29333f9109066cc3a7da79df41cc284fb74ca"}},{"ruleId":"D2","level":"warning","message":{"text":"audio-playback-provider.AudioPlaybackProvider (cognitive 228): audio-playback-provider.AudioPlaybackProvider has cognitive complexity 228 (threshold 15). Drivers by points: if/else 97 (107 pts), boolean chains 55, ternaries 37 (53 pts), error handling 10 (12 pts), loops 1 (nesting depth added 28). Most of this is not in the body itself: 5 of the 228 points are its own statements and the rest belongs to 58 function literals inside it that branch (lines 337, 400, 821, \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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4589ccfdec25bb3006c745525a21ef3e7c332b47b6a679ada8c8f62b58b168"}},{"ruleId":"D2","level":"warning","message":{"text":"app-shell.AppShell (cognitive 225): app-shell.AppShell has cognitive complexity 225 (threshold 15). Drivers by points: if/else 79 (99 pts), ternaries 49 (81 pts), boolean chains 45 (nesting depth added 52). Of this number, 49 points are the body\u0027s own statements and 176 belong to 56 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa757470760f9b2bc96a9b52efaa4a92d0fccd2962696243d9f612837897652"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanLibrarySourceTree._walk (cognitive 192): ScanLibrarySourceTree._walk has cognitive complexity 192 (threshold 15). Drivers by points: if/else 35 (112 pts), boolean chains 26, ternaries 8 (23 pts), loops 7 (20 pts), error handling 4 (11 pts) (nesting depth added 112). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"737d557ca9a035e90e6256c98e6c64cad2880025f948ad3e0ada3dd2fe7f97c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessReadableResourceImportTask._execute_directory (cognitive 177): ProcessReadableResourceImportTask._execute_directory has cognitive complexity 177 (threshold 15). Drivers by points: if/else 41 (110 pts), loops 7 (22 pts), boolean chains 19, error handling 5 (19 pts), ternaries 4 (7 pts) (nesting depth added 101). 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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b17140ff4454ba23fb540e8c129c3b6ef2a84f3e2b2618177f92326f099276c"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-safety-policy.validate_policy (cognitive 168): generate-reader-safety-policy.validate_policy has cognitive complexity 168 (threshold 15). Drivers by points: if/else 70 (108 pts), boolean chains 49, loops 10 (11 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/reader-contracts/generate-reader-safety-policy.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb6da44c16572c53db00007f52997e6693523099916c02d6afb66687cffa3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"library-page.LibraryPage (cognitive 153): library-page.LibraryPage has cognitive complexity 153 (threshold 15). Drivers by points: ternaries 52 (90 pts), if/else 36, boolean chains 24, error handling 3 (nesting depth added 38). Of this number, 82 points are the body\u0027s own statements and 71 belong to 32 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef9086968437ff2aac983562a97151dbd39dc941cbed1b4f0c4059ef3282d19"}},{"ruleId":"D2","level":"warning","message":{"text":"update-operations.UpdateOperations (cognitive 136): update-operations.UpdateOperations has cognitive complexity 136 (threshold 15). Drivers by points: ternaries 40 (91 pts), boolean chains 37, if/else 8 (nesting depth added 51). Of this number, 122 points are the body\u0027s own statements and 14 belong to 4 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":"apps/web/features/updates/ui/update-operations.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9a9a13d47c18da7a22d7d0635c0c50e97fe548a74935d7ca3d61c3bcdf560e"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiDownloadSheetKt.MultiDownloadSheet (cognitive 132): MultiDownloadSheetKt.MultiDownloadSheet has cognitive complexity 132 (threshold 15). Drivers by points: if/else 73 (105 pts), boolean chains 20, match/switch 6 (7 pts) (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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cd1964134bd7d0041e5255232bbe5cdef284d0c8956d9a2d820f2d83b7a867"}},{"ruleId":"D2","level":"warning","message":{"text":"feedback-dialog.FeedbackDialog (cognitive 129): feedback-dialog.FeedbackDialog has cognitive complexity 129 (threshold 15). Drivers by points: ternaries 37 (62 pts), if/else 33 (41 pts), boolean chains 20, error handling 3, loops 3 (nesting depth added 33). Of this number, 54 points are the body\u0027s own statements and 75 belong to 21 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8312822954f790aed8e41eb135e813ab86bf79b1748bdbcf44f2828a39f14a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 124): main.main has cognitive complexity 124 (threshold 15). Drivers by points: if/else 26 (57 pts), ternaries 10 (30 pts), error handling 10 (24 pts), boolean chains 11, loops 2 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/worker/main.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c022ab12285bc6b9987e1acfcd7851bc5e6a79ea5bc1d5ce76d0ae1a0ef208d6"}},{"ruleId":"D2","level":"warning","message":{"text":"settings-page.SettingsPage (cognitive 118): settings-page.SettingsPage has cognitive complexity 118 (threshold 15). Drivers by points: ternaries 31 (70 pts), if/else 29 (34 pts), boolean chains 8, error handling 5, loops 1 (nesting depth added 44). Of this number, 30 points are the body\u0027s own statements and 88 belong to 20 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"011651714d8b5efae6801fc0a57d85fd7437b1da0c3172d1f4cda4dc771518c6"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencySet.validate_set (cognitive 115): DependencySet.validate_set has cognitive complexity 115 (threshold 15). Drivers by points: if/else 32 (77 pts), boolean chains 27, loops 5 (6 pts), ternaries 1 (5 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/updates/application/dependency_release.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0444b5b3e8c3b7d6fb608ff01798b3f8ace3cf434e0c137c2b169841e8b561a7"}},{"ruleId":"D2","level":"warning","message":{"text":"audio-mini-player.AudioMiniPlayer (cognitive 109): audio-mini-player.AudioMiniPlayer has cognitive complexity 109 (threshold 15). Drivers by points: ternaries 49 (87 pts), boolean chains 14, if/else 8 (nesting depth added 38). Of this number, 81 points are the body\u0027s own statements and 28 belong to 9 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":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf7b37d214aa40b183cd5a72df58b1a73f0f1ceeb8135b71c7d728f57e5d3f8"}},{"ruleId":"D2","level":"warning","message":{"text":"target-directory-picker.TargetDirectoryPicker (cognitive 101): target-directory-picker.TargetDirectoryPicker has cognitive complexity 101 (threshold 15). Drivers by points: ternaries 29 (51 pts), if/else 23 (37 pts), boolean chains 11, error handling 2 (nesting depth added 36). Of this number, 41 points are the body\u0027s own statements and 60 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa7d4f202caadec7ab983d2d82a0ad4f602d7b4924d86ec853cb9cf1606a4f6"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-engine-runtime.ReaderEngineRuntime (cognitive 100): reader-engine-runtime.ReaderEngineRuntime has cognitive complexity 100 (threshold 15). Drivers by points: if/else 36 (49 pts), ternaries 23 (30 pts), boolean chains 18, error handling 3 (nesting depth added 20). Most of this is not in the body itself: 9 of the 100 points are its own statements and the rest belongs to 27 function items inside it that branch (a function literal at line 547, a function literal at line 204, a function literal at line 620, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb296bcba26a64a9f201f6b00f24c0f21ca1b0d179ac14d0865f71a87cb0d1"}},{"ruleId":"D2","level":"warning","message":{"text":"BookManagementKt.ManagementPresentation (cognitive 99): BookManagementKt.ManagementPresentation has cognitive complexity 99 (threshold 15). Drivers by points: if/else 39 (78 pts), boolean chains 12, match/switch 3 (9 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1453ac009bd94ce5799d2d98848f92a88b18c15ab5f06a49290ff7ced3cf835f"}},{"ruleId":"D2","level":"warning","message":{"text":"selective_opf.patch_opf_metadata (cognitive 92): selective_opf.patch_opf_metadata has cognitive complexity 92 (threshold 15). Drivers by points: if/else 18 (52 pts), ternaries 8 (28 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 59). 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":"apps/api-python/app/modules/metadata/infrastructure/selective_opf.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe4a8ca3dbb52761ed6682892e3bd9a343d6c5d2637fa5a11030063b42b7db1"}},{"ruleId":"D2","level":"warning","message":{"text":"automation-settings-page.AutomationSettingsPage (cognitive 90): automation-settings-page.AutomationSettingsPage has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 24 (82 pts), boolean chains 6, if/else 2 (nesting depth added 58). Of this number, 20 points are the body\u0027s own statements and 70 belong to 4 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":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"670863826b2a9fd17fc09bc7b31b71371569c5b96090ecc0ed466958f0616d94"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata-providers-panel.MetadataProvidersPanel (cognitive 90): metadata-providers-panel.MetadataProvidersPanel has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 28 (55 pts), if/else 16 (18 pts), boolean chains 13, error handling 4 (nesting depth added 29). Most of this is not in the body itself: 12 of the 90 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 219, a function literal at line 234, testProvider, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dbb9f27823b2550c3d7cb19ed393cb2af847cf26804b79fba43e9d87c7c25e"}},{"ruleId":"D2","level":"warning","message":{"text":"readium-publication.openEpub (cognitive 86): readium-publication.openEpub has cognitive complexity 86 (threshold 15). Drivers by points: if/else 31 (52 pts), boolean chains 11, error handling 5 (11 pts), loops 5 (6 pts), ternaries 3 (6 pts) (nesting depth added 31). Of this number, 55 points are the body\u0027s own statements and 31 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3be10d750b656229e25ffb1cc235489f385aff11c88e39df4462325f70345b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderSourceNodeMetadataRecognition.search (cognitive 83): ProviderSourceNodeMetadataRecognition.search has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 22, ternaries 14 (18 pts), loops 3 (5 pts), error handling 2 (3 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":"apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddcf075881fc95b443d7b56a4b2b7dcc4b8563aa11c5702f16fbdeb073b8cba"}},{"ruleId":"D2","level":"warning","message":{"text":"directory-path-picker.DirectoryPathPicker (cognitive 83): directory-path-picker.DirectoryPathPicker has cognitive complexity 83 (threshold 15). Drivers by points: ternaries 26 (42 pts), if/else 23 (30 pts), boolean chains 10, error handling 1 (nesting depth added 23). Of this number, 37 points are the body\u0027s own statements and 46 belong to 13 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0f749073b5a3544db5d1bae4576c82f4c93418b6b1dbfe3d880f71a70aa7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata_lookup_queue.process_metadata_lookup_task (cognitive 82): metadata_lookup_queue.process_metadata_lookup_task has cognitive complexity 82 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 20, error handling 6 (13 pts), ternaries 7 (11 pts), loops 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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4cdc26bf0f1d06126f81cd954eff22ed72d9f7726289d2392d1b6daf11dba1"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReaderComposition.bootstrap (cognitive 79): IosReaderComposition.bootstrap has cognitive complexity 79 (threshold 15). Drivers by points: if/else 33 (55 pts), ternaries 5 (10 pts), boolean chains 9, error handling 3 (5 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ae993a7a4bb2828f9f742e12a7f25cc9736497e8bcaec9d414f5b70506efff"}},{"ruleId":"D2","level":"warning","message":{"text":"dependency_preparation.verify_dependency_artifact (cognitive 78): dependency_preparation.verify_dependency_artifact has cognitive complexity 78 (threshold 15). Drivers by points: if/else 22 (59 pts), boolean chains 13, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/updates/infrastructure/dependency_preparation.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"701be6dcf1037694fb7c8177fc39be0d521c5f1dfd774f884f7b5b25b1b5af1b"}},{"ruleId":"D2","level":"warning","message":{"text":"MainShellKt.MainShell (cognitive 77): MainShellKt.MainShell has cognitive complexity 77 (threshold 15). Drivers by points: if/else 46 (51 pts), boolean chains 14, loops 5 (11 pts), match/switch 1 (nesting depth added 11). 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"604bbbde9b75138b9cdc7935de5e2ce7b554c004782c2ea7d57edd2d51b68580"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecuteFileMoveOperation.execute (cognitive 75): ExecuteFileMoveOperation.execute has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (52 pts), boolean chains 6, loops 3 (6 pts), ternaries 2 (6 pts), error handling 2 (5 pts) (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/application/execute_file_moves.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ed6043d54553120a272ec5657839e8e11374c160cc8ff50b482630f9154429"}},{"ruleId":"D2","level":"warning","message":{"text":"book-detail-page.BookDetailPage (cognitive 75): book-detail-page.BookDetailPage has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 57 (83 pts), if/else 51 (58 pts), boolean chains 32, error handling 3 (nesting depth added 33). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 2 other methods here (book-detail-page.BookDetailPage::invokeResourceAction, book-detail-page.BookDetailPage::invokeSourceNodeAction) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd6ac6b49f3317fcfb2b3ecdc91fbae8837cd693ce2ecbcd9df8a71335364d0"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-v3-page.ReaderV5Page (cognitive 72): reader-v3-page.ReaderV5Page has cognitive complexity 72 (threshold 15). Drivers by points: if/else 32 (35 pts), ternaries 15 (22 pts), boolean chains 13, error handling 2 (nesting depth added 10). Most of this is not in the body itself: 7 of the 72 points are its own statements and the rest belongs to 18 function literals inside it that branch (lines 292, 370, 474, \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":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28c562603b89e9a620a70e9939bc1b735663ffb2e94e2845e039ef7949e88da"}},{"ruleId":"D2","level":"warning","message":{"text":"users-permissions-page.UsersPermissionsPage (cognitive 72): users-permissions-page.UsersPermissionsPage has cognitive complexity 72 (threshold 15). Drivers by points: ternaries 36 (47 pts), boolean chains 12, if/else 7 (8 pts), error handling 5 (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 49 belong to 7 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bfe2a887f82b26b28be20f19023074637bb71bc8191564a4cf68c824130f10"}},{"ruleId":"D2","level":"warning","message":{"text":"resource-detail-view.ResourceDetailView (cognitive 69): resource-detail-view.ResourceDetailView has cognitive complexity 69 (threshold 15). Drivers by points: ternaries 33 (53 pts), boolean chains 16 (nesting depth added 20). Of this number, 41 points are the body\u0027s own statements and 28 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/resource-detail-view.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b693eb41e8bb309e150b921f5a3b94415367ec89cc6b85ae7fc175f445240919"}},{"ruleId":"D2","level":"warning","message":{"text":"writeback_queue.prepare_targets_from_snapshot (cognitive 68): writeback_queue.prepare_targets_from_snapshot has cognitive complexity 68 (threshold 15). Drivers by points: ternaries 12 (29 pts), if/else 9 (21 pts), boolean chains 8, loops 4 (7 pts), error handling 1 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/writeback_queue.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b442df0257633cb89e0446fa634b7bc07c7dee7744856ce762f785cc35595a"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata_lookup_queue._prepare_candidate_application (cognitive 68): metadata_lookup_queue._prepare_candidate_application has cognitive complexity 68 (threshold 15). Drivers by points: boolean chains 40, if/else 14 (16 pts), ternaries 6 (7 pts), error handling 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef4a852b6e8d95e120d2a456107aef415cca95b10bfee470a70a92328bf3fec"}},{"ruleId":"D2","level":"warning","message":{"text":"library-batch-actions.LibraryBatchDialog (cognitive 67): library-batch-actions.LibraryBatchDialog has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 46 (90 pts), boolean chains 21, if/else 16 (19 pts), error handling 2 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (library-batch-actions.LibraryBatchDialog::submit) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bd1fec492af806740d7f96f2c972c8c4915fbc5e73e9936f68c78e2fc6c6f6"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-engine-runtime.readerErrorMessage (cognitive 66): reader-engine-runtime.readerErrorMessage has cognitive complexity 66 (threshold 15). Drivers by points: if/else 61, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57741cffe8aa8df560c726de4a17caf892a2d155368bb0bb10a2d034512e3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessReadableResourceImportTask._process_prepared_resource (cognitive 61): ProcessReadableResourceImportTask._process_prepared_resource has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 5 (13 pts), boolean chains 11, ternaries 7 (11 pts), error handling 3 (4 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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ff2944bf8f74c4660f917108c601183e331178f8e3a66d81d61410847f3b89"}},{"ruleId":"D2","level":"warning","message":{"text":"http_streaming._file_response (cognitive 61): http_streaming._file_response has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (48 pts), boolean chains 9, error handling 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/media/infrastructure/http_streaming.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"176a00f3f6aed0b40acdf2a5d983dae8eb6baa3a66dd2dffc91d22a901666da2"}},{"ruleId":"D2","level":"warning","message":{"text":"book_list.list_books (cognitive 59): book_list.list_books has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 14 (28 pts), if/else 14 (20 pts), boolean chains 11 (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":"apps/api-python/app/modules/library/infrastructure/book_list.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a799c0866accf71d012d9b42b685a7e47850865c6e86d189b3c9deafbe9042be"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyRecognizedMetadata.execute (cognitive 58): ApplyRecognizedMetadata.execute has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (28 pts), ternaries 6 (16 pts), boolean chains 8, error handling 3 (5 pts), loops 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":"apps/api-python/app/modules/library/application/recognized_metadata.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c923fca1902f0fbfd31ca408e01801b5db491697daeba694d367765460e8b8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"management-logs-page.ManagementLogsPage (cognitive 58): management-logs-page.ManagementLogsPage has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 24 (30 pts), if/else 12, boolean chains 11, error handling 5 (nesting depth added 6). Most of this is not in the body itself: 13 of the 58 points are its own statements and the rest belongs to 12 function items inside it that branch (clearLogs, saveLogLimit, a function literal at line 317, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3674da52689a8d45f9fca8cd1f73c9fdb9137403804ecec12775b87d16954f"}},{"ruleId":"D2","level":"warning","message":{"text":"OsSourceTreeFilesystem.probe_directory (cognitive 57): OsSourceTreeFilesystem.probe_directory has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (40 pts), ternaries 3 (6 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/infrastructure/readable_resource/filesystem.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffe7814c70e6562d26d883fa39dfa93455021a2770a833d430f799e55a140ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ShelfCatalogScreenKt.ShelfCatalogScreen (cognitive 57): ShelfCatalogScreenKt.ShelfCatalogScreen has cognitive complexity 57 (threshold 15). Drivers by points: if/else 30 (52 pts), boolean chains 4, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shelves/ui/ShelfCatalogScreen.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe581fd0fcee01d8d550959302192283ef0816a7e33fdf3506f2ce5622e0718e"}},{"ruleId":"D2","level":"warning","message":{"text":"combobox.Combobox (cognitive 57): combobox.Combobox has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 16 (32 pts), if/else 14 (17 pts), boolean chains 8 (nesting depth added 19). Most of this is not in the body itself: 13 of the 57 points are its own statements and the rest belongs to 11 function items inside it that branch (onKeyDown, a function literal at line 199, a function literal at line 81, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"75350934203487b3f1174abb71bfcec802fdaf3c20ccf03cac6d78d1d9e5ee42"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfReaderAdapter.execute (cognitive 57): PdfReaderAdapter.execute has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 9, ternaries 3 (9 pts), error handling 3 (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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a847f97675933447f3d28bcc4ce9c7463174b97c1f015732281cf25e48be551c"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.extract_package (cognitive 56): archive.extract_package has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (31 pts), ternaries 6 (13 pts), boolean chains 7, loops 3, error handling 1 (2 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":"apps/api-python/app/modules/updates/infrastructure/archive.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a690f296b43552b0206a51ba27b3cd4d083d2a50991a14c794d3626ed133cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"0037_single_import_execution.upgrade (cognitive 55): 0037_single_import_execution.upgrade has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 10, ternaries 2 (6 pts), error handling 1 (3 pts), loops 1 (nesting depth added 27). 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":"apps/api-python/app/db/alembic/versions/0037_single_import_execution.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30062e65ef90d0b5acc5bb9bf256218c9020183e8fe30e4e1a853155b07cead"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessReadableResourceImportTask._refresh_single_file_metadata (cognitive 55): ProcessReadableResourceImportTask._refresh_single_file_metadata has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 12, loops 1 (2 pts), 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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"786af249f593842128450e94deddc9d19725f37ce74ac3e87fba287d1f7ea36e"}},{"ruleId":"D2","level":"warning","message":{"text":"email-settings-page.EmailSettingsPage (cognitive 55): email-settings-page.EmailSettingsPage has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 17 (30 pts), boolean chains 10, if/else 10, error handling 5 (nesting depth added 13). Of this number, 20 points are the body\u0027s own statements and 35 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/email-settings-page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"731c46bad438bcba6727c78e0155919306c5dc57e60ad3d8d1bc0bd80f365684"}},{"ruleId":"D2","level":"warning","message":{"text":"import-tasks-page.ImportTasksPage (cognitive 54): import-tasks-page.ImportTasksPage has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 24 (28 pts), if/else 13 (15 pts), boolean chains 9, error handling 2 (nesting depth added 6). Most of this is not in the body itself: 14 of the 54 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 143, a function literal at line 317, continueTask, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c164efc69b3c0c2956a30f6562dc073f91c5886542e62e3f93f4082f277ba5d4"}},{"ruleId":"D2","level":"warning","message":{"text":"book-table.BookTable (cognitive 54): book-table.BookTable has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 22 (28 pts), if/else 17, boolean chains 9 (nesting depth added 6). Most of this is not in the body itself: 4 of the 54 points are its own statements and the rest belongs to 12 function items inside it that branch (sortableHeader, a function literal at line 221, beginRowSelection, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-table.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"db75d726793e23988a029408356608e339718d23a1bdadcad846d60344cb0bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"setup-page.SetupPage (cognitive 54): setup-page.SetupPage has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (25 pts), ternaries 9 (13 pts), boolean chains 10, error handling 5 (6 pts) (nesting depth added 9). Most of this is not in the body itself: 6 of the 54 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 53, createAccount, addLibrary, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2b3f67300e77140cbe2c08abaf158860d36a36b3eafd13dc874321e3d38512"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanLibrarySourceTree._execute_scopes (cognitive 53): ScanLibrarySourceTree._execute_scopes has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (23 pts), error handling 4 (11 pts), boolean chains 8, ternaries 3 (7 pts), loops 3 (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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5336f8fd23e7c23513da0c823f1fcd9c71d4840bab9ac9d19d6b6d7669981a"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryResourceAdapterExecutor.parse_file (cognitive 53): RegistryResourceAdapterExecutor.parse_file has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 13 (17 pts), if/else 10 (16 pts), error handling 5 (11 pts), boolean chains 9 (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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ead109676cf7a879f05486155f9542cffa9dc3febe86596c8d1c7ef62b8ebaf"}},{"ruleId":"D2","level":"warning","message":{"text":"pwa-client.PwaClient (cognitive 53): pwa-client.PwaClient has cognitive complexity 53 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 13, ternaries 3, error handling 2 (nesting depth added 9). Most of this is not in the body itself: 3 of the 53 points are its own statements and the rest belongs to 21 function items inside it that branch (a function literal at line 172, a function literal at line 132, a function literal at line 167, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b606d434532d04c1bf1ea5655331a9e0e483d510dca3445169a5f0414fb22"}},{"ruleId":"D2","level":"warning","message":{"text":"records.installed_records (cognitive 52): records.installed_records has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 7, loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/shuku_dependencies/records.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23da888d5f8de8e736cd498b064fbe4675565e2dd87fb187cb3c8b47aa7a938"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderScreen (cognitive 52): ReaderScreenKt.ReaderScreen has cognitive complexity 52 (threshold 15). Drivers by points: if/else 32 (36 pts), error handling 4 (8 pts), boolean chains 5, match/switch 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"398187baabd29b4b4a600c0ef3aebe36dfd3613fe6ad3a1a273d1c4f6d9d0188"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-safety-policy.findDoctype (cognitive 52): reader-safety-policy.findDoctype has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (38 pts), ternaries 3 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d97e0294d96611fc6122c9f923e8ae566e75024fa0056d98aa41bacfa3b5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"selective_comicinfo.patch_comicinfo (cognitive 51): selective_comicinfo.patch_comicinfo has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 4 (12 pts), loops 3 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f631e8d25ea3076020d3d067a83a27804e8937975c667ae45f2509c521d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderContentsPanel (cognitive 51): ReaderScreenKt.ReaderContentsPanel has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 8, match/switch 2 (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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a1e9448bb77eff59bf5c2b7a299d28853c2f8703d7e056b4bc6c9292a601e5"}},{"ruleId":"D2","level":"warning","message":{"text":"http.update_shelf (cognitive 50): http.update_shelf has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (32 pts), ternaries 8 (9 pts), boolean chains 6, error handling 3 (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":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"77377b5e2e902a6a1f05ed5654d4e7e85704584e3118571b143c69efcce2e9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-safety-policy.validate_fixture_manifest (cognitive 50): generate-reader-safety-policy.validate_fixture_manifest has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 14, 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":"packages/reader-contracts/generate-reader-safety-policy.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4caa3906726d3133531f37642fe60b7264397f57ea1f7922ea816c335c2772"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-reader-safety-conformance.load_suite_and_expected (cognitive 49): verify-reader-safety-conformance.load_suite_and_expected has cognitive complexity 49 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 5, boolean chains 1 (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":"packages/reader-contracts/verify-reader-safety-conformance.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea09c8e5a648a8d49a8b311e32b00a04121503a929be5d3809605c1298f352e"}},{"ruleId":"D2","level":"warning","message":{"text":"IosEpubArchiveSafetyPreflight.verifyMetadata (cognitive 49): IosEpubArchiveSafetyPreflight.verifyMetadata has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 5 (14 pts), boolean chains 9, loops 3 (4 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba5b7487e0c1c56b28c474fdb9b20dc4dc0ff41824298fab8da57a17d96a2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"select.Select (cognitive 48): select.Select has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 17 (25 pts), if/else 12 (14 pts), boolean chains 9 (nesting depth added 10). Most of this is not in the body itself: 10 of the 48 points are its own statements and the rest belongs to 10 function items inside it that branch (onKeyDown, a function literal at line 248, a function literal at line 143, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/select.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ae44fb4a73d1233eec76866f6cf0782896d4a7513e2f3c21bbcc5a77eabd43"}},{"ruleId":"D2","level":"warning","message":{"text":"move_companions.move_companion_paths (cognitive 47): move_companions.move_companion_paths has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/move_companions.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6c08d3bd5384fbca0bc5908f98bb6409d2753299d70af5abce1530bb160793"}},{"ruleId":"D2","level":"warning","message":{"text":"ComicReaderAdapter.execute (cognitive 47): ComicReaderAdapter.execute has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 9, ternaries 3 (7 pts), error handling 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14325e5da0a8f203d0c9be04222c855e34c44fedb49257b5d78657a69b7b845"}},{"ruleId":"D2","level":"warning","message":{"text":"system-health-settings-page.SystemHealthSettingsPage (cognitive 47): system-health-settings-page.SystemHealthSettingsPage has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 15 (20 pts), if/else 13 (15 pts), boolean chains 11, error handling 1 (nesting depth added 7). Most of this is not in the body itself: 14 of the 47 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 198, execute, a function literal at line 286, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/system-health-settings-page.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"80778b1623fc26046779f71b6ede8b21ff363f1506aebbfdb612919fcff68188"}},{"ruleId":"D2","level":"warning","message":{"text":"BookManagementKt.ManagementAnchor (cognitive 46): BookManagementKt.ManagementAnchor has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 19, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59bc7dc3057aaa5fdecccab50bbb7687341fca6bcc2871ff4ce349f2aecb356"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.translateDomNode (cognitive 46): provider.translateDomNode has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 27). 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":"apps/web/i18n/provider.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7e7520087d5cef6d62c878ce2c883708f785292f020c9e8122fae5ca4a1021"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-safety-policy.rewriteAuthoredDocumentReferencesWithProfile (cognitive 46): reader-safety-policy.rewriteAuthoredDocumentReferencesWithProfile has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 4 (5 pts), boolean chains 4, match/switch 1 (3 pts), ternaries 2 (nesting depth added 20). Of this number, 29 points are the body\u0027s own statements and 17 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6a8c5a89e3e428eee566971b356cbafe8c626b16463c718f4151ee128bc570"}},{"ruleId":"D2","level":"warning","message":{"text":"text-publication.worker.materializeFb2Chapter (cognitive 46): text-publication.worker.materializeFb2Chapter has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (33 pts), ternaries 2 (7 pts), boolean chains 5, 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":"apps/web/features/reader/v3/original-publication/text-publication.worker.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca080bc70f10230e34000b48b1aee45893321e11d63dd61e13a0b4e441fd08"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailViewModel.loadMultiDownloadFolder (cognitive 45): WorkDetailViewModel.loadMultiDownloadFolder has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (40 pts), error handling 2, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afd4e9c75de6aa510111290f407d08ab4ef1ca82cb323d288b240cdad54ddac"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderPreferenceChangesKt.changedReaderControls (cognitive 45): ReaderPreferenceChangesKt.changedReaderControls has cognitive complexity 45 (threshold 15). Drivers by points: if/else 44 (45 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderPreferenceChanges.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7d25575a0320d064c7726b25f4a4c9a15b5f426022e5f6362640eab223b3f4"}},{"ruleId":"D2","level":"warning","message":{"text":"dashboard-page.DashboardPage (cognitive 45): dashboard-page.DashboardPage has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 13 (34 pts), if/else 7 (11 pts) (nesting depth added 25). Most of this is not in the body itself: 10 of the 45 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 131, 58, 140). 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":"apps/web/features/dashboard/dashboard-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"43eb98630813467796d7309ad044afa17b3c6fb3f6d1d20f40c51664159cee58"}},{"ruleId":"D2","level":"warning","message":{"text":"automation-settings-page.GrantsPanel (cognitive 45): automation-settings-page.GrantsPanel has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 14 (24 pts), boolean chains 13, if/else 5 (8 pts) (nesting depth added 13). Most of this is not in the body itself: 8 of the 45 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 161, a function literal at line 157, formatTime, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaff2c8e6b96d2c7948e64dd8db59fa1a61f79b99e716d68e380f2551b64197"}},{"ruleId":"D2","level":"warning","message":{"text":"FileDeletions.execute (cognitive 43): FileDeletions.execute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (30 pts), error handling 2 (5 pts), boolean chains 4, ternaries 1 (3 pts), loops 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":"apps/api-python/app/modules/library/application/file_deletions.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fddb6b8605591514d70b050b214096c4c3f9ec9cfc5d1976a29b681e95357bc"}},{"ruleId":"D2","level":"warning","message":{"text":"http.get_cover (cognitive 43): http.get_cover has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 11, ternaries 2 (4 pts), 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":"apps/api-python/app/modules/media/presentation/http.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e53f6874af49a1d430a093ce76bbfebf16d2f468d19dac8b1c716e3b472e55"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlControlPreprocessor.expandInternalEntity (cognitive 43): XmlControlPreprocessor.expandInternalEntity has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSafetyFacade.kt"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"680bbb8fb2692ff283e7f8ceb301c8c230b2899cc86e000d08664b4c507c8c64"}},{"ruleId":"D2","level":"warning","message":{"text":"BookDetailStore.loadContentBrowser (cognitive 43): BookDetailStore.loadContentBrowser has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (39 pts), ternaries 1 (3 pts), error handling 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"f502f10756199cf46cbbc9cd4ce8c3d32cc103ab1ad17c4f3c6000329c223a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"IosImageDirectoryBundle.init (cognitive 43): IosImageDirectoryBundle.init has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 21, if/else 12 (20 pts), loops 2 (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c30168320bd0c3bdd0647d66538d5714b91162158670c1e8ffc1e9b479ec1bc"}},{"ruleId":"D2","level":"warning","message":{"text":"organize-page.OrganizePage (cognitive 43): organize-page.OrganizePage has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 18 (25 pts), if/else 9, boolean chains 7, error handling 2 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 27 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40c5a5ed0c460e3aaa8d9bfb47d62db5d33ff47adf81d3abc54e8fd5b296ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadableResourceWorkerProcessor._execute_book (cognitive 42): ReadableResourceWorkerProcessor._execute_book has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 8, ternaries 1 (3 pts), loops 1 (2 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2442827a5131b9bad88e525237748ac8f7ad03b3bbb18c52980176a549fcdd"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBulkBookOperations.prepare_covers (cognitive 42): SqlAlchemyBulkBookOperations.prepare_covers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 7 (13 pts), error handling 4 (7 pts), loops 4 (6 pts), boolean chains 2 (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":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"33692f3f8a2aa337cbe50034bbb6118e80926e23629fda2a9ec1fa1ad4a1b7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_writeback.write_audio_metadata (cognitive 42): audio_writeback.write_audio_metadata has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 6 (14 pts), loops 4 (6 pts), boolean chains 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":"apps/api-python/app/modules/metadata/infrastructure/audio_writeback.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"231b26692f019e9feaadd8d753477939d886b2fcca2fa3b07eea29c2a7a9f5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"api.fetchReaderBootstrap (cognitive 42): api.fetchReaderBootstrap has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 15, ternaries 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"apps/web/features/reader/v3/api.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7735f21f15e63b22bac4aecb7b2da695808b8dc04a99c593c34fa55e98d06b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"strict-fb2-parser.parseStrictFb2.openElement (cognitive 42): strict-fb2-parser.parseStrictFb2.openElement has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 10, ternaries 1 (nesting depth added 10). Of this number, 34 points are the body\u0027s own statements and 8 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6e548a74a8c36a0b0c1cd5a392da4610e46f707bdd54848b55edc1c3926a31"}},{"ruleId":"D2","level":"warning","message":{"text":"0031_book_import_task_backfill.backfill_book_tasks (cognitive 41): 0031_book_import_task_backfill.backfill_book_tasks has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 5 (13 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0031_book_import_task_backfill.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9870eb636f93b569b701dcffc1b8aa4439ea5e83cd91601e296f618eb8f57f"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryResourceAdapterExecutor._epub_navigation (cognitive 41): RegistryResourceAdapterExecutor._epub_navigation has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (31 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"121e18eb11ab0ed61e7684a7083c02a40bd5dbcb1b9970f25e4207d9173c01f4"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.bangumi_candidates (cognitive 41): organize_service.bangumi_candidates has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 12 (18 pts), if/else 7 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ebc1d998c2320984d9eb62e99e63e079e82b7168370b88d8e19fe13e373de4"}},{"ruleId":"D2","level":"warning","message":{"text":"CentralDirectoryReader.read (cognitive 41): CentralDirectoryReader.read has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 13, 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0781d25660bc0e2c03cf38601e4cf63aa8db83feb7a1b7cb9760dc54a441dd64"}},{"ruleId":"D2","level":"warning","message":{"text":"http.create_kindle_send_task (cognitive 40): http.create_kindle_send_task has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 15, ternaries 3, error handling 2 (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":"apps/api-python/app/modules/kindle/presentation/http.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a54903b8c7d055380fe478cb05102ce7251b23e9c2e6de3ce2a9ba2258c40c"}},{"ruleId":"D2","level":"warning","message":{"text":"packages.node_packages (cognitive 40): packages.node_packages has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 3 (6 pts), boolean chains 5, loops 4 (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":"apps/api-python/shuku_dependencies/packages.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27ec347f1170d121c3c420454d6474f807485c3e11ef9f4f1e567135cce06ac"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailScreenKt.WorkDetailScreen (cognitive 40): WorkDetailScreenKt.WorkDetailScreen has cognitive complexity 40 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 3, loops 1 (2 pts), match/switch 2 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94f442d4d09c6ff23b0fcb8b2c8cd84a8ef11ab9efe86e62c0549f464ee2bba"}},{"ruleId":"D2","level":"warning","message":{"text":"client.readerResourceFailure (cognitive 40): client.readerResourceFailure has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 8 (36 pts), boolean chains 3, error handling 1 (nesting depth added 28). 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":"apps/web/features/reader/api/client.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc64dea5bb77f707828539f8ce6342db01c699e92af72018f99544d3e364026"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 40): (anonymous) has cognitive complexity 40 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 3, ternaries 1 (2 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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d550f22bc39b5a654440a8d176eabc758d023d3f84300c9c04e78f71166f07b"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationUploads.complete (cognitive 39): AutomationUploads.complete has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 8, ternaries 3 (6 pts), error handling 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"34797b99b6a3fc761cd7f975f489d59ab54535fd1d2486a251cf096c8288fe6d"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBulkBookOperations.update_metadata (cognitive 39): SqlAlchemyBulkBookOperations.update_metadata has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 12, loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e42f505b2c144264422ab7b11a8cbe0a8c3fc488720eeb78e70aa75528afba"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBookResourceRepository.save_directory_assets (cognitive 39): SqlAlchemyBookResourceRepository.save_directory_assets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 7 (12 pts), loops 6 (10 pts), boolean chains 5 (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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4152b06dc14ba5aca6ddf19f8657db0744d10657cf75ccd2172ca897684ac73"}},{"ruleId":"D2","level":"warning","message":{"text":"generation.complete_missing_metadata (cognitive 39): generation.complete_missing_metadata has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 14, ternaries 2 (3 pts), error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/generation.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9b6c7e2f61e4f990fe014e1d64bdbab3d93c6be410643ec7829996e67c1e72"}},{"ruleId":"D2","level":"warning","message":{"text":"matching.match_metadata_candidates (cognitive 39): matching.match_metadata_candidates has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 21, if/else 9 (10 pts), ternaries 5 (6 pts), loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/matching.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d21484750248c2bfec012f1cce680be7d12e8ae7048aed52d09305d52afe335"}},{"ruleId":"D2","level":"warning","message":{"text":"AnchoredStandardMetadataReader._read_one (cognitive 39): AnchoredStandardMetadataReader._read_one has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), error handling 6 (10 pts), ternaries 5 (9 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":"apps/api-python/app/modules/metadata/infrastructure/standard_files.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4cd5cbc626d1001a2e8bb068bdb77a0d8c13182432ffdd2d0fb44cafe47b96"}},{"ruleId":"D2","level":"warning","message":{"text":"classification-management-panel.ClassificationManagementPanel (cognitive 39): classification-management-panel.ClassificationManagementPanel has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 14 (23 pts), if/else 7 (8 pts), boolean chains 4, error handling 4 (nesting depth added 10). Most of this is not in the body itself: 11 of the 39 points are its own statements and the rest belongs to 10 function items inside it that branch (rename, merge, removeCategory, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5ee356ff0e5f647701fcce2fc84adbe11ba5c171c40eb83db1f42d88b0fe0a"}},{"ruleId":"D2","level":"warning","message":{"text":"epub_adapter._index_epub (cognitive 38): epub_adapter._index_epub has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 6 (8 pts), boolean chains 6, ternaries 3, 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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a47b05010353a0965c5274a3367aecd72de26a5a3ed9ffb314c8478082f3ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ShelfCatalogView.resultContent (cognitive 38): ShelfCatalogView.resultContent has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 5 (17 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogView.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d275169cb18dcdf8f2b5dac0fa93d8a2bf4c066837c21cf4974c0b9de291ae"}},{"ruleId":"D2","level":"warning","message":{"text":"prototype.app.addEventListener(\u0022click\u0022) (cognitive 38): prototype.app.addEventListener(\u0022click\u0022) has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31 (35 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fab9d9fbc67029e8c4a4cf6dd51b7f2bafd72393fdd1cc5bb30f713d672de6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessBookResources.execute (cognitive 37): ProcessBookResources.execute has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 9, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/process_book_resources.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14655cb8048f2d6f69fc69455df0ec01a9fee9289bd9b10c33799307a3d56fb"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativePeopleAndQueueScreensKt.UserEditScreen (cognitive 37): AdministrativePeopleAndQueueScreensKt.UserEditScreen has cognitive complexity 37 (threshold 15). Drivers by points: if/else 27 (33 pts), boolean chains 4 (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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"124759b94863362a37e7a8cabb70b81f1f7d0dceeac9ce07cbd2cf4bf6c8461e"}},{"ruleId":"D2","level":"warning","message":{"text":"context-action-menu.ContextActionMenu (cognitive 37): context-action-menu.ContextActionMenu has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 20 (25 pts), if/else 9, boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 8 of the 37 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 129, 65, 52, \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":"apps/web/components/ui/context-action-menu.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"283e371e877674d97e370cc3da93eb76747674b4ac2fd8bbef3169d284f89b61"}},{"ruleId":"D2","level":"warning","message":{"text":"book-action-controller.BookActionController::invoke (cognitive 37): book-action-controller.BookActionController::invoke has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (29 pts), ternaries 2 (4 pts), boolean chains 3, error handling 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":"apps/web/features/books/ui/book-action-controller.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7899e2526708a48518efa743a1bd806862ccfa7900ab02cf8fe0f97c4355b7"}},{"ruleId":"D2","level":"warning","message":{"text":"account-panel.AccountPanel (cognitive 37): account-panel.AccountPanel has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12, ternaries 7 (12 pts), boolean chains 8, error handling 5 (nesting depth added 5). Most of this is not in the body itself: 5 of the 37 points are its own statements and the rest belongs to 7 function items inside it that branch (uploadAvatar, savePassword, saveName, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0450b81a57246f8006f3fc46ede29cb1130aa7232e50cb344f9da95881eea0d3"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_ast.parse_filter_expression (cognitive 36): filter_ast.parse_filter_expression has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 6, ternaries 1 (4 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":"apps/api-python/app/modules/library/application/filter_ast.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0e622c1cde1b2a1024dd3901e73ab05c8da30d8c092cc12439442acd062e79"}},{"ruleId":"D2","level":"warning","message":{"text":"file_writeback._publication (cognitive 36): file_writeback._publication has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 20, ternaries 7 (8 pts), if/else 5 (6 pts), error handling 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/file_writeback.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cb8152b4899c1dadfba7eb19c1fe25115b483492160da10555e16f90c275bf"}},{"ruleId":"D2","level":"warning","message":{"text":"library_filters.normalize_filter_rules (cognitive 36): library_filters.normalize_filter_rules has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 6, ternaries 1 (4 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":"apps/api-python/app/services/library_filters.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef8dabe7caef91db6b270c77e59c0eee18ce7aeb085fb10df74f521e93988b"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidEpubArchiveSafetyPreflight.verifyMetadata (cognitive 36): AndroidEpubArchiveSafetyPreflight.verifyMetadata has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 9, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/AndroidEpubArchiveSafetyPreflight.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"997becf50134ff239c697c976880e986b721fe02dd02d4e39ffaf3a6345c8f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiClient.execute (cognitive 36): ApiClient.execute has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 6, error handling 4, match/switch 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbb82eb6e60cc159546d20a4af727db214d81da0ce04732d99bedee8e410aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-safety-policy.rewriteReferences::expandEntity (cognitive 36): reader-safety-policy.rewriteReferences::expandEntity has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (reader-safety-policy.rewriteReferences, reader-safety-policy.rewriteReferences::appendEscaped) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"af32830ee4f4fc7ce25af01f942b43a4a97fd3cfc4c2c17008c1112961809d84"}},{"ruleId":"D2","level":"warning","message":{"text":"book-content-browser.BookContentBrowser (cognitive 36): book-content-browser.BookContentBrowser has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 17 (23 pts), boolean chains 13 (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 15 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0b2157c82456193f3af6e60746cbb9a3306303972dbf14fe65ac02470bee14"}},{"ruleId":"D2","level":"warning","message":{"text":"mobi-publication.openMobiPublication (cognitive 36): mobi-publication.openMobiPublication has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (20 pts), loops 4 (5 pts), ternaries 3 (5 pts), boolean chains 4, error handling 2 (nesting depth added 5). Most of this is not in the body itself: 12 of the 36 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 185, a function literal at line 135, a function literal at line 152, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-publication.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc1ea4b556131b00b3bf37d2f4676f18634c934b3c12f8959c0c6cca980187"}},{"ruleId":"D2","level":"warning","message":{"text":"strict-fb2-parser.namespacesForElement (cognitive 36): strict-fb2-parser.namespacesForElement has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, ternaries 3 (7 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"029ab8b18d83da0bdfeae4af8d2ea48f31c31dddcf97c479c2de22a669d1c5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"library_paths.library_directory_tree_node (cognitive 35): library_paths.library_directory_tree_node has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 9, error handling 3 (6 pts), 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":"apps/api-python/app/modules/imports/application/library_paths.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbddb081e4626b3ff1618de10a1c0b26246d1f0e5b06929f9661fb7046e4b590"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailScreenKt.WorkDetailBody (cognitive 35): WorkDetailScreenKt.WorkDetailBody has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 8 (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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c121916d734ee1082d6c5f72e89ec85a135441d79b84af95ade96dc2b0058c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadiumEpubSession.openLocalPublication (cognitive 35): ReadiumEpubSession.openLocalPublication has cognitive complexity 35 (threshold 15). Drivers by points: error handling 13 (24 pts), if/else 7 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d39f1fd66645912d281016921c55092d8533b0da4ff496fcfb855580a3e9cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderBottomConsole (cognitive 35): ReaderScreenKt.ReaderBottomConsole has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (24 pts), boolean chains 9, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cf7aae2556040e6779996a2c99244ef40eedbe944c1e53f00535086bb0bf56"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadiumWebReaderAdapter.execute (cognitive 35): ReadiumWebReaderAdapter.execute has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced6dc27db9682851149fa92b7d664c2b03fac6c6a3aeb65f0538d4d8f8139bd"}},{"ruleId":"D2","level":"warning","message":{"text":"0019_backfill_scan_gaps.backfill_scan_gaps (cognitive 34): 0019_backfill_scan_gaps.backfill_scan_gaps has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (8 pts), boolean chains 2 (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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"658ac60e21744914518a9ed834aa56ce717adcbe40445c081adc25263c1061da"}},{"ruleId":"D2","level":"warning","message":{"text":"0020_recheck_scan_gaps.backfill_scan_gaps (cognitive 34): 0020_recheck_scan_gaps.backfill_scan_gaps has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (8 pts), boolean chains 2 (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":"apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3702f1cc0ce11ccfb68f06bfd86ba053977777a8872bd98a9f3c48b4dbcacf59"}},{"ruleId":"D2","level":"warning","message":{"text":"problems.failure_problem (cognitive 34): problems.failure_problem has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 5 (16 pts), if/else 9 (15 pts), loops 1 (2 pts), boolean chains 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":"apps/api-python/app/modules/backup/infrastructure/problems.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1176405e5b7d0ba83d8a4d7e0693e3ae18a464bc60f2ce76b01883bdaf7c1487"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessReadableResourceImportTask.prepare_resource_covers (cognitive 34): ProcessReadableResourceImportTask.prepare_resource_covers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 3 (9 pts), loops 2 (5 pts), boolean chains 2 (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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc9b6b1435a181c101100561f3bdd097c4bfcbf1add33cd428184bb9ca00f4"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy_views._resource_view (cognitive 34): legacy_views._resource_view has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 29, boolean chains 4, 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":"apps/api-python/app/modules/library/infrastructure/legacy_views.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"da76eeae82bc262f669d5a6a3a1e1be6577e9c22bc1504b3a80e4fc162b9df75"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyMetadataPatches.apply (cognitive 34): SqlAlchemyMetadataPatches.apply has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/metadata_patches.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a250acc68ccee32f67522f32e3caf464472b7a2df9ca30888de5d832676320c1"}},{"ruleId":"D2","level":"warning","message":{"text":"source_name._name_parts (cognitive 34): source_name._name_parts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 21). 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":"apps/api-python/app/modules/metadata/domain/source_name.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"75705982ef21be961c5bba173531613b5d8643b60ed00a8bb968bd2b3413c991"}},{"ruleId":"D2","level":"warning","message":{"text":"xml_policy._scan_entity_declarations (cognitive 34): xml_policy._scan_entity_declarations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (30 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":"apps/api-python/app/modules/publications/infrastructure/xml_policy.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"477801e8f40f43238954e7b06e01de54c2ad662aa609d0b5bf37622a8f3051a0"}},{"ruleId":"D2","level":"warning","message":{"text":"resource_reader._derive_display_percent (cognitive 34): resource_reader._derive_display_percent has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/reader/application/resource_reader.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5377fd913e1c7a57635f3ec39ae951cf4faf0d0bd19244b470719a79580858a8"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataLookupWorker._run (cognitive 34): MetadataLookupWorker._run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 3 (10 pts), boolean chains 4, error handling 1 (3 pts), loops 2 (3 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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"78111c34694ff27a5f7f87bd68b71571b13da6910fd4a71b2526bd36784162c1"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReaderBootstrapView.body (cognitive 34): IosReaderBootstrapView.body has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (9 pts), match/switch 2 (5 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff38832d7bfa8219c5965c4e5475f713455a46552431ef6ffd1e4dd1ad4e23f"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-safety-conformance.evaluateFactCase (cognitive 34): generate-reader-safety-conformance.evaluateFactCase has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 17, if/else 8 (15 pts), match/switch 1, ternaries 1 (nesting depth added 7). 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":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b877da35de99398faf486fbee6db9b959d311fd60e2a6abc7945659c151a07"}},{"ruleId":"D2","level":"warning","message":{"text":"application.prepare_preview (cognitive 33): application.prepare_preview has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 5 (14 pts), boolean chains 9, if/else 5 (8 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":"apps/api-python/app/modules/feedback/application.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8702405bce7fbc17537a98a918fd6134282e4878e6b9cfb45122042bb407eaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderPreferenceSheet.settingRow (cognitive 33): ReaderPreferenceSheet.settingRow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 12, ternaries 5 (8 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSheets.swift"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c06d04a508aab7a50b19f3eba5f30c589fc53c1e854314120be4d81fce4343"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-safety-policy.parseEntityDefinitions (cognitive 33): reader-safety-policy.parseEntityDefinitions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea23bbd3d927fe9d5be4b895a9c8cc1e2aaf4a3369ed0708c6d3a1bf2cb156f"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-shell.ResourceNavigationPanel (cognitive 33): reader-shell.ResourceNavigationPanel has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 18 (24 pts), boolean chains 9 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 16 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7cf7cffb5c1308899ac3a22340a6c56dbfcb80ed18e2be1951d9567f3df3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"recognition-settings-panel.RecognitionSettingsPanel (cognitive 33): recognition-settings-panel.RecognitionSettingsPanel has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 13 (18 pts), boolean chains 8, if/else 5, error handling 2 (nesting depth added 5). Most of this is not in the body itself: 9 of the 33 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 86, a function literal at line 145, save, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/recognition-settings-panel.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa15ab173c9883f97f203da1658e946a29fb671a80919172a63fe00052b2bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"strict-fb2-parser.parseStrictFb2 (cognitive 33): strict-fb2-parser.parseStrictFb2 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 3, 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d2eda8ddd493c584db44b90ae84688a2ebf59eef0d6145a617918664cb0a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"comic_archives.inspect_comic_archive (cognitive 32): comic_archives.inspect_comic_archive has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 11 (12 pts), error handling 2 (4 pts), ternaries 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4352c0747afa6df408942b4fb8aa7d2fc5336f09c61efae24ffb79f18950e3"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadableResourceWorkerProcessor._finish (cognitive 32): ReadableResourceWorkerProcessor._finish has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (26 pts), error handling 2 (3 pts), boolean chains 2, ternaries 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ab3b0b88b8ace599713979ed1ba0e3f50b4d2b59b7d9dc79d6478733091d93"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemySourceNodeRepository.reconcile_batch (cognitive 32): SqlAlchemySourceNodeRepository.reconcile_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, ternaries 3 (5 pts), 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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d349a4865bcd33cb0950984dfea9414d630edcb8c22ed3bbfc6c83dca5d0da7"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardMetadataPublication.prepare (cognitive 32): StandardMetadataPublication.prepare has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 4 (8 pts), boolean chains 6, 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":"apps/api-python/app/modules/metadata/infrastructure/standard_publication.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59ca7ccb0c56093a11020c2ccb2176613acfbe7ef0300bdadaf992609c80849"}},{"ruleId":"D2","level":"warning","message":{"text":"epub_adapter._validated_entries (cognitive 32): epub_adapter._validated_entries has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 5, loops 3 (5 pts), error handling 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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba454e3e0188346ea9b975543babd1d08fdb862dbbaf893152d6adefaaa5bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiClient.loadAuthenticatedAsset (cognitive 32): ApiClient.loadAuthenticatedAsset has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), error handling 4, match/switch 1 (3 pts), boolean chains 2, 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a01b1361b3d7d5b5c77855dfd76b4bd29ab0b1a9e61cd23c1d76ee9b1ffc71"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReflowableReaderSession.open (cognitive 32): IosReflowableReaderSession.open has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 5, error handling 3 (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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f273263a4999313b8677026a6da66d5a7c101464a1f6012e780315ec12278"}},{"ruleId":"D2","level":"warning","message":{"text":"organize-job-detail-page.OrganizeJobDetailPage (cognitive 32): organize-job-detail-page.OrganizeJobDetailPage has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 18 (26 pts), if/else 4, boolean chains 2 (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 11 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-job-detail-page.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b839f16913d3adfa40f713c47ef4f38776b768668d32ffced9b4d07e89d70b6"}},{"ruleId":"D2","level":"warning","message":{"text":"epub-archive-safety.preflightEpubArchiveEntries (cognitive 32): epub-archive-safety.preflightEpubArchiveEntries has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (28 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/epub-archive-safety.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2791aabdf0a12668d208baaa1f8ac0bebfd733d37b38c820e4cc8e6707d8e997"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateUser.execute (cognitive 31): UpdateUser.execute has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 11, ternaries 4, error handling 1 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/auth/application/user_management.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b172ac64c7e54f45cbf76a13949baf08188ab4c9d08e3d54d770afabffb8c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourcePreviewCache.prune (cognitive 31): ResourcePreviewCache.prune has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/media/infrastructure/resource_preview_cache.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11c1dfd62c8712a6f6d6bc84f4936d8229d33edf8178c77dafb01cfad076338"}},{"ruleId":"D2","level":"warning","message":{"text":"file_writeback.cleanup_orphan_prepared_files (cognitive 31): file_writeback.cleanup_orphan_prepared_files has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 4 (10 pts), loops 2 (3 pts), boolean chains 2, ternaries 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":"apps/api-python/app/modules/metadata/infrastructure/file_writeback.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6afac3f73a31c10a28d8662299dd6bda400d04d237f25f6dbd630e85fc1ad4a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_writeback.patch_xmp (cognitive 31): pdf_writeback.patch_xmp has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 pts), ternaries 3 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/pdf_writeback.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3b61c98c245cce4c44ee2768a4d46f1729294b56b585221bbe15d75d86abba"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_metadata._read_with_ffprobe (cognitive 31): audio_metadata._read_with_ffprobe has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9, ternaries 5 (7 pts), loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99407a9b6290f74aa57d39b1172909a9975d4a830d6834d9e7a9f5c9f987c99"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryStore.refreshAfterManagement (cognitive 31): LibraryStore.refreshAfterManagement has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (7 pts), match/switch 1 (4 pts), error handling 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42aaa926c7e2d191ef345440a8b7e5ccbcdb93e59e9b4d9aeb33a01e8fa3b58"}},{"ruleId":"D2","level":"warning","message":{"text":"api.normalizeAudioBootstrap (cognitive 31): api.normalizeAudioBootstrap has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 13, boolean chains 9, if/else 9. Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/api.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f04592c4facad8e59a2b42c4294d06131893afad84882533fa4668600c3b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"ComicSpreadTrackDriver.renderSlot (cognitive 31): ComicSpreadTrackDriver.renderSlot has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 4 (8 pts), boolean chains 6 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 10 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":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c3af148e6ebabad48fe90708f67d9d1e771b8c705f4dcb03a107e66e366016"}},{"ruleId":"D2","level":"warning","message":{"text":"automation-settings-page.ConfigurationPanel (cognitive 31): automation-settings-page.ConfigurationPanel has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 9 (14 pts), error handling 2, boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 6 function items inside it that branch (copy, a function literal at line 96, a function literal at line 108, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e403af07be67a0fd1130a2fdd451512143a913abbf0d54c02ef435804c47b3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"exception_diagnostics.format_exception_diagnostics (cognitive 30): exception_diagnostics.format_exception_diagnostics has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (9 pts), ternaries 3, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f545eb760612c3ffa633cfbd373e9ac139cd4197e0729ee6e75f39cd598504d2"}},{"ruleId":"D2","level":"warning","message":{"text":"persistence._converted_column_value (cognitive 30): persistence._converted_column_value has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), error handling 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77615a962dd5c1abebf08537e9f5e71d2d7e3ebb0acdce9db62e0dd234dd1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyMetadataPatches.execute (cognitive 30): ApplyMetadataPatches.execute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, loops 2, error handling 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":"apps/api-python/app/modules/library/application/metadata_patches.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db055b6a19bb0d914f342af39b7f61a8bf1f928f3b9ebf47cbfbf1d73d4a977"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_query._condition (cognitive 30): filter_query._condition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (24 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/filter_query.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"25921c7cde51ee00456833befd23c80ad94753274f0460841e7ceb0342c592f8"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemLocalMetadataCoverParser.extract_cover (cognitive 30): FilesystemLocalMetadataCoverParser.extract_cover has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 3 (5 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9717a5f79ed0c12f0e086e48c21f99e4e2cce5b71ceb4228badf65e9a4f17e"}},{"ruleId":"D2","level":"warning","message":{"text":"html_serialization._plaintext_prefix (cognitive 30): html_serialization._plaintext_prefix has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (8 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/html_serialization.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f717cec6fdef39a353b6af4ce380232f0289f08df317f4cd1e9ee4c4e57838"}},{"ruleId":"D2","level":"warning","message":{"text":"LoginScreenKt.LoginScreen (cognitive 30): LoginScreenKt.LoginScreen has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (21 pts), match/switch 5, boolean chains 4 (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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2d927fe40858a0b07ca031bb302392392f511f052acc8f6c1315ba65148365"}},{"ruleId":"D2","level":"warning","message":{"text":"FacetViewModel.load (cognitive 30): FacetViewModel.load has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 4, error handling 2, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57f8c5f44f8b34cc393271548d2f284ed86d706eecc652201d64f064f7d9967"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailScreenKt.WorkContentEntryCard (cognitive 30): WorkDetailScreenKt.WorkContentEntryCard has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (28 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d6ac7eda97323a061e16ecde12451cd51d6bc6497c6e3238fce723f3af10a3"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReaderBootstrapHost.beginDownload (cognitive 30): IosReaderBootstrapHost.beginDownload has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 4 (8 pts), boolean chains 7, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9f16dbbeee0eb9c588d6ee1e76357aaf649cf2c6df49c940bf5ffe22197a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-safety-policy.rewriteReferences (cognitive 30): reader-safety-policy.rewriteReferences has cognitive complexity 30 (threshold 15). Drivers by points: if/else 27 (62 pts), ternaries 7 (26 pts), loops 5 (6 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 57). 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. This shape REPEATS in the file: 2 other methods here (reader-safety-policy.rewriteReferences::appendEscaped, reader-safety-policy.rewriteReferences::expandEntity) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fec9162d1493b53001541571d62fdd5c19c334cdf195b909cc36f0b8776344"}},{"ruleId":"D2","level":"warning","message":{"text":"source-node-metadata-dialogs.SourceNodeMetadataRecognitionDialog::apply (cognitive 30): source-node-metadata-dialogs.SourceNodeMetadataRecognitionDialog::apply has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 6 (8 pts), boolean chains 4, error handling 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":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c7f0b560c7b6b9a2a3243577735dff54bdec53294c0d8811f065824c3d56ea"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfReaderAdapter.renderPage (cognitive 30): PdfReaderAdapter.renderPage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, ternaries 4 (6 pts), error handling 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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2e8d8edea820f86034c411e42fcf44128e50ecfc3758304e6e95e93760ad3e"}},{"ruleId":"D2","level":"warning","message":{"text":"kindle-send-queue-page.KindleSendQueuePage (cognitive 30): kindle-send-queue-page.KindleSendQueuePage has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 18 (21 pts), if/else 5, boolean chains 2, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 4 of the 30 points are its own statements and the rest belongs to 4 function items inside it that branch (mutate, a function literal at line 179, a function literal at line 100, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b16915c40a587fd9dfe8cbe3b1eff3fc2a2766e99cf46f563e72ee6d43facd8"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-safety-conformance.archiveIsUnsafe (cognitive 30): generate-reader-safety-conformance.archiveIsUnsafe has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa71fa0145db6f6539f4e971a644f61070181056489f15f13d4e41f5797337e"}},{"ruleId":"D2","level":"warning","message":{"text":"exception_diagnostics._exception_facts (cognitive 29): exception_diagnostics._exception_facts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 2 (7 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65338ce9b2e9724cd547d83a6a4c07fbed22b5e5d97e1e66b476a4e5b304e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"exception_diagnostics.emergency_diagnostic (cognitive 29): exception_diagnostics.emergency_diagnostic has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (9 pts), error handling 3 (7 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":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d89f1f897139c9d008e97d56231ad0cc6198a275639128bcaa9cf6aa3c9c318"}},{"ruleId":"D2","level":"warning","message":{"text":"reflowable_metadata._inspect_mobi_family (cognitive 29): reflowable_metadata._inspect_mobi_family has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 13, if/else 11 (12 pts), ternaries 3, 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":"apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cc370a98902a3827bc5ffee466566d56cff89bb4c7b2c9bd4d67a558cb0c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"file_moves.validate_move_set (cognitive 29): file_moves.validate_move_set has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (10 pts), boolean chains 5, ternaries 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":"apps/api-python/app/modules/library/domain/file_moves.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6354d62ca0646b11059b08566bdc767e62d699a8cf0bda84508e5a96984cdceb"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_structure.mp3_structure (cognitive 29): audio_structure.mp3_structure has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, ternaries 2 (3 pts), error handling 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":"apps/api-python/app/modules/metadata/infrastructure/audio_structure.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c85aa440b8950194dada7319093bd0899a587dabfcc3b9ad1d59d8d7849160f"}},{"ruleId":"D2","level":"warning","message":{"text":"http._organize_job_view (cognitive 29): http._organize_job_view has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 20, if/else 7 (8 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/organize/presentation/http.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5915fc894305c0b304db1526acd0ec015d213deaa68317358aa546177c9975f"}},{"ruleId":"D2","level":"warning","message":{"text":"health_runs._run_health_checks (cognitive 29): health_runs._run_health_checks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 3 (5 pts), error handling 2 (3 pts), ternaries 3 (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":"apps/api-python/app/modules/system/infrastructure/health_runs.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"154a10d980b7043cd9aa0e5c320e3cf43d8201a91eff9b306fb47563d8fc532f"}},{"ruleId":"D2","level":"warning","message":{"text":"KindleSendQueueWorker._run (cognitive 29): KindleSendQueueWorker._run has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 3 (8 pts), error handling 2 (4 pts), loops 2 (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":"apps/api-python/app/services/kindle_queue.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7038bdd9c5322eca3e2c34d552c0e3fad80c3047d7509a1deb943d38fe981c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiClient.loadAuthenticatedJson (cognitive 29): ApiClient.loadAuthenticatedJson has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 4, boolean chains 3, match/switch 1 (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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5e027805350c011438828d74221114db327d7309204381b53f2045b745e84e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanLibrarySourceTree._process_regular_file (cognitive 28): ScanLibrarySourceTree._process_regular_file has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99bb3bc5ec885716d971c68ddc11780f58c24a9fc09590cba5acb6002380146"}},{"ruleId":"D2","level":"warning","message":{"text":"PrepareFileMovePlan.execute (cognitive 28): PrepareFileMovePlan.execute has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 4 (5 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":"apps/api-python/app/modules/library/application/file_move_plans.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4f3592d6f26b2344475697a4b188adc38b4c37f036911709a55351b6c1e586"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.run_douban_crawler_provider (cognitive 28): organize_service.run_douban_crawler_provider has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 11, ternaries 7 (9 pts), if/else 7 (8 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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"0459b93854c77730dbc84751b2461022b87c8204b7e4c15654b1d405e449806a"}},{"ruleId":"D2","level":"warning","message":{"text":"installed.wheel_install_paths (cognitive 28): installed.wheel_install_paths has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 3 (8 pts), boolean chains 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":"apps/api-python/shuku_dependencies/installed.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cce220a55b034b5f1cda71cbab6781294bc66df2f8a7845ed3b9010c5b3595"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeSettingsUiKt.failureText (cognitive 28): AdministrativeSettingsUiKt.failureText has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75b508b1cfa0f792ce4ff1eec358fcc642045fe5545b3d2778ed3c307c94b23"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedDownloadStore.verifiedPageSetBytes (cognitive 28): ManagedDownloadStore.verifiedPageSetBytes has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 21, if/else 3 (5 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee06fb1d156ae3bddc41996775d073e45ddf47cf77802974b36404217ff5fa2b"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadCenterStore.executeApplicableManagementAction (cognitive 28): DownloadCenterStore.executeApplicableManagementAction has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 5 (11 pts), error handling 3, match/switch 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f27d75af64ff2cb88c0d9278d560674ce4bec349affc18ba8b1c14442a9f88"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadCenterStore.removeManagementDownload (cognitive 28): DownloadCenterStore.removeManagementDownload has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (11 pts), error handling 1 (2 pts), ternaries 1 (2 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0427b678ae1dff16272b5a0c5596e7337ba91c5d956fd4df5748918b59f9cc4c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailView.resourceDetailSection (cognitive 28): WorkDetailView.resourceDetailSection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, ternaries 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb34a2c5e86bacb2bd00a3d94472ffe1d215512e7cacf8d077951e8c3044657"}},{"ruleId":"D2","level":"warning","message":{"text":"library-batch-actions.LibraryBatchDialog::submit (cognitive 28): library-batch-actions.LibraryBatchDialog::submit has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 4 (6 pts), error handling 1 (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. This shape REPEATS in the file: one other method here (library-batch-actions.LibraryBatchDialog) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d66067b26344b20882c5b51fd1fcc1c5bd78e2f4cdb280aab7416f2967fbfd"}},{"ruleId":"D2","level":"warning","message":{"text":"ComicArchive._open (cognitive 27): ComicArchive._open has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 6 (11 pts), ternaries 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf87ae3cbe883cea6432721d766b2400c9f749728f1b031847bfe1fdaf3af538"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationWrites.book_tags (cognitive 27): AutomationWrites.book_tags has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (5 pts), boolean chains 3, error handling 3, 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":"apps/api-python/app/modules/automation/application/writes.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"852d4772721024230e901e8b82a9cffbe192f8c87c4df268ad186cb34fcfa2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"inspection.inspect_backup (cognitive 27): inspection.inspect_backup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, ternaries 4, error handling 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/backup/infrastructure/inspection.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b10b98bec12223ee28898bf5078db23827cadc0723771ec5eb51a9bba43ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessReadableResourceImportTask.finalize_resource (cognitive 27): ProcessReadableResourceImportTask.finalize_resource has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, ternaries 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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"90abbdd4d3b41b5cb65cfd03f3861f07df7b87f4224f44167e46519de83b0e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyMetadataPatches.snapshot (cognitive 27): SqlAlchemyMetadataPatches.snapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 6 (8 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":"apps/api-python/app/modules/library/infrastructure/metadata_patches.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2669d7b462bc39a46285d1890b6cf3eaaa2d398a660ee9359eec7ef1b53b0566"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemySourceNodeMetadata.update_metadata (cognitive 27): SqlAlchemySourceNodeMetadata.update_metadata has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 4 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/source_node_commands.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"596100c4522b9dc15ce4358c4d0ff0551c7abe0125cf0897c7f45ff915da13f6"}},{"ruleId":"D2","level":"warning","message":{"text":"opf.parse_opf_metadata (cognitive 27): opf.parse_opf_metadata has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9, ternaries 3, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/application/opf.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecd52c54f532f8ea2e68087fb1c464ebd62f35bbc86d0e2b1da12d4f88a9226"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceLocatorIndex.validate (cognitive 27): ResourceLocatorIndex.validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 6 (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":"apps/api-python/app/modules/reader/infrastructure/resource_locator_index.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7ebc40233319bae5fe4c18c7057eaa305b8b98535274c5f48d9ef2e615df17"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeSettingsViewModel.execute (cognitive 27): AdministrativeSettingsViewModel.execute has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 2 (4 pts), error handling 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f90b9a1e0ad790f417b0200fcb41d1966834ccddd5d683738e176ca8433f52d"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidAudioPlaybackRuntime.launchRemote (cognitive 27): AndroidAudioPlaybackRuntime.launchRemote has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 5 (8 pts), boolean chains 5, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38e0fe0dd428877abf00700afd7e38b2dac47f4240b2a605c4ed46e8c4fa412"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailScreenKt.WorkDetailActionRow (cognitive 27): WorkDetailScreenKt.WorkDetailActionRow has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, if/else 10, match/switch 4 (5 pts) (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef26fc5c7864a5cf31d98a58120a8f0cc654332f30b55cb91bd9c2c40e95d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadiumComicSession.prepare (cognitive 27): ReadiumComicSession.prepare has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, error handling 5, match/switch 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6908031b0666032f6b30e77bf8426f4c5471ac14a3e8bde0a478c62d6efe3e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderActivity.onCreate (cognitive 27): ReaderActivity.onCreate has cognitive complexity 27 (threshold 15). Drivers by points: error handling 6 (12 pts), if/else 11, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f36c4907ee2afe074f0dc376a20bea8d2432a6edb3238eac159d0625afe66a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderCatalogSetting (cognitive 27): ReaderScreenKt.ReaderCatalogSetting has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bcf70cb888808f7d6e65c3c71552f11dd88f1d06e1f293c7696bde8679ad43"}},{"ruleId":"D2","level":"warning","message":{"text":"CentralDirectoryReader.zip64Values (cognitive 27): CentralDirectoryReader.zip64Values has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 5 (11 pts), boolean chains 3, loops 1 (nesting depth added 14). Of this number, 21 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11d94150a81f5c9168386811bc13976ec9d19dd604aeca9c37afd3db94b4337"}},{"ruleId":"D2","level":"warning","message":{"text":"persistence.validate_restore_relationships (cognitive 26): persistence.validate_restore_relationships has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0ce6fb6f8305b6afb0237542cc1360650d20258a3359d66ac52a0af46565e1"}},{"ruleId":"D2","level":"warning","message":{"text":"reflowable_metadata._inspect_fb2 (cognitive 26): reflowable_metadata._inspect_fb2 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 9, error handling 2, 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":"apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aef2c718cbdc1099b38eb6c93c6e271ca2fdc8d59956249e4bca425bf4370e0"}},{"ruleId":"D2","level":"warning","message":{"text":"writes.import_book_files (cognitive 26): writes.import_book_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, error handling 3 (5 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":"apps/api-python/app/modules/imports/presentation/writes.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e24c4bf7adaeee66db6a788c30ef772b09d1279498730e9d2e6c403ee90028"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardMetadataPublication.inspect (cognitive 26): StandardMetadataPublication.inspect has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/standard_publication.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af180b81c67bbd7011c14d8d95679aa143cc839df637e1dd2ca301bdf353d4a"}},{"ruleId":"D2","level":"warning","message":{"text":"xml_policy._internal_subset (cognitive 26): xml_policy._internal_subset has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 2, 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":"apps/api-python/app/modules/publications/infrastructure/xml_policy.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3349033f5adf84c5b4842436c1bd02cede346ed706773e1105419d24a6d8b7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_metadata._read_with_mutagen (cognitive 26): audio_metadata._read_with_mutagen has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, error handling 2 (3 pts), loops 2 (3 pts), ternaries 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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec4da56c64e10711a99afa5a3816b2c385def1b658c5b791944d4cc23e84ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-reader-safety-conformance.validate_report (cognitive 26): verify-reader-safety-conformance.validate_report has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/reader-contracts/verify-reader-safety-conformance.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc8da35a79bee82fc3857fa95277612c488870e4c97f722d6e35accea79d991"}},{"ruleId":"D2","level":"warning","message":{"text":"BookContentNavigationKt.BookContentNavigation (cognitive 26): BookContentNavigationKt.BookContentNavigation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (15 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, 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/BookContentNavigation.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbd950cc650943c1a03ae4fece2824e1f107cd25fb5c9794f97b80cd7f7f0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-safety-policy.rewriteReferences::appendEscaped (cognitive 26): reader-safety-policy.rewriteReferences::appendEscaped has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (20 pts), if/else 3 (5 pts), loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (reader-safety-policy.rewriteReferences, reader-safety-policy.rewriteReferences::expandEntity) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebe246588463a715af63f792fe18403f7f798da1515e287bc05f22ecbc770f1"}},{"ruleId":"D2","level":"warning","message":{"text":"kindle-send-modal.KindleSendModal (cognitive 26): kindle-send-modal.KindleSendModal has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 8, boolean chains 7, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (enqueue, a function literal at line 47, a function literal at line 110, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/kindle-send-modal.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d26153c5f901c70253c14cda650f3f02926ddfc62bb3f61d93bc72664b3672e"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexedDbPublicationStorage.read (cognitive 26): IndexedDbPublicationStorage.read has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 12). None of this is in the body itself: all 26 points belong to one function literal inside it that branches (line 169). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d672d9ae34152154cbf34a654ad70478b6f6c80b18ec08aca1bed03d602f3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"strict-fb2-parser.parseStrictFb2.closeElement (cognitive 26): strict-fb2-parser.parseStrictFb2.closeElement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e5720539c3171ae552a1644648e6ac24e5bc8e92d3619efec87cdfd62f8528"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-api.typeExpression (cognitive 26): generate-reader-api.typeExpression has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: 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":"apps/web/scripts/generate-reader-api.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5119a3dca1307b896de45a6fb9c38f5c305a84c76bb5075c1a5b41e3e3750d36"}},{"ruleId":"D2","level":"warning","message":{"text":"http.update_download_task (cognitive 25): http.update_download_task has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, ternaries 9, if/else 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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7af3fcf2e5b8e54ed20a93b365285bb25602392c1fcc37c652a2132762e7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata_patch.validate_value (cognitive 25): metadata_patch.validate_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, 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":"apps/api-python/app/modules/library/domain/metadata_patch.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"529b8fe34dad8e70be8d76fce7925981ce41ecc2d4e774fc15d3ebe6def2b628"}},{"ruleId":"D2","level":"warning","message":{"text":"http_streaming._send_zip_entry (cognitive 25): http_streaming._send_zip_entry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, error handling 2, ternaries 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":"apps/api-python/app/modules/media/infrastructure/http_streaming.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46c70f6f17a81539b6cc1e0b707050b619183713bd4aa3724806d5629801e03"}},{"ruleId":"D2","level":"warning","message":{"text":"http.create_shelf (cognitive 25): http.create_shelf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, error handling 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f317ea7f1a6d9045a13efa1310ff1e77183d73d630ea041d3289339b6953551"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderNumberSetting (cognitive 25): ReaderScreenKt.ReaderNumberSetting has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e341d52e42e5beb4bd04d2e86ddc107e860e53f6d17eb78122681ddd173e183"}},{"ruleId":"D2","level":"warning","message":{"text":"IosAudioResourceLoader.serve (cognitive 25): IosAudioResourceLoader.serve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 2, error handling 2, 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioResourceLoader.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abe15a7fecd9dc0bb43f7d37c9566328030813077b09d5b20e363f41cc7b58c"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadCenterStore.executeManagement (cognitive 25): DownloadCenterStore.executeManagement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (10 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5958d4be3514defb8662410556d6f98ed966cd44982d3a1e755e5d12606dc23f"}},{"ruleId":"D2","level":"warning","message":{"text":"IosPdfiumNavigatorViewController.startRender (cognitive 25): IosPdfiumNavigatorViewController.startRender has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 10, error handling 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumNavigator.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f9c4855a290f7b70d6158d467bce6a6580b022bc2c2da75b1a2a87e143bbbb"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeBookManagementStore.run (cognitive 25): NativeBookManagementStore.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 3 (6 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac7320e8849dcb0977bbc22ea966ada3ba229fc9c9788407c46bfb9aad3cd3c"}},{"ruleId":"D2","level":"warning","message":{"text":"upload-book-dialog.UploadBookDialog (cognitive 25): upload-book-dialog.UploadBookDialog has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (15 pts), if/else 7, boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (saveFiles, a function literal at line 37, a function literal at line 35, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/upload-book-dialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5dc80d3468222db87f39bf872422724bb378f0ac1ef994ed001eb3b489c12b"}},{"ruleId":"D2","level":"warning","message":{"text":"use-update-operations.useUpdateOperations (cognitive 25): use-update-operations.useUpdateOperations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 8, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 38, 33, 24, \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":"apps/web/features/updates/application/use-update-operations.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44492217fa350be8d34f4c4e3b788eb72bafc944866c5d63b5868ad1fa46585"}},{"ruleId":"D2","level":"warning","message":{"text":"opds-settings-page.OpdsSettingsPage (cognitive 25): opds-settings-page.OpdsSettingsPage has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 5, boolean chains 4, error handling 3 (nesting depth added 4). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (toggleEnabled, savePublicBaseUrl, a function literal at line 28, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/opds-settings-page.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18bc2bc5f1bdfc2750be7e69e953a9c1d64cf083b4ca0018d0f3f814fb224e2"}},{"ruleId":"D2","level":"warning","message":{"text":"session.readerSessionReducer (cognitive 25): session.readerSessionReducer has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 3 (5 pts), match/switch 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":"packages/reader-core/src/session.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e84e87a3455f005f1dc33548134a5681810606287f547db60e511982bb4011a"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBackupRestoreWriter.apply (cognitive 24): SqlAlchemyBackupRestoreWriter.apply has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (7 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":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"567106ef2f1d99ddcea2bd576b10bad2d42869ef82f944d62fa7d78283c15d00"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata_patch.prepare_metadata_patch (cognitive 24): metadata_patch.prepare_metadata_patch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/domain/metadata_patch.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa90ef191ea5d2d9e897a818b7dfc06845a9939c8dc66dee2ffd798aa34ea346"}},{"ruleId":"D2","level":"warning","message":{"text":"book_list._project_books (cognitive 24): book_list._project_books has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 4 (5 pts), boolean chains 2, 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":"apps/api-python/app/modules/library/infrastructure/book_list.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"db13f74d7c7d3290c50be67472e29442b95734eeca29b63164ebce2f60ad76f4"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBulkBookOperations._find_replacements (cognitive 24): SqlAlchemyBulkBookOperations._find_replacements has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2e2d8a95f6569841189197b17771e20ca670aee5edd3d8a3bd943599d0dc3c"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyFileMoveIndex.apply (cognitive 24): SqlAlchemyFileMoveIndex.apply has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 2 (5 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/file_move_index.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3824b23b0d8cff73a62cab0eb24d817ce757754af81284f4db291ed8c0fff420"}},{"ruleId":"D2","level":"warning","message":{"text":"kindle_queue._send_task (cognitive 24): kindle_queue._send_task has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, if/else 8, error handling 2 (3 pts), ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/kindle_queue.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecd62ecf52bd6b76810c7e551a8be261ddda0a9e0aa2ebf9a0cd2d6a78a0d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioPlayerUiKt.AudioNowPlayingScreen (cognitive 24): AudioPlayerUiKt.AudioNowPlayingScreen has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0428b51d1239f2753618501eb70645a8b2c32cffe9b8162fe4a0294f44ba9e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailViewModel.load (cognitive 24): WorkDetailViewModel.load has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, error handling 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7820455dbf62b561ab41eeef8d3e81d4447cd1960e84f7e2a1fb7e5d14e4513"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagementTagEditorKt.ManagementTagEditor (cognitive 24): ManagementTagEditorKt.ManagementTagEditor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, match/switch 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, 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/ManagementTagEditor.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3c22df513fea6c20a572655a9c3be125e6b27d897a87dad3b513cb00e0c161"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderPositionSyncCoordinator.drain (cognitive 24): ReaderPositionSyncCoordinator.drain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 2 (4 pts), match/switch 1 (2 pts), boolean chains 1, 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderPositionSyncCoordinator.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b50748855e6d6a86463fdf3759326f81ae4ae826157a0bb258d8f6c985ac5e6"}},{"ruleId":"D2","level":"warning","message":{"text":"multi-value-combobox.MultiValueCombobox::onInputKeyDown (cognitive 24): multi-value-combobox.MultiValueCombobox::onInputKeyDown has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (multi-value-combobox.MultiValueCombobox) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"546873ff4198858dcdaac07c3a364c314f7f532e92b2d23dfb34cee91ea60c80"}},{"ruleId":"D2","level":"warning","message":{"text":"book-metadata-editor.BookMetadataEditor (cognitive 24): book-metadata-editor.BookMetadataEditor has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 8, boolean chains 4, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 5 function items inside it that branch (save, a function literal at line 117, a function literal at line 149, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-metadata-editor.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bd8e51c30a2d0a95ebe77b586deb691aa213364eb8254c86b9e5ec8d665beb"}},{"ruleId":"D2","level":"warning","message":{"text":"pwa-client.PwaDebugPanel (cognitive 24): pwa-client.PwaDebugPanel has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (18 pts), if/else 5, boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 620, 481, 495, \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":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce64302ca7dea879dd109a3760fda67bca4db4bcec184b7309e8b960358d72f"}},{"ruleId":"D2","level":"warning","message":{"text":"ComicContinuousController.renderSlot (cognitive 24): ComicContinuousController.renderSlot has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 6 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":"apps/web/features/reader/v3/adapters/comic-continuous.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6650073a4772a23d0ca7a045214e91c70be8044ac06997fcccfbd9cd09f79371"}},{"ruleId":"D2","level":"warning","message":{"text":"book-card.BookCard (cognitive 24): book-card.BookCard has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 15 (19 pts), boolean chains 4, if/else 1 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-card.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f314241666e9e16002793019980464799697519861893a1c4963b5ab8ec9ee"}},{"ruleId":"D2","level":"warning","message":{"text":"users._validate_preference (cognitive 23): users._validate_preference has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), error handling 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":"apps/api-python/app/modules/auth/presentation/users.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"024f7841e1d545ce158719c343123bc2bf20a60d88e7c2cb76065538cd9de429"}},{"ruleId":"D2","level":"warning","message":{"text":"persistence.prepare_table_records (cognitive 23): persistence.prepare_table_records has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (4 pts), error handling 1 (3 pts), boolean chains 1, 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":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff16df882a4883bf6a32bba41f1d51b799bd4f27bae4c224cb4c2cf97d9e96b"}},{"ruleId":"D2","level":"warning","message":{"text":"http.update_library (cognitive 23): http.update_library has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9, error handling 2 (4 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/presentation/http.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef5a376446e5df000402e55906a98d31e607dcfbd0bfc3240a23755266f73d2"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBulkBookOperations.apply_find_replace (cognitive 23): SqlAlchemyBulkBookOperations.apply_find_replace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 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":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3c476a13280e62a55dac8a5a5de08752747da6a65165c2003dfcaaf891e90e"}},{"ruleId":"D2","level":"warning","message":{"text":"install_plan.validate_prepared (cognitive 23): install_plan.validate_prepared has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, 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":"apps/api-python/app/modules/updates/infrastructure/install_plan.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6891feb74196429464c23a69db7a9315c655763702966f2352fc588044fa9aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata_file_writeback.process_next_metadata_writeback (cognitive 23): metadata_file_writeback.process_next_metadata_writeback has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, ternaries 1 (2 pts), 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":"apps/api-python/app/services/metadata_file_writeback.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"817bb466949c7e8e69a53989863ed79c3a0d0ec3fe40706684fdfc2cf27429a0"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioPlayerUiKt.AudioChapterSheet (cognitive 23): AudioPlayerUiKt.AudioChapterSheet has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (23 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"65875abb2f571c14d376fea98910e8e248be236f960a9cb0b7a9a26cb78d6dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadResourceRuntime.ensure (cognitive 23): DownloadResourceRuntime.ensure has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3, loops 2, match/switch 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f0958d82db469743cd5aded07d61206bd189bc29169be71ad9b70a8cbb50b9"}},{"ruleId":"D2","level":"warning","message":{"text":"FacetStore.refreshAfterManagement (cognitive 23): FacetStore.refreshAfterManagement has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), ternaries 1 (3 pts), error handling 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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"758430e0cb826edf86037a7048fa6093809d68911aa2f895bb7748ecb9f13832"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDescriptionPlainText.textOutsideMarkup (cognitive 23): WorkDescriptionPlainText.textOutsideMarkup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"320d9583c0fb297e3f0c47500381e0045b407c18373f8e7f68703cbfce64d955"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReadiumRuntime.swift.protectEpubAsset (cognitive 23): IosReadiumRuntime.swift.protectEpubAsset has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 5 (7 pts), loops 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f56c91e5aca2b2ca610692c01fe93fb4c7badd59614298764365b592f8d7a1"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata-lookup-modal.MetadataLookupModal (cognitive 23): metadata-lookup-modal.MetadataLookupModal has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 36 (47 pts), if/else 36 (40 pts), boolean chains 18, error handling 3 (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (metadata-lookup-modal.MetadataLookupModal::applySelected) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42829430689449041a012da134388caa97fdbee700c286b2fdf833e8e99e320"}},{"ruleId":"D2","level":"warning","message":{"text":"readium-navigation.readiumTotalProgression (cognitive 23): readium-navigation.readiumTotalProgression has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-navigation.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c855ab45b460be8cc26364831d29255758a297378225ca1564e500cb0156786f"}},{"ruleId":"D2","level":"warning","message":{"text":"use-reader-session.useReaderSession (cognitive 23): use-reader-session.useReaderSession has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5, error handling 1, ternaries 1 (nesting depth added 2). None of this is in the body itself: all 23 points belong to 6 function literals inside it that branch (lines 226, 286, 217, \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":"apps/web/features/reader/v3/use-reader-session.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e206a3e56ea468461997963aadd2d8dfc03d91c01eff417b2e0005e682300f5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_embedded_metadata._values (cognitive 22): pdf_embedded_metadata._values has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 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":"apps/api-python/app/infrastructure/pdf_embedded_metadata.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7027ce6d8d2e6cf85be0aabee73c2c770b9fa06a3af6140d63ca1eeee6dafa"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationUploads.begin_upload (cognitive 22): AutomationUploads.begin_upload has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, error handling 3 (5 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":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1eff757ba019dc781241894fddac0861a3499713b290a855ba236ad83eef9b"}},{"ruleId":"D2","level":"warning","message":{"text":"writeback_plans._destination (cognitive 22): writeback_plans._destination has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 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":"apps/api-python/app/modules/automation/application/writeback_plans.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"60954d8328c61bc7bc8e5e51ce476f04d78dba5052b001e0808a51d90edf9f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateSourceNodePresentation.execute (cognitive 22): UpdateSourceNodePresentation.execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 3, 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":"apps/api-python/app/modules/library/application/source_node_commands.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9713343bf3d10981217c9b97e788cd522302a26432611844b9dda95d87c994"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_writeback.write_pdf_metadata (cognitive 22): pdf_writeback.write_pdf_metadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 1 (3 pts), 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":"apps/api-python/app/modules/metadata/infrastructure/pdf_writeback.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"beebaab568c8c58afd49e7c5ece3665f6ef6b15e48ecdd8da7634d8fb4bc9183"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.prepare_organize_policy_update (cognitive 22): commands.prepare_organize_policy_update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, error handling 3 (5 pts), ternaries 2 (3 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, 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":"apps/api-python/app/modules/organize/application/commands.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d890b1ba8f2da6ada321d43c1e50149b6be9dc358ae295e8dbd1f1a381a182d"}},{"ruleId":"D2","level":"warning","message":{"text":"events.list_system_events_page (cognitive 22): events.list_system_events_page has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, 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":"apps/api-python/app/modules/system/infrastructure/events.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e834a1fda53ac38ed1f712ecaeed0e96f622c5ca31a67e08358040ef8bb0fd14"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadManagementPolicy.project (cognitive 22): DownloadManagementPolicy.project has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (4 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/domain/DownloadManagement.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a7bb967bc7d3996c49a436f47bcba0920b08d83956c6a2d67c08fa76590339"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerBaseUrl.normalizeAuthority (cognitive 22): ServerBaseUrl.normalizeAuthority has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/servers/domain/ServerBaseUrl.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"469767efcfe3063288148c12a0e9439b8aa5bb265d6f574dc9134c63cbdb3376"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadCenterStore.awaitVerifiedReaderDownloadOperation (cognitive 22): DownloadCenterStore.awaitVerifiedReaderDownloadOperation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1a77895098e5df3b45eb2195e3647dde931123009274baf8aee5592952d593"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiDownloadSheet.perform (cognitive 22): MultiDownloadSheet.perform has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"658600697dc4dc0f74094df2ec81d35c819eec6eed9c788e68cfdd080fd50b14"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-safety-policy.sanitizeAuthoredCss (cognitive 22): reader-safety-policy.sanitizeAuthoredCss has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (8 pts), loops 3, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fc9072386a2eabab650a61ee75a1e2aeaf419b9ec7ee699850ac8d4e5df0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"automation-settings-page.GrantForm (cognitive 22): automation-settings-page.GrantForm has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 13 (16 pts), boolean chains 3, if/else 3 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9965b8c01d78726ba6274bce572955187946ab5b6de8c486318f5081267b51d"}},{"ruleId":"D2","level":"warning","message":{"text":"identity_policy.parse_bracketed_series_identity (cognitive 21): identity_policy.parse_bracketed_series_identity has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/identity_policy.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fcdb58c084675f00830aef3c25e8a4187c9bf10e42ebec1df18143b3d94257"}},{"ruleId":"D2","level":"warning","message":{"text":"OsSourceTreeFilesystem.metadata_input_observations (cognitive 21): OsSourceTreeFilesystem.metadata_input_observations has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 3 (6 pts), error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/infrastructure/readable_resource/filesystem.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"641c32e42f4b73852fc7e1fe7ea397134a0bc7555de6e0afbf6b2b8dcbf715dc"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyMoveTopology.destination (cognitive 21): SqlAlchemyMoveTopology.destination has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (5 pts), boolean chains 2, 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":"apps/api-python/app/modules/library/infrastructure/move_topology.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd6ff22109e93dde39dfe30e5610dad7d2fa081ba1e547dfd517a20cb94f815"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBookResourceRepository.apply_local_metadata (cognitive 21): SqlAlchemyBookResourceRepository.apply_local_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, 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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb0c1d23d8e072f9140c0999a657535ee0def318c8b86dee8914d391834ff4d"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyRecognizedMetadata.apply_changes (cognitive 21): SqlAlchemyRecognizedMetadata.apply_changes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/recognized_metadata.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"68917c587afeaab83f93ff1c120ee64c03ef8d0172efef93d8941a2d0698da7d"}},{"ruleId":"D2","level":"warning","message":{"text":"archive_writeback.preview_archive_metadata (cognitive 21): archive_writeback.preview_archive_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, loops 1 (2 pts), 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":"apps/api-python/app/modules/metadata/infrastructure/archive_writeback.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8f150a22645531c32143a19e0d5dcbb3bb946f6543f98e3a29d414dc08e025"}},{"ruleId":"D2","level":"warning","message":{"text":"archive_writeback.write_archive_metadata (cognitive 21): archive_writeback.write_archive_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (6 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":"apps/api-python/app/modules/metadata/infrastructure/archive_writeback.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f75bdff4d927e87ba39b9654b6ddb9f7960571c3a426a11f3670dcfaee5bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"locator_dom._css_has_active_reference (cognitive 21): locator_dom._css_has_active_reference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/locator_dom.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"035fcada3af233072988184eb2388c1ce5e8c7c66fa6371d9639a35304aa6ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"mobi_adapter._snapshot (cognitive 21): mobi_adapter._snapshot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 4 (7 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/mobi_adapter.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"be05bcb5284331a5a045fbf47d57ef05c259988458f22e633f68f2a08bbd1e65"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicationSnapshotCache.lease (cognitive 21): PublicationSnapshotCache.lease has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/snapshot_cache.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1989194da6ee8847c2f39f433d84d71c39eb4fff0f4b3c3dbd73077d359cef"}},{"ruleId":"D2","level":"warning","message":{"text":"dependency_preparation.check_wheel_platform (cognitive 21): dependency_preparation.check_wheel_platform has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, 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":"apps/api-python/app/modules/updates/infrastructure/dependency_preparation.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"423ab384611f8e1af6e0e7343183a616d3e07efe0ced18b9cb3c96e5dec680b1"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadResourceRowKt.DownloadResourceRow (cognitive 21): DownloadResourceRowKt.DownloadResourceRow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, boolean chains 8, match/switch 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/DownloadResourceRow.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7e8352441f398ebdd80f97c48dfe04cc937fbf3f4a9f0ba0ae5365ddca7676"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryViewModel.loadScope (cognitive 21): LibraryViewModel.loadScope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3, error handling 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf0927e45ffed9b907461473193b58c7f62d1f1ed62fce0412887488257c92a"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidAvatarSanitizer.sanitize (cognitive 21): AndroidAvatarSanitizer.sanitize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 3 (4 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/me/platform/AndroidMePlatform.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"99781e6def5a14df88f903024cb3328cf973eca27570a4918c3d6399c7e7fcba"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderSlider (cognitive 21): ReaderScreenKt.ReaderSlider has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19 (21 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f8cb50aaa830566d9f39346ae4b1ef09e452d367dec28c4597a02e6f071f8"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadBookContentKt.loadBookContent (cognitive 21): LoadBookContentKt.loadBookContent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (5 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/application/LoadBookContent.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9015dd54667bc304944f7c2960695e197834c54ecfabc82f1b7acf264487af44"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlControlPreprocessor.declarationEnd (cognitive 21): XmlControlPreprocessor.declarationEnd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (3 pts), boolean chains 1, 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSafetyFacade.kt"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9d471aec786d8d7d8dfc3a6c264ff3b590bf9da13fa43d0bbd7998d551b1ad"}},{"ruleId":"D2","level":"warning","message":{"text":"KtorWorkManagementRepository.loadManagementSnapshot (cognitive 21): KtorWorkManagementRepository.loadManagementSnapshot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/infrastructure/KtorWorkManagementRepository.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5621f5d52ccf9c7206e079c82b7bb6c0ec9e93d1cfbc4556929235cdf5ec062b"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedDownloadRecord.verifiedSharedArtifact (cognitive 21): ManagedDownloadRecord.verifiedSharedArtifact has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 18, if/else 2, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadModels.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"31490c07818a97e6fa7f2b3604e7ea415f0a45a3e04f67c2a6cdb1ca1194bbe8"}},{"ruleId":"D2","level":"warning","message":{"text":"IosFb2PublicationFactory.read (cognitive 21): IosFb2PublicationFactory.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosFb2PublicationFactory.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a927a949734a6305d8539889372cfa20cbeba8bc9e994531f14bd44bc663707e"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReadiumRuntime.open (cognitive 21): IosReadiumRuntime.open has cognitive complexity 21 (threshold 15). Drivers by points: error handling 8 (16 pts), ternaries 1 (3 pts), if/else 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52a2140fb4d1fc6db3c8c5162d45db72d4a5947b59e927144f5485b249453b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ShelfCatalogStore.refresh (cognitive 21): ShelfCatalogStore.refresh has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogStore.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3cdd2d35b591fa27f200c9399322dfd6c37407029f7d8968958b45e1eb6a44"}},{"ruleId":"D2","level":"warning","message":{"text":"book-detail-page.BookDetailPage::invokeSourceNodeAction (cognitive 21): book-detail-page.BookDetailPage::invokeSourceNodeAction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, ternaries 1 (2 pts), 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. This shape REPEATS in the file: 2 other methods here (book-detail-page.BookDetailPage, book-detail-page.BookDetailPage::invokeResourceAction) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"271af604db6b89359e35fd27541b511f58c7693de485ebf4863687f245f7f7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserPublicationStore.download (cognitive 21): BrowserPublicationStore.download has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/browser-publication-store.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7001f482d885d9a88416a58f10b75dc8b87f1258037604dd08036f40794c8793"}},{"ruleId":"D2","level":"warning","message":{"text":"readium-publication.resolveArchivePath (cognitive 21): readium-publication.resolveArchivePath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, error handling 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b9cb448923116f14e04a44a5bb5a171f296fc700f1569b4ffde463324474b9"}},{"ruleId":"D2","level":"warning","message":{"text":"bounded-response.readBoundedResponse (cognitive 21): bounded-response.readBoundedResponse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, loops 2, error handling 1, ternaries 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":"apps/web/shared/api/bounded-response.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fb652a17b220f209d6f7cb6bd72b4542dabb8be55f061552c85daf204b8b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-v3-page.OpeningCover (cognitive 21): reader-v3-page.OpeningCover has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 11 (16 pts), if/else 3, boolean chains 2 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 5 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":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2b7ab93b16548a017e19efc722aa961ff8c9c8f2a6e2dba64612228d02cc50"}},{"ruleId":"D2","level":"warning","message":{"text":"server-exceptions.writeServerLog (cognitive 21): server-exceptions.writeServerLog has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, error handling 2 (4 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":"apps/web/lib/server-exceptions.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed27278468e4c06aa895bfef287a13b7e2fd2868b8ccbdbce2ca351e8269989f"}},{"ruleId":"D2","level":"warning","message":{"text":"presentation.submit_feedback (cognitive 20): presentation.submit_feedback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/feedback/presentation.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b9ebfa6af05e2d4fb1ad14dedda239c72a7b82862004cad18cb766a6c03af9"}},{"ruleId":"D2","level":"warning","message":{"text":"BookWork.__post_init__ (cognitive 20): BookWork.__post_init__ has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 9. 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":"apps/api-python/app/modules/imports/application/readable_resource/book_work.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1d79f6398fd9ed9aacc519860a5599fe989634a184a5c0891f37b7afbf14ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanLibrarySourceTree._confirmed_missing_parent (cognitive 20): ScanLibrarySourceTree._confirmed_missing_parent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (4 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8aa3395e27c337253d4a1c6164a9b9699b28555e2a627ce68de7b688ac1085"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportAttachmentUploads.target (cognitive 20): ImportAttachmentUploads.target has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, 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":"apps/api-python/app/modules/imports/infrastructure/automation_uploads.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc0582abe2b79677b8fe038042a3d58f774cad7e2c8c01aa49c31360f9d06b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyLibraryImportTaskQueue.continue_book_task (cognitive 20): SqlAlchemyLibraryImportTaskQueue.continue_book_task has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"0386f971345215e0873191a996bb31b7835a2781d046f1d823d44848d7a75c23"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecuteStandardWrite.execute (cognitive 20): ExecuteStandardWrite.execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/application/execute_standard_writeback.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3897485dbb9c408fc150ce5e5f979f81e8978b438c044d6ff8226af25ef30dda"}},{"ruleId":"D2","level":"warning","message":{"text":"id3_writeback.write_selected_id3 (cognitive 20): id3_writeback.write_selected_id3 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (5 pts), error handling 1 (4 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":"apps/api-python/app/modules/metadata/infrastructure/id3_writeback.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf738cf7c8d978fa0c431852e873124a86c607bedff9008f1525dc4715e8aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"smart_rules.normalize_smart_shelf_rules (cognitive 20): smart_rules.normalize_smart_shelf_rules has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/shelf/application/smart_rules.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bba36968a5180738af6dff80c08482f397d5cfb8c2c0d611b4cdb117d1cb17d"}},{"ruleId":"D2","level":"warning","message":{"text":"OfficialReleases.releases (cognitive 20): OfficialReleases.releases has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, ternaries 1 (2 pts), error handling 1, 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":"apps/api-python/app/modules/updates/infrastructure/official_source.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"21138c386506bddcf4977e97077f4a410e643a964b6648984e4a32999ef91e84"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata_provider_registry.prepare_metadata_provider_update (cognitive 20): metadata_provider_registry.prepare_metadata_provider_update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/metadata_provider_registry.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d74cf81037d0432ed91ef3935ac4530ecba5b5c2a2dd551accf343dac433d3"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-http-errors.render_contract (cognitive 20): generate-reader-http-errors.render_contract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/reader-contracts/generate-reader-http-errors.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91b65d7e9251a37aaa811a5de064ad975339519c4911ac56b931e78d79b50e9"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailViewModel.loadMultiDownloadResources (cognitive 20): WorkDetailViewModel.loadMultiDownloadResources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67eedc18257f65d023001414356d8de42139a264c1a2a50f4d0eec9294946a0"}},{"ruleId":"D2","level":"warning","message":{"text":"IosMobiPublicationPath.resourcePath (cognitive 20): IosMobiPublicationPath.resourcePath has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiLazyContainer.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c9a5409b082014f911359e08d2def60dbf6a057459b0d830455a5179812e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailView.contentBrowserSection (cognitive 20): WorkDetailView.contentBrowserSection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40583f6390548d7aab0191650911ea9904ca5be484f803e2d0312588fadff8b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.I18nProvider (cognitive 20): provider.I18nProvider has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 5). None of this is in the body itself: all 20 points belong to 4 function literals inside it that branch (lines 170, 145, 158, \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":"apps/web/i18n/provider.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"642ec3e3514af354ccf130cd0c9ca052af3aef7bc1e5adcbd346fdb85047b3d0"}},{"ruleId":"D2","level":"warning","message":{"text":"shelves-page.ShelvesPage::saveShelf (cognitive 20): shelves-page.ShelvesPage::saveShelf has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (16 pts), if/else 2, boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (shelves-page.ShelvesPage, shelves-page.ShelvesPage::openShelf) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9600a302330ef1dfebc3f8f924cac6bf7d16743d169b8d45ff9efe75ee9b7e24"}},{"ruleId":"D2","level":"warning","message":{"text":"strict-fb2-parser.parseStartTag (cognitive 20): strict-fb2-parser.parseStartTag has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f1490530d228f85d83e68dd4e6a92ba46d91070f86b2da324caade9233bf40"}},{"ruleId":"D2","level":"warning","message":{"text":"server-exceptions.formatServerException (cognitive 20): server-exceptions.formatServerException has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (5 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/server-exceptions.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7866d11206520ebff4766fef2a188442f1cd146f768c4566743a84c6c164f6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedContractRoute.__init__ (cognitive 19): TypedContractRoute.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), boolean chains 3, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/api/typed_route.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9661949604734ab2373ba8e3d5263236ee61d88c67692c091f2b41d8e6e47347"}},{"ruleId":"D2","level":"warning","message":{"text":"exception_diagnostics._exception_chain (cognitive 19): exception_diagnostics._exception_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3cecb05402b8913910835a400fac84fc03af42fb9a5e929a7fa986aa74f08b"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationOperations.progress (cognitive 19): AutomationOperations.progress has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (AutomationOperations.cancel) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/operations.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"137376ab6196389f810620ba9dc0c5f416a03386b35081f5c69336e4eeb01d50"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationOperations.cancel (cognitive 19): AutomationOperations.cancel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (AutomationOperations.progress) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/operations.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc241a848d45155794e0bcbdf06e0feff2ba1d0e206723f06ff4738ebe11c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"refresh.project_file_metadata (cognitive 19): refresh.project_file_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (5 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/refresh.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24250498ae9dd62dc5b687472c088e276ffca09849c72150f72ebb0341912f3"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationUploads.cleanup (cognitive 19): AutomationUploads.cleanup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2e6248986ce5dce146455323cce6e64d2aaaad2fb343813bc95bbd086b7156"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildStandardWritePlan.execute (cognitive 19): BuildStandardWritePlan.execute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (4 pts), loops 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":"apps/api-python/app/modules/automation/application/writeback_plans.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"96de30ec702f51d4494536970119fc3e601f9fb40912d4f302a4726b1a933095"}},{"ruleId":"D2","level":"warning","message":{"text":"writeback_plans._values (cognitive 19): writeback_plans._values has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/writeback_plans.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bfed6ff5bf74049c0b565f6a33c957dbba4662f47364fbac03f84bf8891632"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyCatalogQueries._resource (cognitive 19): SqlAlchemyCatalogQueries._resource has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (12 pts), boolean chains 5, if/else 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/catalog.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c99b6b32373527d57de670501aadf2067673a7f0ea732507a9b17f3d9782645"}},{"ruleId":"D2","level":"warning","message":{"text":"move_inventory.inspect_move_destination (cognitive 19): move_inventory.inspect_move_destination has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2, boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/move_inventory.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fdbe42d7601400f1a238256fec548cb1c1a5f3f71b0d6d42e9be7347c2d8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceReaderV5Service.save_progress (cognitive 19): ResourceReaderV5Service.save_progress has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/reader/application/resource_reader_v5.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a8945a5400491e90e6cd1e5102196f5d10f8580fc83197c17581bb0b943b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_metadata.parse_audio_metadata (cognitive 19): audio_metadata.parse_audio_metadata has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (4 pts), error handling 2 (3 pts), ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0f78c6e267b799aa3e29dc7eda349649d844ca9bdf1bb64e261d8054449e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_metadata._normalized_mutagen_tags (cognitive 19): audio_metadata._normalized_mutagen_tags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, error handling 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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d181af2cd9a5ac8aec0a8d9d27a3e65e36b58dd89a652795e86bb1a67f1d2d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.douban_candidates (cognitive 19): organize_service.douban_candidates has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 5, if/else 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f3b85971835e6c25103da2ef1c2ba7b1470a012ea6d076eec2e14dc38d50d"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiClient.loadAuthenticatedBinary (cognitive 19): ApiClient.loadAuthenticatedBinary has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 7, error handling 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58c45340edf03a7029f07758f95c9b53b68993a6ff6f9f65e82c8b4303f230e"}},{"ruleId":"D2","level":"warning","message":{"text":"BookManagementSession.applyRecognition (cognitive 19): BookManagementSession.applyRecognition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/BookManagementSession.kt"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30120cbcf46451f3138f7364cae2b174e7d61eacd4556316bb76a8edb89aed0"}},{"ruleId":"D2","level":"warning","message":{"text":"VisualTokenGenerator.renderCss (cognitive 19): VisualTokenGenerator.renderCss has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (10 pts), ternaries 2 (6 pts), if/else 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cab12497ca928910243bbbf1605bda4f4c0316d1a7648a3438054cdbeed205f"}},{"ruleId":"D2","level":"warning","message":{"text":"UserEditorView.body (cognitive 19): UserEditorView.body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ef4d361ace34d9479468e7741e64b68ab37fc805c7e436d60b69bf180ad0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"IosComicReaderSession.open (cognitive 19): IosComicReaderSession.open has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f316300cc1449bfbd9af6cf4c73d43b4ce8688e34d5aa9dfa571274ee1695f"}},{"ruleId":"D2","level":"warning","message":{"text":"IosManagedPublicationStore.resolve (cognitive 19): IosManagedPublicationStore.resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8 (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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5544557eb0e8192576c1f1d088a02be2112183aabe3bae74a17b2b8b8f38ab63"}},{"ruleId":"D2","level":"warning","message":{"text":"MainTabView.managedTabs (cognitive 19): MainTabView.managedTabs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 1 (4 pts), loops 1 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Shell/MainTabView.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b9abf1ceac7aa17a9455e4a5a6d467e6c6e076bdca51cb1a90323517016758"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailView.observedScreen (cognitive 19): WorkDetailView.observedScreen has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"79969af4328b9a3212b970c06b3aa13ec23489b8e1ba965d650aeeb5b7d2b4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"multi-value-combobox.MultiValueCombobox (cognitive 19): multi-value-combobox.MultiValueCombobox has cognitive complexity 19 (threshold 15). Drivers by points: if/else 30 (37 pts), ternaries 15 (25 pts), boolean chains 16 (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. This shape REPEATS in the file: one other method here (multi-value-combobox.MultiValueCombobox::onInputKeyDown) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"298e87699498de0c1a607cfe1c1c3ec87e6b52a9a63702546152e92f09f44bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"book-shelf-dialog.BookShelfDialog (cognitive 19): book-shelf-dialog.BookShelfDialog has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 4 (7 pts), boolean chains 2, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 5 function items inside it that branch (save, a function literal at line 33, a function literal at line 42, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-shelf-dialog.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a279bacae84bc17eb663536ebdd8250fe99d66d5b1039b619c06f3de76d1291"}},{"ruleId":"D2","level":"warning","message":{"text":"password-reset-pages.ResetPasswordPage (cognitive 19): password-reset-pages.ResetPasswordPage has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 5, boolean chains 2, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (submit, a function literal at line 91). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/password-reset-pages.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"393fc97958eddf7124bc1a61bde71b9dcf4057c5ad6352226e76c465549d67ed"}},{"ruleId":"D2","level":"warning","message":{"text":"reader-shell.ReaderPreferencesPanel::control (cognitive 19): reader-shell.ReaderPreferencesPanel::control has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 3 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71992096673bd4a3587c6784e3c55afaa2b0ceb1a4c214609bbdbece20a5803"}},{"ruleId":"D2","level":"warning","message":{"text":"directory-path-picker.DirectoryNodeRow (cognitive 19): directory-path-picker.DirectoryNodeRow has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (13 pts), boolean chains 6 (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":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e584e65e82186f6575b2abfc4ebeaac61d73c12c6faec19cbff9aa3b65263965"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-safety-conformance.evaluateMarkupCase (cognitive 19): generate-reader-safety-conformance.evaluateMarkupCase has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, 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":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"707bc42b76a719c099096d465246239081912f74192a4ce75cfeaa8e61d29ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"prototype.feedbackModal (cognitive 19): prototype.feedbackModal has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (19 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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0db13f81de47320f67e329ac3ddb9a43d524fb3271284088a7cd6d685b589c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportAttachmentUploads.progress (cognitive 18): ImportAttachmentUploads.progress has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 4 (5 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":"apps/api-python/app/modules/imports/infrastructure/automation_uploads.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e732475d516c186f44a98631c0166873f92d70be650fa9d9677d1537e1531786"}},{"ruleId":"D2","level":"warning","message":{"text":"books._book_record (cognitive 18): books._book_record has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 14, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/books.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a7ec7e7f57dee8502ee81bb2a94f5289e73b9eb75c3675ca76e191cbde9de7"}},{"ruleId":"D2","level":"warning","message":{"text":"local_metadata._parse_local_metadata (cognitive 18): local_metadata._parse_local_metadata has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 6, boolean chains 5 (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":"apps/api-python/app/modules/metadata/application/local_metadata.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"015f2af874db91a91290a38e948d7590560c70bfb04e65b84025e476ced01ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"local_metadata.resolve_local_metadata (cognitive 18): local_metadata.resolve_local_metadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/application/local_metadata.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3149744d0ec291905fe1de66528d5374abd9b30737efeffecb53d348524ccc38"}},{"ruleId":"D2","level":"warning","message":{"text":"identity_context.identity_clues (cognitive 18): identity_context.identity_clues has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (6 pts), if/else 3 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/identity_context.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ad6bb3835ee2ba04db022a9dca64b6349d229793ea624fe89a00e699672584"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_metadata._repair_misdecoded_text (cognitive 18): audio_metadata._repair_misdecoded_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, 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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"db314a166ca21c4775cd779a09860df3b6055a57f1e77583413149a6dd212cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.first_string (cognitive 18): organize_service.first_string has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b85949e9688b68cc4e8b39b5c0d6907378ce078df7c3e45095626345dfcd985"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.metadata_search_candidates (cognitive 18): organize_service.metadata_search_candidates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, 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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b538fd0ce55cb45f754a3f7caf88c58b8f24aaee8a5d5a9c4ce4299829c2dd"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeCoreScreensKt.EmailKindleSettingsScreen (cognitive 18): AdministrativeCoreScreensKt.EmailKindleSettingsScreen has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"369cfd90f451d8ff3e2a6b75059fd41f01e6d8995d2780d6b2e6eefa564f22bc"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidAudioPlaybackRuntime.launchLocal (cognitive 18): AndroidAudioPlaybackRuntime.launchLocal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a26c3cb90ebe63b69476db4490c62f5477dc30a2dca302d64b1fe8e1f20de0"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioPlayerUiKt.AudioQueueSheet (cognitive 18): AudioPlayerUiKt.AudioQueueSheet has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e56aa68410e20ee7f7121128d49851a6c5b1e4d164d52c497b0b2d6fda12801"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderPreferencePanel (cognitive 18): ReaderScreenKt.ReaderPreferencePanel has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2 (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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c393ad2483fbf625b6afa2668efb8c05f5dd13d7eb07e65389090a89214ca46"}},{"ruleId":"D2","level":"warning","message":{"text":"KtorDownloadsGateway.transferAsset (cognitive 18): KtorDownloadsGateway.transferAsset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/infrastructure/KtorDownloadsGateway.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"244c9f13249e65f4c224bd205c1ea77ec3cfff75c5c4f351e50751064649bbb0"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfRangeLoader.missingRanges (cognitive 18): PdfRangeLoader.missingRanges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/PdfRangeLoader.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"05692b23e62b2b474a44b518445b403c60b58984e1141262deb7eee3eed98660"}},{"ruleId":"D2","level":"warning","message":{"text":"BookCoverView.body (cognitive 18): BookCoverView.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, error handling 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a831ad274e4e3b6d78b2e58c7cd1b3cc7d8d68d3d0f785d8d8b2284b86cd7aab"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeCopyCatalog.userFailure (cognitive 18): AdministrativeCopyCatalog.userFailure has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsCopy.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce08d77cc0df71e6e2ec4abf09020a6565ee5a0e3cb27c8172650000883deaa"}},{"ruleId":"D2","level":"warning","message":{"text":"IosComicNavigatorViewController.applyNavigationResult (cognitive 18): IosComicNavigatorViewController.applyNavigationResult has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e8a52fcba56b4daa4be0b558d3a77bb037dccd2b7c3ef68cb64955c28153de"}},{"ruleId":"D2","level":"warning","message":{"text":"IosPublicationSecurityPolicy.decode (cognitive 18): IosPublicationSecurityPolicy.decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdfe2a88658c1d0fc03bfad796d75bfb047a370eaa4484cfdfbf865a22d608e"}},{"ruleId":"D2","level":"warning","message":{"text":"IosMobiPublicationFactory.build (cognitive 18): IosMobiPublicationFactory.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 5, loops 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiPublicationFactory.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6689e860c7fcad4d3e7c952685d257eb0c326cbef1d10bb16d9357f206678d96"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReadiumRuntime.openEPUB (cognitive 18): IosReadiumRuntime.openEPUB has cognitive complexity 18 (threshold 15). Drivers by points: error handling 6 (9 pts), if/else 5 (7 pts), match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0930d63cbe22c1d1476cfb27c2e2793f96e1cababaca6f0710f34210cef402dd"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiDownloadSheet.resourceRow (cognitive 18): MultiDownloadSheet.resourceRow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 5 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26aad886e37e2a494cf761b75cddbcdf682acc15e91c89ef85184ae3247fc1e"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailView.detailActions (cognitive 18): WorkDetailView.detailActions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, ternaries 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18f9bdbde370145c48bce641494362381d60cf2fa6aa7d7c699ab340bc39c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderV5ProgressSyncCoordinator.drain (cognitive 18): ReaderV5ProgressSyncCoordinator.drain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader/v5-sync-coordinator.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19fd5f4ea9b2b6cdfde787d29a510c835030e17258baffbc95af52d22c77ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"recognized-metadata.currentMetadataValue (cognitive 18): recognized-metadata.currentMetadataValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. 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":"apps/web/features/books/model/recognized-metadata.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a932025dd39e3cfa9a8965539e1fe1b7f66444dd961fee252792b4e0fd6b19e"}},{"ruleId":"D2","level":"warning","message":{"text":"client.searchSourceNodeMetadata (cognitive 18): client.searchSourceNodeMetadata has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9, boolean chains 7, if/else 2. Of this number, 10 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5374267cc7c44dcb9114601a788a6a9b61121d8a3f247b1b5aa5e1b01eeb4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata-lookup-modal.MetadataLookupModal::applySelected (cognitive 18): metadata-lookup-modal.MetadataLookupModal::applySelected has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (metadata-lookup-modal.MetadataLookupModal) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4592d0d2357d8942af5bde4b4bea6b29fdaf0a5c11f4e826fca6e4882802aa21"}},{"ruleId":"D2","level":"warning","message":{"text":"login-page.LoginPage (cognitive 18): login-page.LoginPage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 2 (3 pts), error handling 1 (nesting depth added 1). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (submit, a function literal at line 51, a function literal at line 60). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/login-page.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a2119ad1fafb2dbdabb3911c338224dd3a00098411b1c200d1d4358a4e8867"}},{"ruleId":"D2","level":"warning","message":{"text":"import-preferences-panel.ImportPreferencesPanel (cognitive 18): import-preferences-panel.ImportPreferencesPanel has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 6, if/else 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 73, savePreferences, a function literal at line 141, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/import-preferences-panel.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a5465094af0703d53e7e262f5402fc0321820294f4c2d4bd25ffc07af1eef"}},{"ruleId":"D2","level":"warning","message":{"text":"strict-fb2-parser.decodeXmlEntities (cognitive 18): strict-fb2-parser.decodeXmlEntities has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b933f431cb3ed8646c597f677bac78171c30c6ff25fc724bccb5b2ec495ce29"}},{"ruleId":"D2","level":"warning","message":{"text":"http.mutate_download_task (cognitive 17): http.mutate_download_task has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (6 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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0af7a6a370e40c12b7437e55512a90900452b52bdc98ddccb385e276546673"}},{"ruleId":"D2","level":"warning","message":{"text":"library_queries.list_import_tasks_page (cognitive 17): library_queries.list_import_tasks_page has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"apps/api-python/app/modules/imports/infrastructure/library_queries.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3926ff63b25907244b68e455d9c45f13040301955d4f2a86173eb14251e8e8"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyLibraryImportTaskQueue.request_import_resource (cognitive 17): SqlAlchemyLibraryImportTaskQueue.request_import_resource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 2 (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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c6f88a8133fd7ebe4667e1cbaaa3268e1d22338fa642986610448c9df19369"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyImportedBookMetadata.apply (cognitive 17): SqlAlchemyImportedBookMetadata.apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (4 pts), boolean chains 3, 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":"apps/api-python/app/modules/library/infrastructure/imported_book_metadata.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3fc9080f6b6b766ec74cb7ea30a2a5c59616ecfa49cca2167bb723703e6343"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyBookResourceRepository.refresh_audio_resource_aggregates (cognitive 17): SqlAlchemyBookResourceRepository.refresh_audio_resource_aggregates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2, 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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"2905b829351e2cb2dafcec53d7b67d0ae2bbf6154ff79179ade94c4276f79b00"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemResourcePreview._source (cognitive 17): FilesystemResourcePreview._source has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/media/infrastructure/resource_preview.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9297a789996d2f05ed548e1363912d2441866a68b9f047bb3a119e0613542f1"}},{"ruleId":"D2","level":"warning","message":{"text":"fb2_adapter._render_element (cognitive 17): fb2_adapter._render_element has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b529d470cfbd090e21ec75027ed78e99a4027c4e313006ecb739a5d2a12af13"}},{"ruleId":"D2","level":"warning","message":{"text":"locator_dom._sanitize_uri_attribute_value (cognitive 17): locator_dom._sanitize_uri_attribute_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, 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":"apps/api-python/app/modules/publications/infrastructure/locator_dom.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b489aaa779f7e7ff74bdbc86c1d375f150f0428452c192bbd0409e7844d47f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.parse_douban_search_html (cognitive 17): organize_service.parse_douban_search_html has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (5 pts), if/else 3 (4 pts), error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea6ddf99d98d3cb4689bb6cecb3f55dad68dd348a93ddc572e165f2aecff6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeSettingsUiKt.AdministrativeSettingsDestination (cognitive 17): AdministrativeSettingsUiKt.AdministrativeSettingsDestination has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aea0546a89d21f513630541a123d4eff2a3f3bf0d9e3e3c3a37ba4f3c1704a"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeSettingsViewModel.load (cognitive 17): AdministrativeSettingsViewModel.load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 2, boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e9b1c49e7bfe41f63ed84b7e5faff429975820fd7207e9c636b86c38f705ad"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeSystemScreensKt.OpdsScreen (cognitive 17): AdministrativeSystemScreensKt.OpdsScreen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSystemScreens.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"abea0c888123ffd84196f5d877179693018a44342f0ed3f5e2e3e6652a33cf3a"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeScreenKt.HomeScreen (cognitive 17): HomeScreenKt.HomeScreen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/ui/HomeScreen.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcdf9f4fbb1dd44c5f760b60545894c1f0d0d193569d98e44e5c19006ee1965"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryViewModel.refreshAfterManagement (cognitive 17): LibraryViewModel.refreshAfterManagement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaf1528afb974cdc8601389dbcf4b28848b2f61c829eab8acf9f045e7d50d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"ComicNavigatorFragment.ComicPageImage (cognitive 17): ComicNavigatorFragment.ComicPageImage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, error handling 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ComicNavigatorFragment.kt"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a4a04fae83e26fcdac94a4f421cd08e0e7d26d366e1e4f4b45b8490be90fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"EpubContentSecurityPolicy.prepareResourceBytes (cognitive 17): EpubContentSecurityPolicy.prepareResourceBytes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 4 (7 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/EpubContentSecurityPolicy.kt"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c8ac84dc4318a274cb983219ac8c437ed02a5c81e0d5ab9abe85e6e1dcebbb"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderActivity.openServerReader (cognitive 17): ReaderActivity.openServerReader has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbd5e7fb2ef85edee2dc4f21dbe0fcae57f892692d9668c1eb61919e4574f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderScreenKt.ReaderPreferenceSection (cognitive 17): ReaderScreenKt.ReaderPreferenceSection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5cec8eede9006aed24c48a992030ccdb62a6ddcbb5aec84dcccb3104cd445a"}},{"ruleId":"D2","level":"warning","message":{"text":"KtorAudioMediaTransportKt.validate (cognitive 17): KtorAudioMediaTransportKt.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/infrastructure/KtorAudioMediaTransport.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea631527c6e70a289a0c41eaa3eaaa0fdce74f8d403b0071c9c9f9670a43d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlControlPreprocessor.removeDeclarations (cognitive 17): XmlControlPreprocessor.removeDeclarations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSafetyFacade.kt"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"097bd285f180b58d64fb1f4534c044278cdb8082d1e7180e7eb8470c285e9263"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlControlPreprocessor.replaceReferences (cognitive 17): XmlControlPreprocessor.replaceReferences has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSafetyFacade.kt"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"807dedaa785c4e85e706270c3aef02f49b68d35d3166221db7d340fea9f676a2"}},{"ruleId":"D2","level":"warning","message":{"text":"KtorReaderBootstrapGateway.validateBeforeSecondaryRequest (cognitive 17): KtorReaderBootstrapGateway.validateBeforeSecondaryRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8 (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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75554fcb57f7fb6013f4c7b471770a922e2ca44b922cba877bffdf14f68b17c"}},{"ruleId":"D2","level":"warning","message":{"text":"BookDetailStore.load (cognitive 17): BookDetailStore.load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"790431874fbb86671cc29bf3618ffedbf8b5d86479424e211f7614669efbbcde"}},{"ruleId":"D2","level":"warning","message":{"text":"IosPdfiumDownloadMaterializer.materialize (cognitive 17): IosPdfiumDownloadMaterializer.materialize has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 13, if/else 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e26a36db363cdb874ce6bf9c8a641d52ca8a3f75212600ae3d333c5acf7f830"}},{"ruleId":"D2","level":"warning","message":{"text":"IosPdfiumDocument.render (cognitive 17): IosPdfiumDocument.render 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29d5b7bbeb82a4bac28a77751feff16dad7f5fc8de5d5ba3f49ca61d90e2470"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderTOCSheet.body (cognitive 17): ReaderTOCSheet.body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (6 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSheets.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dea49a1652553eb60940054553df31217f1056f92d9a2c95f1972424ef538aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ShelfCatalogStore.loadMore (cognitive 17): ShelfCatalogStore.loadMore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogStore.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"304acf937f3cd04bf026fe49e7ac414766f65af8a02aa52340fb7c1ef5e3a5eb"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiDownloadSheet.body (cognitive 17): MultiDownloadSheet.body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"86177f8e86914b19246bc0fca0cd4eda7da97ef3e33fd6d95972acd4c050d14f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkDetailView.saveShelves (cognitive 17): WorkDetailView.saveShelves has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 2, 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80ed4905dfc0564783d4f3278eba42a1d88282e2f5a70931becc769caca4fed"}},{"ruleId":"D2","level":"warning","message":{"text":"cover.Cover (cognitive 17): cover.Cover has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/cover.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2649118ceb9e80139d62bba39ac30eb20107ac70ced27e5df6aaf4d79c2b5186"}},{"ruleId":"D2","level":"warning","message":{"text":"feedback.FeedbackProvider (cognitive 17): feedback.FeedbackProvider has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (15 pts), boolean chains 2 (nesting depth added 6). Of this number, 12 points are the body\u0027s own statements and 5 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":"apps/web/components/ui/feedback.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed000369387f3eb93ef57fadf27fe2aa1579920b4d2cfaa37e2f5591757d5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"smart-filter-builder.SmartFilterBuilder::valueEditor (cognitive 17): smart-filter-builder.SmartFilterBuilder::valueEditor has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5, boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"62612a59019cc107e5a67ca45b3766ab1bf65900025b127198620bb7227fe4d2"}},{"ruleId":"D2","level":"warning","message":{"text":"book-detail-page.ResourceEditor (cognitive 17): book-detail-page.ResourceEditor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, ternaries 4 (5 pts), error handling 1, if/else 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (save, a function literal at line 143). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b3f777cae188e3772964af8d8644f70202e5b6f6abf9a52221217da81c509e"}},{"ruleId":"D2","level":"warning","message":{"text":"book-detail-page.BookDetailPage::invokeResourceAction (cognitive 17): book-detail-page.BookDetailPage::invokeResourceAction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: 2 other methods here (book-detail-page.BookDetailPage, book-detail-page.BookDetailPage::invokeSourceNodeAction) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae0682b4e121e036138efbf2def97086a396b8f418a14a684132c78bfb6605"}},{"ruleId":"D2","level":"warning","message":{"text":"audio-listen-redirect.AudioListenRedirect (cognitive 17): audio-listen-redirect.AudioListenRedirect has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 4). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 30). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-listen-redirect.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b177dee791db0d663d80a6c30482f711507b7b50fe162b2f534adfff8efc95f2"}},{"ruleId":"D2","level":"warning","message":{"text":"input-router.readerKeyIntent (cognitive 17): input-router.readerKeyIntent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. 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":"apps/web/features/reader/v3/input-router.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f607b00dabfc11c307537a8c7eb95244b01e321544e355259c5d8331b6593be"}},{"ruleId":"D2","level":"warning","message":{"text":"mobi-worker-client.response (cognitive 17): mobi-worker-client.response has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 6, boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-worker-client.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c70a2f28936db1aee287fdcfc2aa690bfb02c3625338cd14845899dcd6d196"}},{"ruleId":"D2","level":"warning","message":{"text":"readium-publication.chapterXmlEvents (cognitive 17): readium-publication.chapterXmlEvents has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (8 pts), boolean chains 4, if/else 3 (4 pts), loops 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 2 function items inside it that branch (visit, a function literal at line 95). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b92a770671f1d4711d88c53eff6c158eedbefac0a727c2ed68e39dc3ad428"}},{"ruleId":"D2","level":"warning","message":{"text":"backups-client.parseBackup (cognitive 17): backups-client.parseBackup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (5 pts), boolean chains 2, loops 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":"apps/web/features/settings/api/backups-client.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba55c4481ed37252987934ba799381b57a8e637ec3245885aa1d286a6770858a"}},{"ruleId":"D2","level":"warning","message":{"text":"library-scan-settings-panel.LibraryScanSettingsPanel (cognitive 17): library-scan-settings-panel.LibraryScanSettingsPanel has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 4, if/else 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (save, a function literal at line 32, a function literal at line 35, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/library-scan-settings-panel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"de70d230afac93573971c4108423782f0205a534ef58d47c3980ced5a045b0a9"}},{"ruleId":"D2","level":"warning","message":{"text":"shelves-page.ShelvesPage::openShelf (cognitive 17): shelves-page.ShelvesPage::openShelf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (4 pts), boolean chains 3, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 2 other methods here (shelves-page.ShelvesPage, shelves-page.ShelvesPage::saveShelf) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8536d04156ec4b5833fccd022705312cf632b7562528dd8b32ad194daf9c14"}},{"ruleId":"D2","level":"warning","message":{"text":"0031_book_import_task_backfill._merge_pending (cognitive 16): 0031_book_import_task_backfill._merge_pending has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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":"apps/api-python/app/db/alembic/versions/0031_book_import_task_backfill.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfdb77418776fc12c0c719bbb82eed3c5418f048a62445605e790fca43765bb"}},{"ruleId":"D2","level":"warning","message":{"text":"copied_file_attributes.apply_copy_attributes (cognitive 16): copied_file_attributes.apply_copy_attributes has cognitive complexity 16 (threshold 15). Drivers by points: error handling 6 (9 pts), if/else 5 (6 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":"apps/api-python/app/infrastructure/copied_file_attributes.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"103ba1a70055794855cad3e8288ca741206dd7d0d4b443cc965801d40952aadd"}},{"ruleId":"D2","level":"warning","message":{"text":"OpdsMediaResources._cover (cognitive 16): OpdsMediaResources._cover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/infrastructure/opds_runtime.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72a5f7d3499a6d47c16b257a61f4cd40f4125e8ffb375a52f9aa956744071f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanLibrarySourceTree._persist_directory_decision (cognitive 16): ScanLibrarySourceTree._persist_directory_decision has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f0f1c8566c4aa9924076ceee0f9d64f3478336310b335099bd8340bb4e3208"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlAlchemyLibraryQueries._matching_statement (cognitive 16): SqlAlchemyLibraryQueries._matching_statement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/queries.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cb190437e69df2d71d5f257666bfa901b0370169a2eaa08c8e24eaedcdf8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"http.get_resource_page (cognitive 16): http.get_resource_page has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, ternaries 3 (6 pts), boolean chains 4 (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":"apps/api-python/app/modules/media/presentation/http.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d7b0fbda732a8536c3be6cdf52ec3d56d5c88d1d375311b5730bce5fe77667"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataMatch.application_candidate (cognitive 16): MetadataMatch.application_candidate has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (5 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/matching.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5fe1ed0752d0ee348af0b55c25f12497b94e366751379918f6d9f80f9182f0"}},{"ruleId":"D2","level":"warning","message":{"text":"AnchoredStandardMetadataReader.read (cognitive 16): AnchoredStandardMetadataReader.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/standard_files.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4cf3dbbff8558f4f677542141a9dba538965b9ca56fe34efdefe37063626ed"}},{"ruleId":"D2","level":"warning","message":{"text":"writeback_queue.enqueue_prepared_writeback_intents (cognitive 16): writeback_queue.enqueue_prepared_writeback_intents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/writeback_queue.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"614f175af0c20a8b38e37aebc8e6c2e4e30638bfbb4ead9d54b1af77014efca0"}},{"ruleId":"D2","level":"warning","message":{"text":"xml_policy._scan_doctypes (cognitive 16): xml_policy._scan_doctypes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 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":"apps/api-python/app/modules/publications/infrastructure/xml_policy.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"523dc3645edf9122fc576fd5f3b8c953327d3b28d88dd8ef4b6f5ffab9606d03"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateShelf.execute (cognitive 16): UpdateShelf.execute has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5, ternaries 4, error handling 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":"apps/api-python/app/modules/shelf/application/commands.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb45085709989480aad24eaab811989b87a5d71feddb873407370892b12772de"}},{"ruleId":"D2","level":"warning","message":{"text":"events.prepare_event_metadata (cognitive 16): events.prepare_event_metadata has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/system/domain/events.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc15203661b610d60083f6d4eb19b0bcc4d368b3506257b67ab29a42b27293b"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparationWorker._run (cognitive 16): PreparationWorker._run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 4 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/updates/infrastructure/preparation_worker.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3012b69ac072d9d432aaa20195ba2d8355adc80f2766c77120ea7980b2b267"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_metadata._mutagen_cover (cognitive 16): audio_metadata._mutagen_cover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), ternaries 2 (5 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c71bfc86bc6f8775d3f0523067efce4fd6b863a175b4346687c203c19c2495"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.parse_douban_subject_html (cognitive 16): organize_service.parse_douban_subject_html has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, ternaries 5, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81ae381d71ff89fe91e8b0d7f770b2d58fbb2448bbf230e8b61289142dca169"}},{"ruleId":"D2","level":"warning","message":{"text":"organize_service.run_bangumi_metadata_provider (cognitive 16): organize_service.run_bangumi_metadata_provider has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fdba45b4db01fe134b903a952fc28a7635bbdc7435cd178a8834763159b889"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark.resources (cognitive 16): Benchmark.resources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/scripts/benchmark_nas_import.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c7143d2c671e453becca52f38da18d423c81e4903c5a970403eb452d9e3171"}},{"ruleId":"D2","level":"warning","message":{"text":"check-reader-safety-boundaries.check_source_ownership (cognitive 16): check-reader-safety-boundaries.check_source_ownership has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/reader-contracts/check-reader-safety-boundaries.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4ca43bb99172bf9e1e25dcbcf8cec97bc89de2eeb3298e793cfc85c8f15e09"}},{"ruleId":"D2","level":"warning","message":{"text":"AdministrativeSettingsViewModel.poll (cognitive 16): AdministrativeSettingsViewModel.poll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cdda370882a17b18463ffd99dd7ed3ef20b24092d510e79e57950395690ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidAudioPlaybackRuntime.publishFromController (cognitive 16): AndroidAudioPlaybackRuntime.publishFromController has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f66c067a427a7e1a4c29fc5515a65f6c47fed44d546a14062dfaf6b5d2bb000"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiDownloadSheetKt.SelectionBatchBar (cognitive 16): MultiDownloadSheetKt.SelectionBatchBar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9158d584fb7d342b3c169d77bd148176d1311bc45e3d1ec45ea7e4ec1be6afa"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderActivity.dispatchKeyEvent (cognitive 16): ReaderActivity.dispatchKeyEvent has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), match/switch 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4094fffe12f23a589e7e51866896e187731b6fa3995300ec76c53bd200b916fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ReaderActivity.openManagedDownload (cognitive 16): ReaderActivity.openManagedDownload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef79de4160981186abbefc5d1fcb07b904c90dbcde5ab016a31247f7e4c02d57"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagementActionsKt.managementActions (cognitive 16): ManagementActionsKt.managementActions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/domain/ManagementActions.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa1dbe6dd0978b0e80da2f72f148ed9aced1758f73fd660a418471f494de490"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataProviderDetailView.editableField (cognitive 16): MetadataProviderDetailView.editableField has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MetadataSettingsViews.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8e2f59a96c6c81f0a3ff188e861ef12aecb29c7c361bd16ceb0c475f7135bc"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioPlaybackRuntime.launchVerifiedLocalArtifact (cognitive 16): AudioPlaybackRuntime.launchVerifiedLocalArtifact has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, error handling 4 (6 pts), if/else 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbc96bcf2e7d14a5d6c653aa1d2023dc91791fa6728381fedaecfa4f6d7cb58"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadedBookView.perform (cognitive 16): DownloadedBookView.perform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterView.swift"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d704555d788a85a7fb339fcc761a754299fab225decd26d16f9f38a8e28a60f6"}},{"ruleId":"D2","level":"warning","message":{"text":"IosComicReaderSession.restorePage (cognitive 16): IosComicReaderSession.restorePage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0959e55231d8edc44f0c84bddcaeacbcf2f99f2ae7bee9321f8fe614da2c4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"IosReflowableReaderSession.verifyNavigation (cognitive 16): IosReflowableReaderSession.verifyNavigation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c65df1319126df05718dc9ca7acb9ea3e8e13f3aceece4bf8a4be2727fadfe1"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiDownloadTreeStore.load (cognitive 16): MultiDownloadTreeStore.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 4 (6 pts), 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5853fcde3a6c18ae6e66555a04640a90886a78bc3740b5541a898967671a51"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeManagementSheet.body (cognitive 16): NativeManagementSheet.body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, match/switch 2, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"2effa7bd7b12150ae3fadc1dacf147aadc653913f08597db4ce82ee6d1ff8dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"book-download-dialog.BookDownloadDialog (cognitive 16): book-download-dialog.BookDownloadDialog has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (sizeLabel, a function literal at line 119, a function literal at line 125, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-download-dialog.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34f112c7405c7cac4e7218ce91a1ffe8347124ca9e902e30320c3630ec172aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ComicReaderAdapter.executeAdjacentStep (cognitive 16): ComicReaderAdapter.executeAdjacentStep has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c971472f6241296b335264b94d186d8cdfc8264ec24ab49d4167cc90d4c8b02b"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-i18n-catalog.collectTypeScriptMessages (cognitive 16): generate-i18n-catalog.collectTypeScriptMessages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 5). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-i18n-catalog.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d0b297f066742ec6402afd1be24b696d5ca16ba986ac27f13890a002b41002"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-reader-safety-conformance.executableCases (cognitive 16): generate-reader-safety-conformance.executableCases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, 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":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea42bc682591b4dda3145932349e3e5f8839731e2c022c2463477be64df2863"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: shelves-page.ShelvesPage: FunctionTooLong \u2014 ShelvesPage runs 824 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 724 over it, 8.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1453e0c8e838e8a4f438bc3a874376db492d53c1225712e365cbbdabcf0e6f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app-shell.AppShell: FunctionTooLong \u2014 AppShell runs 823 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 723 over it, 8.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea8be84d379c78fee2e2a3fe90faf07271f0440565e40d83a521d682910f3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reader-shell.ReaderShell: FunctionTooLong \u2014 ReaderShell runs 822 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 722 over it, 8.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e99d3a2b224ac9d3a2bbad556e609d268aa6182ea0b8c8eb3d18c2bad5c2b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: audio-playback-provider.AudioPlaybackProvider: FunctionTooLong \u2014 AudioPlaybackProvider runs 812 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 712 over it, 8.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4093061913048b366d3f5eb507f677ffc00e23b8fa14385f6afa616c642f1ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: book-detail-page.BookDetailPage: FunctionTooLong \u2014 BookDetailPage runs 528 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 428 over it, 5.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"158f61b040c55b48a3a355504436247404b2ae8e80416437649763474f47f3b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: library-page.LibraryPage: FunctionTooLong \u2014 LibraryPage runs 508 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 408 over it, 5.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d4c41b515ed6e703baf802376d527bd31dd439ed8391a2b9d3d4c01e4f5fd9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SharedAdministrativeSettingsClient: TooManyMethods \u2014 143 methods, declared across 2 files: AdministrativeSettings/SharedAdministrativeSettingsClient.swift (76), AdministrativeSettings/SharedAdministrativeSettingsMapping.swift (67). The bar is 30 methods; this is 113 over it, 4.77\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. Most of these members implement repository.AdministrativeSettingsClient (75 of 92 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SharedAdministrativeSettingsClient.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0633b04f52c31769301b5e283743ff9062c02a675cafdcff7474bd780a906fae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reader-engine-runtime.ReaderEngineRuntime: FunctionTooLong \u2014 ReaderEngineRuntime runs 432 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 332 over it, 4.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ae24359d4047b5219b702634c45f96df58aedc87315513e0459a09cb703370"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/ReaderScreen.kt: FileTooLong \u2014 2062 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1562 over it, 4.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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"817c64d1529e0054b7030b5e2b0fe3268b5380010880ac37aca7e7277aa66fc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/WorkDetailScreen.kt: FileTooLong \u2014 2056 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1556 over it, 4.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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dba513db3601302c2cd7b3932993f293850f46e73b963a7a581f5cf33d2df9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settings-page.SettingsPage: FunctionTooLong \u2014 SettingsPage runs 395 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 295 over it, 3.95\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":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"71485e362683d9cc1f350808828514c4c63c646e4412cf74891a590cbec707a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: library-batch-actions.LibraryBatchDialog: FunctionTooLong \u2014 LibraryBatchDialog runs 391 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 291 over it, 3.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5046b61400f98728220a68f65cc3990a2f8bae65a074053f9b4cc3defdbaafe4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: audio-mini-player.AudioMiniPlayer: FunctionTooLong \u2014 AudioMiniPlayer runs 375 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 275 over it, 3.75\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":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b759b4c5a5fcb4b8df85661755d0bfe8f0e1782a410a2e5cb139b885c24c5a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkDetailView: ClassTooLong \u2014 1482 significant lines (blank, comment-only and punctuation-only lines excluded), 75 methods. The bar is 400 significant lines; this is 1082 over it, 3.71\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c2065bcb2bb659130c4b5d2c6e99f603ac2a539bac600aa54ff5de749f83aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: versions/0001_library_topology_baseline.py: FileTooLong \u2014 1798 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1298 over it, 3.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feacdc94410a179be59158532adce211a7181bf34153ddbf18128e706f74e4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Work/WorkDetailView.swift: FileTooLong \u2014 1737 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: WorkDetailView (171-2120). The bar is 500 significant lines; this is 1237 over it, 3.47\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c46c7c294b52d5082e0867a68c0f4e11755661309d24971d16d8d762edd27da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AudioPlayerUiKt.AudioNowPlayingScreen: MethodTooLong \u2014 AudioNowPlayingScreen runs 347 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b98f03d398818b0839b2cdab086318694c65c4a0ef9449ed2a2e82fdfe1a01f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KtorAdministrativeSettingsRepository: TooManyMethods \u2014 104 methods. The bar is 30 methods; this is 74 over it, 3.47\u00D7 the bar. Most of these members implement application.AdministrativeSettingsRepository (77 of 102 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b5d628d22fa1533842f8a9edc655cc2fe95a831f8f80055d609c39bbcdbd4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/http.py: FileTooLong \u2014 1718 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1218 over it, 3.44\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":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc19c1e2c4e72a840098f33640a61087e94b2340a266646d9c11f5250bb1e75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: metadata-lookup-modal.MetadataLookupModal: FunctionTooLong \u2014 MetadataLookupModal runs 337 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 237 over it, 3.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"73299556c552acfc8e27dc0f3e13f3acae7416b85e7c1148ec896dd32484c0e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: users-permissions-page.UsersPermissionsPage: FunctionTooLong \u2014 UsersPermissionsPage runs 332 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 232 over it, 3.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f8b1ace09352ad999c33c59544edd81b233d2714983c4ad15bb64d536d70ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reader-v3-page.ReaderV5Page: FunctionTooLong \u2014 ReaderV5Page runs 330 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 230 over it, 3.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2c471f1e6632f3546a6334ae596b01fa8d039f882f59113ceaf492b7157f08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistence/source_tree_repository.py: FileTooLong \u2014 1609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1109 over it, 3.22\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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed23b0beeb5cd69b7df7a8a87d82561b2349b4e73ac531317a98babfaccf4aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: multi-value-combobox.MultiValueCombobox: FunctionTooLong \u2014 MultiValueCombobox runs 286 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 186 over it, 2.86\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":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"899b4d37978ce689e8780793c5cd75d9e01ce7e4b8a29cd026aee08b37d5c50e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IosReaderComposition.bootstrap: MethodTooLong \u2014 bootstrap runs 277 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fedfe1990baa3509c248425b4fcee8fd5dd667fe24b2e8371b830962fe15196"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: management-logs-page.ManagementLogsPage: FunctionTooLong \u2014 ManagementLogsPage runs 267 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 167 over it, 2.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e40d47b17ca18b5862e8c96686b94b4dbcf0dc53fedd4ec5828c06f3ffeb484"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reader/reader-shell.tsx: FileTooLong \u2014 1302 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: ReaderShell (250-1219). The bar is 500 significant lines; this is 802 over it, 2.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae65bce8465549aa81cc0bc118e876d3d236d250ed3a8efc98fda8311f8bd3e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReaderActivity: ClassTooLong \u2014 1032 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 632 over it, 2.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e1125a2ad7d3e6e15884227c204d38eb34355cd2a306e5886fd9c94ea8a18f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: directory-path-picker.DirectoryPathPicker: FunctionTooLong \u2014 DirectoryPathPicker runs 255 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 155 over it, 2.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c4e9868fbac4acbb34c1785010f833eb41b6395edfede1784fef037b79da77"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkDetailView: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"af362a4e5eed63e0925afb502b4c938adf11b56a8bfe784437c57086452d9ed4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AndroidAudioPlaybackRuntime: ClassTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 580 over it, 2.45\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"915d06559cd2a3d54540f28ffb25f72fd4dacd7cc6720c67b4778e4f88180f63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readable_resource/scan_source_tree.py: FileTooLong \u2014 1220 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 720 over it, 2.44\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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2e64b1aa4d4d3e9275f15f0a32a836fea0a1977c5e118bdc3db8d157adf86a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: import-tasks-page.ImportTasksPage: FunctionTooLong \u2014 ImportTasksPage runs 244 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f160d1ece38d1db2fe39060b10389cebe90b1c847e797d0610277b74d7d282"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/writeback_queue.py: FileTooLong \u2014 1174 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 674 over it, 2.35\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":"apps/api-python/app/modules/metadata/infrastructure/writeback_queue.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5619f9948e44b536bbcff38eaf0d5784e9ff80138fe405d32c665dc2859d63c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: strict-fb2-parser.parseStrictFb2: FunctionTooLong \u2014 parseStrictFb2 runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e1a1d13171031bd4f90d50625d37288ef517a8c868cf144c716a9282ea812e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/ReaderActivity.kt: FileTooLong \u2014 1145 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: ReaderActivity (105-1414). The bar is 500 significant lines; this is 645 over it, 2.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d124be01284a12803de3a797e8a4ab2c6b3c00366e23d0cafb35f38a992cc6ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: readium-publication.openEpub: FunctionTooLong \u2014 openEpub runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2a0fe6002cde7b4ce2c49b10eafb87675ae668e6a3a9c8b04356c6c2f50ee6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readable_resource/process_import_task.py: FileTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 620 over it, 2.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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeb06a9c9be6240a6dfcca94d47cf65120d112dce8edf39a75c8d247949e4cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: account-panel.AccountPanel: FunctionTooLong \u2014 AccountPanel runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdfeaf3b8c4df2bf5cc9c974039e0083fc0a3c5f39d32f6e23e9999af3b8833"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IosReflowableReaderSession: TooManyMethods \u2014 67 methods, declared across 2 files: Reader/IosEpubReaderSession.swift (65), Reader/IosReaderControlAdapters.swift (2). The bar is 30 methods; this is 37 over it, 2.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a90ce1cd6f2ab0546ca874e835192c28ae890f8e2846d401778f1ea6110d2e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AudioPlaybackStateMachine: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7a5a65c152bc8a1059e55356270fb79a7680ac7f8a8c4b7f52dedcd92c96b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reader/IosEpubReaderSession.swift: FileTooLong \u2014 1112 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: IosReflowableReaderSession (440-1399). The bar is 500 significant lines; this is 612 over it, 2.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd7958aa102eefd643407ea2d7749d587fa936ae095c41f7f12875e76397e6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/AndroidAudioPlaybackRuntime.kt: FileTooLong \u2014 1107 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: AndroidAudioPlaybackRuntime (84-1342). The bar is 500 significant lines; this is 607 over it, 2.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a65933185f793eea3ecaac26a54773bd10a8f1ed2265f658dbe14dfe29f160"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: organize-page.OrganizePage: FunctionTooLong \u2014 OrganizePage runs 218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7235246422e5c38dd53fa04b4282ae928608c38646ce41712571f46d76a3512"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AudioPlaybackStateMachine: ClassTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded), 67 methods. The bar is 400 significant lines; this is 425 over it, 2.06\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3684de33a1fef92c83f0c6cf98fc91980c4e21d7a46c7e20f20c885c3da2f9cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: book-table.BookTable: FunctionTooLong \u2014 BookTable runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-table.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bacab6ceb82d8d8180f1ef923afea45b00c784055f1fbd3c9e88c2fed483c4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/metadata_lookup_queue.py: FileTooLong \u2014 1015 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 515 over it, 2.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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"729fe7128c35e19871732919405351378cb76a3c00816d0d407e36582d8c7c21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pwa-client.PwaClient: FunctionTooLong \u2014 PwaClient runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"209118ba5c81459aeb5e615ff1d9730d6e150515f174fdca38ba277a0631ff1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/ReadiumEpubSession.kt: FileTooLong \u2014 993 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: ReadiumEpubSession (104-1081). The bar is 500 significant lines; this is 493 over it, 1.99\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8134260ee75c4b26e756c7fdf5030915ce09d858a7d47cb8010b9cf172200829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/AudioPlayerUi.kt: FileTooLong \u2014 986 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 486 over it, 1.97\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12048678336ad612717ecf58bfe068c300ba28bef83074840cff38c3e8eec68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/organize_service.py: FileTooLong \u2014 984 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 484 over it, 1.97\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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0de0bf51472db41c4861bb4ac11649e7a360685157d23ab335b0056c69f9cb8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfReaderAdapter: ClassTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 380 over it, 1.95\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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf99ddc1256b31f498cfe2687cef0ce19dfa0873c032de07c8d37489762b338"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IosComicNavigatorViewController: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3d0e4860cdff2cb33af2694fef63e8439132e0ae637a05113648e544ffe570"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: target-directory-picker.TargetDirectoryPicker: FunctionTooLong \u2014 TargetDirectoryPicker runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\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":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef7f374a7b1e8817844d809c37c8fbdc2f2c8cf091358759aae29b44a2d5e56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: audio/audio-playback-provider.tsx: FileTooLong \u2014 957 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: AudioPlaybackProvider (166-1146). The bar is 500 significant lines; this is 457 over it, 1.91\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69a62e74032a913f053540c97a076d908f0d761b0a05d7df6a43e1ab21502cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AudioPlaybackRuntime: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28ebfc62fa36406705972b42254e90502fcc02f51a2c8d92201846a7530592d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shelves/shelves-page.tsx: FileTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: ShelvesPage (76-1013). The bar is 500 significant lines; this is 448 over it, 1.90\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bd52ff7a9fb02681ad5494c1281a1765c5d665b66ff091a7edf2f102e8b8a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reader-contracts/generate-reader-safety-policy.py: FileTooLong \u2014 944 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 444 over it, 1.89\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":"packages/reader-contracts/generate-reader-safety-policy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d26930f03b0a88f79ca83f74acdb36c6396c5552067a002a327c50bca134480"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/AudioSessionStateMachine.kt: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: AudioPlaybackStateMachine (137-1167). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb768de2d04ed2d3db169667c8df962bf650930be81ea42a667e28cef8cc400"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/app-shell.tsx: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: AppShell (143-1130). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3d0daf19c4b9062c0e2c5869736ed35187d3317e74b87f38f74c0f6ae7b704"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadiumEpubSession: ClassTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 349 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6f8503d24936b4aef9a51fb4665c49979d9262debcfb3b6be9a58e139b2721"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/bulk_operations.py: FileTooLong \u2014 935 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 435 over it, 1.87\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":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0927fc481fcdb849537ed3e901a173082a83dd41e6d42e382ee749cb472774e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reader/IosComicNavigatorViewController.swift: FileTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: IosComicNavigatorViewController (30-859). The bar is 500 significant lines; this is 434 over it, 1.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"751c8cdd82701d63307f7f04d8c0955187a17824f538d80d614f90311b537771"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IosReflowableReaderSession: ClassTooLong \u2014 744 significant lines (blank, comment-only and punctuation-only lines excluded), 67 methods. The bar is 400 significant lines; this is 344 over it, 1.86\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0db2e77f370c608a2fd1bf34625a5750df065a579aac4c3a3763406aac474c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Application/ContentStores.swift: FileTooLong \u2014 911 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 411 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dd5a50b58cfc7cefc47fa340a9741032ed7728631326234c9b69defb57c906"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-reader-session.useReaderSession: FunctionTooLong \u2014 useReaderSession runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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":"apps/web/features/reader/v3/use-reader-session.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfcf005130b7d967342e868a8e39e14ae03c4659128cdba56f587f772dd04b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/pdf-adapter.ts: FileTooLong \u2014 904 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: PdfReaderAdapter (145-1098). The bar is 500 significant lines; this is 404 over it, 1.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8792cad95b6a9bfb0f6592ed194a555a7116beab0ea691905c580d3891de7eb7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultMobileRuntime: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/application/DefaultMobileRuntime.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3773d7a1d81841784c08b8eb18b3e9066c1c73dd5a81a8d040344a548ccbac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: system-health-settings-page.SystemHealthSettingsPage: FunctionTooLong \u2014 SystemHealthSettingsPage runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\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":"apps/web/features/settings/center/system-health-settings-page.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c514fa517984216d3737cf8dfed2b8c577c2bb3422a30c0fc6377c03340c40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/v5.py: FileTooLong \u2014 878 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 378 over it, 1.76\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":"apps/api-python/app/modules/reader/presentation/v5.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21f7d7ecbe5b2969512facfb706592df6303f58d465a7eb0a284177dc4ad019"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: combobox.Combobox: FunctionTooLong \u2014 Combobox runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26488dafa54916f3eeb96fedb0376e9631290f40a56663eed283071a34907aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shell/MainShell.kt: FileTooLong \u2014 859 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 359 over it, 1.72\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4a2afc9f6b4c871d9e6fa0f6d6015455fe9198c068696cd1aeb41a9ac6a2d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: email-settings-page.EmailSettingsPage: FunctionTooLong \u2014 EmailSettingsPage runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/email-settings-page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"98620be079dc1c41747bd42b8d76e75df8851bdaafb086609bf462c50816a741"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefaultMobileRuntime: ClassTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 400 significant lines; this is 271 over it, 1.68\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/application/DefaultMobileRuntime.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1f92c8c46daaab7fd25d999fb2a9474c3fbe2e3bab529d066dd79cc016b64c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MainViewModel: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/MainViewModel.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead2c6ec0920d29b4d03f62f70bcc524a4750713a7298ff2b8b82642fa30df34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: select.Select: FunctionTooLong \u2014 Select runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"apps/web/components/ui/select.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbb06f5308d0fbac202cf240a7aa688066942e95df1ef16af96fbd6abdef146"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/health_runs.py: FileTooLong \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 326 over it, 1.65\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":"apps/api-python/app/modules/system/infrastructure/health_runs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86efedee3ec19bf5c10d63bd5f90596c4b0e28614a38c4b59c5fcf324da0cadb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AndroidAudioPlaybackRuntime: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef5d1e66c061a009d3da29529251cd6ab0e4c42d0cad3266c225c1d5bb084f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: classification-management-panel.ClassificationManagementPanel: FunctionTooLong \u2014 ClassificationManagementPanel runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e23186ba9266b191bebaf1ab09f704f95352b76021d989a4eebaa4c59a14594"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generate-reader-safety-conformance.evaluateFactCase: FunctionTooLong \u2014 evaluateFactCase runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f273151aae6e614e239dc8d37867b0ad0ba502f4405e913d2564ad781ade6301"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Work/NativeBookManagement.swift: FileTooLong \u2014 795 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 295 over it, 1.59\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bb706847159dcf4813e4992f3c99d59dafe829389aaa90c190c3a9865b5b21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: book-action-controller.BookActionController: FunctionTooLong \u2014 BookActionController runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-action-controller.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"971441d6a3db615d67ee23dceda3ecdbc49843842f5d31acb155e017bd2eb98a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IosComicNavigatorViewController: ClassTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods. The bar is 400 significant lines; this is 229 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6070dec4387dc6b33d0271e4f99fcc2faec4de72c24578024fd4a73229a735ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Audio/IosAudioPlaybackViews.swift: FileTooLong \u2014 773 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 273 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b0fad47e4200135755ff9a4d4807ee3ff635908e99fd6db68a6f34d67b898"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KtorAdministrativeSettingsRepository: ClassTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded), 104 methods. The bar is 400 significant lines; this is 218 over it, 1.55\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da2c8d77b54e49efb8fcbeb989ebc2d44020704718ce7c7480701eeabca801a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReaderScreenKt.ReaderBottomConsole: MethodTooLong \u2014 ReaderBottomConsole runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adfcad8c0908de35639c5d277cbfe26bb1473e7f5b779ed2dc34a3557fd2fe4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/audio_metadata.py: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ff8b69ed9543361a77aeeee783b3d7d4e71ad6f5999b81f37886e192b6df43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReaderScreenKt.ReaderContentsPanel: MethodTooLong \u2014 ReaderContentsPanel runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"730b5b2da7ce2d9fbe237e4de9c69df9e08dd0c1903bfea480a321f246c3e337"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: smart-filter-builder.SmartFilterBuilder: FunctionTooLong \u2014 SmartFilterBuilder runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0399ae21c27e6f52cb9498a5e6c232ba2971bd1392a5ebf82f966bf96ab9e824"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AudioPlaybackRuntime: ClassTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded), 57 methods. The bar is 400 significant lines; this is 208 over it, 1.52\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2ccf40ad7f780c390008fa25933ca3380b11d236e323f443e7355eab5ec130"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/MultiDownloadSheet.kt: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: MultiDownloadTreeRow (87-692). The bar is 500 significant lines; this is 257 over it, 1.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85a6884959b7ef6daf0ac6cfad7a3442c977028dd4b502b822ddfd889c24525"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/http.py: FileTooLong \u2014 755 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 255 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b48957c57a4e2ed196b1b55ad9eaf61635a0ca41e914c8b6bc0e9ea30d3bc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: metadata-providers-panel.MetadataProvidersPanel: FunctionTooLong \u2014 MetadataProvidersPanel runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cde6c5812ee728fbf83c7ed6173db470bfc9020035485efd4bc2b56192aca2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Work/MultiDownloadSheet.swift: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: MultiDownloadSheet (262-1004). The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297bfb6f868b54c3395c7cfb1dd5617b34a6ba45944a1b5e87abc6c6d7d6ad3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfReaderAdapter: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8c6733904517c84a23ea63808bcf2547b8a34851e1eba68fda4141cdef75a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readable_resource/task_queue.py: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25b24767fcd7eb503eb2c9ea54d8e9ad7d1ec92c38e2fd2fc98e5eb9619dbcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/generate-reader-safety-conformance.ts: FileTooLong \u2014 747 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 247 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54141a0ba6d08d5887b5bb07cfdd785dbf9a570d770dbe7ea737c49edff3e95f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reader/IosReaderComposition.swift: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"013200ed310ac4ad3c998c5aa46bb94bc1642ae065d9c7f6590fd150977f599f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: context-action-menu.ContextActionMenu: FunctionTooLong \u2014 ContextActionMenu runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"apps/web/components/ui/context-action-menu.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d699c47e38c6a9e2ae2c403887ec8ebd21fc2e90d439db36050bb819fecc25d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadiumWebReaderAdapter: ClassTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 189 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"067b1977b8c38daba7302d86bab618eb1900fcccabcaabffb8769ff6f66ee10b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadiumEpubSession: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdaab4b0844c57252f51f2c32598d9cd5f3fbaa0e577abcb9f165d65b61390f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visual/VisualFixtureActivity.kt: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 221 over it, 1.44\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":"apps/mobile/androidApp/src/debug/kotlin/com/ermao/library/visual/VisualFixtureActivity.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cd6a882ab89ad63203ddbed5420c256e90070b428bbd7ebd2a05d78a541f5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reader/public.kt: FileTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 220 over it, 1.44\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/public.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec9d5e77042b488de6ba0a8f25c3eba50e37971e25411e81d0e480cc09170c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComicReaderAdapter: ClassTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 171 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfabc1e19a2e3f1fe59bb5d0a5fb0a7f756b76e241cd386581d1a8eee7ea43a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/DetailViewModels.kt: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: WorkDetailViewModel (225-865). The bar is 500 significant lines; this is 207 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"347a1458333aee7b0b835408d3dc87c50da805f23c3949f7734f554ddff741ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/readium-adapter.ts: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: ReadiumWebReaderAdapter (137-878). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"664d049b609697dbcd81571c0344843f48e71758e7f92060caf050ad2c882b79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkDetailScreenKt.WorkDetailBody: MethodTooLong \u2014 WorkDetailBody runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c95cec885a65616cb65264ba8eb83d8124b2de8f26669617e4799074316cdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/readable_resource_schema.py: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 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":"apps/api-python/app/modules/library/infrastructure/readable_resource_schema.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aa190ca9ea6ab8bf593a45bf204be5ccc9845d35989a7c9fd743a8e40f8841"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/AdministrativeSettingsWire.kt: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsWire.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e632657661bcc05d4fdff1fa8cb938ae502d664c87ac5b6daab054ecd9673ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/DefaultMobileRuntime.kt: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: DefaultMobileRuntime (36-922). The bar is 500 significant lines; this is 200 over it, 1.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/application/DefaultMobileRuntime.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad36468c834611c8a1a43a400b1c641ead17c2e209ff5dfffa465e467dedfbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BookManagementKt.ManagementPresentation: MethodTooLong \u2014 ManagementPresentation runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"049bc5a3702e968eb6d9a64240e4bc6cdc821c12d9bd77cff6c11b8ef8bd0c02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KtorReaderBootstrapGateway.toDomain: MethodTooLong \u2014 toDomain runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c89b858295c6149b416cd1dfed85c2ea02388b528b680e10711f79629f70f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pwa-client.PwaDebugPanel: FunctionTooLong \u2014 PwaDebugPanel runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc994efb9574595fb9bebe69a166ab2c60fcaddeafc25a8f2190f9fdddb036a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/exception_diagnostics.py: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 194 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":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1055488fe67722d2b74be19cb4d9fb68ea48072f4a2184ce0c8c3ee11ae18486"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MultiDownloadSheet: ClassTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 155 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"790c0b8731287448141107d04934a0c86410e1cf3b3c8b89816a74e30e1d0b50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reader/IosPdfiumDocument.swift: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 191 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5cb9e525ecaca2b23831ef7bccc7480bec2323f38e564312b51c15a88d01bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mobi-publication.openMobiPublication: FunctionTooLong \u2014 openMobiPublication runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-publication.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d745faf5b922f19cca918c0031bf54f2a7f0035e0d4fc9210001de096bd63eb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: books/book-detail-page.tsx: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: BookDetailPage (189-800). The bar is 500 significant lines; this is 189 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee85207b8b973a50d35c13bf030ccfaaadad569189438d471ab63954a54d59c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReaderActivity.openServerReader: MethodTooLong \u2014 openServerReader runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d299704a4d0b8f0c44d1e30396b37b443657e73bada2a2c882289ec39ebe09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dashboard-page.DashboardPage: FunctionTooLong \u2014 DashboardPage runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/dashboard/dashboard-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1467cedb563959cb97c5cbddcedd06e05c4e279d9fd18695625700b71c71e878"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionStore: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"apps/mobile/iosApp/ErmaoLibrary/Application/SessionStore.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"105aa8d6891bf02878a94b869705b69fbcaeb35ed87acd8b0c18c8f0cdeb8683"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/http.py: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 over it, 1.35\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":"apps/api-python/app/modules/auth/presentation/http.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0da1de55ae0433fefd3edea9a950439691f9e0eee6833016536d2144ffbe56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/LibraryScreen.kt: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 over it, 1.35\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce1b62a39c795d9cab94b38313b74bbd057fd55865a110e067f2647794339e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/ReaderSafetyFacade.kt: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 171 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSafetyFacade.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d079d1492504001aff56923c54706ce5bdb498d558572e39f1e4b7def254ba2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api.fetchReaderBootstrap: FunctionTooLong \u2014 fetchReaderBootstrap runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/api.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966ce09d9138e355d996e1df00376155a8c26c7114b48ae9bd3a02fe33d7331"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/xml_policy.py: FileTooLong \u2014 669 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 169 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":"apps/api-python/app/modules/publications/infrastructure/xml_policy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8791b9ca3a0972306ff4d95e1f49ef5a187b6e5cc33d0aa3a9d340680b13a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/opds_runtime.py: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 167 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":"apps/api-python/app/infrastructure/opds_runtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bbcab0b14c6155a3f1ffbb45389f5f58172126a81cc4f04c852d17897574fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqlAlchemyBookResourceRepository: 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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6592306db3766b818e32a068d2d8411ccfb071dbc4850ea8794e6050bb71a9d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadiumPdfSession: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dec8ab8db064b9a8ccf6e68b4f2c1f3d3fd5d154c9f44c9590dfbb68adb646"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IosEpubArchiveSafetyPreflight: ClassTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 121 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b6590fcaed68b1422ff278a5f5f310cdef853832e5d711743baac5ced1fc53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VisualTokenGenerator: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3929ed57aee626443e35757a1b42739d1958ae261b27d9e24284c60041a2b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BookManagementSession: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/BookManagementSession.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"14907beb69c583157730c0558489a7223fe5155e52a4b4e37496b6c0d1202f86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/comic-adapter.ts: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: ComicReaderAdapter (83-800). The bar is 500 significant lines; this is 143 over it, 1.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"957eb78f42fc21411e7d0c416ae43531a06fd043206bbfbddbb2ce3e65f1a1dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: security/reader-safety-policy.ts: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 141 over it, 1.28\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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58087bcd16ec1674dfa0a56d3b9fb6cbdb9f56529a1d82b75315b26bd5defa6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/KtorAdministrativeSettingsRepository.kt: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: KtorAdministrativeSettingsRepository (24-857). The bar is 500 significant lines; this is 139 over it, 1.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e03e17cd15ee3e610c3f6a460d07591adc00decb918427c40c92480c5f4bca1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqlAlchemyLibraryImportTaskQueue: 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2064f01f4d56b1ad65c357dd679b90a758c74a1a5615a95d76f0642b261a6cde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ComicReaderAdapter: 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9b7c1a809a784516e7e351b3fec9250bd7390d22f7caa3ebd9b1fe8d09bd96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Audio/IosAudioPlaybackRuntime.swift: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: AudioPlaybackRuntime (12-819). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c2dce35c71a27ff2970fcd2716b7138a71a58e40c9a9ffb14efe4f5886a1be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: library/library-page.tsx: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: LibraryPage (75-671). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f5620955c7d99f6d38716e6d50b2ac69fb735c2d288e2c0ba078aafc99518"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IosPdfReaderSession: TooManyMethods \u2014 37 methods, declared across 2 files: Reader/IosPdfReaderSession.swift (33), Reader/IosReaderControlAdapters.swift (4). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"272e818859caf23b0aa1701eb035d2d9b62b8492a8b5b76027f0a78dd0a54933"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReaderSafetyFacade: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSafetyFacade.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccec4cee8435a533fc17a837661a9800b6cc6fdb05103ae44c5e9421db0e15e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: recognition-settings-panel.RecognitionSettingsPanel: FunctionTooLong \u2014 RecognitionSettingsPanel runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/recognition-settings-panel.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9473170abede71e73b186148e57ab483dcc37475a56b938cb2ba739a5cc3ae4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Shell/MainTabView.swift: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: MainTabView (145-698). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Shell/MainTabView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ae46b8329de110c03e25eee21e19477db37d5513f475d7cc806a43b4833ffe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: import-preferences-panel.ImportPreferencesPanel: FunctionTooLong \u2014 ImportPreferencesPanel runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/import-preferences-panel.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf110de0cb2898a7290e8d128f7f8305d42b41ded12968c21df46fce410fe720"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: opds-settings-page.OpdsSettingsPage: FunctionTooLong \u2014 OpdsSettingsPage runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/opds-settings-page.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f401f7980099738f9432e275b3312f9963692bcbd61e2aef0b1b10966abbb25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/client.ts: 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":"apps/web/features/books/api/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f11a5ccfee48661685cea2551c0fa74cb16740aeef2586c5ea5bfafd4a186c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReaderActivity: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb9bf7fe56fab9bf394daf140ccf5203604940524e06e4702819ba6e5ed7662"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DownloadCenterStore: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43f5a8c9852abadad7acfdbc0946ed71006470fb4a70cd5bd371342d6a77edb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComicNavigatorFragment: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 80 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ComicNavigatorFragment.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a63bacf9c49095d4671a61b0badd304a0c6a7755b510ee35550593748ad40e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoginView.body: MethodTooLong \u2014 body runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Auth/LoginView.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0419ca84a1a8c82fbaa7629a2df20f9660cdf6ab24d77de9b95bfefc24daaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CentralDirectoryReader.read: MethodTooLong \u2014 read runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6047832a67f53698f82aed1c189ff88977ea0580416684e16a8f8dec663706ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/epub_adapter.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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"112dba39f58eba99f050b29457a89189d831ed37017abbec2ea5876c19f22763"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/comic_archives.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":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f742f42c8fa94780a4196853d947bffb4d22b40395198ec902ed0937be06c8e0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkDetailViewModel: ClassTooLong \u2014 472 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 72 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"050b9c5a8c706adce88503dcaf22c4bcf97e1f29236f5fc95ccaa1ce5ac7c933"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readable_resource/adapter_registry.py: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9806f4560f5be73b9b5f71cdcb3e6dbcdc231170631fd9ab7e794e23db37d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: kindle-send-queue-page.KindleSendQueuePage: FunctionTooLong \u2014 KindleSendQueuePage runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"22821188ef5fd81a7e80e018409cb058e27a8145f6fe0e541e12cbbf0ddeb62a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Reader/IosEpubArchiveSafetyPreflight.swift: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: IosEpubArchiveSafetyPreflight (69-756). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9749d00c1a5c887b89565e23ba0f7e3273d951e932fb7a66ebc8263f8b1e5834"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MultiDownloadTreeRow: ClassTooLong \u2014 465 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 65 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d160570fb0069a29b140fe9a372ba48fb495c0fdbe566cd991dcfdf9761e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DownloadCenterStore: ClassTooLong \u2014 463 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 63 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd74db317ea264b9ad006dd8f44af9be4c07e43e1fd097f28946739d673da9dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/settings-page.tsx: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: SettingsPage (54-510). The bar is 500 significant lines; this is 77 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2e5cf0cc734d817c437a5f0525acec2e4742accb09d3d0d438e32d0c30a168"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/ComicNavigatorFragment.kt: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: ComicNavigatorFragment (96-736). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ComicNavigatorFragment.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"721fa89c6213d6e3cf0b838e2bcd3d7a60b1e1bae018804d1b3e55e36cc58e76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReaderActivity.createSession: MethodTooLong \u2014 createSession runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ccf57f8e789e04b724aa2d8541b5857dd2ee9fa170eeda927c4e42d491c85f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/organize.py: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/models/organize.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c1db9e32181aefb07eb4a6674e211f62104e46280a0036ef1dba980934fc82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/MeScreens.kt: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/me/ui/MeScreens.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1db80aeec6b39bdce1fd1b32b9bd5c9d35b23591c78868ad4e071525910c3f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadiumComicSession: ClassTooLong \u2014 456 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 56 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02cde813d788de83614067aa4083d7108d32d052b681851f2e14a0ea377826e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: v3/reader-engine-runtime.tsx: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: ReaderEngineRuntime (156-659). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae339ac2496cbb47d788686e4556a14047ebe0c17a21e67ec5fd79a1df7211f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/recognized_metadata.py: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 67 over it, 1.13\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":"apps/api-python/app/modules/library/application/recognized_metadata.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c081c7e097910cbc6c8b58c2dcee7ca57111cabf6093c92c592cbbd40a50591f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SharedContentClient: 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":"apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f779d01f4725880de37011594b25212c41c7593e1cb5683e50e124daeda23a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bootstrap/MainViewModel.kt: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: MainViewModel (97-718). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/MainViewModel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c637c4debfdfb96a084af9059434b55f9c192f1862435e3126c5f38283b82831"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AndroidAudioPlaybackRuntime.launchRemote: MethodTooLong \u2014 launchRemote runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90b29c4d03dc85e8be07f5e7b1a09dd3619e3e8b02e847986933f7971748498"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadResourceRowKt.DownloadResourceRow: MethodTooLong \u2014 DownloadResourceRow runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/DownloadResourceRow.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7bf27ef2670f7af98f286834e51bf41c10e79f2fc0e2df0f753d453422041f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkDetailScreenKt.WorkContentBrowser: MethodTooLong \u2014 WorkContentBrowser runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e4bd2d87778c535c77c58c9da20cd8fff00b484953da370295be3f0b12e52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComicSpreadTrackDriver.renderSlot: MethodTooLong \u2014 renderSlot runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8c7637f379de651e3fe93f38918f47e8d095e7a1a3c77eb3e4f9f15e6bc344"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadiumComicSession: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d89fa72e61d4aa57a117095897d0ed25bf762de51cda5db5ed4de918305265d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: book-metadata-editor.BookMetadataEditor: FunctionTooLong \u2014 BookMetadataEditor runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-metadata-editor.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8ec8172ecf7d99956d4112eac2618b78cca52dc68e683016d6d71815552690"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfReaderAdapter.renderPage: MethodTooLong \u2014 renderPage runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f31dd5f824d38e90764aee37790218484171a5c96caa7437c4bf4ce4e5cec8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Application/ContentClient.swift: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentClient.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c495f063e00a6e8d62a5225c5f5e5b570ccf8d0c86b24b86867c1b72639df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MainViewModel: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 32 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/MainViewModel.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f357908d60b1d234e300de161375262ba4d402c12cd8788b4e9a1390be7fe8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reader-v3-page.OpeningCover: FunctionTooLong \u2014 OpeningCover runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f085001ce052741f09658a1e460b051ba3feb513b1a685d2cca5bd9ce15bd88e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/schemas.py: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/presentation/schemas.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42410011d0d8db5a4342033a24d9bb8dbe60f2f76322ba979ed6aa82f397d28"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ApiClient: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 30 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ad077f385fa8cb60d8753fc2d35528e2cceb88364e93237c6e9e34fa66d377"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AdministrativeSettings/AdministrativeSettingsModels.swift: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsModels.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b29beddfa2b87c2565433dfcd917f6069739dba841976a0c83aa6c766833c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IosEpubArchiveSafetyPreflight.verifyMetadata: MethodTooLong \u2014 verifyMetadata runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"356c8bcee72f9ff5e5ba42e2ab9055d696767268d35fe64ef40516e7f2a4fc0e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibraryStore: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e364a8c3c6965f4a2a0314f2b977a565e50e8226164ae1d58750a208da6adf47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IosComicReaderSession: TooManyMethods \u2014 32 methods, declared across 2 files: Reader/IosComicReaderSession.swift (28), Reader/IosReaderControlAdapters.swift (4). The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbb70d3bd9489efe37c73b639a95a46061959d6ab8c56914e5bab703453129f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PagedTrackController: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/paged-track/paged-track-controller.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e34dd3c2c858831d3db53aacfdf418678e0d8c1f02e24132d2363e3476bf27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: administrativesettings/SharedAdministrativeSettingsAdapter.kt: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/SharedAdministrativeSettingsAdapter.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53aceb1ad23b21fc0f4ed363425c9dcbfd742dc9b5cd4b601e3531ca82e0139"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/mobi_adapter.py: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/mobi_adapter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"903fcba0c7b229f5e0fc37649a7e94d8c7c3848c1f3d1f2a1c7ba0090b23daf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: v3/reader-v3-page.tsx: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: ReaderV5Page (228-612). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b535b4064d449fd852f6b367931c4a07bf16095bf4a72ae34bc54c9d43903df7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReaderScreenKt.ReaderPreferencePanel: MethodTooLong \u2014 ReaderPreferencePanel runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"021607a133bae8ce95df62db3ef9a071be497d3ba3eae2be2793dc47da412945"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReaderScreenKt.ReaderNumberSetting: MethodTooLong \u2014 ReaderNumberSetting runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"875e791b3d2168b0532d078f70f982c33e0b3117b364b8c38f0a3d8941b11b2a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MainTabView: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 19 over it, 1.05\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Shell/MainTabView.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad441488f8426baec9055112d103a2bd535df6199157aa0d14b20fbffb2a399"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: setup-page.SetupPage: FunctionTooLong \u2014 SetupPage runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a27516ad6b6dab102dbb6fd9f86c17dc7e7d89794470b0a00e58815a994788"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/WarmPageSettings.kt: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee0c70aca295cc8d829ca7252a84119e11a6a0b87d30ade94399f7146858df5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadiumWebReaderAdapter: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3101ba588b4d90eb6347f2c5bee372e133f92da73317904bfc111d456bbb015"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: library/library-batch-actions.tsx: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: LibraryBatchDialog (144-588). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a5bac9eaaec29cf7776c7cfd38fca9183a7d4adace634b6bab18442442f451"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkDetailScreenKt.WorkDetailActionRow: MethodTooLong \u2014 WorkDetailActionRow runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7001c30a4fd7c76fec3db3b7bf9750f67463df4e58ede2272e1de3f558be67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkDetailScreenKt.WorkContentEntryCard: MethodTooLong \u2014 WorkContentEntryCard runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"890e9b9227d19765ad4166b28ae9202f20d3debb572832224dab89c3bc4d2ede"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: update-operations.UpdateOperations: FunctionTooLong \u2014 UpdateOperations runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/updates/ui/update-operations.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"076fffb2356aa865d0d751c77feb1b99d654dae41b11290ddbc2b321e993df8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Me/SettingsComponents.swift: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"700e395a3a3364bfe4fc39f348da88a97169039da9a50bd71ae4ac0f4e6b1382"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: administrativesettings/AdministrativeSettingsModels.kt: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsModels.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bf500f46ccc84e13da2f90a01ffed428d4dbd27e67f8e6c0c2f312bfc6113e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: upload-book-dialog.UploadBookDialog: FunctionTooLong \u2014 UploadBookDialog runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"apps/web/features/library/upload-book-dialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe8fb6573b10810d0293b21e93fe31e93e679ec360912765aab6d3233984de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/http.py: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 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":"apps/api-python/app/modules/kindle/presentation/http.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0908e39c34ea9b903bf833163d0e0131adc1516e1d7a9231c6ca8acebd435cd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infrastructure/ReadiumComicSession.kt: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: ReadiumComicSession (53-637). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51539f89fdf6897e0e1bcdba7a4bfaa115710a6bbf73ad9cf25f2f1922a4451b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: system/pwa-client.tsx: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6 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":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31460aac275c3504dfc9189c2790e55d0ef84370c02a8d4c438e47c3eb614a9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/resource_reader.py: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 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":"apps/api-python/app/modules/reader/application/resource_reader.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5430f905cbbc5c89388f1590a036c3849df2a2f86b2b5ae827a8aae3017770da"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionStore: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 2 over it, 1.01\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":"apps/mobile/iosApp/ErmaoLibrary/Application/SessionStore.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e974012a65ab2d2593ef0a0fb1df9efdc5b4820766b38e9cea5f2cbe625163"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadiumPdfSession: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 2 over it, 1.01\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ca7904128edec44f36e391543bcd0f8d8fd02dc7542ed4fce3a4845e46fb20"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:306-396 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:409-493 \u2014 These two members are variants of one another: 55 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2a14a615495465bb58f48e76722ad43435e306b0d506ba59da8d716c9e0fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift:375-393 | apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift:272-292 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f323f3465e981590f2043956eace68273deb594d5a414c4e978688a4b436573e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): apps/api-python/app/modules/automation/application/uploads.py:185-289 | apps/api-python/app/modules/automation/application/uploads.py:330-455 | apps/api-python/app/modules/automation/application/uploads.py:502-563 | apps/api-python/app/modules/library/application/execute_file_moves.py:87-265 | apps/api-python/app/modules/library/application/file_deletions.py:153-279 | apps/api-python/app/modules/library/application/file_move_worker.py:33-86 | apps/api-python/app/modules/metadata/application/execute_standard_writeback.py:88-203 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cabd9772c8f0a0a2db0df1ecefa675e6e65accf1d5e320a0a7c2f2f9d16670"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:13-63 | apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py:13-59 | apps/api-python/app/db/alembic/versions/0027_automation_uploads.py:13-34 | apps/api-python/app/db/alembic/versions/0029_file_deletions.py:13-21 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0023_file_move_operations.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c6057b19402523c25eeb1c13f4a3d304a258dd7948b2e5ed95ac9a7144abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apps/api-python/app/modules/library/infrastructure/book_list.py:274-293 | apps/api-python/app/modules/library/infrastructure/books.py:283-302 | apps/api-python/app/modules/library/infrastructure/facet_sync.py:41-78 | apps/api-python/app/modules/library/infrastructure/facets.py:144-258 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/book_list.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe8a3dbe27a671c1d1b9930d4798ce2778f7c87b47f558a3783bfcb24e0e605"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:11-64 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:11-65 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8bc508f46c9a1102888d0a276de85962ba3343021a626e1a6619bc369c5704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java:175-205 | apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java:221-251 \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":"apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf8bed32b6225f455f2fe1142697dd5e9c1bee71106266eda96b27f9e2ef4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): apps/api-python/app/modules/library/infrastructure/resource_cover.py:59-107 | apps/api-python/app/modules/library/infrastructure/source_node_cover.py:35-83 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/resource_cover.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fefce8511cb536aa1442487100998e9c3f518d515aed7a9e7e1d85282513d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:47-97 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/RemoteComicReadiumPublicationFactory.kt:32-82 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aec2ef9993b2e83e568d152b0a5d62b5632c61cdc0d9939e235f7d395cdbc99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): apps/api-python/app/modules/media/infrastructure/http_streaming.py:1216-1272 | apps/api-python/app/modules/media/infrastructure/http_streaming.py:1285-1360 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/media/infrastructure/http_streaming.py"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e554ad39a804548ecfbf0ace4d09c36cc66747d2aafe6a3b77e081cbafd24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift:259-302 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift:183-225 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f88d464264c0283f2adceb4512fa8c3ff709d4919847527a280e6a3b91518fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:160-205 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:217-252 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91ee05b072e94185655b1c979d5c6b3e58a39a0e4523ef8f19b03b008c73dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift:115-151 | apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift:177-216 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a9ae0378bf48862619e97989fc2baa869c5da97435214e4916da1e97e85ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt:353-370 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:174-190 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab14f46d869d80be015cccdc598d993584c818000b788eaf8760ebb2e9315771"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt:330-346 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt:352-369 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6780476987a7b1f74f2eaa2d55531df9e84d98eead82e6ee8e3ff2fb28bc3895"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1202-1234 | apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1236-1275 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8994455ead13f5bff33d8b2c6029eb934e7394e3a1722c1f00a8170e71fdfdcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): apps/api-python/app/modules/kindle/infrastructure/tasks.py:340-369 | apps/api-python/app/modules/kindle/infrastructure/tasks.py:375-414 \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":"apps/api-python/app/modules/kindle/infrastructure/tasks.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1be397dd53f37ab9cec8f094f01df3d3fc3e57b9a871769e21dd7f26d11db58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:274-304 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:237-263 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"67742e32a821d1773b48b7120852c693441dd818064929d8c028434a38f65de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): apps/api-python/app/infrastructure/comic_archives.py:272-307 | apps/api-python/app/infrastructure/comic_archives.py:409-447 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92fdb2539ec0fbbe8cc86c6683b27c459bd6570ca690c9e785789a1baeff057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): apps/api-python/app/modules/automation/application/file_moves.py:65-92 | apps/api-python/app/modules/automation/application/writebacks.py:114-140 \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":"apps/api-python/app/modules/automation/application/file_moves.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"121292daa238648f7266e2e467201d97e9503a8b5a2752cf7f15806c3d631eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): apps/api-python/app/modules/kindle/presentation/http.py:474-504 | apps/api-python/app/modules/kindle/presentation/http.py:514-550 \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":"apps/api-python/app/modules/kindle/presentation/http.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b958437dce2917cfad7c064bbe7527e628ff4c334f18f621e241ea2fdf1414b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): apps/api-python/app/modules/reader/presentation/v5.py:855-890 | apps/api-python/app/modules/reader/presentation/v5.py:911-949 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/reader/presentation/v5.py"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3308aec83d3473ca0eca8548e282a6f83a2d5b4b1a48ba54f71601b2d668bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): apps/api-python/app/infrastructure/copied_file_attributes.py:35-72 | apps/api-python/app/infrastructure/copied_file_attributes.py:76-103 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/infrastructure/copied_file_attributes.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"22690f5f0b248689827854b5f12f4ee74aabc1d46e5057ddae427324fa5c3766"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift:112-122 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumNavigator.swift:39-48 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"635cf2cd59592a1baf137a139d3337a41e7f387ef4f4a879cf5c6b669f3c74d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Home/HomeView.swift:41-77 | apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift:42-65 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Home/HomeView.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4423838d1cb0dc468ac2f502781229bfee792175d42da24a2fd135d3dc8f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt:37-64 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt:75-102 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61bf9fc246140d526a358591bf6695077bc0199ddf5a926b7ab95cee9a46453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): apps/api-python/app/modules/automation/application/operations.py:27-57 | apps/api-python/app/modules/automation/application/operations.py:60-90 \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":"apps/api-python/app/modules/automation/application/operations.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f46d67f4d0eec7d880aba36c47062088a9e08eca1e7a7ab87be2486d7c3d1ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:372-389 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:391-409 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c16f5abae83be6584c0b3f1c71220d1f2c80205012a07dad9b0516ab15aa74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:744-766 | apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:901-927 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef38f1e4abb372c51a40113c314ee7720fd1f8bca04079929339f269e912a603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): apps/api-python/app/db/sqlite.py:349-366 | apps/api-python/app/db/sqlite.py:369-386 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/sqlite.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb66088a09da9a4bcf7b8e6394183f398f571694f37e47cda18ec8929f9f960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt:465-481 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/me/ui/MeScreens.kt:677-691 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef968c697f651f8dc780e6a1828538569b92b03eac961a69340637c539f2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): apps/api-python/app/modules/imports/presentation/writes.py:346-368 | apps/api-python/app/modules/imports/presentation/writes.py:385-415 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/presentation/writes.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a642c45892c9cac196be211dc0ae9e698488d7e334f447fc03a91809c742df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:66-84 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderView.swift:125-146 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:67-89 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"749af5ef2496046d21034bf442700dbef368db8a43a40df5a47458f057eeab80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt:687-715 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/personalsettings/infrastructure/KtorPersonalSettingsRepository.kt:349-380 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d59bdc97e5d7961e3ff0d86dfac163b7f1cf85c288da33b18ab7fbf3a69ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): apps/api-python/app/modules/library/presentation/http.py:1839-1865 | apps/api-python/app/modules/library/presentation/http.py:1879-1908 \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":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54631f95373d8425eb76f3fe20c0d5c10db76b30d8fe136d090d2cc5d4074f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:341-353 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:355-368 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ba48cce78413a514468b18a32fb25669f588976906b757a79791e2e6e441ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiCore.swift:167-202 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiCore.swift:243-261 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiCore.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a7993281643eb9b34bab0f0b6a9bb7d4ab075c3d8d7d307e9edb3c2fa1af98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): apps/api-python/app/modules/library/infrastructure/projections.py:155-179 | apps/api-python/app/modules/organize/infrastructure/job_queries.py:397-431 \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":"apps/api-python/app/modules/library/infrastructure/projections.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dbf32f845bdb15a4625ff0fc6895b2be2ac1cd85120aca3273bc6079ca0c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:939-974 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:532-559 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"8938807de48f2e9757d9ea879d331c38030c2c8342eceefbed64374f487eac4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:357-388 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:703-732 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:363-393 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e021717a2c1407c91f0893ca00ec08ae6d266bfce363d881188c801bf090ce52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): apps/api-python/app/modules/media/infrastructure/resource_repository.py:33-61 | apps/api-python/app/modules/media/infrastructure/resource_repository.py:64-100 \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":"apps/api-python/app/modules/media/infrastructure/resource_repository.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3e994ec1f9a0c87c63359f8ec5e833c16be9fc2b429ea334ed2c875a179170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): apps/api-python/app/modules/reader/presentation/v5.py:756-778 | apps/api-python/app/modules/reader/presentation/v5.py:800-833 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/reader/presentation/v5.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b81220600adb3035b2d836dc8a051f0d6490e6834578cd59d8c762ed93c494"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioComposition.swift:393-412 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderProgressStore.swift:74-95 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioComposition.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ea9dadabb7c9640eb7c691798a6a0b7813b1fd9b7f6241c2da497b55da646c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:169-186 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:189-209 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dbc137c9798f9184edea182bc93878fe32243a46126c37326c8bced4e689c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:541-577 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/WorkDetailQueryWire.kt:136-169 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca3d2e0c01c6c526d4d946ecc2f92f6f5c38357deafd4438c76753d3b4fe121"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): apps/api-python/app/modules/download/presentation/http.py:58-83 | apps/api-python/app/modules/imports/presentation/path_helpers.py:18-41 \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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9846d4cbd27b0caa1838e9ebf38e02be494cb96fec919b89ff9d6a419665b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift:60-81 | apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift:134-157 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"315bd23044bc0ce5735fff7e640d68a0b21f1581c5b77b2e68555a32c17ac7d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsWire.kt:658-670 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsWire.kt:910-924 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsWire.kt"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99db78fb34d0af4c274228a51dc412dd90a569da44ddc8264fb5f447682d025"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py:331-350 | apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py:356-374 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"41676c87b69aa44d53c2ba7879583abd3cd685cfc369bb2775e19bfd8f4501fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): apps/api-python/app/modules/system/infrastructure/queue_runtime.py:150-183 | apps/api-python/app/modules/system/infrastructure/queue_runtime.py:186-214 \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":"apps/api-python/app/modules/system/infrastructure/queue_runtime.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a4c3e97a432727a0900282dc8741f97ddc95f4b798d27a4fc9a884177a29ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): apps/api-python/app/modules/auth/presentation/users.py:239-262 | apps/api-python/app/modules/auth/presentation/users.py:282-306 \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":"apps/api-python/app/modules/auth/presentation/users.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc88bd4591b5fb1c412a9e521826539135bcde8999943fc22259191bab0f729"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): apps/api-python/app/modules/automation/presentation/http.py:113-134 | apps/api-python/app/modules/automation/presentation/http.py:145-163 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/presentation/http.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59119ebc073031d754e00e9305868a20209bc35f48ca1c9ca6485f4894b6da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): apps/api-python/app/infrastructure/opds_runtime.py:689-711 | apps/api-python/app/modules/media/presentation/http.py:124-143 | apps/api-python/app/modules/media/presentation/http.py:166-185 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/infrastructure/opds_runtime.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"003bc2772ba1c6906681355b4c122009628871a490ad11eae6175ae8da985ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/api-python/app/modules/library/presentation/http.py:1234-1250 | apps/api-python/app/modules/library/presentation/http.py:1641-1658 \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":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48cc1c07e681740503ea49608d0919b7832ba339def261efc58bd3c631ec571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:566-588 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:515-530 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3115de3c9914ddd808949d0ac0208912dc33a42ad17885f09791c32f8d78992f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt:554-565 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt:573-584 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f500b75417f14ccb775038685d2122063b2f8517036f95bc0465285450c421b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift:228-247 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsComponents.swift:104-111 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f822b4e88dc3907c0e66ab31c7c8d6ae42d7de4371ccd5bb64c3722e15951a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift:598-614 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift:644-656 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"657aed9b0d66208ed0745239bbc0e60d44568c22496f5ec2a182641140ac73a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/PdfRangeLoader.kt:173-185 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/PdfRangeLoader.kt:196-208 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/PdfRangeLoader.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b450bfab28e52c5362377c97dd4bc83360b0ce35fa08d03e59f3769e14def7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift:36-58 | apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift:109-132 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f6e126f362105f037b10e76de01fad86f5b61032a5f7301caafdaaeaf9bdc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsRequests.kt:27-36 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsRequests.kt:38-47 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsRequests.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3d8a5b5fc2aa5de4d680afed3ccf0ade9fa22e8bf246e2e173646cc7ee2968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/api-python/app/modules/library/infrastructure/source_paths.py:10-26 | apps/api-python/app/modules/media/infrastructure/resource_preview.py:173-184 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/source_paths.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e943acda47d6734f6c93106efbd506384c90b9aaa73c9a7e2ed6f1b757b17309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt:123-146 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt:152-173 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc981325c96f312bf69a973dd394a3952c277e84ab786b26bcc1cda643dc6dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsStore.swift:89-106 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsStore.swift:108-124 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsStore.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c125221f328b83615acb68760982423368fcd41a4b9be73d73f1709c6f8be445"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:393-419 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift:1292-1315 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:435-458 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fa85e8f48ddfe0fc6937b43c3d54ad96f2d062c256ea1e8f5083fb3a4d1e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): apps/api-python/app/modules/updates/presentation/http.py:115-135 | apps/api-python/app/modules/updates/presentation/http.py:158-183 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/updates/presentation/http.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f523fa51db2eb7d884680599a04f2bf975fe87d5d13078b33f21426ee99578a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): apps/api-python/app/modules/reader/application/resource_reader.py:279-300 | apps/api-python/app/modules/reader/application/resource_reader.py:392-412 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/reader/application/resource_reader.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cf900f605f316eac1f70b578216a4f4bf81fd29361fe0cbb9dc4d95674ed8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt:130-144 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt:595-610 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c0f83784d682431a0f7b1ce452b3e4d5517703c8f6a5bbc52dcfb0ad08a81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioComposition.swift:209-227 | apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioComposition.swift:229-247 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioComposition.swift"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1ff1b0837173f8175d5f999f7d8feeddd147e65c1448252270065f2482b2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:99-118 | apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:155-177 | apps/api-python/app/modules/publications/infrastructure/locator_dom.py:140-166 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"802e4bfc365c0687be0b73c128b4391e869547eab30885e1745a97995ad7b08a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): apps/api-python/app/modules/library/presentation/http.py:570-592 | apps/api-python/app/modules/library/presentation/http.py:730-747 | apps/api-python/app/modules/library/presentation/http.py:760-776 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff107de37b634fe6eb2b01730a0e1801991ad6862f907399915faaf0efa1e0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/api-python/app/services/download_queue.py:38-51 | apps/api-python/app/services/kindle_queue.py:393-406 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/download_queue.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e296877766d9ea615a35e69c8e4dc18f9314e890ee8d4c1d93f92806a63c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:263-283 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:294-313 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4458bb214b0954c5c8c437371419395ff7d9ba96c8cf5688a14a68119e314fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): apps/api-python/app/modules/library/application/commands/manage_source_tree.py:290-307 | apps/api-python/app/modules/library/application/commands/manage_source_tree.py:323-340 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/application/commands/manage_source_tree.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d7c4d093921bd26dcda1f9abcb413873e23e46444ede1dd296c496e5994195"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): apps/api-python/app/modules/organize/presentation/http.py:413-438 | apps/api-python/app/modules/organize/presentation/http.py:451-470 \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":"apps/api-python/app/modules/organize/presentation/http.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"725e6351bca25c38f899d239ae993546d144eee15ea25f3fd574901d6056278e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt:623-636 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt:638-651 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bef007b7db38f84ff1f8d833e49897afccc3d2f4bf5e9fdf863ee8d3f007e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt:272-286 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt:513-530 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ffe39ecb581ce621dfb2f1c4c519f62c952e0cae33c3ffc889348c7d6bff22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apps/api-python/app/modules/library/infrastructure/books.py:306-314 | apps/api-python/app/modules/library/infrastructure/books.py:318-324 \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":"apps/api-python/app/modules/library/infrastructure/books.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c720f956534df7431f5c9095a5d18eb58859b4c9a56930e53e0ebc9afac318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java:212-219 | apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java:258-266 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f6c0ab5371a250080c61b9ffd296ba9343b75a098ba882a88a6e258acc1645"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:342-359 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift:1333-1348 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:265-281 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8ad4fa31b847e8a54ee610a5cb7193d7480479d6fb17df0e0c4ef5c26f7876"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosFb2PublicationFactory.swift:269-279 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosTxtPublicationFactory.swift:218-228 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosFb2PublicationFactory.swift"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e044d87d21a65eb44f1b258749f842ad669139ed4a35f63a45279d6c7750eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:253-267 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift:1082-1099 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d322511292ffa556c9a06f9facdb4efa470113e5b24477121dfff5d101a955"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/personalsettings/infrastructure/KtorPersonalSettingsRepository.kt:217-234 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/personalsettings/infrastructure/KtorPersonalSettingsRepository.kt:239-260 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/personalsettings/infrastructure/KtorPersonalSettingsRepository.kt"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff73c73891b0fec625b3736a8c6699c9fc1dce8e387ce28286e3c2c5ce1ce19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): apps/api-python/app/modules/backup/presentation/http.py:158-175 | apps/api-python/app/modules/backup/presentation/http.py:206-232 | apps/api-python/app/modules/backup/presentation/http.py:244-261 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/backup/presentation/http.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c45ddd2514b517d05516d88cc0368573223c56d59e238ea14f23eca9853723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt:661-679 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt:681-697 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae49b3f40fc80deed16d86fce2e6f1b046ce632bbbe65289a7c372ae78096dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/application/ReaderScreenController.kt:114-121 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:393-406 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/application/ReaderScreenController.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"742d47d9a570191a45e0f5ab149774f83c0dfdbcfe9cf9ce639142c70576097a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderLocalDatabase.swift:179-185 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderPrivateContentCache.swift:34-40 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderLocalDatabase.swift"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba99f9d127e3bc5fbdba12018289aa0168661be58c8d6c74ac581f2c8ef780e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt:56-69 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt:78-91 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea03ae2ad1bd97e3f64ac87422bfffec1986e512b853a760d0d36cc10aba30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift:84-95 | apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift:97-108 \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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"905684dcb4d6acdba2110858d9c445a94f6d93ceb512d2b51044ae7ef3b0d1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBookmarkSyncPort.kt:83-94 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt:343-350 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderPositionSyncPort.kt:100-110 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBookmarkSyncPort.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7386fe671f203d2fa24382961d64095627a6a5759821ddc4dd2300d8db9e5212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Home/HomeView.swift:19-39 | apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift:16-40 | apps/mobile/iosApp/ErmaoLibrary/Features/Library/LibraryView.swift:18-38 | apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogView.swift:18-24 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Home/HomeView.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64509fb3ebb8c8f43747ff3f1a2f6eb0de254841f1c1ac7e18f4b9183f85b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:141-159 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:161-177 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:179-195 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:197-213 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6444ad8b53a8d1c48b85eaa5ced8b9b0c2b700382b26407ae1c18f80e4eb204d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): apps/api-python/app/modules/automation/presentation/http.py:90-106 | apps/api-python/app/modules/automation/presentation/http.py:212-222 | apps/api-python/app/modules/automation/presentation/http.py:229-253 | apps/api-python/app/modules/automation/presentation/http.py:260-281 | apps/api-python/app/modules/automation/presentation/http.py:288-300 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/automation/presentation/http.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b48ae730f92ef6e6a85c0eaa96217cab5c54d4bf4628740e855efebf046fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): apps/api-python/app/modules/library/presentation/http.py:666-685 | apps/api-python/app/modules/library/presentation/http.py:698-717 \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":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0189a4fa6127fe7938d9701117b5bdf52a05ac3a314d0488f2ac1c2498fa9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): apps/api-python/app/modules/shelf/presentation/http.py:496-515 | apps/api-python/app/modules/shelf/presentation/http.py:524-543 \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":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2664ad1631f839dc6d022a6fb8d8cd08626756f727f77e9a635e92c7ef4dd297"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): apps/api-python/app/services/download_queue.py:65-82 | apps/api-python/app/services/kindle_queue.py:420-439 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/download_queue.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"37636e9c97b94f252a4d776b49026cad04eb8792e3b93dd37c7dabc49caaba8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ComicReaderSemantics.kt:283-290 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ComicReaderSemantics.kt:297-304 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ComicReaderSemantics.kt"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e2135eac11c6a0d05e69dedecc4dc4ce0c751f2879fa29517d74fb0824d36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/api-python/app/modules/media/infrastructure/http_streaming.py:208-222 | apps/api-python/app/modules/media/infrastructure/http_streaming.py:226-241 \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":"apps/api-python/app/modules/media/infrastructure/http_streaming.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44a2619451bf3064af8fcd6f302fb2d056614fc04f5c4e34becbd63f952c7c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/api-python/app/modules/automation/application/file_moves.py:101-115 | apps/api-python/app/modules/automation/application/writebacks.py:149-161 \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":"apps/api-python/app/modules/automation/application/file_moves.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb42508a1e2b17f1ae9ebad43e59df813caa564b87454fcf7ebb8c5d0f42d5bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/api-python/app/modules/library/infrastructure/join_queries.py:21-34 | apps/api-python/app/modules/library/infrastructure/join_queries.py:38-60 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/join_queries.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5141a7811d998cdd259c8595c0a928de317bfcdc3e4de945442ec2ada00c4b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift:340-353 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderModels.swift:129-142 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbcf62ffac623b52c0b61824685f9806b60c2983b8a653252119811815733ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:411-421 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:423-433 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:436-446 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9225d29da93faa1ce15b46db8ad023115f89a5af62c5e7f18211ad278585d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift:305-314 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift:352-361 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bfefe8fba8864b852f2ad8bcdcbb5fe401a4492d4a01448e2984f87fa8364f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:82-94 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:230-245 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:250-262 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:267-283 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"23910647548484d12c855a74b05cb138d4cc62840c9d1aa22553205c0c5b520e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/api-python/app/modules/automation/application/file_moves.py:47-60 | apps/api-python/app/modules/automation/application/writebacks.py:97-109 \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":"apps/api-python/app/modules/automation/application/file_moves.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c03e0786d89076877bb94116adfd34584a0ce462c775281e7474f11deea4da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py:353-364 | apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py:462-473 \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":"apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd9bd7c6b8c94e4429ec88bf30a8007d69f7e49fca11dd9a7d0d2ad82bb319d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:327-340 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:416-428 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fea80bbd07ca68e36f0ebb08eb9e1dfd542ca11c68e45b998a5284be0292dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): apps/api-python/app/modules/organize/presentation/http.py:207-223 | apps/api-python/app/modules/organize/presentation/http.py:233-251 | apps/api-python/app/modules/organize/presentation/http.py:260-276 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/organize/presentation/http.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0a6af62a6d426a93e93cd6703110390ce7d1141540f717b380a21543807606"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt:51-64 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt:326-340 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb26cabe9e2e1c50ad8a267ce414d5ceca87fd4d5ed74d172dabf86b4e73bfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt:670-684 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/personalsettings/infrastructure/KtorPersonalSettingsRepository.kt:289-304 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/KtorAdministrativeSettingsRepository.kt"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b61b3d3dff42868bebf28c91dcea877b4c68b6cceaf4886fd6a74ea13be0124"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:691-707 | apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:661-679 | apps/api-python/app/modules/publications/infrastructure/mobi_adapter.py:605-617 | apps/api-python/app/modules/publications/infrastructure/txt_adapter.py:214-232 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb7c4c6f73a4b99f1cad67a54aee6a9573d320ce2cd55d971d54d54478f8a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apps/api-python/app/modules/updates/infrastructure/dependency_preparation.py:29-37 | apps/api-python/shuku_dependencies/installed.py:16-22 \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":"apps/api-python/app/modules/updates/infrastructure/dependency_preparation.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f820f98124b994adcbedf1700f024bf77f543783552aa845411d0027d46b71c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): apps/api-python/app/services/log_maintenance.py:103-118 | apps/api-python/app/services/log_maintenance.py:121-137 \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":"apps/api-python/app/services/log_maintenance.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"716c6024b38ab2004308ce2f393bcf2408e0990a3dfca880f6300d3bf68e0dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt:1249-1259 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1905-1912 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ad84adca9d7da278e274b5a70c6841df61ecb4a36f2ba1c3aeec48ae03bd30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/infrastructure/KtorAuthGateway.kt:42-60 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/infrastructure/KtorAuthGateway.kt:66-84 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/infrastructure/KtorAuthGateway.kt:129-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/infrastructure/KtorAuthGateway.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"262ee1317331058c676e22c3bb24b2f507f4353594adcd1e57adf13093b5ef48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/modules/library/application/catalog.py:192-201 | apps/api-python/app/modules/library/application/groupings.py:65-74 \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":"apps/api-python/app/modules/library/application/catalog.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c807936f567556c2ce3fd1377bbbfb2b6638d8c07e47857611a7d426381af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/bootstrap/IosComposition.kt:177-195 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/public.kt:101-119 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/public.kt:55-69 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/shelf/public.kt:35-49 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/public.kt:61-75 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/bootstrap/IosComposition.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"63af14171a62da9ea15283091af8fde00c6494fbcd3723e6418c3c0e43e43f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apps/api-python/app/modules/library/infrastructure/automation_access.py:31-40 | apps/api-python/app/modules/library/infrastructure/filter_options.py:55-60 \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":"apps/api-python/app/modules/library/infrastructure/automation_access.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fca78cac77efc5e3bb7c20a81b55a8bfde9f662333feed86defab4b4298d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/api-python/app/modules/library/infrastructure/categories.py:39-47 | apps/api-python/app/modules/shelf/infrastructure/shelves.py:130-139 \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":"apps/api-python/app/modules/library/infrastructure/categories.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"426a07dd121dfcef1c9e393ba18d92f3afa1442b3e13445ba449d30db1125f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeLibraryScreens.kt:390-405 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt:107-123 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeLibraryScreens.kt"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadeb34bca5922d5f6caccde253765b709e1a8f145bb1b83cda732e092d4afab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift:361-378 | apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift:398-412 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e649ab5aee20421e48f466f860272659271b1c227a8e170927028eff19f4b9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift:167-172 | apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift:173-181 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"434ae05b80f6a695b108772bf4d62dc3303ba9c599d6b52b9b6d40e8042cd52c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/infrastructure/comic_archives.py:217-226 | apps/api-python/app/modules/imports/domain/volume_index.py:26-42 \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":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"39896625ceeb0a323f8f532fdb3b4d400ee20fcdffb70000cf1ba59a038a2c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Me/AvatarImageProcessor.swift:154-166 | apps/mobile/iosApp/ErmaoLibrary/Features/Me/AvatarImageProcessor.swift:168-179 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Me/AvatarImageProcessor.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbf775105e7bc9b4ce71446edeed7800ee671b97ca7f1083f7a486b6453bff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift:807-815 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift:817-830 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5134c5658e4ce3c5622916d576a883db3e523b6612ae57b3a384b38e5a4d89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): apps/api-python/app/modules/backup/presentation/http.py:118-127 | apps/api-python/app/modules/backup/presentation/http.py:137-148 | apps/api-python/app/modules/backup/presentation/http.py:184-193 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/backup/presentation/http.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0b9bbaccb4507d50e266093650d638e6fec292ff990c88fb80fe325f4c32ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:343-359 | apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:400-414 \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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca2d56d193d907e808219532ab5d88a3cfdd5e4edd6a9e36f109a5989e2cd57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MetadataSettingsViews.swift:54-54 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift:112-118 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MetadataSettingsViews.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd73dc8ae1167cd507b1344384c0351ba27386fbd65f0be3882efc5b53fef6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift:590-602 | apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift:604-616 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"77baa351adc95692feb676780157200219254fef2b1c6902284fb97f43f3d0de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): apps/api-python/app/modules/library/infrastructure/facets.py:35-42 | apps/api-python/app/modules/library/infrastructure/legacy_views.py:56-66 | apps/api-python/app/modules/media/presentation/http.py:82-95 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/facets.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e4dd4ac4f9e9b75cd3cb2bb49ccd4806b12b3ce32750d3fed2e36eebb0039a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:617-625 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:667-674 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"959da7dc6edbd13c4f0ce361f22f65a5921ac059631fbf974cd0971afc104310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift:29-33 | apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift:35-39 \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":"apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba14788351620e662b70713b4ed143df7629794f387f6690650117ee4ca59ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift:323-329 | apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/SharedShelfCatalogClient.swift:58-64 \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":"apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ac18a58d157ccd40bc3b5db02da8b225e08ec9762c9caaeaa5448e19ebb90d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/LibrarySettingsViews.swift:213-213 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/LibrarySettingsViews.swift:254-262 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/LibrarySettingsViews.swift"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3df7ad44a8531312782019f0aebe927030330ca5513d70dec9c5eaace9e810"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MetadataSettingsViews.swift:185-185 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/OrganizationSettingsViews.swift:182-182 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MetadataSettingsViews.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf352dc51309d06c23c58c672166370474f0cc816d1dd83acb6a555138e92157"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/AdministrativeSettingsContract.kt:20-34 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/personalsettings/PersonalSettingsPublic.kt:15-30 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/AdministrativeSettingsContract.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e98955c44f05c6f84f1d6bd168227d8e9467559e3b4f1953889f568152ca6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/modules/updates/presentation/http.py:83-92 | apps/api-python/app/modules/updates/presentation/http.py:201-210 \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":"apps/api-python/app/modules/updates/presentation/http.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a572270fcffeb4667f6bd48bec72ad5242a31bac068ae94107729d8058eeff8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MessagingSettingsViews.swift:176-186 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SystemSettingsViews.swift:87-95 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MessagingSettingsViews.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0725255d40f2a10495299348b7b96ed15244b02f7730bc29062a3b1d9f1e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/AndroidReaderV5Database.kt:89-103 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/AndroidReaderV5Database.kt:191-203 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/AndroidReaderV5Database.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"561ee87ec48e2d8aede2cec441a73118858e38ceefbe8fb6af93daed83f07476"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt:111-125 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageScaffolds.kt:149-162 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed7f2b1cbd5f7ce13866a3683831cdec9a9e2dedf72cd7773e59d928a05896"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SystemSettingsViews.swift:251-260 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SystemSettingsViews.swift:261-265 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SystemSettingsViews.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a84f13e2b97f2b5fae8c53b7ba4718d9b6c9971bfee3176591c1e8622428202"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Application/SessionStore.swift:74-91 | apps/mobile/iosApp/ErmaoLibrary/Application/SessionStore.swift:250-267 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/SessionStore.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6054d2d464e1ab91a76151cd885a10ce9e9d31741de2def91a064b7c7663583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift:225-235 | apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift:237-247 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d71f64e3a83a63cdc7002290d079e8bbf50ad783127687967cb225b1282861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift:292-296 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift:119-122 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8797486431212f96899acff9dfaaf663f650495ef11fde771cef59ec2b5bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlAdapters.swift:21-29 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlAdapters.swift:30-38 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlAdapters.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96ae4841a39d5b21f374dd5c2629064c0d5f060d63a13034958261ca9c258a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apps/api-python/app/bootstrap/automation.py:259-275 | apps/api-python/app/bootstrap/automation.py:279-297 \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":"apps/api-python/app/bootstrap/automation.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a996d319e5686fbb8b6facafe259bda48f116a59e7ccaf1022e2764d163c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/api-python/app/modules/auth/infrastructure/user_data.py:149-163 | apps/api-python/app/modules/system/infrastructure/settings.py:91-105 \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":"apps/api-python/app/modules/auth/infrastructure/user_data.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b568b11c51d2c2a39a795d4d68d27acc385f1116d969a9b79a32d0daaf4a20a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): apps/api-python/app/modules/library/application/recognized_metadata.py:365-374 | apps/api-python/app/modules/library/domain/facets.py:37-46 | apps/api-python/app/modules/library/infrastructure/facets.py:50-59 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/application/recognized_metadata.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83bcd77cc8e79ff1b4231457e137ec4cb0d5462baea0ba640e31daffecbe0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Application/SharedShelfClient.swift:57-65 | apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/SharedShelfCatalogClient.swift:66-74 \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":"apps/mobile/iosApp/ErmaoLibrary/Application/SharedShelfClient.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6753f9c643657866c8294e9dc19a720781ce5e7e3af1e2333cd8a93a946e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MessagingSettingsViews.swift:187-196 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MessagingSettingsViews.swift:197-206 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SystemSettingsViews.swift:240-250 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SystemSettingsViews.swift:352-358 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MessagingSettingsViews.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f56e57eb9112213e099d2fa85055bc469127caf670b56848f5b4442df92952"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MetadataSettingsViews.swift:184-184 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/OrganizationSettingsViews.swift:181-181 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SystemSettingsViews.swift:308-308 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MetadataSettingsViews.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"109a439301e1e4889f7e1d8fd5b690e8b70127ef47c70c2b1e55e000ad6ca483"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioModels.swift:362-374 | apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:173-184 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioModels.swift"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe62aae978e5df9951dca71185556d5cce8017ad1ef3da3e60dc1fc68f3014cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/api-python/app/modules/auth/presentation/users.py:186-196 | apps/api-python/app/modules/auth/presentation/users.py:213-221 \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":"apps/api-python/app/modules/auth/presentation/users.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e5bfd500c630df36c7085d5b37e37a0069fa6c84dc7356c014a36a7c11c222"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/api-python/app/modules/library/infrastructure/join_queries.py:109-120 | apps/api-python/app/modules/library/infrastructure/projections.py:86-94 \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":"apps/api-python/app/modules/library/infrastructure/join_queries.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb659416e3258858570c0e508d1b97bce04f4ea6199b66c1941448580491610d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/modules/metadata/infrastructure/lookup_queue.py:389-420 | apps/api-python/app/modules/organize/infrastructure/jobs.py:233-242 \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":"apps/api-python/app/modules/metadata/infrastructure/lookup_queue.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d193f962df5f159818ba874aaa55c02c40f6e10b80246e7ae9953227016499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubChapterProjection.swift:287-295 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosFb2PublicationFactory.swift:140-148 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubChapterProjection.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a027ad0cb8e3debd64e7c2919a5fb4be84e2766cac7361b723e7a345d78ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SharedAdministrativeSettingsClient.swift:101-104 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SharedAdministrativeSettingsClient.swift:105-108 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SharedAdministrativeSettingsClient.swift:109-112 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SharedAdministrativeSettingsClient.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4631ad2194d2119e22a5481e058b54728da70bd8528ed1835d7b1b21201d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/modules/library/infrastructure/file_move_operations.py:47-56 | apps/api-python/app/modules/metadata/infrastructure/standard_writeback_store.py:52-61 \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":"apps/api-python/app/modules/library/infrastructure/file_move_operations.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6869df66285b158d4c7cba9663f979317f283f46bbec9f47139b5897490577de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/OrganizationSettingsViews.swift:230-230 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/LibrarySettingsViews.swift:319-319 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/OrganizationSettingsViews.swift"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17748a8288451511b183999950b51ec1188e497a4756c5672e0f0ea28ae54e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioAdapters.swift:6-15 | apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioAdapters.swift:17-23 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioAdapters.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b010c444b2fd9072d635cbd08e51230be46dd0ed3b467253929fbb618a23adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift:357-362 | apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift:245-247 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04052b9a303d0b8ed76079f66943430b4cb1c670a035965a860816b70ddd53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): apps/api-python/app/modules/library/infrastructure/file_deletions.py:73-84 | apps/api-python/app/modules/library/infrastructure/file_move_operations.py:59-72 | apps/api-python/app/modules/library/infrastructure/file_move_operations.py:121-133 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/file_deletions.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1056b6d8a9f03149bdb8245d9ba27a138ff80d8b31425b25b6369fd01f8ee6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/api-python/app/services/audio_metadata.py:924-931 | apps/api-python/app/services/audio_metadata.py:935-943 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf9f27fcea55786eb2ff3bd47dcf1572243c37302bd70eeb9aa686d89eb65c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/api-python/app/bootstrap/kindle.py:133-145 | apps/api-python/app/modules/kindle/infrastructure/tasks.py:210-223 \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":"apps/api-python/app/bootstrap/kindle.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"973b60c95d728f91f8406feab6475a537d4e0414c5fab3072d1f17895b1131fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt:118-125 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt:581-589 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff15b03b6aa09b401874317feebcde62138e376de691bbfd76f6fcb2305c6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): apps/api-python/app/modules/download/infrastructure/tasks.py:156-157 | apps/api-python/app/modules/imports/infrastructure/library_queries.py:67-72 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/download/infrastructure/tasks.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1933ce004b0719f6fd7d9dff04bdc3c850b034fd4be1fbb2c929d2a062a86e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MessagingSettingsViews.swift:312-315 | apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/OrganizationSettingsViews.swift:49-49 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/MessagingSettingsViews.swift"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"91709f277482cd955544dad7dda2b4aee37a827b7fd7c3bb6265f679ada3279b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 5\u002B corresponding lines): apps/api-python/app/db/alembic/versions/0047_source_cleanup_page_index.py:14-18 | apps/api-python/app/db/alembic/versions/0048_import_task_state_totals.py:14-18 | apps/api-python/app/db/alembic/versions/0050_book_import_status_page.py:14-18 | apps/api-python/app/db/alembic/versions/0051_book_search_cover_index.py:14-22 | apps/api-python/app/db/alembic/versions/0052_directory_member_cover_index.py:15-19 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0047_source_cleanup_page_index.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b88cb86e323b9010646778ad6a71a844f3966f680e9ccfe190d70b5ba999f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Persistence/AuthenticatedCoverCache.swift:68-72 | apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift:128-132 \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":"apps/mobile/iosApp/ErmaoLibrary/Persistence/AuthenticatedCoverCache.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c48b2f447cb6c51902c3a00dd11c7b9fd884d4378137422f3f272dbcce3efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/domain/Downloads.kt:384-385 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt:374-375 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/domain/Downloads.kt"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e55a94a4638a978f8574ad5584809ddbbc62533c92a860df46ee60707f1284"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SharedAdministrativeSettingsMapping.swift:18-18 | apps/mobile/iosApp/ErmaoLibrary/Features/Me/SharedSettingsClient.swift:167-169 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/SharedAdministrativeSettingsMapping.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e6ff3d3ce399f2e91a6b29ecf8ab62d15edc3b3b01efb81ac0bdea82de7739"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift:564-571 | apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift:438-440 \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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f526fdc36db54e467bb07ffad4b93f3584ab014156e131d249327187114e3be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift:392-394 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift:124-127 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad3a87fa2df5682122770b10993a609f5bf4877d861bac870415edb50a79d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/modules/system/infrastructure/events.py:138-148 | apps/api-python/app/modules/system/infrastructure/runtime.py:131-140 \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":"apps/api-python/app/modules/system/infrastructure/events.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a355ff82fee35d125559e6b7497f315a40f9b1e1d95358990f9d03de03c9c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apps/api-python/app/modules/backup/infrastructure/persistence.py:174-177 | apps/api-python/app/modules/download/infrastructure/tasks.py:19-25 \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":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc14a35191f418b33e7c5d0ca62aeedbe324bfef40d730880f24d9a7bb8fcf18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): apps/api-python/app/modules/library/infrastructure/recognized_metadata.py:412-414 | apps/api-python/app/modules/library/infrastructure/resource_cover.py:133-135 | apps/api-python/app/modules/library/infrastructure/source_node_cover.py:109-111 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/recognized_metadata.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddce864dcb27c8b9d02f9443c1cb1d767be757664eaeb1ead8a6d4b1a72ed55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Application/PreviewMobileRuntime.swift:106-117 | apps/mobile/iosApp/ErmaoLibrary/Application/SharedRuntimeAdapter.swift:115-128 \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":"apps/mobile/iosApp/ErmaoLibrary/Application/PreviewMobileRuntime.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c6af8425dc71c2c66215182dab51949e44fd7d6092799e28be82a09ba757b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/core/authorization.py:156-165 | apps/api-python/app/modules/library/infrastructure/resource_commands.py:45-54 \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":"apps/api-python/app/core/authorization.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d0a1df2bddec1ad5599cc319443ab06c92db41fd3bd3ebf5dcae7d27baf34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/api-python/app/modules/auth/infrastructure/user_management_queries.py:59-70 | apps/api-python/app/modules/auth/presentation/http.py:142-151 \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":"apps/api-python/app/modules/auth/infrastructure/user_management_queries.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"155fd137d2155fc9c723781ff2dddee3678a45c8072f17cfed2a6951c409110e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift:186-194 | apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1805-1812 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0565b360556f39e5debdf2161ef58f467f8015794c1baf3797773f632d1a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): apps/api-python/app/modules/backup/infrastructure/persistence.py:83-84 | apps/api-python/app/modules/download/infrastructure/tasks.py:29-30 | apps/api-python/app/modules/kindle/infrastructure/tasks.py:37-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd56d9914cd0a0c1124fad612fa6c800c6b004d113ded7bd71c25ca09405d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apps/api-python/app/api/deps.py:21-24 | apps/api-python/app/modules/kindle/presentation/http.py:79-82 \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":"apps/api-python/app/api/deps.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fab317f87198acb7e1dd78dabcc944096a21aa2a996614bb31b6ff79c129dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apps/api-python/app/contracts/bibliographic_identity.py:10-15 | apps/api-python/app/services/organize_service.py:113-116 \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":"apps/api-python/app/contracts/bibliographic_identity.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0875c359505ff787cf03477b9731917a4d102e2e3ed6729483a2ad9e54663c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt:158-167 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt:870-880 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99df35740c942698a182016a00b2b858eed34139597b568bf684b70e1181f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): apps/api-python/app/modules/library/infrastructure/facet_sync.py:34-35 | apps/api-python/app/modules/library/infrastructure/facets.py:79-80 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/facet_sync.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c9c8518e61e349104951b34a0ee0142dcac3ee5e30cb4ffc4bb2af74ef0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apps/api-python/app/modules/reader/application/exact_location.py:16-24 | apps/api-python/app/modules/reader/infrastructure/exact_location_codec.py:93-99 \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":"apps/api-python/app/modules/reader/application/exact_location.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5114dfbe7bbbf13440314bd09c801f61b69a21f46f7bf02d1a642548ed165c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt:282-290 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt:333-341 \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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd26c3a9664a5d3ca917751adbe938b322925b6d4a83869c93649764f1d2e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py:429-433 | apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:140-145 \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":"apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1531803240a1c2d4c11bb12e282505af0b7a49a8b2cb329579e6949534382e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AndroidDownloadCatalog.kt:181-183 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/platform/persistence/AndroidCoverCache.kt:127-129 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AndroidDownloadCatalog.kt"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2fc2e46ab6f985eef0d8c5e0198f148248c799a107f838c0a40f0ef37f737e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py:414-417 | apps/api-python/app/services/audio_metadata.py:803-806 \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":"apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d388316171d3e2885e5f19b32dec83b50e7cba3b777bdbd3f03074a93ad315b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py:65-69 | apps/api-python/app/modules/reader/infrastructure/v5_repository.py:134-138 \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":"apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec58416af5604ee37afc5fc1f2abd80371645c3d324afea876e7e457c72e30bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apps/api-python/app/bootstrap/download.py:166-169 | apps/api-python/app/modules/download/infrastructure/tasks.py:104-106 \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":"apps/api-python/app/bootstrap/download.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa6148e9e184aefc8285f9612560477c84baeb6f456b358af4cb5e1082e093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apps/api-python/app/db/session.py:62-67 | apps/api-python/app/modules/imports/infrastructure/readable_resource/support.py:73-78 \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":"apps/api-python/app/db/session.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50c3134ca975a5a1c72394af721d96f1d99399b2bd25278bc61599e88217dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/content/ui/ContentComponents.kt:472-481 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:469-478 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/content/ui/ContentComponents.kt"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c530befa0653d553943ab28fda5b1bd936eabaa9c7c070eb8067b55e04fee97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (91 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py:78-168 | apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py:79-169 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 121 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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1f1fecccd4b6b678c4acdd997edc26a449087b274019ea1451d813d4cf5091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (83 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0013_image_resource_tasks.py:13-95 | apps/api-python/app/db/alembic/versions/0014_audio_resource_tasks.py:13-95 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0013_image_resource_tasks.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0014_audio_resource_tasks.py\u0060 as WHOLE FILES: 91% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. 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":"apps/api-python/app/db/alembic/versions/0013_image_resource_tasks.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e458a85e1d78020085155c78cf1eb5f4e4b54a64700e03a660b9d40fcfbaf1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201346 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0012_resource_import_tasks.py:43-85 | apps/api-python/app/db/alembic/versions/0030_book_import_task_shape.py:34-79 \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 \u0060apps/api-python/app/db/alembic/versions/0012_resource_import_tasks.py:43\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":"apps/api-python/app/db/alembic/versions/0012_resource_import_tasks.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbcbe3cb642945ced825969b9ccf420e4623310a01ac5170d6f4fcecfc3ba11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): apps/api-python/app/infrastructure/comic_archives.py:274-307 | apps/api-python/app/infrastructure/comic_archives.py:414-447 \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":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34a78779924ba0ee87ea51cb19bf4c405702e9f7f39934f314e809046048927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:299-324 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:402-429 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:299\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd72c715bc7d205123aff3cc5fac1a7ae9591222bd9dc1a2b0cc88c19b02a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201327 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1754-1769 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1870-1896 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2015-2029 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2096-2122 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1754\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, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1898\u0060 calls \u0060UniqueConstraint\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1771\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da23c8a051ff91b877d710dbfd2d106d7c00ede05000f90270c92c293029e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201327 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:464-490 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:590-609 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:464\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"07113a7ae775ead9721e915d9531fe056d0e400b4766176a9510b1d3f750492c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201327 lines \u00D7 2): apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py:174-194 | apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py:204-230 \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 \u0060apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py:174\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":"apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef9e2b4abee21fe282bff25a32cd5621cb6436020ec45021d5d8557b03c9f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/resource_cover.py:63-85 | apps/api-python/app/modules/library/infrastructure/source_node_cover.py:39-61 \u2014 before extracting anything, compare \u0060apps/api-python/app/modules/library/infrastructure/resource_cover.py\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/source_node_cover.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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":"apps/api-python/app/modules/library/infrastructure/resource_cover.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a1af815c6e826580a1549485233ec9fa5892729b45e823ffdc412ba2fa5c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apps/api-python/app/modules/media/infrastructure/resource_repository.py:33-55 | apps/api-python/app/modules/media/infrastructure/resource_repository.py:64-86 \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 \u0060apps/api-python/app/modules/media/infrastructure/resource_repository.py:33\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":"apps/api-python/app/modules/media/infrastructure/resource_repository.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa2e844f507ca6c8f9017652b6f1a048de66e06f66d64ae98c6d94838aa8fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): apps/api-python/app/modules/system/infrastructure/health_runs.py:810-831 | apps/api-python/app/modules/system/infrastructure/health_runs.py:842-864 \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 \u0060apps/api-python/app/modules/system/infrastructure/health_runs.py:810\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":"apps/api-python/app/modules/system/infrastructure/health_runs.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"967fd7748d5dd8f9884b413264c605f253a84ced50b185ab75781edd20568826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:299-319 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:402-421 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:515-531 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:299\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df812f0df1f92a8d910c4ce6fb509efc5c8ea43b716762c3995cf03e540d4e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:181-200 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:296-315 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:401-417 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:181\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e89959753b1e7f3be68b335d2fcf05a7d73a56385e4fa70512568faac7e000c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2007-2026 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2180-2199 \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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9c55020de69ce63c66ede5127b953f90e5aa3a65d318c52b946476ff5bcc73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:817-835 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1295-1311 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1973-1988 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2035-2051 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:817\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1292\u0060 calls \u0060Column\u0060, \u0060Integer\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1970\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95fbcfc17537f434cf5b85d114dfc44e6d04a998c733f7ba66b54358a601cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 7): apps/api-python/app/modules/automation/application/uploads.py:271-288 | apps/api-python/app/modules/automation/application/uploads.py:405-422 | apps/api-python/app/modules/automation/application/uploads.py:539-556 | apps/api-python/app/modules/library/application/execute_file_moves.py:232-249 | apps/api-python/app/modules/library/application/file_deletions.py:244-261 | apps/api-python/app/modules/library/application/file_move_worker.py:68-85 | apps/api-python/app/modules/metadata/application/execute_standard_writeback.py:148-165 \u2014 there are 7 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/modules/automation/application/uploads.py:270\u0060 calls \u0060view\u0060 and \u0060apps/api-python/app/modules/library/application/execute_file_moves.py:231\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":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8ac9d385f5a7c260219d49460dcb0371985f645fd7e2ac266334498a5579cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1823-1840 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:140-157 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1823\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd5a0d6a1b308cf0882641872942351e0dc361d92bf6ba72a91a8da780a399f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:98-115 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:182-199 \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 \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dc287e1ea2836cf411b1a1ddf5613983a557c9272e655f7cef12bcca58dec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py:167-184 | apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py:287-304 \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 \u0060apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py:167\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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab33941853f2909b39af4d207a3aedde13e7ee833302765a5756393045042076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/api-python/app/modules/library/presentation/http.py:1356-1373 | apps/api-python/app/modules/library/presentation/http.py:1421-1438 \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":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e766aa8849f723ea2d0bba1e5372b82760cf88348196bc594b6d33d684d99e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/api-python/app/modules/system/infrastructure/queue_runtime.py:166-183 | apps/api-python/app/modules/system/infrastructure/queue_runtime.py:197-214 \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":"apps/api-python/app/modules/system/infrastructure/queue_runtime.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a766ac210b0f25035efff9a6ed26b89374d8eef1d3e972f9d9981c6c26b9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1515-1531 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1588-1604 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1622-1638 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:96-112 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:180-196 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1515\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1514\u0060 calls \u0060Column\u0060, \u0060BigInteger\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:179\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5482e89e196777235a9cde6f27bc672daced9df8f794a2fbab0c6f12d747dc4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:149-163 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:355-369 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:472-488 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:591-607 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:149\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1d87201ff2cae85293af9fd047346203a0209e70181988a214959a9195033d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:249-261 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:294-310 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:329-341 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79125cd5e7ca9cf5c4fbb369cf6befc8ba322dfb9639df1283ce93adf260087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1684-1698 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1748-1764 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2023-2039 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1684\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dde80c7e25020b7189d287da400746ddc7123b2e2c1e7e91d9a99511b58aaea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201317 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:17-33 | apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:55-56 | apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py:17-33 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0023_file_move_operations.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 \u0060apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:17\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, \u0060apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:34\u0060 calls \u0060Column\u0060, \u0060String\u0060 and \u0060apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py:34\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":"apps/api-python/app/db/alembic/versions/0023_file_move_operations.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9697b9105df1079d29d5814b0034f28a9c197182099ea3cf088f8557de7a6daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py:1051-1067 | apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py:1241-1257 \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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8485f19d5e36d1541a5f7260bd6acd7599772e265ea55b1d8ece9af1cb1bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/cover_publication.py:52-68 | apps/api-python/app/modules/library/infrastructure/recognized_metadata.py:373-389 \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":"apps/api-python/app/modules/library/infrastructure/cover_publication.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb7b0e83e498b1965353fee5d9cb9ff153ef5d010112ce4b611846bf39fdd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apps/api-python/app/modules/reader/presentation/v5.py:867-883 | apps/api-python/app/modules/reader/presentation/v5.py:922-938 \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 \u0060apps/api-python/app/modules/reader/presentation/v5.py:867\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":"apps/api-python/app/modules/reader/presentation/v5.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf50b761096ff5dbe297b5241dd0969a6291866913dc69d2314b461bf6f5c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1682-1696 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1746-1760 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2020-2035 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2113-2128 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2020\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba1b627fe20c5fcf4ac3cd6d0c10796c5f912d45a5da3e9ad489c326e5af1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:691-705 | apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:661-676 | apps/api-python/app/modules/publications/infrastructure/txt_adapter.py:214-229 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:691\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d0782705256230468bb93682d1ee819d5352d982b00ceb612ff1c24a114be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:270-284 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:371-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:370\u0060 calls \u0060Index\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:270\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4b16dca9591da2f4972e3c0a644c3895ee699337486a3ff12a8d4b6d411394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:87-102 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:132-147 \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 \u0060apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:87\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":"apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"184847ca4e544545ff60d3e62970019196322fc2bab2889226da3c8c3cd4ff74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apps/api-python/app/modules/automation/application/file_moves.py:77-92 | apps/api-python/app/modules/automation/application/writebacks.py:125-140 \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":"apps/api-python/app/modules/automation/application/file_moves.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cac0973e7b3a9dc62b8371c3db39cc75db113691acc70e15d3e7872ca9400a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apps/api-python/app/modules/automation/presentation/mcp.py:275-290 | apps/api-python/app/modules/automation/presentation/mcp.py:297-312 \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 \u0060apps/api-python/app/modules/automation/presentation/mcp.py:275\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":"apps/api-python/app/modules/automation/presentation/mcp.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e535f2ab262317f870d1bed309b0532c3465ceb6261fa29a0e6728d790bdfe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apps/api-python/app/services/download_queue.py:97-112 | apps/api-python/app/services/kindle_queue.py:480-495 \u2014 before extracting anything, compare \u0060apps/api-python/app/services/download_queue.py\u0060 and \u0060apps/api-python/app/services/kindle_queue.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 \u0060apps/api-python/app/services/download_queue.py:97\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":"apps/api-python/app/services/download_queue.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"72908796c0a7e6b9b2d50960dfa6c1e70e03d390ef37153fc1a010c75b7dc9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/api-python/app/db/sqlite.py:352-366 | apps/api-python/app/db/sqlite.py:372-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/sqlite.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcd51e5adc28a798bc52d79ced50c65d8bf324a6feaaa084ce6f75072a6181f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/api-python/app/modules/download/presentation/http.py:390-404 | apps/api-python/app/modules/download/presentation/http.py:413-427 \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 \u0060apps/api-python/app/modules/download/presentation/http.py:390\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 \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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd77e7356d46e191be9fc5a899b1a2689bd4ef4bfe53bc2053d69a7fa08a3ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/resource_cover.py:115-129 | apps/api-python/app/modules/library/infrastructure/source_node_cover.py:91-105 \u2014 before extracting anything, compare \u0060apps/api-python/app/modules/library/infrastructure/resource_cover.py\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/source_node_cover.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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":"apps/api-python/app/modules/library/infrastructure/resource_cover.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4548ab6826810f10bf1d2c294de12b82b6b8171ed1e4c49aa9d698c77f63b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/api-python/app/modules/reader/presentation/v5.py:764-778 | apps/api-python/app/modules/reader/presentation/v5.py:819-833 \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 \u0060apps/api-python/app/modules/reader/presentation/v5.py:764\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":"apps/api-python/app/modules/reader/presentation/v5.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5940bab518a244c29d8e2798ec6ef9d92ba827a4f0efd1f4defb5f622bf692d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/api-python/app/modules/shelf/application/commands.py:153-167 | apps/api-python/app/modules/shelf/application/commands.py:246-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/shelf/application/commands.py:153\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 \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":"apps/api-python/app/modules/shelf/application/commands.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d286bbcee424fefd63a9ae9513058b852fe92d7c68923de7fe416ecc64befa28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/api-python/app/modules/updates/presentation/http.py:115-129 | apps/api-python/app/modules/updates/presentation/http.py:158-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/updates/presentation/http.py:115\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":"apps/api-python/app/modules/updates/presentation/http.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1148d7f5256af1cae70ebc467f7d79a0e5be4d0835937681d6f7e24fdf5dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 6): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:745-755 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:766-778 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1354-1364 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1428-1438 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:130-142 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:173-186 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:745\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:744\u0060 calls \u0060Column\u0060, \u0060Integer\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:765\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adf2be66004a137172274e575b087c1aa01fea6d457e090f9e43140fc98218c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 5): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:808-821 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1678-1689 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1742-1753 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1866-1879 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2092-2105 \u2014 all 5 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:808\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd259c1d0b942a2cac04ccdba8fb47b26323defd6d7d30e29b0f2067b2481ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:235-248 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:310-323 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:412-425 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:235\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91364dcec77d6e70ce12b398f5baaef28fc42e27a941bae85590f69a0ce4057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): apps/api-python/app/modules/download/presentation/http.py:95-108 | apps/api-python/app/modules/organize/presentation/http.py:66-79 | apps/api-python/app/modules/shelf/presentation/http.py:102-115 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eb819f25e0d06de5678b3b6794fdc4930b95cd1c5d233889172c8e8d66ab05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py:28-41 | apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py:29-42 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 121 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. 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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"055089780f6693ba891b65b37a039d1d0d3878e9b1172a0a6913d6ae71501e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/api-python/app/modules/kindle/infrastructure/tasks.py:352-365 | apps/api-python/app/modules/kindle/infrastructure/tasks.py:395-408 \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 \u0060apps/api-python/app/modules/kindle/infrastructure/tasks.py:352\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":"apps/api-python/app/modules/kindle/infrastructure/tasks.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"686176c726c520adb6a3ebe2ec5babcc8149b78c72f42aeda99121e1b85e8bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:211-224 | apps/api-python/app/modules/publications/infrastructure/txt_adapter.py:96-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"136d628e86c9a2e250efed5b62694d0f34afae4b38b958e55e853257491f3b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/api-python/app/modules/shelf/presentation/http.py:647-660 | apps/api-python/app/modules/shelf/presentation/http.py:789-802 \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 \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":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdee99532635445124ec6d11454995a526ba1dd8741c661dd6117366f3d40b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1515-1527 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1588-1600 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1622-1634 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:96-108 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:135-148 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:179-192 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1515\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1514\u0060 calls \u0060Column\u0060, \u0060BigInteger\u0060, \u0060ForeignKeyConstraint\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:179\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"6781afba78c689a035e9c995ae702a02f7b34e74568783187571f7661ffd27d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:753-763 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1436-1448 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1459-1468 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:753\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, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1451\u0060 calls \u0060Column\u0060, \u0060Text\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:766\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"578e3809c657f29502a7e248780b4e1f60b23fe10d618a12ab132d594bc650fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1820-1832 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:92-104 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:137-149 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1820\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cd40eba63d382d3f29f2213f5c7f2948c9e9672bf04b4192be0a8555562020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/api-python/app/modules/download/presentation/http.py:71-83 | apps/api-python/app/modules/imports/presentation/path_helpers.py:29-41 \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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94febe6eda3bd116c44d4b8588d555da2a9be0e535270346607260795ad0263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/api-python/app/modules/organize/presentation/http.py:426-438 | apps/api-python/app/modules/organize/presentation/http.py:458-470 \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 \u0060apps/api-python/app/modules/organize/presentation/http.py:426\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":"apps/api-python/app/modules/organize/presentation/http.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af4b064db3167ee2403579852dcf85b31ed17b8110f7699e9b6a78571c8aadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:106-118 | apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:162-174 \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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3366309c9dbda489529420b779efadda3b013eab61f07601f584a735b1326c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1513-1524 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1586-1597 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1621-1631 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1969-1980 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:95-105 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1513\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08ba404f1b03e6610ea333756caf1a69d22d9ed5ef311a5cc10e3dad015d294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:750-759 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1359-1369 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1433-1443 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1555-1566 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:750\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7135c801b3179a91fabd5240a204376f63f3188040bca982d3c58fdb9ea86736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:914-925 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1061-1072 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1074-1085 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:914\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89fdedad2f9c920c50fd85e04665dd9c5931b9e7f6d817061d0646e7da7c215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): apps/api-python/app/modules/download/infrastructure/download_http.py:26-37 | apps/api-python/app/modules/download/infrastructure/download_http.py:55-66 | apps/api-python/app/modules/download/infrastructure/download_http.py:72-83 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/download/infrastructure/download_http.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddfedfd99aa41375809e2a6cd2ca0f8cb96b4a591f0d9443d9ba5967831f501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:629-640 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:981-990 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:629\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6c5fce0c224ca15f209e6a5d67c98a9d7436afaa1f641321fa732f55d8d254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:44-55 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:168-179 \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, \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:56\u0060 calls \u0060Column\u0060, \u0060Integer\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:180\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":"apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c45aae9438d6306de6cbc28920945e8aafaae43f2cf526804611498b7b3782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/api-python/app/modules/auth/presentation/http.py:413-424 | apps/api-python/app/modules/auth/presentation/http.py:499-510 \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":"apps/api-python/app/modules/auth/presentation/http.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b649fbe1cde22e2970d5208582e267289484748d6af9b61471a48e9cf3011820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): apps/api-python/app/modules/automation/application/writes.py:527-537 | apps/api-python/app/modules/automation/application/writes.py:561-572 \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 \u0060apps/api-python/app/modules/automation/application/writes.py:561\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":"apps/api-python/app/modules/automation/application/writes.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc0466b314c0ef2811f23e659f5a9b9d6c6da92ae2ca7c1011263a8cb0d9ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): apps/api-python/app/modules/kindle/presentation/http.py:387-396 | apps/api-python/app/modules/kindle/presentation/http.py:450-461 \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":"apps/api-python/app/modules/kindle/presentation/http.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"448c5d4fd5177abb1dd151635c027f37b4406c229edc23f6de01309106464eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/book_list.py:274-285 | apps/api-python/app/modules/library/infrastructure/books.py:285-296 \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 \u0060apps/api-python/app/modules/library/infrastructure/book_list.py:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/modules/library/infrastructure/book_list.py:287\u0060 calls \u0060asc\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/books.py:298\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":"apps/api-python/app/modules/library/infrastructure/book_list.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6b822d5af6386f872ed0527e5bb555b522774219681eef01a07e3ca942a492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/resource_cover.py:87-98 | apps/api-python/app/modules/library/infrastructure/source_node_cover.py:63-74 \u2014 before extracting anything, compare \u0060apps/api-python/app/modules/library/infrastructure/resource_cover.py\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/source_node_cover.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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":"apps/api-python/app/modules/library/infrastructure/resource_cover.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f019d88e12131f1edf1ea40ff1dd26c45e533476d3b8b219acdf121cca57169c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): apps/api-python/app/modules/reader/application/resource_reader_v5.py:207-218 | apps/api-python/app/modules/reader/application/resource_reader_v5.py:279-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"apps/api-python/app/modules/reader/application/resource_reader_v5.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6912c0c112e153cc2e9a0f56ca6ce479b5602e22cb1c896fc01033eef814b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/api-python/app/modules/shelf/presentation/http.py:504-515 | apps/api-python/app/modules/shelf/presentation/http.py:532-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/shelf/presentation/http.py:504\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":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaf3abc1497016e2d2734cc4cd89dcc64312baedd1aef061c1b754d7f79db6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/api-python/app/services/download_queue.py:38-49 | apps/api-python/app/services/kindle_queue.py:393-404 \u2014 before extracting anything, compare \u0060apps/api-python/app/services/download_queue.py\u0060 and \u0060apps/api-python/app/services/kindle_queue.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 \u0060apps/api-python/app/services/download_queue.py:38\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":"apps/api-python/app/services/download_queue.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d056ca0e2b033a91b89523d86e8ae5e7969a3bca92a9ecf7dd3cf44a4f14c21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 18): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:717-725 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:805-815 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1126-1134 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1185-1193 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1209-1217 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1233-1241 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1330-1338 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1396-1404 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1452-1460 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1474-1482 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1508-1516 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1581-1589 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1675-1685 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1739-1749 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1863-1873 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1930-1939 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1964-1972 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2089-2099 \u2014 all 18 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:717\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1929\u0060 calls \u0060String\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:805\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"768eb7d9909e69fb1b3aec8b6780cb9f6c450bbc866108a3fcec5c69d5fa5deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 5): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1044-1054 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1144-1153 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1173-1182 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1565-1574 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1912-1921 \u2014 all 5 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1044\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1170\u0060 calls \u0060create_index\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1564\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"9560dee8d8e62e20abdbf0b56354b3975c73f5bb9a7a79dd2d8991e91574a379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:724-731 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1766-1776 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1938-1945 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:724\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ab99dbed2fac13823abaa0fc8b499a4fbfcc22bb5ffafb4d9c4d3f01bc42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): apps/api-python/app/modules/kindle/presentation/http.py:474-484 | apps/api-python/app/modules/kindle/presentation/http.py:514-524 | apps/api-python/app/modules/kindle/presentation/http.py:560-570 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/kindle/presentation/http.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7beb2e165238d4b7bcc88b6cba3a858bad023743ee6ad9fa16474d0948d691a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py:640-650 | apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py:1263-1272 | apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py:1356-1365 \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 \u0060apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py:640\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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3aa0c6a0065c33b76fd93ba3177649333802f35f15566528150f6448154bb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:117-127 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:151-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feab7cac1fb44f10ffa14c21221b51485a73afb6c91907656929bb71d6b1a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:44-54 | apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py:37-47 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0023_file_move_operations.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 \u0060apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:44\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":"apps/api-python/app/db/alembic/versions/0023_file_move_operations.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e76e39c3686a5649a57ec397bc48382bf53a4b28a60bc3216d9cfb5d68f3ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/api-python/app/modules/backup/presentation/http.py:164-174 | apps/api-python/app/modules/backup/presentation/http.py:278-288 \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":"apps/api-python/app/modules/backup/presentation/http.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0285dcd63f25f761636e268d1338036609d1f0c0bafa5bf778ade255a4a3b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/api-python/app/modules/media/presentation/http.py:130-140 | apps/api-python/app/modules/media/presentation/http.py:172-182 \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 \u0060apps/api-python/app/modules/media/presentation/http.py:130\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":"apps/api-python/app/modules/media/presentation/http.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdcc5950ab5b79af6346f9c671636cad81d26686f741f7e4b0c88b0626e32a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py:34-46 | apps/api-python/app/modules/metadata/infrastructure/selective_opf.py:58-68 \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 \u0060apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py:34\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":"apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa2f38db394d7127534082aa5c9ad12e8b074a5a51b052d36302862f0613660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/reader-contracts/verify-reader-safety-conformance.py:309-319 | packages/reader-contracts/verify-reader-safety-conformance.py:458-468 \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 \u0060packages/reader-contracts/verify-reader-safety-conformance.py:309\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060packages/reader-contracts/verify-reader-safety-conformance.py:468\u0060 calls \u0060get\u0060, \u0060_nullable_string\u0060 and \u0060packages/reader-contracts/verify-reader-safety-conformance.py:319\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":"packages/reader-contracts/verify-reader-safety-conformance.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d538827728492c903b421ac1ed8e308601bcdd5480060377c52ea88432e145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/reader-contracts/verify-reader-safety-conformance.py:321-331 | packages/reader-contracts/verify-reader-safety-conformance.py:469-479 \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 \u0060packages/reader-contracts/verify-reader-safety-conformance.py:321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060packages/reader-contracts/verify-reader-safety-conformance.py:467\u0060 calls \u0060_string\u0060, \u0060get\u0060 and \u0060packages/reader-contracts/verify-reader-safety-conformance.py:320\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":"packages/reader-contracts/verify-reader-safety-conformance.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c545480c9904db8675196d35ba0b0afbf695f204cb35d6f064200400e55714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:69-78 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:236-247 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:311-322 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:413-424 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:69\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb58c9254a090834f34ffedbe71d07fb0bf085bff75f9e7ab3162b435800d9d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:105-114 | apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:161-170 | apps/api-python/app/modules/publications/infrastructure/locator_dom.py:151-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/publications/infrastructure/epub_adapter.py:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/modules/publications/infrastructure/locator_dom.py:150\u0060 calls \u0060parser\u0060 and \u0060apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py:160\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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab28b4a4406ef8975195d1bff9ea8beb2086255a3c21d790f569134a4a4d49a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/api-python/app/modules/library/presentation/http.py:1336-1345 | apps/api-python/app/modules/library/presentation/http.py:1391-1400 \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":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9782e46ef2b6305117fc591a0566f2179fcbe9616e713db6a951229c86d4767e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/api-python/app/modules/media/presentation/http.py:478-487 | apps/api-python/app/modules/reader/presentation/v5.py:1052-1061 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/modules/reader/presentation/v5.py:1051\u0060 calls \u0060expunge_all\u0060 and \u0060apps/api-python/app/modules/media/presentation/http.py:477\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":"apps/api-python/app/modules/media/presentation/http.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e51b485ba526cc91b55f6ec67683a5e20debc2d169dfc077eaafd04f235c77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 8): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:911-919 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:936-943 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:976-978 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1124-1131 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1673-1680 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1737-1744 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1861-1868 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1962-1969 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:911\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1122\u0060 calls \u0060Column\u0060, \u0060Text\u0060, \u0060BigInteger\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:976\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e37484a0367335c97e7a52b159570dda6728ebde85c48f80eb0704ea152994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:629-637 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:914-922 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:981-989 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1061-1069 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:629\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46f3427205ac87c28c7f34254b906749af32d160374f20064a27fbbf402f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:661-669 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1283-1291 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1507-1514 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:661\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, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1292\u0060 calls \u0060Column\u0060, \u0060Integer\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1515\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2abe4304756b6020f7dc81ebcd7facbb6b6808e4a824dcef99b42ee016218b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:979-987 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2087-2095 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2178-2186 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2187\u0060 calls \u0060Column\u0060, \u0060BigInteger\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2096\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"f775da17d0f4ed48820ea7921109fa41417557cb6226508ab33862f886e12a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:939-947 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1102-1110 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:939\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8beaece183986574ce02709fc5d2caabdd8256e3df0e59b8af868a6b0c436d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py:66-74 | apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py:67-75 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 121 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. 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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5daf3a258bd0819c26addddb0528aa70caf1b2b771e80df1f0db52857b5b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/modules/auth/infrastructure/transactions.py:157-165 | apps/api-python/app/modules/auth/infrastructure/transactions.py:322-330 \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":"apps/api-python/app/modules/auth/infrastructure/transactions.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"df30293dd9f230f5d1eb8617a252156e9ec87c52b367c46e056820b1d7c38979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/modules/backup/infrastructure/persistence.py:230-238 | apps/api-python/app/modules/backup/infrastructure/persistence.py:246-254 \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":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81ce4fd63ec6e3a4484f3713ee04ae7e26bb621b7ea31c1e3bc487d6487d2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/modules/library/application/file_deletions.py:211-219 | apps/api-python/app/modules/library/application/file_deletions.py:228-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/application/file_deletions.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e22e54c7985bd835a36f7be97f68fa04005124575b5c6dadc090b700d5eb17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/facet_sync.py:58-67 | apps/api-python/app/modules/library/infrastructure/facets.py:164-173 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/library/infrastructure/facet_sync.py:58\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":"apps/api-python/app/modules/library/infrastructure/facet_sync.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"14facb7dac66057ef8854c73429e8750dfa6bae78bca40814adf2c632e13fe7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/modules/metadata/infrastructure/standard_publication.py:401-409 | apps/api-python/app/modules/metadata/infrastructure/standard_publication.py:466-474 \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":"apps/api-python/app/modules/metadata/infrastructure/standard_publication.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdab8bc491ddaa8696e7254d305d135c307e476398cb7809132951099c9a06e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/modules/organize/infrastructure/policy.py:56-64 | apps/api-python/app/modules/organize/infrastructure/runs.py:70-78 \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":"apps/api-python/app/modules/organize/infrastructure/policy.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a51b11a9ce12afd6ec41ddb8f5f6e0af6250f5d1cae8ea509957c6e206b1c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:628-635 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:913-920 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:937-944 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1060-1067 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1125-1132 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1674-1681 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1738-1745 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1862-1869 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1963-1970 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:946\u0060 calls \u0060UniqueConstraint\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:637\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b88f3c61977a291da980e2b4f12b6a1aa375b2ff85e6da97b25e54e92551d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 8): apps/api-python/app/modules/opds/presentation/http.py:266-273 | apps/api-python/app/modules/opds/presentation/http.py:303-309 | apps/api-python/app/modules/opds/presentation/http.py:314-320 | apps/api-python/app/modules/opds/presentation/http.py:334-340 | apps/api-python/app/modules/opds/presentation/http.py:346-353 | apps/api-python/app/modules/opds/presentation/http.py:367-373 | apps/api-python/app/modules/opds/presentation/http.py:379-385 | apps/api-python/app/modules/opds/presentation/http.py:391-398 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/opds/presentation/http.py:266\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":"apps/api-python/app/modules/opds/presentation/http.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f01d8213277e1bcec5da70393fbd040cd5c1cfbb69d71d8fa078d461e409961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:764-771 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1328-1335 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1352-1359 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1426-1433 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1544-1551 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:128-135 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:126\u0060 calls \u0060Column\u0060, \u0060String\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:763\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b1e8979eeed62f29d8c844b9a747c547512d0593b5a15f56187f6faab15d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:629-636 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:914-921 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:938-945 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:981-988 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1061-1068 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:946\u0060 calls \u0060UniqueConstraint\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:637\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d006504e35156a8855e958415302e427dc8941ba1c7ce50026d3e8f7bc766ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:804-811 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1073-1080 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1184-1191 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1451-1458 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1473-1480 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1181\u0060 calls \u0060Column\u0060, \u0060String\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1071\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"6706770d0ac53950dab56c7a1f550ab66b582e9d300812668d48825966d3ae91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:684-691 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:938-945 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1101-1108 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a51789350ed1b74e0c42705fdc8f469d330848470d0d5e2763a0a41012aabea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:684-691 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1074-1081 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1101-1108 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:682\u0060 calls \u0060Column\u0060, \u0060Text\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1073\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9acdb104f03c327aa662d13359fd033caf05165797adbacf6948e631daf7720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:73-80 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:533-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:532\u0060 calls \u0060Column\u0060, \u0060String\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:72\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0dd6a8f16b9bffefb2cf305d9b1ce681924ae466673f693a08eeff44504f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:663-670 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1816-1823 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:663\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd42b1426e1cc5cb02f58161da68d2d00c3fc39e2fd5851dff36172dcffafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/modules/automation/application/file_moves.py:65-72 | apps/api-python/app/modules/automation/application/writebacks.py:114-121 \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":"apps/api-python/app/modules/automation/application/file_moves.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"064330b2470d7c506b9036746759840afd5f5b66ecbcc5939c17eba3d7e69786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/modules/automation/application/uploads.py:448-455 | apps/api-python/app/modules/automation/application/uploads.py:492-499 \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 \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":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6cf8bf7ac3569d88deb55be6fee665e824053df6d862af3ff96ee47a6f8b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/modules/metadata/infrastructure/standard_publication.py:381-388 | apps/api-python/app/modules/metadata/infrastructure/standard_publication.py:450-457 \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":"apps/api-python/app/modules/metadata/infrastructure/standard_publication.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9eaa1315b0dc8ec91a623724f1f5b0c3527c611cb308d517878fdb91f68f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/modules/publications/infrastructure/chapter_core.py:204-211 | apps/api-python/app/modules/publications/infrastructure/mobi_adapter.py:162-172 \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":"apps/api-python/app/modules/publications/infrastructure/chapter_core.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a89a509eb067118add9fcde32e6423df6e659e4366d52a4e9d3d45497ab4487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:684-690 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:870-876 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1101-1107 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1233-1239 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1396-1402 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1930-1937 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2007-2013 \u2014 all 7 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1930\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1231\u0060 calls \u0060Column\u0060, \u0060Text\u0060, \u0060Boolean\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1930\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"36297bec007b472f0aab66e8cff75b27229d80af382d13b6b47f443cfe49cc60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:765-771 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1329-1335 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1353-1359 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1427-1433 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1545-1551 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1580-1586 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:129-135 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1587\u0060 calls \u0060Column\u0060, \u0060BigInteger\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:772\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"8242922c2f377a06d0b7599ed9eda8fa5c7078606c5a2cee364c3b77053ee41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1047-1054 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1147-1153 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1176-1182 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1539-1547 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1568-1574 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1915-1921 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1047\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"287398af183d9ed2166d0b1fc873112da4add4efb4c85535d648e9a6171698a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:684-690 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:870-876 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1074-1080 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1101-1107 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:682\u0060 calls \u0060Column\u0060, \u0060Text\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1073\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6cbcb77790cd27b6a8e53cf3610411aed5c84c5b2edcaa304a6b0537910f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:744-750 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:869-875 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1099-1106 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2006-2012 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1099\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:867\u0060 calls \u0060Column\u0060, \u0060Boolean\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:743\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ec9515910dd7b3ed07ef5ec2488762d266abc3b66978c9637522248236bfdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): apps/api-python/app/modules/library/infrastructure/book_list.py:276-284 | apps/api-python/app/modules/library/infrastructure/books.py:287-295 | apps/api-python/app/modules/library/infrastructure/facet_sync.py:56-62 | apps/api-python/app/modules/library/infrastructure/facets.py:162-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/modules/library/infrastructure/book_list.py:276\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/modules/library/infrastructure/book_list.py:287\u0060 calls \u0060asc\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/books.py:298\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":"apps/api-python/app/modules/library/infrastructure/book_list.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d809d96a4cd65340cb82aed51c6993159f75ab0d176e764f78b31425ef1f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1285-1291 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2180-2186 \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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"489a41dfd0214be550c985b88449c1d6caade7c2a1a14827a23172808bd3d45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 17): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:738-743 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:760-765 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:784-791 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1087-1089 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1201-1206 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1254-1259 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1320-1327 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1372-1377 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1422-1427 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1443-1450 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1465-1470 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1656-1657 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1988-1995 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1996-1997 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2071-2073 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2156-2163 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:27-29 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:738\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:744\u0060 calls \u0060Column\u0060, \u0060Integer\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:766\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d3cdff5d9ef00757b346ce1feae612c9852c728f493ecae87a265141e8fbeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:919-925 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:963-968 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1066-1072 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1079-1085 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:919\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ce4167562f134a2c1f012d06301708660d9369040c7ccd356ca34a83c99956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:673-679 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1108-1113 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1218-1224 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:673\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, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1227\u0060 calls \u0060Column\u0060, \u0060Text\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1116\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"483aa9dc4f07f9f014b9bd70dcecda7619ee557b27d4ea0ea8284041c4a7d447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:793-807 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:30-44 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:793\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab284ce1760b04a5902c7d3a615115e7f2623316907eb67382f616cbdbaa2ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0012_resource_import_tasks.py:34-41 | apps/api-python/app/db/alembic/versions/0030_book_import_task_shape.py:14-19 \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 \u0060apps/api-python/app/db/alembic/versions/0012_resource_import_tasks.py:34\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":"apps/api-python/app/db/alembic/versions/0012_resource_import_tasks.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2db98cecccf86401884fd274e44ae9fa741f53dfb5c109597815aae550cb4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/file_move_io.py:65-70 | apps/api-python/app/modules/library/infrastructure/file_move_io.py:145-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/file_move_io.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd958ee73720e67ae6f6768106b89181ea2a7350fdb36f42ebcf88bec654f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 12): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:648-653 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:965-969 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1048-1054 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1082-1086 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1148-1153 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1177-1182 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1569-1574 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1840-1844 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1916-1921 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:83-88 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:122-127 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:156-161 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:648\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:163\u0060 calls \u0060Column\u0060, \u0060String\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1576\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef60615ec99c8780267e3ce4a54c6005a7a938db05a24094b7f725e306a703c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:13-17 | apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py:13-17 | apps/api-python/app/db/alembic/versions/0027_automation_uploads.py:13-17 | apps/api-python/app/db/alembic/versions/0029_file_deletions.py:13-17 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0023_file_move_operations.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0025_standard_writeback_plans.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 \u0060apps/api-python/app/db/alembic/versions/0023_file_move_operations.py:13\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":"apps/api-python/app/db/alembic/versions/0023_file_move_operations.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"027b61e8e7f17caa4f7f848aa6e1f5b280c2fe5a770483163a6a67e793345367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1110-1114 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1221-1225 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1644-1649 \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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1110\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, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1227\u0060 calls \u0060Column\u0060, \u0060Text\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1116\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b24e5908e24ec05d7d4c76d6595e4b91199398044570f8f78b5f3cec1d5c335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 6): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1615-1617 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1810-1811 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1814-1818 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:125-127 | apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py:131-135 | apps/api-python/app/db/alembic/versions/0009_reader_v5_opaque_progress.py:90-92 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0005_asset_navigation_marker.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1814\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1810\u0060 calls \u0060Column\u0060, \u0060Integer\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1615\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e1894b4795a4426125aaf40b90402f02cbaed9da94fa0d9f621290aa1232ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/books.py:308-313 | apps/api-python/app/modules/library/infrastructure/books.py:319-323 \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 \u0060apps/api-python/app/modules/library/infrastructure/books.py:308\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":"apps/api-python/app/modules/library/infrastructure/books.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"dada6ab81b132c34d3ddc82e439ac011f58dcfaf6f83e4d1e43c98262ad6a758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): apps/api-python/app/db/alembic/versions/0054_resource_filter_cover_index.py:14-19 | apps/api-python/app/db/alembic/versions/0055_resource_book_summary_cover.py:14-19 | apps/api-python/app/db/alembic/versions/0056_resource_identity_cover.py:14-19 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/db/alembic/versions/0054_resource_filter_cover_index.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e39181b74263defdb49ee3ec7ca3838095ed0b2ebaa461051a3488e09aa280f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): apps/api-python/app/modules/auth/application/commands.py:10-39 | apps/api-python/app/modules/system/application/commands.py:10-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"apps/api-python/app/modules/auth/application/commands.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2322cff66e537a6411b3c05378e792876c736f3804477a7182a92b094ad9106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): apps/api-python/app/modules/download/application/commands.py:11-27 | apps/api-python/app/modules/kindle/application/commands.py:8-31 | apps/api-python/app/modules/metadata/application/commands.py:10-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/download/application/commands.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f51b8ddfc255c0c732de4f8e5d559b990d1ebb1fc3eb30a70cb38f0b7fe71c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): apps/api-python/app/modules/kindle/application/commands.py:8-31 | apps/api-python/app/modules/metadata/application/commands.py:10-35 \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":"apps/api-python/app/modules/kindle/application/commands.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd63044a61eddfe673ba3f6b8f68eb146502e59d0529cfcfd446200cfc4a1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py:45-51 | apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py:46-52 \u2014 before extracting anything, compare \u0060apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py\u0060 and \u0060apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 121 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. 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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf9617ce8429348c293554dd5debb23fc149690f74564481f59b3b5f57e8b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/api-python/app/modules/kindle/infrastructure/tasks.py:29-33 | apps/api-python/app/modules/shelf/infrastructure/shelves.py:25-29 \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":"apps/api-python/app/modules/kindle/infrastructure/tasks.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60298afff8c642f22f2183289651dfae6ce079eea8dc6f1c44fc06587a22e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/api-python/app/modules/library/domain/layout.py:149-154 | apps/api-python/app/modules/library/domain/source_nodes.py:219-224 \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":"apps/api-python/app/modules/library/domain/layout.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd30a6b7225fb377519bc8a72051c3c673b3d15593f240f875c53817fdb65f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/recognized_metadata.py:66-73 | apps/api-python/app/modules/library/infrastructure/resource_commands.py:35-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"apps/api-python/app/modules/library/infrastructure/recognized_metadata.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ab79c7b19326f1f9be70d05e7e7d472e2ce2353525007efad9a98078af676e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/resource_cover.py:152-159 | apps/api-python/app/modules/library/infrastructure/source_node_cover.py:131-138 \u2014 before extracting anything, compare \u0060apps/api-python/app/modules/library/infrastructure/resource_cover.py\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/source_node_cover.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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. 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":"apps/api-python/app/modules/library/infrastructure/resource_cover.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4341dad85844360679e5a5977eea52f18a811c4e5078155b79f989bfdd1ef4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): apps/api-python/app/services/default_cover_cleanup.py:73-77 | apps/mobile/native/pdfium/scripts/verify-lock.py:16-20 | scripts/prepare-public-domain-format-library.py:176-180 | scripts/python_backend_sample_smoke.py:75-79 | scripts/python_reader_position_acceptance_smoke.py:395-399 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/default_cover_cleanup.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"157d1bf6f133ccb7b4f71a009ba88a9e8c0efc255d808e69f1ef79c387772cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/api-python/app/modules/auth/presentation/users.py:80-85 | apps/api-python/app/modules/reader/presentation/v5.py:143-148 \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 \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":"apps/api-python/app/modules/auth/presentation/users.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"077107ebca34175567964f451e3bc4bce2a9d9d9437172311d531b3f433671e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/api-python/app/modules/imports/infrastructure/uploaded_file_publication.py:167-172 | apps/api-python/app/modules/metadata/infrastructure/standard_publication.py:197-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060target\u0060 to \u0060UploadTarget\u0060 in one and \u0060StandardWriteFile\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/infrastructure/uploaded_file_publication.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf0016b633d8ed175582cf8fcc8905161f82f717fce4f07be3fa86b8009b970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/api-python/app/modules/library/infrastructure/resource_cover.py:143-149 | apps/api-python/app/modules/library/infrastructure/source_node_cover.py:119-125 \u2014 before extracting anything, compare \u0060apps/api-python/app/modules/library/infrastructure/resource_cover.py\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/source_node_cover.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060published\u0060 to \u0060PublishedResourceCover\u0060 in one and \u0060PublishedSourceNodeCover\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/infrastructure/resource_cover.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c0cedbc65b64dc6270dc32a57f4f9d9dca4821f0deb851835626afb703491c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): apps/api-python/app/modules/reader/infrastructure/resource_repository.py:126-132 | apps/api-python/app/modules/reader/infrastructure/v5_library_queries.py:369-375 | apps/api-python/app/modules/reader/infrastructure/v5_repository.py:182-188 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. 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":"apps/api-python/app/modules/reader/infrastructure/resource_repository.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"12320b99c482ba1174421a0620aa87416f78a55eb91c21c078e76f72c0e03f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/api-python/app/modules/reader/infrastructure/resource_repository.py:137-145 | apps/api-python/app/modules/reader/infrastructure/v5_repository.py:193-201 \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":"apps/api-python/app/modules/reader/infrastructure/resource_repository.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffbc05497e65580cffc8ba301f6bef058edc95fad8a0597f496d544ee5cc299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/api-python/app/modules/reader/infrastructure/resource_repository.py:150-157 | apps/api-python/app/modules/reader/infrastructure/v5_repository.py:206-213 \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":"apps/api-python/app/modules/reader/infrastructure/resource_repository.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b37ca3b3a324f0d3699b4f1a3325537079cee9e50d8336cc7820040468e6b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/api-python/app/services/download_queue.py:180-189 | apps/api-python/app/services/kindle_queue.py:506-515 \u2014 before extracting anything, compare \u0060apps/api-python/app/services/download_queue.py\u0060 and \u0060apps/api-python/app/services/kindle_queue.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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. 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":"apps/api-python/app/services/download_queue.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4b5a929f3ee8e1b8f193b5cb62468c9493b07f27981cf6b47013a7a831c19e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1853-1857 | apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2172-2176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:1852\u0060 calls \u0060Column\u0060, \u0060Text\u0060 and \u0060apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py:2171\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":"apps/api-python/app/db/alembic/versions/0001_library_topology_baseline.py"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35521e364f40740198340931866300fba325c2f78bb65f3dd06937cb8f9674d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt:1005-1056 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt:1104-1155 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt:1005\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e602be6e37e255916c13f35f3df32ad85b0ae41bdf5c965f386ea22222611c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/theme/WarmPageTheme.kt:149-180 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/theme/WarmPageTheme.kt:188-219 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/theme/WarmPageTheme.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"17521f9b1b576a316c677c7a6c43a4414e48e6fa1b9fd31a6cd4a7a17383424c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:489-516 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:524-551 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:489\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb52f35769dfc68b9ffe38b8675e02c625bf6a720e48911e264cbbdef2919e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:495-516 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:530-551 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:587-608 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:495\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd9bf3b607c73503a48d6e4f9679b8ec1b80e40ac31da195ec23ed2a152c900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:235-253 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:178-196 \u2014 before extracting anything, compare \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3573073ab5fde4d4e325d0f816c099f3d76b4942eb2818e417f98d5e0f7796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:365-383 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:371-389 \u2014 before extracting anything, compare \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0e2badf067722ea629a0b1f8bde3c1aab3029e78d13f2b1d0be438b4cb9712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:166-184 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:221-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:166\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:185\u0060 calls \u0060takeIf\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:240\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"060a60507e53471c91cebe0f4b9e542bba594ef9558f50657563915f7615f509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt:342-357 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt:783-800 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt:342\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c10ff524586ab26ed6e2f28f0c6a5167ed0427f346941e6db9b5dd2323dbd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt:79-95 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsModels.kt:89-105 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt:79\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5051d0ab149cdef65b8c33f12e2ca84d251503d1912bad490acc547b084f615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:233-248 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:377-392 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:176-191 \u2014 before extracting anything, compare \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:233\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5840dbb5b3a1c7f2e0a3f1eead66f43377b41e85525f0863b8d0b6fc422a0978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:381-396 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:478-493 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:560-575 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:381\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b118089d26aabb38592e20c4f598dec86fd254a1103e2297a6bad76af9db485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:87-101 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:203-217 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:87\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3062e9e5f4e62df668262e87c99c5eb869975d81f3ad6c3bd8b12f9c834988a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:131-144 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:321-334 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:423-436 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdd19f059c45c926f8bd1b2d4b8194eb54c2a7240fe015921759332d48f56ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:602-615 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:536-549 \u2014 before extracting anything, compare \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"4282ce9780fc89bed6d0e786f72f955e88978155c18c3bc73189986b1b442e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1431-1442 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1730-1742 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1431\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"931c407857a7b789bbe54b587b52596214285dfbfab329019274745ba844fa83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt:131-142 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt:596-607 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/home/application/HomeViewModel.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1db64812d36d31cc90bf66559f572eb7b2291e7428a7369703aa77757c16e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1564-1574 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1611-1621 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1564\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbacde4de6924c5d0a87e3d1de686ba4d4ab0feb7e3113cf0d85fd2427ae1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:449-459 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:309-319 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:449\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d50a68945bd9264ea3f97db79bb9795139d9c5a2bdd9de09a7420d5c9c1e6c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt:1852-1864 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt:1908-1918 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt:1852\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68fbdf172abb419ab8cab2d43dde3f6eacf4db543d0d852b555b2d6738c0d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt:351-360 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt:394-403 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt:351\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b86362745521b5acdca3e0f957a5725787ef04deb1f39bbd3961ba04bf77c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt:52-61 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt:90-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageActions.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfaaa6319720bd435ec77eb5011521d1f7fe252b767194fd5ab22efbc2896d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:188-197 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:242-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:188\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:185\u0060 calls \u0060takeIf\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt:239\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageSettings.kt"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"38285d9091493d6ed0cd085def6795fc7b39a05db0d2a8fc8446dca0d052f66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:151-160 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:290-299 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:151\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3607152f4c005ba8e4abe0a64f59cc9747b1c4d9179e852aaad51b9cae6f3ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:339-348 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:442-451 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:339\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf034b4502f993d71c271a1d7cbdef3dede2ec2ebcc2dfa69826c38d792ad91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1123-1131 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1149-1157 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1123\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"caab2dae1e8ec9e574146f63b3c4aa82cb73f73ad3b8e49e38fb2b320d1882d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt:1989-1997 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt:2100-2108 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt:1989\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"b601b1f364b77b3f7c5e05127dd8535294bab3896d87dc12324fd97e4494c5da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:361-369 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:464-471 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc091394ea90e18957f351a729f102a44dd1b75d1ea3d198f47e1868d6356ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1455-1462 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1480-1487 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2277dac62ec198966755740288c66d102d219f6010a4207f1faf487b4522f769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:238-245 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:276-283 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt:238\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/library/infrastructure/KtorContentRepository.kt"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"948db411d77e967cf301032b944ba672bb3d51cc114453ce434a73b3e61090f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1124-1130 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1150-1156 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1177-1183 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1131\u0060 calls \u0060requireNotNull\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:1184\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc5284736b65e9d7a6d15e86f084f5937fafbcc664ab6c2aba588f13d5fe1c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:243-249 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:261-267 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:243\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc9fc068993366bb54352cfcec1c7cbcae49dd69d7ab13892e02bab7cc3cfd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt:476-481 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSystemScreens.kt:251-256 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt:476\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8b806b31f60207b457520940acf0ac35445e208f98434282fa686a7c69b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt:365-370 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:184-190 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt:365\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"914aa8c58d4447716763a43acd90ceabb281e43dd0605dd688c859ee10821126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt:560-565 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt:579-584 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt:560\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/LibraryScreen.kt"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ffcf05b4aebb19e15a4abb8a86eeb27bfee2358914686e990abf9ff6a40e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:50-55 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/RemoteComicReadiumPublicationFactory.kt:34-39 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:50\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"496c98d38ea7b59d7bab051146f985241004917f91e7d49e44984d9cd7027335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:276-281 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:285-292 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:276\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"177a3d91b5c903608fb6018b9982256591d9d883e3dee5f0cadd03df7f94a6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:256-262 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:276-281 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:256\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcba6fe45f78a1aa9a45834f5b1e01d14ac4f49f4b19f61b7673e03a5b671f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt:61-66 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt:83-88 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt:61\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/ui/components/WarmPageFeedback.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"60937515ff3f1ad59764bb9bae683d3d2025e35f8ca3ed319c60d2bb65ec5f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt:314-318 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:243-247 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:261-265 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerCenterScreen.kt:276-280 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/servers/ServerScreens.kt:285-291 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt:314\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2371397b2cc890b666a2eb8ddac5f0fe98a95a3d81b718c965af6dd30ef8329b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt:476-480 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSystemScreens.kt:251-255 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSystemScreens.kt:477-481 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt:476\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"17995b095f7485a4df3a62db237e5eb8a311734676bdd746eadc110b17427049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1598-1603 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt:1645-1650 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ece904c3aedf20227b6f8896da970130a3f48587f26182f7c1cb2141ac3e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/EpubContentSecurityPolicy.kt:273-277 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/EpubContentSecurityPolicy.kt:281-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/EpubContentSecurityPolicy.kt"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"589d13c402dab5ff4dd7cedc71ca71881837eef10b26c6a0729bec2712061762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/application/DefaultMobileRuntime.kt:563-567 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/application/DefaultMobileRuntime.kt:583-587 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/application/DefaultMobileRuntime.kt:563\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/application/DefaultMobileRuntime.kt"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f01a500ba9463c5efa4aad09ec9bfe435df401aad7d79256cb161a8e73660b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:495-501 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:989-995 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:467-473 \u2014 before extracting anything, compare \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"de464b7361dcd789f2321db325692993ea6a49533d0d46135c3e87fc6a2a921a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt:630-635 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt:997-1002 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt:561-566 \u2014 before extracting anything, compare \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt\u0060 and \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db0375cb96e44259aed4cf180b5c78f09d75c07fa8a6a6949dd8262e390cb28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/mobile/shared/src/androidMain/kotlin/com/ermao/library/shared/core/network/AndroidEncryptedCookieVault.kt:35-39 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/SerializedCookieVault.kt:35-39 \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":"apps/mobile/shared/src/androidMain/kotlin/com/ermao/library/shared/core/network/AndroidEncryptedCookieVault.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9d1ee812df3c954f5385d298a35e3c5f60536242726d709f61e87b4779c2fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/shared/src/androidMain/kotlin/com/ermao/library/shared/core/network/AndroidEncryptedCookieVault.kt:71-77 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/SerializedCookieVault.kt:62-68 \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":"apps/mobile/shared/src/androidMain/kotlin/com/ermao/library/shared/core/network/AndroidEncryptedCookieVault.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05fed8197005c798c79797ff857f75a7ea9d02c4e00b338606a558b7ea5ecbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/CbzReadiumPublicationFactory.kt:46-58 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:75-87 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/CbzReadiumPublicationFactory.kt:46\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/CbzReadiumPublicationFactory.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"85986c1b9fbb4df4b3801baf8a33f7f6eeede54a1c1bd033b4beca940a1bcdaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:182-190 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:195-203 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:876-885 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt:182\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f364dc785ca4d8bfa086cacbc89048ce933560afc389f20cb5c65f61d7bcfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:74-82 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/RemoteComicReadiumPublicationFactory.kt:59-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:74\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fbffe8bb9f6caffbcd57046bdfb9a9e9c4c82eb18e8e983781d1ec48c551f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:310-316 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:413-419 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt:310\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fc7626caedba9a1043440fead30d133fddbaed7363f4a2eb4fe33b969b0b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/DownloadResourceRow.kt:235-240 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt:965-970 \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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/DownloadResourceRow.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0c919716e81275d99ef9866617c161415886ebbe1c7872d2b0291d0e61473b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt:354-359 | apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt:175-180 \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 \u0060apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt:354\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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0184632715f7818ea58c516f7c48b75819e0c67ef81eb949f8c07fd1b567e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsRequests.kt:32-36 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsRequests.kt:43-47 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsRequests.kt:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/infrastructure/AdministrativeSettingsRequests.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6977282aa4ceb9a0582cc14a86e2bf8521c6f6b8aa8f6c968e45ad7071ff1ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:373-379 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:392-398 \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 \u0060apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt:373\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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5919120930d31d3f50f71a511bfc8260c6f6133cede112cf66bafa36a5abd60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt:344-350 | apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderPositionSyncPort.kt:103-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"236dc780eb69e20d59d6f75f07b495c2f91457be1b97fda636b1721d7bceb912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java:176-182 | apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java:222-228 \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":"apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffb76d0e2027882d9a97a344dec5792f3ca2acb521f918b22747fc5d07134e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:43-64 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:44-65 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:43\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:43\u0060 calls \u0060applySavedZoomAfterPresentation\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:42\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd225ef01fb45cc335edc7fdb4390cd193a9c1646e16f07e55d2a874caf85a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:746-766 | apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:907-927 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:746\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0a650811232caec7f9e7fa04eab5bfed58328542a4658af0af37f542ef7ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift:130-146 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift:206-220 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift:130\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3e2384eae1a22bfec9670cf5aab053e6de23ff4cc0ae9d27327789f6d7b1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift:136-151 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift:287-300 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift:210-223 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift:136\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosCbzPublicationFactory.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"40673726fb19a1a4a3929d997cb64e4cdd82b43a1899ec1ed71444d33129a49f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:19-42 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:19-42 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:19\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:43\u0060 calls \u0060applySavedZoomAfterPresentation\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:43\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87405570f024ec1bbc7f54baa6b96ae58316c8a7bfb65b2954b204d9d37031b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:66-80 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:67-81 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:66\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"77897979c285d73fde35c3adc1baf5f2a9b30095ed8a9821e278ce0b9c041ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1205-1219 | apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1247-1261 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1205\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5e220897269e8def668848cbab52656dafa7a7df4e17d38584d30b39e29733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:690-702 | apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:883-895 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift:690\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackViews.swift"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa88e20291c55263d8d874a009380589f139bb7877f0a957868f5035eeefd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:51-62 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderView.swift:53-64 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift:52-63 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift:51\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6610f30089a7c10864abbdd4008c00e7e0a3a713e9c0de559fcf10d91e68067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:348-359 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:270-281 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:348\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"95043b1741f0e5f7b29709f413375b7ee80694f99f432d44d16e4fb1be6d1030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift:342-353 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderModels.swift:131-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift:342\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubArchiveSafetyPreflight.swift"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d24a28128c7d251c3d469c50c873602fa14d98cebc8ca39b998e9039daee67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1221-1232 | apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1263-1274 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1221\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c986d300259d9e1c5bcb1e577a5478b839815cb4a7e799a049f91ec3408d3817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:147-159 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:167-177 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:203-213 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:166\u0060 calls \u0060sanitizeMarkup\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:147\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c78bceabb14bf2965ec22a0632ad44362686d6bb31beef699441124b480e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift:383-393 | apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift:403-413 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift:383\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"db06451729d82820806fe324565d0af45f9499ae9788840fed97a4c7e6179a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Home/HomeView.swift:64-74 | apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift:54-62 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Home/HomeView.swift:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Home/HomeView.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"163316215b1998081949dd430f8eca901b61778b91dea76aeabe27670d129811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:284-294 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:247-257 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb9ac0ca5390c7427db1373671bebac908684d23e893159084390dfa376a90d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Server/IncompatibleServerView.swift:50-60 | apps/mobile/iosApp/ErmaoLibrary/Features/Server/TLSRiskView.swift:18-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Server/IncompatibleServerView.swift:47\u0060 calls \u0060Text\u0060, \u0060LocalizedStringKey\u0060, \u0060appTextStyle\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Server/TLSRiskView.swift:16\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Server/IncompatibleServerView.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9d7942a1f409f13dba116b97adf08f372daf17ea461f874afb1b11673ca444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1070-1079 | apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1463-1473 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:1070\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"7855c78ec0264a6033f58bc3f55256dd5becca0bbe77e04922e0989fec948e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift:206-215 | apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift:266-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/SharedContentClient.swift"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3bcb46743e469d8b682c94d1bab3a7b87a9520554a61a0f393cd1038302d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift:68-77 | apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift:454-463 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"09856a6fa8f80bc0a0f0472759e09dc73498d05916400c1de6b697759cc738f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Server/IncompatibleServerView.swift:74-83 | apps/mobile/iosApp/ErmaoLibrary/Features/Server/ServerFlowView.swift:125-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Server/IncompatibleServerView.swift:74\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Server/IncompatibleServerView.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b83b3a3a38ab6c58198e159a4e273285dab4062e60da010eeca951f1ff9ac2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift:40-49 | apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift:113-125 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift:40\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":"apps/mobile/iosApp/ErmaoLibrary/Persistence/KeychainCookiePayloadStore.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa667cb28f5864d250bc118ca060e70462ae5cc69412bc0e57a5fbd80d9496d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift:181-189 | apps/mobile/iosApp/ErmaoLibrary/Features/Library/FacetView.swift:141-149 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift:181\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":"apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fee525224834c1d8c13655e0bb4a70717264855a528a286904cb92cc72d74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:50-57 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:56-64 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 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. 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdad6fb64f04afea6e0bb23b694ec418db3e7a713399693db642c1e395de24a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift:435-442 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift:487-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47a68a0c8f36214320af9f03d53e7ac91ef4a2d20f727e8ad5ea35d46a3aac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift:309-317 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift:333-341 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift:309\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18ef38f868db4480c1b98f0e5839723d75dca2891a4dff9f6e2e31a0b0a6f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift:337-343 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift:367-373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicNavigatorViewController.swift"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bf31a4d4b9040933a0730f3dd10bb8b8de2758e1ebde6fa12e160c9d22486d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:347-353 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:361-367 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift:347\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiContentSanitizer.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a10c5f3523c5f5937721ae0755eb05b89c80299890faae3de165b7700b297e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift:586-593 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift:600-606 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift:586\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cfd8243b97a6206c78af396daa444c67010915789dce55721e286567e91022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Application/SharedShelfClient.swift:46-55 | apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/SharedShelfCatalogClient.swift:59-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/SharedShelfClient.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cad7f21608a075fc33aee56de114f79acbdb664a122a9f72e31c487856345cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift:378-393 | apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift:277-292 \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 \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift:378\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/SharedManagedDownloadTransfer.swift"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c76fc6b22d42a5f3c63598d6835dfab0052dbcdc82c4fedf3dc4ad591208a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderLocalDatabase.swift:180-185 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderPrivateContentCache.swift:35-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderLocalDatabase.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3a987b2eb174524f09690863abdb450314e13f590f00296d0ade493138c3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Design/AppTheme.swift:60-64 | apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsComponents.swift:692-696 \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":"apps/mobile/iosApp/ErmaoLibrary/Design/AppTheme.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"40afa3c2b30c542bf8eb5cf978898d184d95cfeb3939e6d98f57b892dcc089bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:217-222 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:141-146 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eedbde977132e3ff5f7bcd7ec88e2ae059da15a2344320e89d11d879dcbdfdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:234-239 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:201-206 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06b66c0db942bf0897cfe8aa7400a7b16c7a7caa218c4778f76e695090b6646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift:241-251 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift:1070-1080 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift:208-218 \u2014 before extracting anything, compare \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift\u0060 and \u0060apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5a416b535ea77d6d4a690a6cc035e61ace90911c2e1c80718e344430b6c2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosFb2PublicationFactory.swift:295-300 | apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosTxtPublicationFactory.swift:245-250 \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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosFb2PublicationFactory.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"57026a4ba106e6e34bf1434b1d4fe77c1d33ae851645aedaa5a9585564684f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): scripts/python_backend_sample_smoke.py:126-148 | scripts/python_release_live_fixture.py:573-593 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python_backend_sample_smoke.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"49128e120627817549dc735a0933cfecf36f831f06994eb76680569ce71abca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scripts/python_backend_sample_smoke.py:152-159 | scripts/python_worker_import_smoke.py:95-105 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python_backend_sample_smoke.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d87cd0dcdfbe97e221ad6f76d2796acaf04f02a717dafb77e842d29edf3f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/python_release_live_fixture.py:125-131 | scripts/python_release_load_precheck.py:114-120 \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":"scripts/python_release_live_fixture.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eba762ab5f80a14ffbeb360dd1e481c496b0a2e5e9883a75237c35de41bb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/container_image.py:170-176 | scripts/container_install.py:284-290 \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":"scripts/container_image.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"91023ae39a5391024bce09cbe002f87939d4b4cdff2fe0e854b46555cb258264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): scripts/python_release_load_precheck.py:2363-2392 | scripts/python_release_load_precheck.py:2437-2466 \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 \u0060scripts/python_release_load_precheck.py:2363\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":"scripts/python_release_load_precheck.py"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5180338e5b2a0abef0d0407b0d8873cf3404ed017a5bdf4469285893abf4a44b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): scripts/accept_dependency_preparation.py:120-134 | scripts/container_update_fixture.py:271-286 \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 \u0060scripts/accept_dependency_preparation.py:120\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":"scripts/accept_dependency_preparation.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc7cbca4d12e297543a90112129743007e441ff25a7ed627e6e3f08d362c50"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: :archiveCore: :archiveCore: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d29d4e9a0db63595601823b3ecaff62f97444bb942b4489878ed39a622a04aa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: :chapterCore: :chapterCore: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"482fcab07d6c89505c479d0bc1fff52335cfa4687049884ca1a7199ce898db8e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @shuku/reader-core: @shuku/reader-core: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3e918f838ee91cf6c1e8cb43991421319c148f403951612727db1e6e47714bf5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: :pdfiumNative: :pdfiumNative: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0bec9107ff7eeaa4c84d2aeeb6ed7afcec6219c5a9ab6abcfdc72f0ce0774297"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: wake lock request rejection never blocks the reader lifecycle: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/screen-wake-lock.test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b55802ce5dc5d26ce66c3ff41f3f731d99b847a395193f8083fb4b05bea036"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3a635251b9cdfe19621bfd9602f7acbea1d161df675df100e21d615b17adcc7"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae3534862b7581612b32d43ac8423cf464bf34c8c65bbc5233dbdf5b97e6449b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d707c238d448d1ecbf8a26503536e574a8d6a8d16e58d27a2393d933f23c5e47"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67b38b7d66719c657d0d1c6b2628662f13f22673dd47535f798046e67e4ae498"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f64032a5f35974baacd08e8bf5651cf5b9ef7f52075691f937e3aca1d94a6038"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7fd56c65b2f2d02a5663a0881b8e3e0a4f447140d22f315801cb00d9301e265"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79ea9d76cfe8488ed381876b5b7d17dd97c62466d61d11ef340421728cadbe92"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84b2370341322adfabb66dc7784778b1321945c25eb61fc1720327ce8260631d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca2ca7ab5b6acf448c40446144a855e81e95999b06882eed9bf14c9d5a7e5a35"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"003a2fcb33834c144dd1d2aba69e32bc04b5b41d0509fecf5728131b03ae55d9"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4714cac721011746836349b5630fce6cf1855c51d412ee5381ea92984c9b5f0"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cedab55d8985bf52662a400cf323f4b94918f3031d10e44e40be130bc88b2047"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f280275ebfade3eaecbffc5d6fd70dcfe77491cf115c927878597af78d27586"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e585936cee966e597dec3412decb9ec7d46ad441a4efed030fe04d60e7e9b031"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6373232f37e1d0e699c801118f1f391ead87982decb8a693b5d50727e196d49c"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a0acf7c31cd1edb6f6ca613cb53f257c5b178798f5ddf7d9687f02a9c3f5b0f"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa66435fb7fc99e07d2f38dd4c3d616011bdafd0cb7f0140c28d96e9261a878d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10ca02c7955d11e61462d25fef079825d4330d90bad70eb44d578fe1bdd53a5a"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"429ce3762e8378e92336768ab56f930dae60ef9c630161cb72173dc024038f8f"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75cb5285f092986e28e372fd785d6a6debcf9d15ea6be1012206059f069f8925"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"481f824849fe8bc3553d58ed5666359110bdd0d397b6e38dd41885da98b2edf5"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aaf7fcedeaf21ce6d7913bf6ede78aee165cce0a8d5f48bc2d377f77cfc4fcff"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5190b90ea5352dd3a89354fefe4e4d4a417454930700f377e47b9ed6f8e51fb3"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24f567a1e91f4ca14e5b6ee4a43029052b985b85c1745ffa1c3c3c99042f9d36"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2817c12dc96062e9c54442b6ec67e1581add61b62e2656e5466b68ddad9124b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcf9564136c2fc11076fe73770f868378b7042e4dfa88ea0962d08e28677756e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e2fa51846c369ed54ab488acd74cf05502b1d03fc496c189208dfb92327aa4f"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a84f5b9c8da65f9d47d725c95922235caae3f3675d7e97433457e6339c0ca1d2"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a208f6e9c256389584eef594cafda305b522a5add58226dff20a660b055439c"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5869f716b28de85babeede523f25383b642fadaffe620b9c1bed704e2eedf78"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f818aa6533f0e11eb9018966f750a02df18420ab260225c4884d1f351a37e1c6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12007d353b892c87539d60e424a58332646caeadc28b119b927652882f36dc57"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85920e8d2cdf83204f85e19b48d072de84dd510de297dd8b8afdd7528be49042"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e1d7b4e98e7c997b1f78cf469e821936637e7dfd74335f702abd9be7ea8beac"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60417476458545e59a2afc64faf58d6b01b66355a022ea6db307536e85db0735"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/book-detail-page.tsx: apps/web/features/books/book-detail-page.tsx changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 156 in book-detail-page.BookDetailPage at line 189. 14 of those changes were fix/bug commits, and the other 17 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/book-detail-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4705b6d6bb0dab38b12367b101d49444a09fc1d73df8f95a85378532192f39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/audio/audio-playback-provider.tsx: apps/web/features/audio/audio-playback-provider.tsx changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 201 in audio-playback-provider.AudioPlaybackProvider at line 166. 8 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/audio/audio-playback-provider.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ed0847606365c935a9c334fedf5c4eac0e79eb828c0554cd51bb25670e0b4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/reader-shell.tsx: apps/web/features/reader/reader-shell.tsx changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 225 in reader-shell.ReaderShell at line 250. 5 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/reader-shell.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d38469e52a2bac3cc64d8003c094842fc56f99bc271740afb2f7a6f743d0e53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py: apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in ScanLibrarySourceTree._walk at line 575. 13 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.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":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c20a84d5b5a55517b80dea63b2bcca47e974618b4881193c0495773193cb387"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py: apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in ProcessReadableResourceImportTask._execute_directory at line 715. 11 of those changes were fix/bug commits, and the other 24 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/application/readable_resource/process_import_task.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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"45851a004723c4a28a81e8b2b6b0d964175338f6d50c073d5e589869e92f543f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/shelves/shelves-page.tsx: apps/web/features/shelves/shelves-page.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 232 in shelves-page.ShelvesPage at line 76. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/shelves/shelves-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b60b3427a9cbaad53aca6328679743b65c5c98d33d95dad610778b06c51c40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/services/metadata_lookup_queue.py: apps/api-python/app/services/metadata_lookup_queue.py changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in metadata_lookup_queue._prepare_candidate_application at line 319. 13 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/services/metadata_lookup_queue.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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf2275b12430f4b8409da54e23a6d4cbe9e752db8d73ecf7affac30045ee918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/layout/app-shell.tsx: apps/web/components/layout/app-shell.tsx changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 186 in app-shell.AppShell at line 143. 5 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/layout/app-shell.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed01ce2322d1b05d473ff7966c1938796baa3da8bca61d16cf75c1945555769e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/metadata-lookup-modal.tsx: apps/web/features/books/metadata-lookup-modal.tsx changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in metadata-lookup-modal.MetadataLookupModal at line 92. 9 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/metadata-lookup-modal.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ccf4312986a4220808ad44b847ebd6c0c770c6523e57d938156d33e2e54443"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in MainShellKt.MainShell at line 218. 7 of those changes were fix/bug commits, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/MainShell.kt"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f89da4fb42d34e4082bfa7ee015ca18481bbe0975e5844981f2471906568c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/reader-engine-runtime.tsx: apps/web/features/reader/v3/reader-engine-runtime.tsx changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in reader-engine-runtime.ReaderEngineRuntime at line 156. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/reader-engine-runtime.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"55543c0716dea8c99829198bfe15239f45bb6c101b528691d48d7c289cd98821"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/worker/main.py: apps/api-python/app/worker/main.py changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in main.main at line 103. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/worker/main.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":"apps/api-python/app/worker/main.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a0a430a0cae95bda056e45103f0e5e063375f8deaf7ba9f288f39cb127afa2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py: apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in ProviderSourceNodeMetadataRecognition.search at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.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":"apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f76bc4f2da9c6b9d5047a1f29357261c7d009eda7f4753cb860acb493b0764"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/library/library-page.tsx: apps/web/features/library/library-page.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 119 in library-page.LibraryPage at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/library/library-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"512112d3b0def85fa31365a2f12225c335c855218a9e3ad11e944a6bd8a2fa07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py: apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in RegistryResourceAdapterExecutor.parse_file at line 214. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3109807bf348af24786f0f0739fe7b4c05933039a1e2bf98d9e3267355698fd4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in WorkDetailScreenKt.WorkDetailActionRow at line 715. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/WorkDetailScreen.kt"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ef6389d27090c4a1a06503106953e5f449de3467b03090a3374882714954bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/book_list.py: apps/api-python/app/modules/library/infrastructure/book_list.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in book_list.list_books at line 411. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/book_list.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":"apps/api-python/app/modules/library/infrastructure/book_list.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"456d44b05089dc7e06f2e65b752038ee5d0000f6e55b18cf90e0e9596a5e3879"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ReaderScreenKt.ReaderScreen at line 201. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bb49f4356d564dc436aeb8a7c211fafbe374dd9e248e2b6409a7a2bcff0b83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/import-tasks/import-tasks-page.tsx: apps/web/features/import-tasks/import-tasks-page.tsx changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in import-tasks-page.ImportTasksPage at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/import-tasks/import-tasks-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"13307e58a87eed7f977dccbaee70664aacccb40803a9651c6f71c6d593d0eb8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py: apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SqlAlchemyBookResourceRepository.save_directory_assets at line 1400. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.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":"apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd92c4e14be132654892c7d52d525d8896a1ac8b035149cf92e92081528285de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/reader-v3-page.tsx: apps/web/features/reader/v3/reader-v3-page.tsx changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in reader-v3-page.ReaderV5Page at line 228. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/reader-v3-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f71d3fc05084d4458771a0347ab5038d50a2f11fb7b986783fc97b5bbf26ec9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/settings/settings-page.tsx: apps/web/features/settings/settings-page.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in settings-page.SettingsPage 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/settings/settings-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49dece5ec575d8e3b6cb2c5b32f4b94258d5442589a18029cf73dea19d951bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/api.ts: apps/web/features/reader/v3/api.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in api.fetchReaderBootstrap at line 255. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/api.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/api.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc6332efbfed7099b3350dc9c7772879c838f6e47d720915e87009f34f06be5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/api/client.ts: apps/web/features/books/api/client.ts changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in client.mapBookView 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/api/client.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3834224711dbd325fe19ca6ae6779acdf931ec96abd6d456869313fd7d03acc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.py: apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ReadableResourceWorkerProcessor._execute_book at line 246. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/worker.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d47697c7545e27190b0e3d70bb1c2a2efd127e638cbee365fde68bbc051939"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/library/library-batch-actions.tsx: apps/web/features/library/library-batch-actions.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in library-batch-actions.LibraryBatchDialog at line 144. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/library/library-batch-actions.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dff42d379caed006d8eb4e0ce228da29b19321d951a4d516b9622a0a1870228"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in IosReaderComposition.bootstrap at line 177. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderComposition.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f61549db1ab7ba1da0360c7526a1c21742dc826ac1085da48812afca9c6f6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/writeback_queue.py: apps/api-python/app/modules/metadata/infrastructure/writeback_queue.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in writeback_queue.prepare_targets_from_snapshot at line 749. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/writeback_queue.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":"apps/api-python/app/modules/metadata/infrastructure/writeback_queue.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dc9081f0c5bbf92bebabf0020d81c8b91bcd157ab383a82eddb685ccd8356e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py: apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SqlAlchemyLibraryImportTaskQueue.continue_book_task at line 479. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8797b109992fbb0fc8a702518eba67512a1f0d717f67f85856b5cafae7c18d88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in MultiDownloadSheetKt.MultiDownloadSheet at line 99. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/ui/MultiDownloadSheet.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd5c1be09ad286f3f900294536851624ffb18c3ddbc417ff361a6c575d1981"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/media/presentation/http.py: apps/api-python/app/modules/media/presentation/http.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in http.get_cover at line 273. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/media/presentation/http.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":"apps/api-python/app/modules/media/presentation/http.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d44e2aecf3caf1dcddc5a742e27bbb355962028cbc8f10847e3dd765d83c3bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/container-entry.py: scripts/container-entry.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in container-entry.run_application at line 55. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/container-entry.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/container-entry.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"291ca1e87d8d04c323d389f7ff735404c2012aaf42fd20e0b307a580af0f6514"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WorkDetailView.detailActions at line 731. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ac4b8ee0ed700512c9f15944ecc0dc37bb5cd7b44837f7030eac763118a170"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/shelf/presentation/http.py: apps/api-python/app/modules/shelf/presentation/http.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in http.update_shelf at line 727. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/shelf/presentation/http.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":"apps/api-python/app/modules/shelf/presentation/http.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"b305fa571d5c4a6bd571e400d68791475cf0127d17d37c565abe24ce4a388004"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/services/organize_service.py: apps/api-python/app/services/organize_service.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in organize_service.bangumi_candidates at line 828. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/services/organize_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":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f6f7620c063172f16f88f3265b8c367b282e45e850e11d0da820c5f476a1c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/reader-contracts/generate-reader-safety-policy.py: packages/reader-contracts/generate-reader-safety-policy.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 130 in generate-reader-safety-policy.validate_policy at line 109. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- packages/reader-contracts/generate-reader-safety-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":"packages/reader-contracts/generate-reader-safety-policy.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb72f138bc631a0b7969604a18020bd438fdb081490e729da6b4a1c4edc33ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/adapters/readium-publication.ts: apps/web/features/reader/v3/adapters/readium-publication.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in readium-publication.openEpub at line 310. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/adapters/readium-publication.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b15d1ad24fc9f39aa7502fc3d0b9cea8761969c64969b78d307af52b1e978f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/updates/ui/update-operations.tsx: apps/web/features/updates/ui/update-operations.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in update-operations.UpdateOperations 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/updates/ui/update-operations.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/updates/ui/update-operations.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"053d18e902cc4b451eae3e4d591051b0336a7536550bb5424689b3dd492d1d55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/infrastructure/comic_archives.py: apps/api-python/app/infrastructure/comic_archives.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in comic_archives.inspect_comic_archive at line 498. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/infrastructure/comic_archives.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":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"decff8fb4d1e4b4a67d1536e7c377fb54a43f83c85f26384f45f1c873581c4ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ReadiumEpubSession.openLocalPublication at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f209d082ce4efa7ff96b623ae6b22aeaef581f6bdf07a9ff2b4419004dd5bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/legacy_views.py: apps/api-python/app/modules/library/infrastructure/legacy_views.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in legacy_views._resource_view at line 177. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/legacy_views.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":"apps/api-python/app/modules/library/infrastructure/legacy_views.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"755b5dbc32c1b1997974a7a310c60a9b51b004819366d98e148a78151d6ce7e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ReaderActivity.dispatchKeyEvent at line 303. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4371e9a9f12180654c3c250d821b54580b2854e9efea35723ee2670aaa3979"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/organize/metadata-providers-panel.tsx: apps/web/features/organize/metadata-providers-panel.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in metadata-providers-panel.MetadataProvidersPanel at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/organize/metadata-providers-panel.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd09a98fa35b50e46fc56c176e9ccbdaf8668e27606a4f6addb8d975e1a01e51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/management/management-logs-page.tsx: apps/web/features/management/management-logs-page.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in management-logs-page.ManagementLogsPage at line 99. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/management/management-logs-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3214ae385025f4625f80f0a4a93aab843cbe5a0f1f8b47336e4f7ac2f5ef75ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/book/book-table.tsx: apps/web/components/book/book-table.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in book-table.BookTable 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/book/book-table.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-table.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a092b1967692e6e14e35c2ac02bf9667cdc2e73d473843734d0ec4aa3c9356"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/presentation/http.py: apps/api-python/app/modules/imports/presentation/http.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in http.update_library at line 367. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/presentation/http.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":"apps/api-python/app/modules/imports/presentation/http.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e8741c97ac8bb39009aa86a1cca8e0a9a1d409253a311a37afb3f11c041d64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/organize/presentation/http.py: apps/api-python/app/modules/organize/presentation/http.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in http._organize_job_view at line 130. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/organize/presentation/http.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":"apps/api-python/app/modules/organize/presentation/http.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f536d79b382ef415e3e1cd5ea363e4f9d5ef3d124c94ad5904d80edf123583d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/presentation/writes.py: apps/api-python/app/modules/imports/presentation/writes.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in writes.import_book_files at line 114. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/presentation/writes.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":"apps/api-python/app/modules/imports/presentation/writes.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29340f19caa8c8725018e66e7d784c025ec475e6b2f6dffb909000581351b0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in WorkDetailViewModel.loadMultiDownloadFolder at line 682. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41e81e1a229c3cdea22577c6681a65a9d2dd4b42c8cfd8026e725c60e6b8c69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in AdministrativeSettingsUiKt.AdministrativeSettingsDestination at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsUi.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2015307de3cada983f8287f15ea8480d3d1c4a93268bb0bad143e9b0b5388db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/infrastructure/readable_resource/filesystem.py: apps/api-python/app/modules/imports/infrastructure/readable_resource/filesystem.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OsSourceTreeFilesystem.probe_directory at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/readable_resource/filesystem.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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/filesystem.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4b604497117e3d2c0f8223409d205837a30d4ab30a05a133ddbc2a265a009c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ReadiumComicSession.prepare 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0960ee87e8cf5e0077d68463fa91f0d8c5ee4a087207946266bcfe452e7e87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/system/pwa-client.tsx: apps/web/components/system/pwa-client.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in pwa-client.PwaClient at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/system/pwa-client.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f629c0860bae733445428a0a054e74eb0b03a98dd696cf417c00a0c3b6c883"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/ui/source-node-metadata-dialogs.tsx: apps/web/features/books/ui/source-node-metadata-dialogs.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in source-node-metadata-dialogs.SourceNodeMetadataRecognitionDialog at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/ui/source-node-metadata-dialogs.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ed53af83a24d18da911bd226ac7e483b840a85ab63ce3404f80feab2641ce9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/ui/book-action-controller.tsx: apps/web/features/books/ui/book-action-controller.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in book-action-controller.BookActionController 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/ui/book-action-controller.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-action-controller.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2b8539fa09f7e05e3a7286719121ec61d076f02baf0b9f0b3072e035b6d3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/books.py: apps/api-python/app/modules/library/infrastructure/books.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in books._book_record at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/books.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":"apps/api-python/app/modules/library/infrastructure/books.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c3789aac093a6ea6c11d571b7cad9ed429ce9cdc539af639360d4df22d712e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/audio/api.ts: apps/web/features/audio/api.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in api.normalizeAudioBootstrap at line 103. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/audio/api.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/api.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dcb8a7cacaf9be20f036d9531b5256b82cab3dec145acf3b2c32204c6351f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/application/recognized_metadata.py: apps/api-python/app/modules/library/application/recognized_metadata.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ApplyRecognizedMetadata.execute at line 412. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/application/recognized_metadata.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":"apps/api-python/app/modules/library/application/recognized_metadata.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72ae17beea4bd3bef10316bed8cbc8a6526cd51add1c563d18e8bae2fdf244b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/filter_query.py: apps/api-python/app/modules/library/infrastructure/filter_query.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in filter_query._condition at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/filter_query.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":"apps/api-python/app/modules/library/infrastructure/filter_query.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"06277e668562e0d3ca92f90c73c98bb64ea79692469c25c51997cf65da41038d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/reader/application/resource_reader.py: apps/api-python/app/modules/reader/application/resource_reader.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in resource_reader._derive_display_percent at line 465. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/reader/application/resource_reader.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":"apps/api-python/app/modules/reader/application/resource_reader.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc38a00dfcba591bf076a30bb839a15de97a88485c9cc33fc50ee6da388fb9fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/adapters/pdf-adapter.ts: apps/web/features/reader/v3/adapters/pdf-adapter.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in PdfReaderAdapter.execute at line 367. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/adapters/pdf-adapter.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"81935ec0017651e55c7ef1a32050055799dd6ea1188f68781dc07f47c0d1e345"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in IosReaderPreferences.readium at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8023c6397021927575eef0058f6de96f3ea1842eaa9e0dc788bcb03fca5fc8c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/backup/infrastructure/persistence.py: apps/api-python/app/modules/backup/infrastructure/persistence.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in persistence._converted_column_value at line 203. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/backup/infrastructure/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":"apps/api-python/app/modules/backup/infrastructure/persistence.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"de43b536b36591e4d5976f0dc10b088af4aa18d9750fec7444a1a97fc2e98511"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/services/audio_metadata.py: apps/api-python/app/services/audio_metadata.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in audio_metadata._read_with_ffprobe at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/services/audio_metadata.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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"71864f6726324fb6c2e28eee78fd3bdcc0b76168d5d9e7b0ab52086f51b5c741"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/ui/resource-detail-view.tsx: apps/web/features/books/ui/resource-detail-view.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in resource-detail-view.ResourceDetailView at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/ui/resource-detail-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/resource-detail-view.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9f5bec2549d881dd81b73b188a3207899e25414d3905df535b7d8a76c94885"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/publications/infrastructure/epub_adapter.py: apps/api-python/app/modules/publications/infrastructure/epub_adapter.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in epub_adapter._index_epub at line 417. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/publications/infrastructure/epub_adapter.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":"apps/api-python/app/modules/publications/infrastructure/epub_adapter.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"956bfe0d78c3b24fda96d2b14605f7801fcc8ddb804cb35251630a50fa0bdb4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/audio/audio-mini-player.tsx: apps/web/components/audio/audio-mini-player.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in audio-mini-player.AudioMiniPlayer at line 42. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/audio/audio-mini-player.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0c3df07ca4d160e32b2e8788ff35ae60f0259da85aaec96969b4a370e1dade"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/validate-release-assets.mjs: scripts/validate-release-assets.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in validate-release-assets.validateReleaseAssets at line 9. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/validate-release-assets.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-assets.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a806308bd0fd5b3161f94327562dc1e2185e738f3910259f8505b4570de8acf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/kindle/presentation/http.py: apps/api-python/app/modules/kindle/presentation/http.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in http.create_kindle_send_task at line 327. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/kindle/presentation/http.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":"apps/api-python/app/modules/kindle/presentation/http.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"07efa9adb4329e828683c484ef5d4a86123c98dfb70f4e4703e7f9f0716b2e06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in BookManagementKt.ManagementPresentation at line 328. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/workmanagement/BookManagement.kt"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa8eb4e1b5d9e7710b79a48f0c1378a85f6c9b30e133412291f790712f647a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/system/infrastructure/health_runs.py: apps/api-python/app/modules/system/infrastructure/health_runs.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in health_runs._run_health_checks at line 731. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/system/infrastructure/health_runs.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":"apps/api-python/app/modules/system/infrastructure/health_runs.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a68a00c48edf8bcd6628aff6bfc9aa605d44065bd87d39c2aed3a73a114e92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/accept_container_update.py: scripts/accept_container_update.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in accept_container_update.main at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/accept_container_update.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/accept_container_update.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"416e881bf149727d487137ed0b5da63b7b044102c7394850a76ecd19c7af83f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift: apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ManagedDownloadStore.verifiedPageSetBytes at line 212. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Persistence/ManagedDownloadStore.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2803f2ae959975735e54779d2b2259c5781458d8db2799a13683ff84463236"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ApiClient.execute at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/core/network/ApiClient.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8301e63ef85019e624613762d99baf8a2945fcefd1df67c86773af772036d9df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py: apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in reflowable_metadata._inspect_mobi_family 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.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":"apps/api-python/app/modules/imports/infrastructure/reflowable_metadata.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6290f180de3b662cf2f78eec6836d32032b2107b08f23f844669e7223489faca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/adapters/comic-adapter.ts: apps/web/features/reader/v3/adapters/comic-adapter.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ComicReaderAdapter.execute at line 317. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/adapters/comic-adapter.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ccfd26c325f4c1f90fb2f0a27f81ccbd05b77a3d4d9740acd7b37e09b6d13f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in KtorReaderBootstrapGateway.validateBeforeSecondaryRequest at line 107. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55f9be7e6cce7bdb0b1f053ee45de788965dc4ca7045c0affb5f4f87ecac22a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/services/metadata_file_writeback.py: apps/api-python/app/services/metadata_file_writeback.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in metadata_file_writeback.process_next_metadata_writeback at line 295. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/services/metadata_file_writeback.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":"apps/api-python/app/services/metadata_file_writeback.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f84d769d6d59bf08346963d5cf895680b5bbf204dc45c384e7d8ab531fefc4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DownloadCenterStore.awaitVerifiedReaderDownloadOperation at line 287. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3768fc2daac146cf22150550afa26569bb3b57f116b750b7e2698dc2fa777417"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/services/kindle_queue.py: apps/api-python/app/services/kindle_queue.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in kindle_queue._send_task at line 181. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/services/kindle_queue.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":"apps/api-python/app/services/kindle_queue.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ca9b92211fe892d92908485c01b89338cdb2638708d04ce0d4424ef95d8041"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/ui/book-content-browser.tsx: apps/web/features/books/ui/book-content-browser.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in book-content-browser.BookContentBrowser at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/ui/book-content-browser.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a129398c479b13a80c2e6155701779ab41de46fd6abdc3a45723d6ffbae52c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/adapters/readium-adapter.ts: apps/web/features/reader/v3/adapters/readium-adapter.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ReadiumWebReaderAdapter.execute at line 549. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/adapters/readium-adapter.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6ad26646cae206f850a8fa80afba98fd64bd31aed248bda7ebd5f15b91ea20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/settings/ui/directory-path-picker.tsx: apps/web/features/settings/ui/directory-path-picker.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in directory-path-picker.DirectoryPathPicker at line 13. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/settings/ui/directory-path-picker.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde94d91fbfd6136dbd0f7e9727014229db4e32dc92234e17f10fc954c19429b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/file_writeback.py: apps/api-python/app/modules/metadata/infrastructure/file_writeback.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in file_writeback._publication at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/file_writeback.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":"apps/api-python/app/modules/metadata/infrastructure/file_writeback.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0632925efef4ea5ea130764a4c85b422e74256b052dfd83a8987c6593263d1ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift: apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BookDetailStore.loadContentBrowser at line 919. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"195683da780500a828cedcc6c170e4f43ea9df85de99fc2601426b508b65fe6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/download/presentation/http.py: apps/api-python/app/modules/download/presentation/http.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in http.update_download_task at line 271. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/download/presentation/http.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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2080007c430394d3f89cf15d2a66f400492b5e45cdf58829af73e8fa1bb41d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/application/execute_file_moves.py: apps/api-python/app/modules/library/application/execute_file_moves.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ExecuteFileMoveOperation.execute at line 86. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/application/execute_file_moves.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":"apps/api-python/app/modules/library/application/execute_file_moves.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a66fab32fb858a18ea647fc7d922f2005c989f015fc0465acc7693f1fb6bea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AndroidAudioPlaybackRuntime.launchRemote at line 323. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88889684a6b9e5466930308d80dae6ebbf31033b5938c5d0114dacefd01b3fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/catalog.py: apps/api-python/app/modules/library/infrastructure/catalog.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SqlAlchemyCatalogQueries._resource at line 238. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/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":"apps/api-python/app/modules/library/infrastructure/catalog.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d594d2b986562ef0dfbbe12f9737ff6888db64613e809b0f684a90dc9005aa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/bulk_operations.py: apps/api-python/app/modules/library/infrastructure/bulk_operations.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SqlAlchemyBulkBookOperations.update_metadata at line 341. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/bulk_operations.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":"apps/api-python/app/modules/library/infrastructure/bulk_operations.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"180bcd711d551c9d1a59bad3ecbb76654729248eafda89d84cc586bd32150e35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/scripts/generate-reader-safety-conformance.ts: apps/web/scripts/generate-reader-safety-conformance.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in generate-reader-safety-conformance.evaluateFactCase at line 563. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/scripts/generate-reader-safety-conformance.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80cc68ac89cce7dbb3871d80c457dceb9b0769fa876870c84313d4220c292e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/automation/ui/automation-settings-page.tsx: apps/web/features/automation/ui/automation-settings-page.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in automation-settings-page.GrantsPanel at line 148. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/automation/ui/automation-settings-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d66b854e800284f6d6999b511c36a2499efcf0fc85d219c299d163355c226e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/core/exception_diagnostics.py: apps/api-python/app/core/exception_diagnostics.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in exception_diagnostics._exception_facts at line 218. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/core/exception_diagnostics.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":"apps/api-python/app/core/exception_diagnostics.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc3944a0d85e810d8beb1f32e93d70a58d640b65baeac8c733056b49bb7a02d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in IosManagedPublicationStore.resolve at line 238. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosManagedPublicationStore.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"523d2d286b41f8ca774e79833e151d336f659d29fe46d809d6b3c3f1a1d1b0d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/organize/recognition-settings-panel.tsx: apps/web/features/organize/recognition-settings-panel.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in recognition-settings-panel.RecognitionSettingsPanel at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/organize/recognition-settings-panel.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/recognition-settings-panel.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fe9bf145f27b10ce66baeeaca87e70463e4ad5391c17cf65db2d21ef033265"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/reader/infrastructure/resource_locator_index.py: apps/api-python/app/modules/reader/infrastructure/resource_locator_index.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ResourceLocatorIndex.validate at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/reader/infrastructure/resource_locator_index.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":"apps/api-python/app/modules/reader/infrastructure/resource_locator_index.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb5dd34c79f203b3aeb0c4c28d7a435a70790080f34880b0831596b58a48f91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AdministrativePeopleAndQueueScreensKt.UserEditScreen at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativePeopleAndQueueScreens.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2db5875b3ed956c477b1c57e50fb4e232ec64cdb0c14c9828861346b226ae6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSheets.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSheets.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ReaderPreferenceSheet.settingRow at line 244. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSheets.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSheets.swift"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81bd718fc8cb0c0cd8d2c96645ee94aa717b7cce470eb23cd6d069dce3bb829"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/updates/application/dependency_release.py: apps/api-python/app/modules/updates/application/dependency_release.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in DependencySet.validate_set at line 61. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/updates/application/dependency_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":"apps/api-python/app/modules/updates/application/dependency_release.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6da3156abd28b40d8763ea2c4056aea0279c89f8e6111de60f1909953d660e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/directory/target-directory-picker.tsx: apps/web/components/directory/target-directory-picker.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in target-directory-picker.TargetDirectoryPicker at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/directory/target-directory-picker.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e3b1c5a9c6df69c44c3ceb2630e95a17c4753ed448dd7da1bfa9f334bc5dde"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/ErmaoLibraryRoot.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/ErmaoLibraryRoot.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ErmaoLibraryRootKt.ErmaoLibraryRoot at line 32. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/ErmaoLibraryRoot.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/ErmaoLibraryRoot.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"332b8855fa250a9c3d0ed479b79bd83c191774c5805559d0f68d46d638376176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/settings/setup-page.tsx: apps/web/features/settings/setup-page.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in setup-page.SetupPage 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/settings/setup-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5a85eca4d06b561416e4cbb205e3d0e0ed63214ce540dd3952adaa5d59eec5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/organize/organize-job-detail-page.tsx: apps/web/features/organize/organize-job-detail-page.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in organize-job-detail-page.OrganizeJobDetailPage at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/organize/organize-job-detail-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-job-detail-page.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"06be75ecfd202ad58a8e4cfc28c6047c50576e3fd26dc2c751538b751a21a171"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/standard_files.py: apps/api-python/app/modules/metadata/infrastructure/standard_files.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AnchoredStandardMetadataReader._read_one at line 187. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/standard_files.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":"apps/api-python/app/modules/metadata/infrastructure/standard_files.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72ba979db4a1bb161ab8a9ed5ef06b385890a53e6427d6ff4609629ab1215e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPreferencesMapper.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPreferencesMapper.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ReadiumPreferencesMapper.toReadium at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPreferencesMapper.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPreferencesMapper.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd04dce97e0a47e236b5c2f93c0dc9d335c2ec79345a27c7a496661d55e032a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/application/opf.py: apps/api-python/app/modules/metadata/application/opf.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in opf.parse_opf_metadata 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/application/opf.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":"apps/api-python/app/modules/metadata/application/opf.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8a3fd855c1ff18847ac193b867a47660e5ef5a6006df30849f29ce01141618"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NativeManagementSheet.body at line 886. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc1d44b64e04c678ef3bd923ff182d4b773022e184431fa22da072f1661d795"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/updates/infrastructure/preparation_worker.py: apps/api-python/app/modules/updates/infrastructure/preparation_worker.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PreparationWorker._run at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/updates/infrastructure/preparation_worker.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":"apps/api-python/app/modules/updates/infrastructure/preparation_worker.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ae83a0e29074fcbf9a4d0ecaef0f46d31328065aeca55cf926d8c9486c040e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MultiDownloadSheet.perform at line 821. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"77211b27fc83353d7ec5ca84ba60af37131e90306e816cc8650c1be6125539a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in IosReadiumRuntime.openEPUB at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReadiumRuntime.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d1870ef9e1277290ae266a21a23351e5421f14048ade6c541bd54df43f4dc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/recognized_metadata.py: apps/api-python/app/modules/library/infrastructure/recognized_metadata.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SqlAlchemyRecognizedMetadata.apply_changes at line 161. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/recognized_metadata.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":"apps/api-python/app/modules/library/infrastructure/recognized_metadata.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e584fbde4d94f81176125ded23d9a9fa71c1612d683677b72d228ec1624c9f8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/organize/application/commands.py: apps/api-python/app/modules/organize/application/commands.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in commands.prepare_organize_policy_update at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/organize/application/commands.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":"apps/api-python/app/modules/organize/application/commands.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3855d7968cc08d3fb623fab3f10e4d015b726f46563bdb8afa52b2f15b49d818"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/application/file_move_plans.py: apps/api-python/app/modules/library/application/file_move_plans.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PrepareFileMovePlan.execute at line 114. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/application/file_move_plans.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":"apps/api-python/app/modules/library/application/file_move_plans.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cd55dbfe7b4c583486835d3b6b1ceb7a4e36dc49d4e357b69a94c620ebe46f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/metadata_patches.py: apps/api-python/app/modules/library/infrastructure/metadata_patches.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SqlAlchemyMetadataPatches.snapshot at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/metadata_patches.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":"apps/api-python/app/modules/library/infrastructure/metadata_patches.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7797a738e9f90d8d498657581a8522a35535555e6e163a1b5d241026bc1e98f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/application/library_paths.py: apps/api-python/app/modules/imports/application/library_paths.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in library_paths.library_directory_tree_node at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/application/library_paths.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":"apps/api-python/app/modules/imports/application/library_paths.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b2d88e6031a50aae2b07c91ea63cd62c41de1472045f767f6c4fcc9bccf6ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in LoginScreenKt.LoginScreen at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/auth/LoginScreen.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa30cbc063e1fb860fad3f5a9e17023fb4c0662485ac2e55d2375d31363bbfb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/kindle-send-modal.tsx: apps/web/features/books/kindle-send-modal.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in kindle-send-modal.KindleSendModal at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/kindle-send-modal.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/kindle-send-modal.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ae0c14ffe1b29f23c38b5a064a2cdaf8aadab891eb41648da14c9680cbc7ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/test-support/reader-safety-conformance/kotlin/com/ermao/library/testing/reader/ReaderSafetyConformanceRunner.kt: apps/mobile/test-support/reader-safety-conformance/kotlin/com/ermao/library/testing/reader/ReaderSafetyConformanceRunner.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in ReaderSafetyConformanceRunner.evaluateFactCase at line 314. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/test-support/reader-safety-conformance/kotlin/com/ermao/library/testing/reader/ReaderSafetyConformanceRunner.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/test-support/reader-safety-conformance/kotlin/com/ermao/library/testing/reader/ReaderSafetyConformanceRunner.kt"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed2e8950c3cc5a1b84ad2df16e14c82bc7335ba09fa08a2f93b6933a83f7b2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/original-publication/mobi-publication.ts: apps/web/features/reader/v3/original-publication/mobi-publication.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in mobi-publication.openMobiPublication at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/original-publication/mobi-publication.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-publication.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fabc3120a8d69a132a8bd3042797ebfeca8c01b797f2cce3c6138f939a2918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderPreferenceChanges.kt: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderPreferenceChanges.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ReaderPreferenceChangesKt.changedReaderControls at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderPreferenceChanges.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderPreferenceChanges.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f8bc707858f45eb1cba0d0e8dae239d55af03fee224af0d3b27104d30faef8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AudioPlayerUiKt.AudioNowPlayingScreen at line 229. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/ui/AudioPlayerUi.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa46f277537bdf734ebf448fc2dc0fc1d1690b7846a30b542d30b0d41367a07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AdministrativeCoreScreensKt.EmailKindleSettingsScreen 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeCoreScreens.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bc0b455ba454cd0ea9753b04ed85306f4db187c5ce3911e0e8124df2d209d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/library/smart-filter-builder.tsx: apps/web/features/library/smart-filter-builder.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in smart-filter-builder.SmartFilterBuilder at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/library/smart-filter-builder.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad05a998a4a31931285f7c29995980300636f0715759fb1d4a39614523fdc86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/application/source_node_commands.py: apps/api-python/app/modules/library/application/source_node_commands.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in UpdateSourceNodePresentation.execute 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/application/source_node_commands.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":"apps/api-python/app/modules/library/application/source_node_commands.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"788bd426158b14bcf25da922c6c3cae7bdba2a9606be984c67dbf2cfd20a3b56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/source_node_commands.py: apps/api-python/app/modules/library/infrastructure/source_node_commands.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SqlAlchemySourceNodeMetadata.update_metadata at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/source_node_commands.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":"apps/api-python/app/modules/library/infrastructure/source_node_commands.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"044e3a1e0bb2ae0cde9428ed278108525d99757fde11adf811dcb7e64c11efed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/books/ui/book-metadata-editor.tsx: apps/web/features/books/ui/book-metadata-editor.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in book-metadata-editor.BookMetadataEditor at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/books/ui/book-metadata-editor.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-metadata-editor.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"579cc3f930dfc2c81f662a4a503b0258e372fee2fa3e8ba99b951f34dcd86367"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in IosPdfiumDownloadMaterializer.materialize at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumDocument.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a99254e05790706fa501306e520dd29be599dcddc409206335a603fed8d665"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/application/readable_resource/process_book_resources.py: apps/api-python/app/modules/imports/application/readable_resource/process_book_resources.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ProcessBookResources.execute at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/application/readable_resource/process_book_resources.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":"apps/api-python/app/modules/imports/application/readable_resource/process_book_resources.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c95865c2d8e56f7e78df919eb5526625a86335b953e9a1c60d699c5cc8c0ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/python_release_load_precheck.py: scripts/python_release_load_precheck.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in python_release_load_precheck.run_measurement at line 2084. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/python_release_load_precheck.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/python_release_load_precheck.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"253e0941b6d7d240997e2e6e5f724ff3ca63885092c27770e688fa089a8c1959"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/dependency_install.py: scripts/dependency_install.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in DependencyInstallation.apply at line 315. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/dependency_install.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/dependency_install.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d1f19a6e467a9e11d761f74ac8e40ed738c0f879cdc9b1d543ef6078168565"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/book/book-card.tsx: apps/web/components/book/book-card.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in book-card.BookCard at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/book/book-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-card.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e7c02ea9cb1027e4b3138b4a20c97e5489a05e69265e55aa15606162bbc5a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/use-reader-session.ts: apps/web/features/reader/v3/use-reader-session.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in use-reader-session.useReaderSession 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/use-reader-session.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/use-reader-session.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b58a68afa6ea5ee34584a662b67fe027f10a3a99c61a1bee3630bee0ff3ed6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/imports/infrastructure/automation_uploads.py: apps/api-python/app/modules/imports/infrastructure/automation_uploads.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ImportAttachmentUploads.target at line 61. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/automation_uploads.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":"apps/api-python/app/modules/imports/infrastructure/automation_uploads.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc71762c63abc30c544714efcc692d77c43e717de9f0808261eb13c6985353"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/application/metadata_patches.py: apps/api-python/app/modules/library/application/metadata_patches.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ApplyMetadataPatches.execute at line 100. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/application/metadata_patches.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":"apps/api-python/app/modules/library/application/metadata_patches.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2511862a20e48022e904c4e8da5aad1361cbdaf34177142fc3bd093000066ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/BookManagementSession.kt: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/BookManagementSession.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in BookManagementSession.select at line 175. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/BookManagementSession.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/BookManagementSession.kt"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"001c1fb0fd1c32b61f3d81dd54e2061a7c08324c6ee3dd80939f66047de81618"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/ui/context-action-menu.tsx: apps/web/components/ui/context-action-menu.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in context-action-menu.ContextActionMenu at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/ui/context-action-menu.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/context-action-menu.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"143e4ef561686b04f06cac5ce57cfb5e97bb59789c7534a0ce27ff6da46871ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/standard_publication.py: apps/api-python/app/modules/metadata/infrastructure/standard_publication.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in StandardMetadataPublication.prepare at line 204. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/standard_publication.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":"apps/api-python/app/modules/metadata/infrastructure/standard_publication.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65c3a1a9d7826a7a6a9c3b804856b63eeaa3ae776efc9f255b5d9ebb64eeae1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts: apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in strict-fb2-parser.parseStrictFb2.openElement at line 305. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f868d25b03c18f0ac20f75776ee44e5fe4a8256da9bebd588231ed2910d836"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/shelf/application/commands.py: apps/api-python/app/modules/shelf/application/commands.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UpdateShelf.execute at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/shelf/application/commands.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":"apps/api-python/app/modules/shelf/application/commands.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9627f0da02cb39549c8fa0fbb87cee90bca283f5d2f4654ea16f7feb93e2fe46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/updates/infrastructure/archive.py: apps/api-python/app/modules/updates/infrastructure/archive.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in archive.extract_package at line 137. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/updates/infrastructure/archive.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":"apps/api-python/app/modules/updates/infrastructure/archive.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f767442b0155d879b1a495e6a3e3d780196c9748eaf58efe5060b6622fd88a9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LibraryViewModel.loadScope at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe256ad9445452c5e5000e6ff671fd7ef279057bf4bea434a4b91caf27b032b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiPublicationFactory.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiPublicationFactory.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in IosMobiPublicationFactory.build at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiPublicationFactory.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosMobiPublicationFactory.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e0f4bdaf8d3873acaa77b4896fac9068cd47d157f648308bd45e2911071e81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/security/reader-safety-policy.ts: apps/web/features/reader/v3/security/reader-safety-policy.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in reader-safety-policy.rewriteReferences at line 242. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/security/reader-safety-policy.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"095076e63bf94a27f5a2d3103b59b2b6835728eda57f6b605e536263c3d3e921"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/automation/application/writes.py: apps/api-python/app/modules/automation/application/writes.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in AutomationWrites.book_tags at line 337. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/automation/application/writes.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":"apps/api-python/app/modules/automation/application/writes.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d132af23c062ee31bae0505ea67e7373278b646226a754e4071789cdaf78769"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/adapters/comic-track.ts: apps/web/features/reader/v3/adapters/comic-track.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ComicSpreadTrackDriver.renderSlot at line 312. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/adapters/comic-track.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d44c95a01591e068d649b36b32d053fa255c9f5095b2dc5735d75a87ab013d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumNavigator.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumNavigator.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in IosPdfiumNavigatorViewController.startRender at line 149. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumNavigator.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfiumNavigator.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b55a30032db46801d4a7760028a74463a6f868033092bea8f95d87acf3b91a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/automation/application/uploads.py: apps/api-python/app/modules/automation/application/uploads.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AutomationUploads.complete at line 329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/automation/application/uploads.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":"apps/api-python/app/modules/automation/application/uploads.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d495f354d46ab5f71fa00e150ffdbc378a4b92529aee055248cea02bb111d77c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/updates/application/use-update-operations.ts: apps/web/features/updates/application/use-update-operations.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in use-update-operations.useUpdateOperations at line 9. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/updates/application/use-update-operations.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/updates/application/use-update-operations.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2b726eb436740e0d6d82818b56668996ca8badb31997b8dcf8de7db9e8ecff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/settings/center/email-settings-page.tsx: apps/web/features/settings/center/email-settings-page.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in email-settings-page.EmailSettingsPage at line 64. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/settings/center/email-settings-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/email-settings-page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f812bf7bdc024874d40fbc178550cc9620eb452ee1f8f821f233190cbeda1aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/adapters/pdf-range-transport.ts: apps/web/features/reader/v3/adapters/pdf-range-transport.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PdfRangeByteSource.fetchChunkGroup at line 250. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/adapters/pdf-range-transport.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-range-transport.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"430ea92ec109e735b98fd722e1fc554471c04bcffe83cacb3c21b1a6241ad03c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.py: apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FilesystemLocalMetadataCoverParser.extract_cover at line 77. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.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":"apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d9bcfa93dd9ed529d8909731654db15a5041141884b4489682d0c6b913855"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/library/upload-book-dialog.tsx: apps/web/features/library/upload-book-dialog.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in upload-book-dialog.UploadBookDialog at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/library/upload-book-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/upload-book-dialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09759aa658ef2dfc00d1ed1637ce5a30cfccc9728e204c9c823aade2f00177b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shelves/ui/ShelfCatalogScreen.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shelves/ui/ShelfCatalogScreen.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ShelfCatalogScreenKt.ShelfCatalogScreen at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shelves/ui/ShelfCatalogScreen.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shelves/ui/ShelfCatalogScreen.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"95046e9b52fa7309796718ebee4257a94381ab7b66c959895df46ccfdf5b94b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/original-publication/browser-publication-store.ts: apps/web/features/reader/v3/original-publication/browser-publication-store.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in BrowserPublicationStore.download at line 56. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/original-publication/browser-publication-store.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/browser-publication-store.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d249815e7c6a916e5516b3eae485b840e19590acdab4e411497a6e0e21198656"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AdministrativeSettingsViewModel.execute at line 102. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/administrativesettings/AdministrativeSettingsViewModel.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d174f91872efd9277fc90cc58e464c48f8ee46a8ae665674c0ac4eac1e1d04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/ui/select.tsx: apps/web/components/ui/select.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in select.Select at line 86. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/ui/select.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/select.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9579dbdeebf07aab41eabe5e72b01ac19f519603a2d4927f86375a2a80101ba6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/components/ui/combobox.tsx: apps/web/components/ui/combobox.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in combobox.Combobox 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/ui/combobox.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3f84acd2a73b736ae468c0fc19c56ecf19a1025ef3785a83b9cd183f21288c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/settings/center/import-preferences-panel.tsx: apps/web/features/settings/center/import-preferences-panel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in import-preferences-panel.ImportPreferencesPanel at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/settings/center/import-preferences-panel.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/import-preferences-panel.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ec06ceb4a52f93913ec70789af68d6834b488956a670c02e72acab7dd81f04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AudioPlaybackRuntime.receive at line 408. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecbc9d0741efe9726302228228de540f3c1f64c3fdc8a3c9be6594de21dd718"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in IosImageDirectoryBundle.init at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosImageDirectoryPublicationFactory.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"254374bffd28aec1420c86cf0a0a9976f2961201454398a20eadfbdcf003a846"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/generation.py: apps/api-python/app/modules/metadata/infrastructure/generation.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in generation.complete_missing_metadata at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/generation.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":"apps/api-python/app/modules/metadata/infrastructure/generation.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dbc481aa2cb4c90c34bceda2f68261a34cdfed4b4b67f01575c49478aa5095"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/file_move_index.py: apps/api-python/app/modules/library/infrastructure/file_move_index.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SqlAlchemyFileMoveIndex.apply at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/file_move_index.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":"apps/api-python/app/modules/library/infrastructure/file_move_index.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b33a44304acc3255236aca6a924bbc56b0cc7f9f4a133742bb0b3040a20b29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift: apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UserEditorView.body at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/UserSettingsViews.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1809eb30124a98b3c20572da56ebb23e573513c034ab7b702ce3918078bc0a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/python_release_live_fixture.py: scripts/python_release_live_fixture.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in python_release_live_fixture.main at line 754. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/python_release_live_fixture.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/python_release_live_fixture.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4d8e56ac9602226844251040e1c6d7a11c46eaaa0a3dbb388612fd12e6be8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/updates/infrastructure/official_source.py: apps/api-python/app/modules/updates/infrastructure/official_source.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OfficialReleases.releases at line 109. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/updates/infrastructure/official_source.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":"apps/api-python/app/modules/updates/infrastructure/official_source.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3844e6b3655c61cefe9eecbb69a64d7cab3edfcf84e3abdefee92ed7e406be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/application/local_metadata.py: apps/api-python/app/modules/metadata/application/local_metadata.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in local_metadata._parse_local_metadata at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/application/local_metadata.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":"apps/api-python/app/modules/metadata/application/local_metadata.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9bbc29060da80f76c4e2a07a18c4022e2229e433551a8da273bf200bb5d74a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/python-worker-runtime-smoke.mjs: scripts/python-worker-runtime-smoke.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in python-worker-runtime-smoke.main at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/python-worker-runtime-smoke.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/python-worker-runtime-smoke.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a1bf870016517f7d521e484bc4f6e6d8fc90bda8dc443afdbeea1eb111b2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/dashboard/dashboard-page.tsx: apps/web/features/dashboard/dashboard-page.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dashboard-page.DashboardPage 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/dashboard/dashboard-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/dashboard/dashboard-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d4e4485bab4bfd8f4b47b98a6c807b33b697245472a317eefb060e7708e324"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/application/file_deletions.py: apps/api-python/app/modules/library/application/file_deletions.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in FileDeletions.execute at line 146. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/application/file_deletions.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":"apps/api-python/app/modules/library/application/file_deletions.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43e0c2d6c17659a81b7498cbc22120f03fbc7c7fb09f2a4ceb67e31af171b70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt: apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DownloadResourceRuntime.ensure at line 124. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/application/DownloadResourceRuntime.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f211ddcc8aa567c35ef1055224c121643214fd736f78455e9a91adae515cc3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/organize/classification-management-panel.tsx: apps/web/features/organize/classification-management-panel.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in classification-management-panel.ClassificationManagementPanel at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/organize/classification-management-panel.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59322b6afb8c1444f7056afe7986e7d7d63d11e23a5c6188fdfec7c7a58df31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/backup/infrastructure/inspection.py: apps/api-python/app/modules/backup/infrastructure/inspection.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in inspection.inspect_backup at line 36. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/backup/infrastructure/inspection.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":"apps/api-python/app/modules/backup/infrastructure/inspection.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ac7d237c545abf894ab183c177ce721c1d2ad5d783b7954742e2b962b63453"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/db/alembic/versions/0037_single_import_execution.py: apps/api-python/app/db/alembic/versions/0037_single_import_execution.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in 0037_single_import_execution.upgrade at line 51. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/db/alembic/versions/0037_single_import_execution.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":"apps/api-python/app/db/alembic/versions/0037_single_import_execution.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b440eb7864b601dd57ba6f1458ca570920a2fa1b461269d7a8baf38b2cd5bb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/reader-core/src/session.ts: packages/reader-core/src/session.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in session.readerSessionReducer at line 96. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- packages/reader-core/src/session.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/reader-core/src/session.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0f6844dcb8d034782a9ee871f071d9cfb2c380ff6c1f3924fbfea31e942311"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/library/infrastructure/move_companions.py: apps/api-python/app/modules/library/infrastructure/move_companions.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in move_companions.move_companion_paths at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/move_companions.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":"apps/api-python/app/modules/library/infrastructure/move_companions.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e003d5869d08867f8b75955fc8663c1a24df89491b119de1cc26483ba027af5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/settings/center/library-scan-settings-panel.tsx: apps/web/features/settings/center/library-scan-settings-panel.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in library-scan-settings-panel.LibraryScanSettingsPanel at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/settings/center/library-scan-settings-panel.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/library-scan-settings-panel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7df66a3f97a38da78f2cd78626cca1d7a41f4b8a8a943dad20726043a637890"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py: apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in selective_comicinfo.patch_comicinfo at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.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":"apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"da569c50babb854207a6f5bb4a12acb0b55a20af8ab610da5d73d6fdcee40cec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/feedback/application.py: apps/api-python/app/modules/feedback/application.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in application.prepare_preview at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/feedback/application.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":"apps/api-python/app/modules/feedback/application.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"410f73dabdc8ad23dca222621d4fd759bd46f61e091e0d240587e136e9f3c2b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/metadata/infrastructure/audio_structure.py: apps/api-python/app/modules/metadata/infrastructure/audio_structure.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in audio_structure.mp3_structure at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/audio_structure.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":"apps/api-python/app/modules/metadata/infrastructure/audio_structure.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e723a65b176520976062fe39d141536938b2100ff86729eb48077d9bebc5341"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web/features/reader/v3/security/epub-archive-safety.ts: apps/web/features/reader/v3/security/epub-archive-safety.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in epub-archive-safety.preflightEpubArchiveEntries at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/security/epub-archive-safety.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/epub-archive-safety.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a307a4b8ff2420b010a953db3dcc281e320a5f06010aff8b5e154dfb494fa957"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/api-python/app/modules/feedback/presentation.py: apps/api-python/app/modules/feedback/presentation.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in presentation.submit_feedback at line 102. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/feedback/presentation.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":"apps/api-python/app/modules/feedback/presentation.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfa78820cb49c4511c9be1d0d6b6e9ef633dce1dff3ed2f23cbb62d9a6e00f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/BookContentNavigation.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/BookContentNavigation.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in BookContentNavigationKt.BookContentNavigation at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/BookContentNavigation.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/shell/BookContentNavigation.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18e97d700d551be2e93d7858b6da6ffcb2cd5d68e6d9a8bfa3ee0f76b4d196b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogView.swift: apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogView.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ShelfCatalogView.resultContent at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogView.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Shelves/ShelfCatalogView.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e331ad9a23c12ad84b0e6c91413e62494795e3782f4258b3a06c0ac9f93ee80"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/db/sqlite.py: apps/api-python/app/db/sqlite.py changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is sqlite._usage_delta at line 52), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(db): let offline index replacement finish under migration ownership\u201D; \u201Cfix(db): allow startup migration index builds beyond query budget\u201D; \u201Cfix(db): shorten transactions and prune system events by row count\u201D; \u201Cfix: recover Book imports and align SMTP requests [skip ci]\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/db/sqlite.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":"apps/api-python/app/db/sqlite.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"25007ddc7ad6943c4f5f9856311d84db66345f5f9224b0eb3cd88be177c9c257"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/imports/infrastructure/pdf_inspection.py: apps/api-python/app/modules/imports/infrastructure/pdf_inspection.py changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is pdf_inspection.inspect_pdf at line 18), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pdf): merge bounded XMP metadata and split subject tags for v1.4.1\u201D; \u201Cfix(backend): retain real failures in imports and background processing\u201D; \u201Cfix(imports): restrict inspection to bounded metadata reads\u201D; \u201Cfix(imports): enforce canonical typed queue paths\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/pdf_inspection.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":"apps/api-python/app/modules/imports/infrastructure/pdf_inspection.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8506015b36520a63f24c3bf3906bd62901855dbc19004809c282af6eceac0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/library/infrastructure/imported_book_metadata.py: apps/api-python/app/modules/library/infrastructure/imported_book_metadata.py changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is SqlAlchemyImportedBookMetadata.apply at line 240), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: unify tolerant TXT decoding and library maintenance\u201D; \u201Cfix(backend): retain real failures in imports and background processing\u201D; \u201Cfix(imports): preserve publication titles in flat libraries\u201D; \u201Cfix(metadata): identify local metadata before manual lookup\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/imported_book_metadata.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":"apps/api-python/app/modules/library/infrastructure/imported_book_metadata.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c691e70081e4210497d07327a714c11b20d5e58b36fc63430c6e48fd9bccb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/container_install.py: scripts/container_install.py changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Installation.synchronize at line 221), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(runtime): diagnose gateway startup and update failures\u201D; \u201Cfix(updates): harden installation recovery and runtime state reporting\u201D; \u201Cfix: allow container restart after update failures and add book shelf action\u201D; \u201Cfix(updates): simplify online verification and release v1.3.0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/container_install.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/container_install.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"076e896a584b96d9c388784d39b49c3cff96925c9a5092a8850b2f223f8847ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ComicNavigatorFragment.kt: apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ComicNavigatorFragment.kt changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ComicNavigatorFragment.ComicPageImage at line 559), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(android): preserve comic page while continuous images decode\u201D; \u201Cfix(android): let zoomed comic drags reach image scrolling\u201D; \u201Cfix(android): preserve comic image fit and expose overflow edges\u201D; \u201Cfix(android): recreate comic pager when page grouping changes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ComicNavigatorFragment.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ComicNavigatorFragment.kt"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c5f0011ad89928abebb8f846bae47d72fa07779a5ee5090915456b11b20199"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/media/infrastructure/resource_preview.py: apps/api-python/app/modules/media/infrastructure/resource_preview.py changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is FilesystemResourcePreview._source at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(media): share archive page index with book details and previews\u201D; \u201Cfix: unify tolerant TXT decoding and library maintenance\u201D; \u201Cfix(imports): bound scheduled scans and expire preview caches\u201D; \u201Cfix(backend): retain real failures in imports and background processing\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/media/infrastructure/resource_preview.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":"apps/api-python/app/modules/media/infrastructure/resource_preview.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a90c53894e32845a328158899412bb3542f2a92afd7df83e3a6c64724dcc341"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/services/log_maintenance.py: apps/api-python/app/services/log_maintenance.py changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is SystemEventMaintenanceWorker._recover_startup_maintenance at line 61), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: unify tolerant TXT decoding and library maintenance\u201D; \u201Cfix(imports): bound scheduled scans and expire preview caches\u201D; \u201Cfix(backend): retain real failures in imports and background processing\u201D; \u201Cfix(api): defer optional recovery and isolate startup components\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/services/log_maintenance.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":"apps/api-python/app/services/log_maintenance.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c8c2f19ad3e4695985a3e46c8abc74f6565a8ca8f533e144745621351554f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/core/logging_config.py: apps/api-python/app/core/logging_config.py changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is logging_config.configure_logging at line 93), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(diagnostics): render parameterized logs before sanitizing\u201D; \u201Cfix(diagnostics): preserve uvicorn access args and escape SQL params\u201D; \u201Cfix(diagnostics): close sanitization and exception-group gaps\u201D; \u201Cfix(diagnostics): unify safe output and harden exception boundaries\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/core/logging_config.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":"apps/api-python/app/core/logging_config.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"96411420a212ef6736a650884ab386890454246e0ce486f1efadf91e60c85870"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/db/session.py: apps/api-python/app/db/session.py changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is session.release_read_transaction at line 61), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(db): shorten transactions and prune system events by row count\u201D; \u201Cfix(sqlite): separate statement budgets from lock waits\u201D; \u201Cfix(library): unify rescans and local cover metadata\u201D; \u201Cfix: prioritize requests during facet indexing\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/db/session.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":"apps/api-python/app/db/session.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff3f09130d4a89e60ec245140097372febdf8c8083bb1f2a36ffc5237515240"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/web/components/book/bookshelf.tsx: apps/web/components/book/bookshelf.tsx changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is bookshelf.useHorizontalDragScroll.onKeyDown at line 155), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: refine import filters, metadata display and settings across clients\u201D; \u201Cfix: align import visibility and library filtering\u201D; \u201Cfix(library): align book list projections\u201D; \u201Cfix: \u5B8C\u5584\u4E66\u5E93\u6D4F\u89C8\u4E0E\u9605\u8BFB\u8FDB\u5EA6\u5C55\u793A\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/components/book/bookshelf.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/bookshelf.tsx"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f43049ed97f730881642660a0a3a256530c2f244c30169e29da070e242212a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/library/infrastructure/move_topology.py: apps/api-python/app/modules/library/infrastructure/move_topology.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is SqlAlchemyMoveTopology.destination at line 153), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: unify tolerant TXT decoding and library maintenance\u201D; \u201Cfix(mcp): reimport moved volumes while preserving complete book identities\u201D; \u201Cfix(mcp): preserve recovery locations and invalidate rewritten file versions\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/infrastructure/move_topology.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":"apps/api-python/app/modules/library/infrastructure/move_topology.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d041a22c72eade237abff5038eccc3fc0668b66618236f9f176d27fad011681"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/web/features/reader/v3/original-publication/mobi-core.worker.ts: apps/web/features/reader/v3/original-publication/mobi-core.worker.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is mobi-core.worker.loadRuntime at line 114), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(reader): allow absent optional strings in MOBI WebAssembly metadata\u201D; \u201Cfix(reader): keep only per-file 2 GiB import admission on web and backend\u201D; \u201Cfix(web): support original publication storage and integrity checks over HTTP\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/web/features/reader/v3/original-publication/mobi-core.worker.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-core.worker.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c672585586514195fd2ed935aec507a4cc61ba0b026dc6d18d7f35204977dfb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/system/infrastructure/settings.py: apps/api-python/app/modules/system/infrastructure/settings.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is settings.get_settings_raw at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(settings): enforce JSON storage and correct optional metadata diagnostics\u201D; \u201Cfix(backend): retain real failures in imports and background processing\u201D; \u201Cfix(system): prepare setting deletes before writes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/system/infrastructure/settings.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":"apps/api-python/app/modules/system/infrastructure/settings.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afbf69cf4ee4d184ba3f94dae2ae54f71e671078760147256fcbdc5d37e5718"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/library/application/imported_book_metadata.py: apps/api-python/app/modules/library/application/imported_book_metadata.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is IdentifyImportedBook._persist_identification at line 139), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(db): shorten transactions and prune system events by row count\u201D; \u201Cfix(imports): preserve publication titles in flat libraries\u201D; \u201Cfix(metadata): identify local metadata before manual lookup\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/library/application/imported_book_metadata.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":"apps/api-python/app/modules/library/application/imported_book_metadata.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a0befd6c4876adbb7d07e9551ef564b3dee155dd746a72557789697c054a27"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/auth/infrastructure/user_administration.py: apps/api-python/app/modules/auth/infrastructure/user_administration.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is SqlAlchemyUserAdministrationGateway.delete_user at line 214), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: unify tolerant TXT decoding and library maintenance\u201D; \u201Cfix(db): shorten transactions and prune system events by row count\u201D; \u201Cfix(backend): retain real failures in imports and background processing\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/auth/infrastructure/user_administration.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":"apps/api-python/app/modules/auth/infrastructure/user_administration.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa020947bcb0cc184e9e853de160f8e6b044d28993e916921d15e6771bb80936"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/imports/infrastructure/library_scan_settings.py: apps/api-python/app/modules/imports/infrastructure/library_scan_settings.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is SqlAlchemyLibraryScanSettingsRepository.load at line 30), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(settings): enforce JSON storage and correct optional metadata diagnostics\u201D; \u201Cfix(imports): bound scheduled scans and expire preview caches\u201D; \u201Cfix(backend): retain real failures in imports and background processing\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/imports/infrastructure/library_scan_settings.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":"apps/api-python/app/modules/imports/infrastructure/library_scan_settings.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3785d8c4bbd903b86a5c8e0e5fe6f6bdd3a06e7fcbaec380e0f770290b713341"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/backup/presentation/http.py: apps/api-python/app/modules/backup/presentation/http.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is http.upload_backup at line 131), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(db): shorten transactions and prune system events by row count\u201D; \u201Cfix: release v1.5.1 backup management and HTTP book deletion\u201D; \u201Cfix(api): expose traceable HTTP and MCP failures without misclassification\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/backup/presentation/http.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":"apps/api-python/app/modules/backup/presentation/http.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ae0cd7b536d24d50c808d3d13f64433da3ac43fba5719cc66934a26542f36"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apps/api-python/app/modules/metadata/infrastructure/short_writes.py: apps/api-python/app/modules/metadata/infrastructure/short_writes.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is short_writes.metadata_short_write_session at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(db): shorten transactions and prune system events by row count\u201D; \u201Cfix(sqlite): separate statement budgets from lock waits\u201D; \u201Cfix(library): unify rescans and local cover metadata\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- apps/api-python/app/modules/metadata/infrastructure/short_writes.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":"apps/api-python/app/modules/metadata/infrastructure/short_writes.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d080adef7390b13396daf32636b2022600006c8448fba89e96cb6e15cdedde"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/dependency_environment.py: scripts/dependency_environment.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is dependency_environment.validate_dependency_seed at line 93), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(runtime): diagnose gateway startup and update failures\u201D; \u201Cfix(updates): harden installation recovery and runtime state reporting\u201D; \u201Cfix(container): synchronize runtime when image identity changes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 22:35:30 \u002B08:00\u0027 --until=\u00272026-11-04 22:35:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/dependency_environment.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/dependency_environment.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"78478d4b34fed04b9784cb0e854c96aa867af46601609bca93a9c024687c5d7a"}},{"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 \u0060apps/web/package.json\u0060 makes this repository a deployable product (line 7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"150c1de07aa1c2aadf73dadff18d47607f1762b04876920e0ce1c89279428027"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060DownloadTaskDTO\u0060 spells \u0060DTO\u0060 where 36 names in the project spell it \u0060Dto\u0060: 36 of 37 names in project ermao-books-api-python spell the token \u0060Dto\u0060 (36 of 37; unit: names in project ermao-books-api-python containing \u0060Dto\u0060). Peers: apps.api-python.app.modules.opds.application.dto.OpdsActorDto (apps/api-python/app/modules/opds/application/dto.py:13); apps.api-python.app.modules.opds.application.dto.BasicCredentialsDto (apps/api-python/app/modules/opds/application/dto.py:18); apps.api-python.app.modules.opds.application.dto.OpdsAuthenticationRequestDto (apps/api-python/app/modules/opds/application/dto.py:24); apps.api-python.app.modules.opds.application.dto.OpdsLinkDto (apps/api-python/app/modules/opds/application/dto.py:32); apps.api-python.app.modules.opds.application.dto.OpdsAuthorDto (apps/api-python/app/modules/opds/application/dto.py:44). Rename to \u0060DownloadTaskDto\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/download/application/dto.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e45d69dce05468fcc8debd5cbf7a2b5e9f2a33c5fe0fc775da159d30853b470"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060apps/api-python\u0060 (108724 LoC, 2071 module-visible types across 81 directories) overshoots its size bounds. 5 of 19 build unit(s) (Gradle, Python, SwiftPM, Xcode, npm) overshoot their size bounds, lowering Project Cohesion to 4.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29227cbe98a6626b5b6d06913a5895959d10afc4de7abc026b4a7f3b4468778c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060apps/mobile/shared\u0060 (22091 LoC, 1723 module-visible types across 59 directories) overshoots its size bounds. 5 of 19 build unit(s) (Gradle, Python, SwiftPM, Xcode, npm) overshoot their size bounds, lowering Project Cohesion to 4.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ece8d53ace386be29e1289a04c856445072952e075d532f7bad8df4a0c4d855"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060apps/web\u0060 (43586 LoC, 400 module-visible types across 100 directories) overshoots its size bounds. 5 of 19 build unit(s) (Gradle, Python, SwiftPM, Xcode, npm) overshoot their size bounds, lowering Project Cohesion to 4.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb99b883f52b14458c8e7af26003f99be169b642d34957473e4c4318c5e432a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060apps/mobile/androidApp\u0060 (40524 LoC, 1176 module-visible types across 42 directories) overshoots its size bounds. 5 of 19 build unit(s) (Gradle, Python, SwiftPM, Xcode, npm) overshoot their size bounds, lowering Project Cohesion to 4.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db4a4b82120c0af7fbb255a240f15ffd04eac12b5f01dd1ae8f5a2da53f601c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060apps/mobile/iosApp\u0060 (37702 LoC, 581 module-visible types across 17 directories) overshoots its size bounds. 5 of 19 build unit(s) (Gradle, Python, SwiftPM, Xcode, npm) overshoot their size bounds, lowering Project Cohesion to 4.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary.xcodeproj/project.pbxproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6f00a2eff70f209690b1a6fea70d7cca7769a4697aad1cc4b3761b72bdcd3d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c63da59a707679b5b63ac5b1c8ede0dd93f4d578cb4345b414c50e19985754f5"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7fff31741a11046b36a499b37aafcbe0cdf15f7a1024f25bd865d2226a4fa649"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c1bdc1834488bcf11db07a502cf67b4972aff09fc4e921ac615c4172c424cd5"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea0dd4697c111c846e36517628d7e7cf9e3bb4bf008ca6ca03983c0a62af00e4"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c36a49f7152ed49247898e1e469f61285c43945036db7fb1c1a4792ef266219d"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ba8248e52917ed589c511fbe7c24baa4537365284eb290106799aa1423b7944"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a832e544d95a0126940f1c7b696e89d984849b68ff8f44ac1d0998f6e3c78da"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef4bda80ae3c0cc24907d5f4f9732fecb430eb2b438233a6ae861dd0e16b6f22"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9715fca454c9ec65b7feed983ad526f17950acd64e4ef2932bbd9015022521de"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"708c22f5ad4aae1e09796700b42c93463519040af869a38a31cedc0750c56cb8"},"properties":{"commitSha":"197e81a808ba32595a8a6ffeda62422b3a7d3473"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc6fd5df71e093e12cf01712240e3aa072514764059517a2e0e2a01691886800"},"properties":{"commitSha":"d2190885f3ee17569f0c8f71a415a371e5b55653"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64512a0b5d76572eacc84172380fbdd8f1a247f5742845e585d363c35369404c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b60f7284628f0370f1de67d58e927e176f1c4259c5399709c5b4fab8472fa9b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea0529aee359b7e2be74163f17c7f3a48d4b7aaee37745a875d8255b6e0803bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f69109d0b7864d5d4e42fdfdaa288d184bf2a2948318dbfa2687cba1c3b14c8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00fb82c46ed0b3be13a8200521e601564619833ecb1bd87efc26b7f924902bf7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9e1347321b35603cd06b4dbeab45383a5c59c660742a471998ae23ddb0dddc6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88def1634680557b4738ded71db9237fa0d91e762b5a7ae4098062a647e269ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728390e17c5fb4a60325ed692ca9629cac19b7d5b9466ff6803462dffc3fe23e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6798bd168176a3aa3872099e91bf59c57160dd0498f0e440b813349a79eec39d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8da24f934f0dc6a1f4bf5e40f2d6ba5634e090cf1c29c6119e56ac0c1fe7afd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"958cc62d529ecdde9f9dfd8f906b00c3f408c9a5842541d3ffef6e443448e531"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c63bd5ba618086e288841a80f4f2c58bf78ea7e8ef64a15ee20ccce9fbe6078b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00fd0216e42552771b8df8b0aee21a806c8b5f1d5fc46868884b73932da5041d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d81e7f45cf03ba1f7092e47b54f7836970b22ff61d38029b7887ab9a004ba649"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a35399b0067387e9fa38bbaee961260f4525af2222a4797778742d6ef57f875"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7126d8ad1111f9cd714d0ccc28f5bf5d6db389491513b2be8fe38eddb2002b49"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f34a147b46b51fbaa169b0db776d82d66509eb29ca5e0ccbbb18a8493cf24242"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"706e9e0c00a660871120b5808c41e70c7c129a32d0d8df785c4d369807172ca0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0eb42971d71a8f975f80ff32e2c07c184d4cb12daa28f7b54b1b361c1e5e2518"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d898001fa6104100ad9c378e9f8bb45548bba2453da64e23172b674570d6dfb2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"230926b64e1d51565a689ffaca21de2b8221dd5ef1d8ef897357bca8ce66a366"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd5e9360551e9fc05d5a991f40dfdeb6470fa9e03f94c582bdda63063b557577"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3899673fbd70c1ba2b6187d597ea3c92b56f5d2e7737c77fe6d9fd46e15c3321"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"871d9fa3efe16051089224ee1869cd699df3be7bd829e36a9e9e462545e6b591"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4d78eed8a4274299c2173e74f662b25cee1b9a3dc0e9466d95b790a3147cbd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f97a15b512b09658185f22253383b26968a15796d99504c54317bacb839490a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91e501b65d8c8a3d91d231d19527f32af3ae053859d710c94a31ec8748b4526b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af5480674b7de32b8bec8aadeeedf8777a206b0387db8a655a587f3dac8d1a66"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef79bc4bdc14d517ac1215b55896c9ada522fcd528f0ee51de679773891a86c5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4a36e3b52eb5b584ae7b963c4f55524f08882b81a14e742f9137cb55fafed5d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4c96000a333ac41724ffc4fb5c59b255b2d36e2665bda5285e23c1dea498756"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6de14635cf54973d6d95e35ef15c48b22aea5026cd2cd135eaef3cda09785ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33e98eb1ff21217ade5f87f0a6caec923082c39af99a344962b22abf30e78d89"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6e54f2d1b00481a8052a0bad94c07483d9db397ce6396c3ee363862ce4098c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d361a50395d76cc492a1a74795e1216e74f2f4fbb1cb225cd384e1aad42fbe9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c97d1d06bcf3029d8b610143106a421ff27391c6e11678a61f8c5da255d67096"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d355fd90d0eb3035734171abda837a896c92aa44542569a9d95accca9720537"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32a0df1aa202fec1c0344ade6130c796309e4154384fd002591076bb90387ae6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aaee0782f3cc48e933f0847223d86b16518d91929812a89edf617ab527d8049a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdc5d61e84aef71cce6d9c9cc3ab4619948dc5309ad796c21811feea8559fc7f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7bae5a7e39054da402052ee561a595f1d1bc82a3c7f6390996e5f497cd38348d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"605296449b19cefd22b9474effa077003481bb4a4f216184b0ba335e2c62c304"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c43a1e3110eb81e41f8b82988063048c07b4eb09fde06a3176bae86e17ba2bbe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1983248eb18bd20c1c099c7b067704e2cb8b35ad3e75edc5ebca4259a193a43c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d11e0dce76b4024629250553cb638963685d49e5d08e29c44b3acf8339329cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"328b704d0ba181c73c327339b45f2a6ea722da7d5f6e8fda55ef557323bd196d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"feb74b4074d4b5e2f91abc836f61ce89f996ff04939739a0dd6c9596e60061c8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddbe29ea3a94b4b935f522de80c59e6b56fba213d415799bbcb2615e0482599b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33089f304dd1c6d4ff8bead58cd4c367216dc595c7e50f2577a9b746d466c00b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35c57cf00e968cd5df570d0da33bc89dcf995a858517717c134832dd386619b2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d83c7c18d5fa9afa99b3b84e3d7e54fc04ecb53ab1588c848c15e9345350c793"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f60ee07c2cfdf24bfff42487d21ba51a65c971eea6c8614d9b137ccae3ab29bb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9527363b6cf9641bd78029b6cbf652fc6aec082b3c89599e2c64696569d679a8"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e916f3e41f0e572599767c23c0a4b71317d7b9a1680e172b460507a81a430252"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0ab7259691103be9291a1b6050eecfa9a17684c1e46e0706a485aaa7d5ab3b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6b483c8d6b281dd3425811972c80890f0aa778126f55916c53c1d827313b361"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a736910543428012354dc5ab993370ad9daaa63b21de336403c55354121d1165"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab3e1b30f90d82c02b074ff7a77dbef6b2994eca7c6398668a96ecd6912286a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d83a3e7be3c8ca63e5fbff64fb754443cd153d60ba0b3d799b1940ff435e0ddf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"900105a744aef11892e5c89369114098861e5b8a3b97be058c895a15531e7c8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90737125b6b93894a82a627d9287044cd523534daa4b6fff1cd17f0ea723231e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e2b8fe9d35d4aca23cec9124db548953e8a28c4ec87a0408e3d304957843fa6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a1cbbcb95b9101617af4d640f05a7edd196487ef79b6fdc1409739cfaa809d3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef5360a7ff1b2e506cb2954b42698430b1ffda89060b25c13f26948984396599"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c776009bfcf7b876ebf1d3e1d49e4ad787b1305ceb48e082dc37788bba0ba5dc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f4775d7979724d1b3895652bc920f38dab1ad5c884ea1afdbca9bc19100b832"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ba278506d0ac871e15fec94ce3c8951d64e3cfddb5d48abe4f48839a0ca7332"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fab099b923d8e217f96f9931be935151e6e34f8dc666b43bd5dedf11c4d7863a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b49843886c1d648858df4c141ddc68dcb684af93f771f1a4ae9ec32608e1e9b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"233758b9056e2297427bda8b2ee12a87a8f25fce79b369b7bbe384681fbf235e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"776fdaaeb7b0345cb3faec592d7a85b10513a57812baf3455f2a5ef1f07214fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c9eee55d584c890467a5a4e2b8ab7d9bea82bd1c4e91720f2f673728c6be546"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea6dc02eed11d49e6b6052468447aa80fa799bd7329e85806d89ad3a1bbdfe67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e40cf0485ccaaf9769f6f89b8b77c971a1f3198463277508b140ef93c8392f6f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"044f1e8efe8c54f9e7c5d398397b22c547563147a84f0b3cc9c6928761dbb28e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c702560c186d5756622406afc8383afee0751a5aa0fd746954cd3c72708ed6d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c269e1b1bad4689a3a1617edce4fc621669355d1a2ff50150c0aaff87d7e02e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02e0d3834c2b18fffbf0adbdc1ad6a4b81438c60a3b038caef4c0b7963e3dc4b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71cf3345e1390a887884f7f0847374342d7938a5a28eaab2869eea3a6065cbec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4285c2dcb22fbbebb6f5ae12d36b501ccdfbae33dbf7c94717d5f82a4b294df2"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d515edf51604b2793fcc00dc0692794639556c95548c86f20cc6f50fb60e373b"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b69e248869af64087104ee54077eb8542d91cc44a408f00456e94462edef182d"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1263e215233c59ed914ff5457964f070053104a0d8c3ab9f4182dbe28baa5e5"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f07f1b308b959bb1482f871d2352d636936da2b79b94129ca1acaa88ed3a75b9"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fc232f8ab1ad6dc171897a7f27cb5fa447b2a3186e91cb23bd5591adf542297"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1cbb3aa382b8474697f70d67aa26206416d87bbae169105fc082c02241bf1883"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b53081dc2ad9dbeb4e27ac87ded88921caebc2b94aa924f6ffab6dd666f9511e"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a68e5cc3d98839cba1c1f4c458c9607eb26de8e5648661af84d603a2a05ba987"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f7ac2a8b8ead4f4e281090cc2455b4192a9fbd1faef314dbf049d054b989948"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e2d9d54622564bb2d5e77d99b1b4186f185732e01941532538b910e104ce4e1"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28261c43b1ad694ad664fc2de0a23ae2ee4b6b8fdcf632f9fb922e111ea54b64"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b23fcb116a065a69802542fe687799de26b64eebfce8dce20ed3bc744db3c2e"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e40f28ba8e6bb84c388e27c45f3e96c0c01b8798be0297054a3b9b34656d444b"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"261ce5e2c84a2fa1fb77390bcc58ee0d7c067e01929b5d50eb129a98aa4a8ad2"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"340744a2da5e791a9227af792cc3292bd84ef01bae20e72f6ad5e4e94cf74652"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bf2c73687f7e761e36912ce948deb23d7ae37b0ec32e6432c855833a37560cf"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"526ae7534b2246f82c5ae35c0325b036b75242c590c9a36f9fad4a951d19da1b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"783e5f95170a9303babf24c00d4ff814f27d579a0faa03bcf473b3d64e7ed088"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"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":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"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":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"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":"f7c6ca8a64372f412fa6c17981481b7becb83975460d7a54a92199eb5d06b97d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"cc5d671f0c18f087f063b43e91ccfc263227626882deb15ada1e282a7cd4bfa8"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85d4356de1721eb33d27a9377f948962b5dd4cd8a3102945822ae72930ff968c"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f0ab54ccb7225db79ae37ee9112b43c90052b6047966b0b882f31828a458618"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ad92d102b9c115af6a28047138336c51e9b49d818ba2be0cdfcd153b82aa4f1"},"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":"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":"22bb0e5593625f37f1bad07bf1b24c43978ee881dad3f09346d2d92ea96c6bae"},"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":"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":"f6f9c0ee01119942273c5423388a31cf5712ceabb2b7a853db6137594836558c"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7808441ca736321976da09df01acf180101f893a499b21f50788f03bbf60467"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad1a461dec77ef0a4c9a980671062671435e37796a73a3565d73c31572c05c56"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"022e7847a18e0987a370c470f78a566d059b1a359294d1bec384aa064edec9f5"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ab841a6e71a2d0117550de8c1c706ca11d50a10fa3b0a37419579002f3b60de"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"315eeb41f194124a1d07a7632cdf8b6eb92fe75ba1571636744a94abd7d45a93"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce42e6be58ddefb2b9aee0609e247bee07caa0c2609ed72efc4c3007e2e578a9"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ffdfe7e0cf8b9f672c319780ecbc7acc75a60abeb4816309a3dd3bb59eeaae4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"a4b19dfb173e58690031f1945f30d43df5690e5c67d168187c5ec7d254615b56"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"f59b5c703bcf10a0412ddbcdd8e135a501a76f1aeea11967e06931d3b7249b59"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"62e9935241846cd0d88db15a555938c4e0f6d65d8fb1bd3c9b180bb0e0125439"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9321e0f61aad3dd2ae30434990de54d96cae1ac7c77cb342352da79baa1dc19b"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10d6be0b40aa461354d5b8f95ed5e5947f14bdf94cb92e5ce770fdcb0842d242"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"377670a6c1f867d9494942951613835b4d7ce587482be783e3e44d900f68c416"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2956f52e961805d1f65395b20280bfa030126552d869b05a937f991579d4a4c"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1db5de4e8d928b3ed0c0e5ded7e1ea575c2eb6e3d4afc733ad8160f3d22d6b90"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d997d36159c5071f2a91d26c001b20bf9b3ea3702479f74f00ee6923862aee97"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59374ff680d91cf5aada8df5a5885eed953bb6c9e5f7735963e87ca595ab2366"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"645299cce5ad4258ed2aafa0cda27e906ae4a81cddcc622e228cfcc85d64cce7"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"eb105cabcdf91c4ff3e64a5631802107ad2b2db210cdb2e8ba33fb4edb3dc1b6"},"properties":{"dependency":{"package":"anyio","version":"4.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4024","PYSEC-2026-4025"],"severity":"critical","fixedVersion":"4.14.2","relation":"transitive","reachability":{"kind":"production","file":"apps/api-python/app/modules/library/presentation/http.py","line":12}}}},{"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":"b4329cf59da2b357867f132b81e8c40576b77ad20b1b85f57c2dfb6aac880618"},"properties":{"dependency":{"package":"certifi","version":"2026.5.20","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"severity":"critical","fixedVersion":"2026.10.18","relation":"transitive","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":"0aeed8653dfda34ae8e4fe9d6b0f44f94bbaa93fea742af3cc94bbeb616b66ef"},"properties":{"dependency":{"package":"pillow","version":"12.2.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112899","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-112902","BIT-pillow-2026-114501","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59203","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-3451","PYSEC-2026-3452","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","relation":"separate-copy","declaredRange":"11.3.0","reachability":{"kind":"production","file":"apps/api-python/app/modules/auth/infrastructure/avatar_files.py","line":12}}}},{"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":"b14a8fd1dae14db99e822d557fd0ab8ed0a3f8e7114177e624a78de9fc5599ed"},"properties":{"dependency":{"package":"next","version":"16.2.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"16.4.1","relation":"direct","declaredRange":"16.2.12","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":"580de32376ebcef3a8e10a0b3cbad8df58b31101d7d4a3c934be28eb7b3aeab9"},"properties":{"dependency":{"package":"dnspython","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"2.9.0","relation":"transitive","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":"0825f292da7fdaed01de059f5916617ff32f9a9f7ddf8ddf20117e8842c62e18"},"properties":{"dependency":{"package":"pypdf","version":"6.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3655","PYSEC-2026-3656","PYSEC-2026-3910","PYSEC-2026-3911","PYSEC-2026-3912","PYSEC-2026-3913","PYSEC-2026-4153","PYSEC-2026-4154","PYSEC-2026-4155","PYSEC-2026-4156","PYSEC-2026-4157","PYSEC-2026-4158","PYSEC-2026-4159","PYSEC-2026-4160"],"severity":"high","fixedVersion":"6.21.3","relation":"direct","declaredRange":"6.14.2","reachability":{"kind":"production","file":"apps/api-python/app/infrastructure/pdf_embedded_metadata.py","line":11}}}},{"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":"b72c632b60dfdbc8f4d30c4b3b3c78d3ffa09de01a4dc6857cfe0b98c238ba07"},"properties":{"dependency":{"package":"starlette","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-248","PYSEC-2026-249"],"severity":"high","fixedVersion":"1.3.1","relation":"transitive","reachability":{"kind":"production","file":"apps/api-python/app/api/diagnostics_middleware.py","line":19}}}},{"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":"38a4f5f2098e420f1c8b649773c23ebf6fe86f11bba744d1ba27a9d3c5ac9ea2"},"properties":{"dependency":{"package":"github.com/marmelroy/Zip","version":"2.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","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":"11a339c84db057da3b487b4fa924bf8332133a03b09f3938eaf9dc72a2311ae8"},"properties":{"dependency":{"package":"vite","version":"7.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"7.3.7","relation":"direct","declaredRange":"7.1.2","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":"d5875c78ad7deaa6d879cd2daf7b114867a45bc97d444ec7f13c1cb7f9619a6f"},"properties":{"dependency":{"package":"pdfjs-dist","version":"6.1.200","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"6.2.108","relation":"direct","declaredRange":"6.1.200","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":"df21b8127d24aeed9579f3ce44f2f84d2d4f9ae41d6b03d4309b75c4781747cc"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.15","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]"],"severity":"high","fixedVersion":"1.1.16","relation":"transitive","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":"6fde06abe7dac0b6bc6951df4e58a3dd77b634a2402a8ce8ec6bcc39669c05de"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.6","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]"],"severity":"high","fixedVersion":"5.0.7","relation":"transitive","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":"ce9bbfea95fe015374ae86e03b9373fd15c82feee84c4ee070b765207d8d9476"},"properties":{"dependency":{"package":"browserslist","version":"4.28.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","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":"685cba4514570b53bf9bc85812fa54c07fec7b3f62fc67d4712c038e9ec2e605"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.3.2","relation":"transitive","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":"2ea65af982fbfa7ee58dbe3fa40bd975ecb648d209c563eae9269b519d2be2a6"},"properties":{"dependency":{"package":"nanoid","version":"3.3.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","relation":"transitive","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":"8bc75d6ae6f61b4c00859aaf5ab70991e1057622810c9a2f9baf0a4daea22f70"},"properties":{"dependency":{"package":"picomatch","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","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":"e4e0dd83584cb27c0d0d1e9d59854c83a45e11db83ca00fa9a7e894971acb833"},"properties":{"dependency":{"package":"picomatch","version":"4.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","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":"94c6ff14ea54b382a61d2f966f77a9032450e908372d7ab5d8acd1b161983573"},"properties":{"dependency":{"package":"postcss","version":"8.4.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.12","relation":"direct","declaredRange":"^8.4.47","reachability":{"kind":"test-or-tooling","file":"apps/web/package.json"}}}},{"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":"7bbcf727c11f3451b90e0c4181659fec15555399ba4dd1a967c87b3704c5ad8b"},"properties":{"dependency":{"package":"postcss","version":"8.5.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.18","relation":"direct","declaredRange":"^8.4.47","reachability":{"kind":"test-or-tooling","file":"apps/web/package.json"}}}},{"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":"5f538739e89f76b0971a5390fa8cddbf706f34980e213deea9c68f7ff3476760"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"0.35.0","relation":"separate-copy","declaredRange":"^0.35.3","reachability":{"kind":"production","file":"apps/web/e2e/comic-reader.spec.ts","line":2}}}},{"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":"3dae02efd4a19e70cfc4f7b9f8206dc9e35e058d135bf49ebbe5dd0128f7f56f"},"properties":{"dependency":{"package":"sharp","version":"0.35.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"0.35.4","relation":"direct","declaredRange":"^0.35.3","reachability":{"kind":"production","file":"apps/web/e2e/comic-reader.spec.ts","line":2}}}},{"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":"0bf997523edcbfd004b0e48079d2d03fc36b5b8058c165442d7b3299bf52fe16"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","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":"af3a18cf730f6276ad50ac81337c95bc6659e9de68697e5d39209e4ecd015b5a"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","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":"0851f5a2b3c1700180f0dfa5f6ec927589e14b1e96d0ad2db741b4fb5bd6c96b"},"properties":{"dependency":{"package":"mako","version":"1.3.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4243"],"severity":"medium","fixedVersion":"1.4.2","relation":"transitive","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":"6c296049d565e4a7e88e55657cb95abd9efa6cb0343f3ee6f2fd3930cd344cb5"},"properties":{"dependency":{"package":"opentelemetry-api","version":"1.44.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"1.45.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b7d88bb68ea785ef6a7108ccb834195333335074fe76772882f8fa507f04992"},"properties":{"dependency":{"package":"pydantic-settings","version":"2.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.14.2","relation":"direct","declaredRange":"2.4.0","reachability":{"kind":"production","file":"apps/api-python/app/core/config.py","line":7}}}},{"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":"81092f57b650938b52ec2a3fb7a44c0e1880f6daa266763e0a924d5a313b51d3"},"properties":{"dependency":{"package":"pyjwt","version":"2.14.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4141","PYSEC-2026-4183"],"severity":"medium","fixedVersion":"2.15.0","relation":"transitive","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":"16bc49aac72eafef4ac9a880a9755121d0367a6bdf3e48689c49c4d9d8c09a58"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.32","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","relation":"transitive","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":"c3bac0b956cc7625db5ffaa04443fc36030c2af44043a6f2dfd365abaf694f40"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"932a3bfecc4fdb553659a83b676fe51d69a354f33acdb515911e099d90c2a373"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"6.1.5","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f54d1f4607fdaea22194262dabcf05db6136d2d813d8619ac129c6b6f33edda"},"properties":{"dependency":{"package":"esbuild","version":"0.28.0","advisory":"[GHSA redacted]","severity":"low","fixedVersion":"0.28.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","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":"e44839652a6458a46c639313b80f352f523a2c17df7246dac6e0a2dbd2cf7216"}},{"ruleId":"D31","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":"8110d56106b567fa770a53624975c1f559e25a8a17a68948b6c870cb250809d4"}},{"ruleId":"D31","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":"f5a9c243361734b61c21f0f2e83079de3cb3eff69688ac500a9a86f481d92dbf"}},{"ruleId":"D31","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":"bada9f6ec2bb3eb7a10745a02551756867f7737f7a5be29b51c818c41c19a726"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"05082adfff2954d2ff29351ad6439da49c03373f356fbaa7d303d2dac4bb2d7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"57bed13a26312576bba2a20995f53acb587132df4057b047406990795f0a4178"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"e54bf941bdfe84c98e84c267831b8ce112fec5703f27c90b619e5cac1ded6d64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"70f0358913fab0a55f0633ca73ee2fde882102b1ababe632270f690abc5fd640"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"7d376d6c83a06bbb2ab58322de5d3b9cadfe0e4afb923ac640e8d01ac959522c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"1bb15f106033fac8071e67e6a363fecd1ae8e0960acb1d1e5f3860d27f78af7a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"b2b7e047d03a0914b0eb3ca692175233b66c916799a938f9685fcb0260930acc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"e8a98778eceb0f3f63a206ed2023bc73abcd64836c6b7b5cd3157ce79d0da9e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"ac75461a1e22503195d3db4588f7c9747cca63997deb1dbde7a84876b14a3c4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"ddb2f02fd0e3de9196e4a38ba4a1c2fca183b36c663a0141a1d9f41b142bdbc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"9850638c5c7968205a8951243f1adae25dc7296991b209c4f704bd82a16c7762"}},{"ruleId":"D31","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":"db0946a1d10bf49549d1c373e7f5a7a8ededa88ec67ffa7c81b76a40c59a19c7"}},{"ruleId":"D31","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":"e2c1f071c6b2072c2021b09b0f479f5de679f95abdb8b0cef85db1dce44b8991"}},{"ruleId":"D31","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":"3b7328ac1c705cd115bba9e81aa7dae9e1cc573ba404e5c8a0abc8547667a86e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: schemas.py \u2192 organize_service.py, client.ts, metadata-lookup-modal.tsx: \u0060apps/api-python/app/modules/library/presentation/schemas.py\u0060 changes together with 3 other files \u2014 \u0060apps/api-python/app/services/organize_service.py\u0060, \u0060apps/web/features/books/api/client.ts\u0060, \u0060apps/web/features/books/metadata-lookup-modal.tsx\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/presentation/schemas.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ba3af5100fae2634e4b4de9d153b254ee5c036d9997854570990ae8600f935"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: source_node_recognition.py \u2192 http.py, schemas.py, metadata_lookup_queue.py, organize_service.py, client.ts, metadata-lookup-modal.tsx: \u0060apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py\u0060 changes together with 6 other files \u2014 \u0060apps/api-python/app/modules/library/presentation/http.py\u0060, \u0060apps/api-python/app/modules/library/presentation/schemas.py\u0060, \u0060apps/api-python/app/services/metadata_lookup_queue.py\u0060, \u0060apps/api-python/app/services/organize_service.py\u0060, \u0060apps/web/features/books/api/client.ts\u0060, \u0060apps/web/features/books/metadata-lookup-modal.tsx\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 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 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c32ddcf99905487b1bce7c2178d6be0ab71c27aad35efc9a64113d2b1247c62"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: process_import_task.py \u2194 source_tree_repository.py: \u0060apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006008afade8\u0060 fix(imports): finish book metadata after partial resource failures; \u00601257f3d0\u0060 perf(imports): batch scan writes and preserve resource import intent; \u0060ffda2da2\u0060 feat(imports): finalize audio directories once per resource \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4f090dfb64f562f9e47e3c3bb80b83b4030d24b70ba55b1c6f8a2342b735d3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: http.py \u2192 organize_service.py, client.ts, metadata-lookup-modal.tsx: \u0060apps/api-python/app/modules/library/presentation/http.py\u0060 changes together with 3 other files \u2014 \u0060apps/api-python/app/services/organize_service.py\u0060, \u0060apps/web/features/books/api/client.ts\u0060, \u0060apps/web/features/books/metadata-lookup-modal.tsx\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/presentation/http.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db439a23100138180ac4c5825365987579d1e148bf109ad43dfae039552777"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ports.py \u2194 source_tree_repository.py: \u0060apps/api-python/app/modules/imports/application/readable_resource/ports.py\u0060 and \u0060apps/api-python/app/modules/library/infrastructure/persistence/source_tree_repository.py\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006008afade8\u0060 fix(imports): finish book metadata after partial resource failures; \u00601257f3d0\u0060 perf(imports): batch scan writes and preserve resource import intent; \u0060ffda2da2\u0060 feat(imports): finalize audio directories once per resource \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/ports.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b6d561f7035ddd51e7fddb17644cc5c2db262815e5735afb591c9ab0b5a757"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: process_import_task.py \u2194 scan_source_tree.py: \u0060apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py\u0060 and \u0060apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060a9f771dc\u0060 feat(diagnostics): persist and surface backend exception details; \u006002c4988d\u0060 test(imports): verify resource pipeline and retire asset dispatch [sk\u2026; \u00601257f3d0\u0060 perf(imports): batch scan writes and preserve resource import intent \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"356e981a04f2604ceb7f7053a484f513888da26522a108abbe94af443afb2f09"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: scan_source_tree.py \u2194 task_queue.py: \u0060apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py\u0060 and \u0060apps/api-python/app/modules/imports/infrastructure/readable_resource/task_queue.py\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006002932cd0\u0060 fix(imports): close scan gap upgrade, narrowing and waiting gaps; \u00606fd3c638\u0060 fix(imports): make scan readiness durable and scoped; \u00604d8f8319\u0060 fix(imports): scope scan failures to dependent tasks \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/imports/application/readable_resource/scan_source_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7990ad5d05c728b4d2887ea70911aab011d3c7606565d01491d05b1dc59f63b3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: organize_service.py \u2194 metadata-lookup-modal.tsx: \u0060apps/api-python/app/services/organize_service.py\u0060 and \u0060apps/web/features/books/metadata-lookup-modal.tsx\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are \u0060e11555e2\u0060 fix(metadata): fetch details after final candidate selection [skip ci]; \u0060132e2c14\u0060 fix(metadata): honor manual queries and reject conflicting authors [s\u2026; \u0060aa202f58\u0060 feat(metadata): correct title and author with AI identity [skip ci] \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e9c6b4da8577e701c576e87b5052417f0160b8625770357a7da8d21c9f833e"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbca12eeb8efdf5fcd9239148219d8989ef4b9dfe3f5e05bc72767a9c2c91f2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc9975cfc10463d9b81062719000566c7701a0bf76f057d0220eb9542d4ec69"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"59de3efe4c30dca23a4738bc01bd9e05598eed3b311882772155ef7d287bf7fd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9247e0d8a815f8a62d8608fcfaf03b0020266eed04530d331353b432753dc568"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d1750cc509b68be879662c3af150024030842c46a141b2acb87d8ee7be0d83"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25066994022cb1c4b0b02fd479fe33756c3f79d8af80a0b048666f4c5268957"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea75c4b665e915a74741890c3b877bae0e9072d1c52b17ca2c5cc2c3fc60ccfb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d778f0accdaf155190dbb38e152944b049ee3180fa5362e2c5a23a155a92dd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"08edbbbd576306833f9d4a4ef383f5f5a604727f315420cbe535181c792fd2d7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab90850bedeff433894cf4bc5e85c4a79587038b6ef0bb84dde933f633d2402"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/compact-language-switcher.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"089099c7d9524016c8f41ccdba675067f50ab63f5e2eed189ebc08a81778c7f1"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/resource-select.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee897b5c7b3f01dbcead19808a8fd4f1bfde27e16d2407df12bede8a75eee7"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c93211f2bb81acb8fa0a095b981dd26cb6662edd870071caaca07402ecbe7d7"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4bb7db9db5f53fca58ca19d526cb1d48ab75664d009455cf3e230bf50d11e7"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad1d62520a577a18f6e51eada7f7e4bf0e7d939c9980dab4028b24d4f6ee2b6"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"28151a08c85aaf182bf130744faac4e87625e1a0f85d6478e52c32d6e19bdf3f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fc7d10f033f73f474374928485c0a3fd1e4d5ffb2d15551432ff6172bd94ff"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a734c12fe392df5b69d6418e70ff001d53da267b064b9502663eb5240f214d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-shelf-dialog.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f06ca9ec38dc37d3a0aaa9a6f46d5867e1e7555b348a4bdd32a35302dcc0faf"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b2d0e4dd2b21cbdb1b1ab58ff46a2ba40a24ec85c0050b79efd1fa55780056"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2309f78578453d6d3893011431217909caae2bb962ac87af335517e103066a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1227fda344a2a489f50a5c50d717ea7dd04c8f494bbad48b080cd5e674033c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"44273438f8a628ef94d1b694425a1ec041c6b10130146461e44be4d3091bd3a2"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cdaa076506f97790d6502a6c0007498de52f9d8d08ad5d62b504fc256f4baf"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1542918eb1137eeafbf8e336c9dd2931b180d9d75d7f907d02f1cc1caa7fe"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0419f057e87de5ad1b9fda0eaacc4cc7b0cd083fd6891df1a9be61b5cf5ef24b"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CCombobox\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/async-filter-value-editor.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5483a201edd56c0caea3545a8578e98a7e2ef92761d0157adbd98b43f38fc2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"95890ea33f5f3f8f402e77ffbd3e89877e6b7fab31313b043f663a16413214f5"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f3471ef0ce2fe038ab6e7e1c7e61e073c10d3096b6730cd2764bf7ac564e38"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f9a1a47cd7ac49965f84934ca0ca5d301bc6addea8158ed2bfdb1cfb2fbf07"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6703ace8ebc9f11928d151d6ace165ed37780631f7b0869ef6a754047b5796a8"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CCombobox\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4738daace8defb6892c88f420a5ce02ade1fa5a7e0e5184fe547999e894350"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b92aeed11e7a03e800ccd506d0eb1f703d053debce52c29a9ce679e116a616c"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"044b312a8fb0064242e4e7c8c3658a63d990e7c209234fb9b000c6445d3227a0"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43314b5a21b7f637b7ab760f1387823cfa11306952a10d36de75c10c056406d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12c1acd8deaeb019513c74ec829a89e154b4da105217e9eb06a88616dd65604"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c6727679d58f60a443d3ba87efb4c4b0471cb1cd6d5dc0702554d41a836bed"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"29071c069461df70036ed354a2522e70c982a2ec75c9445767ece3829f89f70b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"333cd593a3e3e9cef05136c835b405e0462425875e5003905dbd2f71c06ea452"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc0ba4418d9a0e8c9529247cd4dc93fe34f26026002f4a31981e8ad105d6e00"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e784f2e16ef8727907b65246d90dd216a711d36a45600b3c0a815e4cf9a97f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f221fc19859f4d7f888c6c121139d52a3b2232adf3b513a70a70f2a79354e7d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63832fdd4e08f758c5fc4b799a1fbf7690ee23bc005d06eaa140f0a5e1d5e81"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6be3ed196d3c2b723715b34e3ca5dd5d8221cdb04a0b8fa57944e130db025d3"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2d0ee6f5d4a71ffdfdca1b7da45e8067a532a9d1d26aad3461ad30403f029b"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/recognition-settings-panel.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bf37d28d10734262303fbb2d6c0e3a87c1aaddf83a91bc919b7efa016a8124"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"340c10167494e26f214327ca7d3db5b791b6a0a7a91ea057b913dc7109e68351"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb84e7f6fb70564e5f61265df2537059ff843dddc23ce2c7380b664537ffb77"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/email-settings-page.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18296bdb426e5303e54e36f77db13c8a087f562e7747b369da5637715de6bee"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/import-preferences-panel.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"748b0f442671132cdf39d6fd57fd3503dd9b5e589036edbf1de8238998c6e47d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdfb648aeafb50bea29f16230d064cdf13e291d209920b3e7f29d87df90743f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf009c31dee94163c0dcdc24cddf16c7f83d78c82d1c60d1ca5b5f661958845"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a110b2606a3b4fd117972991f7e1fa0dc9944f378d2be653a84311abb24051db"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21d12f04ac703c69747989ef43b5d0c09a87d6b2d8d00d99a2d6fbc2f98739a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b3e735c64cdae501a516d18ac0fb86843483b141a761b82ce83526269af6c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch1\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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da117b227bec06fb0fbff995d6d75a6bb55d5a55d55e93491f2c2c8b0a573cd"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch2\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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62c1ab48af721f62095d45cc6db7050b58923f0000ab0234d6c7f1553183a7c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch2\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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc29d9b76b349a1bafc0e9c20ae748d7ddde949ce9bd0f4ff92722c98d7bb80"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch2\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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"318d1c014a5a4878c23ef5f801d779313d4c1a0b3a0d1889c613df844d78b968"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch2\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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a9ae0060e0d065a48a61a96db9cca155af06e329e483af6db6f14a4c747f8"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch2\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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"40212c70ae0f8d569f44b93fa41be98ee6c407f905a06378d6f1978954cadc2c"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: userScalable: false or a maximumScale below 2 makes the framework render a viewport that stops low-vision users zooming to 200%. Remove the zoom restriction from the exported viewport."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/app/layout.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e39ec1e12ac2bde04807ad1a3c50346f3c3f9d5fe45618005807a7a11d3db52"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-table.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6fddc7b66824483a94217c9be876e6aa5acc650b4d5b8077dd73e15c95e63c"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022alertdialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1c57a368ce831a5ec36d1f8fd84986a2cc5ac2d6b6a761b7c0d6fc703682f4"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/feedback.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae151fc13ec568027311eddb094f7f1b9bcb2f81c9b510a63af23bbd7b6b09dc"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2040eec7a038e294ec2505e7808874bd6bad1164c45c9b30fac89ccf7f2823b6"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/kindle-send-modal.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e0172a16e1a54f86ce6cc56a5dca3a70953b889fd27a07d7f9babaea55c2fc"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c1b78a35ea4a0499a0a3e1946251dacaab90f77ae44b00685b907c0b6efe8e"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b082eff854d14fe36edf25b144e661171dfa067a02040817bff6fbbbe18b771"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-metadata-editor.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eafaecd0a7b3410a626c9d1ca5f932dcbf1fba5b41aa45b19321c3208bd92eb"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43edf64e73950610c1fef74bb0e624362fc9b42060162218bbc1cf3dc601a0c"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9c0606f1f4f227012081e0f50067d04e1b4aebc586e24d33b2493a1d32d226"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fa9830208611ce649b730cfcd7cbda1e38f1f8b4a8619acbe37d095760a171"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/upload-book-dialog.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c72b7301b226caa9c78469b6373facc3235f7b7e55def11a380862c477a2193"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbdbc0d571a05536ac7c10d2423baace2f04e212de698dfb10dc44e0d15633c"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8766ea0c7e6109cb2291470f03a1197787231b0dbdcbf0e2f892433e088b52d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"75433b4717ab0ad0dc01fa8e5b8a66205997b1e662e6b7832acd3a2bfa4f198c"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11d7bd40ee81ed7491476e07c0ca6bb443845f6560b8483ae4b2d41ae580409"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ab446a58ac9a3d86edf165ba9f020eedc877f78a5cc6441cb90bcf06b78774"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d6b96159c1fd4847bee54bbe90a8f919b4442d47dd15ecaaf472d6e7659c5c"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a775fe1d8249af86fa13194a2505d3496b3a0c6fb2a25ba33c7c21123f85698"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022alertdialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31ae90d08a90fdd2432f07c3dcdf08eb16e89d2eadeec07a1e4b61943b38414"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/context-action-menu.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2002a9dca9d933d83bf9265bf7f8bdc564d48656cca3126732305c44c86ae367"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/feedback.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6ece482bdfd42fa00b616bd0c2081f18ae0cbaece9d1f73e37c51423be794b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5aa2c620ecf9ba186799357650c6d77dfdcb836dbdb6688daa9343087d8c66"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/kindle-send-modal.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"964a5c4b7aab6090a2b4a2ce597616c7734c488522f449bcc62b2a5bde920918"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1e5d215c8cb149e304510e52186bd3452e380df8c620da03f1f82c5d5b349b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.8:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7148f220b97ee482ed59164d20ee6cc198147ce3c3fdde3658a45df9963ce221"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"20578441c02d08515d27cc00f6936bda4654b33cba728630f2be501ef3400a32"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"967624c00c6636e510ef714edfa6b10401bd4c0acdcbc8aad877441774cc7224"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"069ec52705d48961dda3a7d4d9da48940ad209bfb7d5cfcbe892ddc834b7ff91"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9156637b22a2ec458b0190e529143a22273e1dd705f5789fdeb93b37082473b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"13967400b965c90daf569de8e3f67b64510d6bb78bb0d77a8c7245ea9a862bca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f626d957531464dde6b589fb85899c78078ebd381e4cb07f7df27017c25c5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7971ec78669f36f998c4f4368af1c0cb9016f3847bb119a095d0718fad2f8899"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"079a3dd5588f79834908c94f8071698cb38a3067ed22662e1f6c3d88d7d9ed0e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"909fc82eee1e8fdc3db53deecf008153c0cdbb8b01a943407c7e53cc9bfe5e47"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0706e4d7b415b6b0a538b8d8f0c903ec06ca5c5679e309a17a77348894b9b9dc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/library-import-settings-page.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8f3b64dfe94615fbc158433e2acb80c0f878f52b6705820194a933460b6326"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf6ceaf99bc8ed931216c65abe42cd2f3a4a786000d3179d28acf8b11c6ef20"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"215134a233b3dea06975245c0e26d798ff90ac34ec2190f8463ff7ce26294218"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.mobile-nav button.active\u0060 sets color: #ed4d2d on background-color: #fce5de \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet \u2014 editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.css"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dceb007adc54e6c9f884611d49a52a0d4471cfb014eec00252297d3b50176fd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060.editor-tools button:hover\u0060 sets color: #d94322 on background-color: #f0e9e4 \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet \u2014 editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.css"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc72ed87a8ac8ea0e43689da345edac7176dcf946e2a7bfb7b0c015c3b190aba"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.editor-switch button.active\u0060 sets color: #d94322 on background-color: #fff \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet \u2014 editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.css"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea9b090ab4ca9b461ca16dc0e2ba355c909b5ff8748af4cb5e9c6a1012b0edf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.upload-item\u003Eimg,.upload-file-icon\u0060 sets color: #d94322 on background-color: #f4eee9 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet \u2014 editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.css"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9501585c767a70d75a2f7a0404aef53f6d47fca254896e7f187ed840df0091c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.markdown-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.css"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b9f253cc0b294c11b34e59641be62dd5a775e6a190189b19b5c6fb497d3f90"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spinner\u0060 moves (\u0060animation: spin .75s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.css"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2dc86762e9ce303dc6cb2ee6fa021f18a8d426f271545f6f3a2e7d65521f7d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.shuku-loading-panel::after\u0060 moves (\u0060animation: shuku-loading-spin 0.85s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/app/globals.css"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3bd8c43721e6bc4d4fa305835ea1a2e798b48e1fdcfe7f812b7bcc1d863732"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ReaderV5Storage (16 required operations): \u0060ReaderV5Storage\u0060 declares 16 required operations: \u0060getClientId\u0060, \u0060getV5Progress\u0060, \u0060putV5Progress\u0060, \u0060putV5ExactAndPending\u0060, \u0060putV5PendingProgress\u0060, \u0060getV5PendingProgress\u0060, \u0060getV5PendingProgressForIdentity\u0060, \u0060listV5PendingProgress\u0060, \u0060deleteV5PendingProgress\u0060, \u0060putV5ExactAndDeletePending\u0060, \u0060getPreference\u0060, \u0060putPreference\u0060, \u0060deletePreference\u0060, \u0060addDiagnostic\u0060, \u0060listDiagnostics\u0060, \u0060clearAll\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader/v5-storage.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6600a956e823bbe4787360c55f3ed6d23dd3f4a0fd74206688d91df744d4be"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: AdministrativeSettingsRepository (77 abstract methods): \u0060AdministrativeSettingsRepository\u0060 declares 77 abstract methods: \u0060invalidatePendingResponses\u0060, \u0060loadKindleSettings\u0060, \u0060updateKindleEmail\u0060, \u0060listKindleTasks\u0060, \u0060createKindleTask\u0060, \u0060cancelKindleTask\u0060, \u0060retryKindleTask\u0060, \u0060deleteKindleTask\u0060, \u0060loadEmailSettings\u0060, \u0060updateEmailSettings\u0060, \u0060testSmtp\u0060, \u0060listUsers\u0060, \u0060loadUser\u0060, \u0060createUser\u0060, \u0060updateUser\u0060, \u0060setUserStatus\u0060, \u0060resetUserPassword\u0060, \u0060deleteUser\u0060, \u0060loadLibraries\u0060, \u0060createLibrary\u0060, \u0060updateLibrary\u0060, \u0060deleteLibrary\u0060, \u0060loadDirectory\u0060, \u0060loadLibraryScanSettings\u0060, \u0060updateLibraryScanSettings\u0060, \u0060listImportTasks\u0060, \u0060loadImportTask\u0060, \u0060listImportTaskLogs\u0060, \u0060retryImportTask\u0060, \u0060deleteImportTask\u0060, \u0060clearCompletedImportTasks\u0060, \u0060clearImportQueue\u0060, \u0060rescanImportFolders\u0060, \u0060scanDirectory\u0060, \u0060listImportScanJobs\u0060, \u0060loadImportScanJob\u0060, \u0060cancelImportScanJob\u0060, \u0060loadImportPreferences\u0060, \u0060updateImportPreferences\u0060, \u0060listOrganizeJobs\u0060, and 37 more. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/administrativesettings/application/AdministrativeSettingsRepository.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2885e0bc53258a692e6866d6a38f8aa82b9e2917afc91b8daef9e8a5aac306a0"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: MobileRuntime (16 abstract methods): \u0060MobileRuntime\u0060 declares 16 abstract methods: \u0060observeSession\u0060, \u0060start\u0060, \u0060connectServer\u0060, \u0060editServer\u0060, \u0060switchServer\u0060, \u0060removeServer\u0060, \u0060restoreSystemTrust\u0060, \u0060acceptInsecureTls\u0060, \u0060retry\u0060, \u0060login\u0060, \u0060loginToServer\u0060, \u0060loginToServerAcceptingInsecureTls\u0060, \u0060setupInitialAdmin\u0060, \u0060refreshCurrentSession\u0060, \u0060logout\u0060, \u0060close\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/public.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f140c3d4c494d0f7c9fbb0ecb5702cafff28c90f39a72ed373dd8b23a5c927a4"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: MobileRuntimeBridge (16 abstract methods): \u0060MobileRuntimeBridge\u0060 declares 16 abstract methods: \u0060observeSession\u0060, \u0060start\u0060, \u0060connectServer\u0060, \u0060editServer\u0060, \u0060switchServer\u0060, \u0060removeServer\u0060, \u0060restoreSystemTrust\u0060, \u0060acceptInsecureTls\u0060, \u0060retry\u0060, \u0060login\u0060, \u0060loginToServer\u0060, \u0060loginToServerAcceptingInsecureTls\u0060, \u0060setupInitialAdmin\u0060, \u0060refreshCurrentSession\u0060, \u0060logout\u0060, \u0060close\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/auth/public.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0750fe440f19482f36667efe821d592d6a1ca3253a329fbb56e45142ae8e0ac"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: WorkManagementRepository (20 abstract methods): \u0060WorkManagementRepository\u0060 declares 20 abstract methods: \u0060loadBookMenuContext\u0060, \u0060saveBookFields\u0060, \u0060replaceBookTags\u0060, \u0060loadManagementSnapshot\u0060, \u0060saveResourceFields\u0060, \u0060saveSourcePresentation\u0060, \u0060regenerateBookImage\u0060, \u0060deleteResourceSource\u0060, \u0060applyRecognizedFields\u0060, \u0060applyDirectoryMetadata\u0060, \u0060uploadCover\u0060, \u0060regenerateResourceCover\u0060, \u0060rescanBook\u0060, \u0060deleteBook\u0060, \u0060loadMetadataProviders\u0060, \u0060searchMetadata\u0060, \u0060loadKindleSettings\u0060, \u0060sendToKindle\u0060, \u0060setReadingStatus\u0060, \u0060setBookReadingStatus\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/workmanagement/application/WorkManagementRepository.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46bf7df730777217022139b177c2d6063b2818745fa7c569ba03d5b8efed8ff"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: BookResourceRepositoryPort (37 protocol members): \u0060BookResourceRepositoryPort\u0060 declares 37 protocol members: \u0060refresh_scan_context\u0060, \u0060page_directory_members\u0060, \u0060directory_failure_summary\u0060, \u0060page_ready_directory_cover_candidates\u0060, \u0060save_directory_assets\u0060, \u0060resource_cover_state\u0060, \u0060single_file_fallback_cover\u0060, \u0060resource_local_observations\u0060, \u0060ensure_book\u0060, \u0060get_book_id_for_source_node\u0060, \u0060get_resource_by_source_node\u0060, \u0060get_resource\u0060, \u0060page_book_resources\u0060, \u0060resource_matches_owner\u0060, \u0060create_pending_resource\u0060, \u0060refresh_resource_adapter\u0060, \u0060delete_resource\u0060, \u0060invalidate_asset_for_reimport\u0060, \u0060set_enablement\u0060, \u0060mark_resource_ready\u0060, \u0060set_resource_page_count\u0060, \u0060should_extract_first_page_cover\u0060, \u0060save_asset_local_metadata\u0060, \u0060refresh_resource_local_metadata\u0060, \u0060apply_local_metadata\u0060, \u0060clear_local_cover\u0060, \u0060mark_resource_failed\u0060, \u0060upsert_asset\u0060, \u0060asset_has_processed_version\u0060, \u0060asset_was_imported\u0060, \u0060count_ready_assets\u0060, \u0060refresh_audio_resource_aggregates\u0060, \u0060replace_navigation_units\u0060, \u0060find_outermost_directory_resource\u0060, \u0060delete_library_overlay_rows\u0060, \u0060delete_assets_for_source_nodes\u0060, \u0060reevaluate_ready_after_asset_loss\u0060. Counted over its public methods and properties, once per name \u2014 a \u0060typing.Protocol\u0060 is satisfied structurally, so every one of them is an operation each implementer must provide and each consumer depends on; \u0060_\u0060-prefixed members, static methods and data attributes are not counted, and an \u0060@overload\u0060 family is one operation. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/library/application/source_tree_ports.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad1ef96efec52ec52cf9ff82429d7173dec42134c50dc02faf22201825730fa"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: MobileRuntimeClient (16 requirements): \u0060MobileRuntimeClient\u0060 declares 16 requirements: \u0060observe\u0060, \u0060start\u0060, \u0060connectServer\u0060, \u0060editServer\u0060, \u0060switchServer\u0060, \u0060removeServer\u0060, \u0060restoreSystemTrust\u0060, \u0060acceptInsecureTLS\u0060, \u0060loginToServer\u0060, \u0060loginToServerAcceptingInsecureTLS\u0060, \u0060login\u0060, \u0060setup\u0060, \u0060retry\u0060, \u0060refreshCurrentSession\u0060, \u0060logout\u0060, \u0060close\u0060. Counted over its method requirements (members with no body), once per name; a default supplied by a protocol extension is not counted, because no conformer is forced to write it. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Application/MobileRuntimeClient.swift"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b34779107cd097f305c47ce90c99f5ae70670960eadfe83175a8bc5d744b2d"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: AdministrativeSettingsClient (75 requirements): \u0060AdministrativeSettingsClient\u0060 declares 75 requirements: \u0060invalidatePendingResponses\u0060, \u0060loadManagementSummary\u0060, \u0060loadEmailAndKindle\u0060, \u0060saveKindle\u0060, \u0060saveSMTP\u0060, \u0060sendSMTPTest\u0060, \u0060loadKindleTasks\u0060, \u0060cancelKindleTask\u0060, \u0060retryKindleTask\u0060, \u0060deleteKindleTask\u0060, \u0060loadUsers\u0060, \u0060loadUser\u0060, \u0060createUser\u0060, \u0060updateUser\u0060, \u0060setUserEnabled\u0060, \u0060deleteUser\u0060, \u0060resetUserPassword\u0060, \u0060loadUserEditor\u0060, \u0060loadLibrarySources\u0060, \u0060loadLibrarySource\u0060, \u0060createLibrarySource\u0060, \u0060updateLibrarySource\u0060, \u0060deleteLibrarySource\u0060, \u0060rescanLibrarySource\u0060, \u0060loadServerDirectories\u0060, \u0060scanDirectory\u0060, \u0060cancelDirectoryScan\u0060, \u0060loadImportTasks\u0060, \u0060loadImportTaskDetail\u0060, \u0060retryImportTask\u0060, \u0060deleteImportTask\u0060, \u0060clearCompletedImportTasks\u0060, \u0060rescanAllLibrarySources\u0060, \u0060loadImportScans\u0060, \u0060cancelImportScan\u0060, \u0060loadImportPreferences\u0060, \u0060saveImportPreferences\u0060, \u0060loadLibraryScanSettings\u0060, \u0060saveLibraryScanSettings\u0060, \u0060loadOrganizeJobs\u0060, and 35 more. Counted over its method requirements (members with no body), once per name; a default supplied by a protocol extension is not counted, because no conformer is forced to write it. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/AdministrativeSettingsClient.swift"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4d4c1bc59ef75a1f9042cf79a99beb95efbee4f6961fff33f830a60426c648"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 4/7 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060.\u0060, \u0060apps/web\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"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 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/fnos-package.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060HttpClient(\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":"apps/mobile/shared/src/androidMain/kotlin/com/ermao/library/shared/core/network/PlatformHttpClient.android.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae988dc7fae77d0affa1d29afef926db6f7e392fff0750ced5a8c5d3c8e51f1a"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060HttpClient(\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":"apps/mobile/shared/src/iosMain/kotlin/com/ermao/library/shared/core/network/PlatformHttpClient.ios.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"195a4cf84fcaaf59d9c9b8a0e36d9d4c37ad97e46b896a738d0b8e8b43b17bf5"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by SQLAlchemy create_all() outside the migrations: This repository versions its schema (Alembic), but SQLAlchemy create_all() here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Alembic own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/feedback-receiver/receiver/app.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3924ced12cde828b4e95699d3b5d0184b93e40d82cf744d4e83731100a30e7e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 14 sibling directories (82 clone groups): 82 duplicated blocks under apps/web/features/ have copies in at least two of the sibling directories audio, automation, books, dashboard, feedback, import-tasks (\u002B8 more sibling(s) not listed) \u2014 39 of them are reported below, and 43 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 82 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 82 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 82 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/api/events.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd626bb5eaa07c8b6ae085f49de75afb8fb3e485ba4c842b3ecd89ac77a47496"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (30 clone groups): 30 duplicated blocks under apps/web/ have copies in at least two of the sibling directories components, features, i18n, lib, scripts \u2014 12 of them are reported below, and 18 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 30 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 30 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 30 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3d3d5750af6073e4b5cb3f7b993948eda02d7cffa4dac99dc1218e04697062"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (112 matched lines \u00D7 2 locations): apps/web/components/ui/combobox.tsx:63 \u00B7 apps/web/components/ui/select.tsx:114 \u2014 the two spans are one implementation copied and then locally edited \u2014 805 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d9088664cd7a5eca1951a0c3291ddd1b7535859aa3990e0dd533803c81ae52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (106 matched lines \u00D7 2 locations): apps/web/components/ui/combobox.tsx:46 \u00B7 apps/web/components/ui/multi-value-combobox.tsx:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 813 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0fdbe2fa4db5bd0b6ff8ace3b0ec3460e3ef6f1310beb75f76f39578171624"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (86 matched lines \u00D7 2 locations): apps/web/components/directory/target-directory-picker.tsx:184 \u00B7 apps/web/features/settings/ui/directory-path-picker.tsx:162 \u2014 the two spans are one implementation copied and then locally edited \u2014 603 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2938f930ec710990e32d4b728a19572b4c395e2a4fe37809835486c6592fb2e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (86 matched lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/comic-adapter.ts:215 \u00B7 apps/web/features/reader/v3/adapters/pdf-adapter.ts:213 \u2014 the two spans are one implementation copied and then locally edited \u2014 563 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3493682c75716fa03c4b24fefd5ff5badf0149377c02d80d3fdc7b6e058b3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (63 matched lines \u00D7 2 locations): scripts/python-api-runtime-smoke.mjs:25 \u00B7 scripts/python-worker-runtime-smoke.mjs:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 442 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python-api-runtime-smoke.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59b88e277cf67e5037875ce5ca2b2d65b6644a6b8e49c63a7fe7b6df0e619ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (58 matched lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:895 \u00B7 apps/web/components/layout/app-shell.tsx:1060 \u2014 the two spans are one implementation copied and then locally edited \u2014 382 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":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be9c21bd1c5313e1e285beef72011f20fb308eb293db8c7347dad3663427e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): scripts/e2e-flow-check.mjs:24 \u00B7 scripts/python-api-runtime-smoke.mjs:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 395 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-flow-check.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47210b2c521c43b7ad9310d0843890b6c8bbf9359891d4614af07d6719f405a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (55 matched lines \u00D7 2 locations): apps/web/scripts/build-chapters-wasm.mjs:6 \u00B7 apps/web/scripts/build-mobi-wasm.mjs:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 544 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/build-chapters-wasm.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7941c7ccd68e832208c9140f61b0d1b74f9781483ee0248a1aeaf4ac1855dab0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): apps/web/components/ui/multi-value-combobox.tsx:92 \u00B7 apps/web/components/ui/select.tsx:104 \u2014 the two spans are one implementation copied and then locally edited \u2014 474 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae4bc48c4a40d618bb46d91d3a97834c2b6b68f0aa5af3869445525bb68997b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): apps/web/features/management/api/events.ts:19 \u00B7 apps/web/features/organize/api/facets.ts:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 385 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/api/events.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"68af8d2791deadc94e3d621d94b3ae52717aa431da743c6cb743c11a882ddfe7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (42 matched lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/mobi-worker-client.ts:10 \u00B7 apps/web/features/reader/v3/original-publication/text-worker-client.ts:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 339 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-worker-client.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fabbfc02bf78cd6f7ca832ad92a4fa6ceb72514e2414e6fca8a45689d1c19e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): apps/web/scripts/migrate-i18n-jsx-attributes.mjs:14 \u00B7 apps/web/scripts/migrate-i18n-jsx-expressions.mjs:20 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6483a3de53f001c7e421144ea7f91490d10b6805c51d74de973bcc149f32df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): apps/web/features/library/async-filter-value-editor.tsx:27 \u00B7 apps/web/features/library/ui/library-tag-input.tsx:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 222 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/async-filter-value-editor.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2554ad0b45eb9f2ca66b80565c8e8cd253c7c4b674c39f8cdeac0ef6c3c6521"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): apps/web/features/audio/audio-playback-provider.tsx:588 \u00B7 apps/web/features/reader/v3/reader-v3-page.tsx:407 \u2014 the two spans are one implementation copied and then locally edited \u2014 183 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffe4e48d30abc9c83a9d493e08a40b460edd3daac5056e92c4c884dc9aaf5d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): apps/web/features/reader/reader-shell.tsx:1117 \u00B7 apps/web/features/reader/reader-shell.tsx:1180 \u2014 the two spans are one implementation copied and then locally edited \u2014 188 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfca7e70412a953d25a628d2dbfafa9c4ca86a967aa6d317a5c20bfddafbf91d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/web/features/organize/classification-management-panel.tsx:169 \u00B7 apps/web/features/organize/organize-page.tsx:415 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b51f2df80b3cbf71d7bf17918d8a91f4e5e6175562880a7bda3942308ead282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/readium-publication.ts:377 \u00B7 apps/web/features/reader/v3/adapters/readium-publication.ts:401 \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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1b8ee828c1f3678521c2655144a5db63c515bc49dab11f00b43514984b6b56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): apps/web/lib/pwa/frontend-resource-update.ts:43 \u00B7 apps/web/lib/pwa/frontend-resource-update.ts:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 147 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":"apps/web/lib/pwa/frontend-resource-update.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d9c1b9da59fa20a9629ab155af2d3ea8d3fdfd529d2323e856954b41e6c51b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/web/scripts/build-mobi-wasm.mjs:23 \u00B7 apps/web/scripts/verify-mobi-wasm.mjs:9 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/build-mobi-wasm.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"01666a259583ca02915205178802980c6298a21d8b9d16fe70e916772a604671"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): apps/web/scripts/verify-chapters-wasm.mjs:15 \u00B7 apps/web/scripts/verify-mobi-wasm.mjs:9 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/verify-chapters-wasm.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"db99add2644aa249b992b7c85a812416e425b35837403d60efaebe30171885ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): apps/web/features/kindle/kindle-send-queue-page.tsx:127 \u00B7 apps/web/features/organize/organize-page.tsx:259 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27f405f70006d17d398ebdea62fa1f7bb108a4c7942679788ad928c78355bef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:395 \u00B7 apps/web/features/reader/v3/use-reader-pwa-surface.ts:19 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"93867efff170df42997a40d45e226935102a168d8a747da08fd32fb3586bc9d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): apps/web/components/ui/combobox.tsx:74 \u00B7 apps/web/components/ui/multi-value-combobox.tsx:157 \u00B7 apps/web/components/ui/select.tsx:136 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb31c57e0b13a0fb714676e84f15b1a1e39f5b6438e5ab30003a7bb2cf184a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): apps/web/features/books/metadata-lookup-modal.tsx:127 \u00B7 apps/web/features/books/ui/source-node-metadata-dialogs.tsx:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 106 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4373929bfe4159c2de209a55f2c85cfe7f1995f186a02c07d332546bb4259318"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): apps/web/features/library/api/bulk-operations.ts:37 \u00B7 apps/web/features/management/api/events.ts:22 \u00B7 apps/web/features/organize/api/facets.ts:18 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/bulk-operations.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b8d3df3066cd52373a2cbb5a1f9691f745c91acb001d80a1c33d6347a2eec2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): apps/web/features/reader/v3/paged-track/paged-track-controller.ts:505 \u00B7 apps/web/features/reader/v3/paged-track/paged-track-controller.ts:529 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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":"apps/web/features/reader/v3/paged-track/paged-track-controller.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa0618380b947ba45acd194479a0045db48914f63e24e60d0d23e7311469251"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/web/features/books/book-detail-page.tsx:262 \u00B7 apps/web/features/import-tasks/import-tasks-page.tsx:182 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6b5732803c4aede923c64d23e0112f7f3ff92f24d106b37a56b77e17e5b8cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): apps/web/features/dashboard/dashboard-page.tsx:84 \u00B7 apps/web/features/library/library-page.tsx:506 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/dashboard/dashboard-page.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b7f63fd803943778f1b89d99ab6620bc0f682ae428b94baa8a2f87593c2116"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/chapter-core.ts:57 \u00B7 apps/web/features/reader/v3/original-publication/mobi-core.worker.ts:26 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/chapter-core.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13c2f356e50df62d5f302e5b190a710078cb2946a91e3238e2f826359592b34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/web/features/reader/v3/security/epub-archive-safety.ts:26 \u00B7 apps/web/features/reader/v3/security/epub-archive-safety.ts:42 \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":"apps/web/features/reader/v3/security/epub-archive-safety.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"315183d29c3c5b5fbfac0423830443ed6307d4066670b15334666dbe7d9782f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): apps/web/features/settings/settings-page.tsx:140 \u00B7 apps/web/features/settings/settings-page.tsx:246 \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":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f2ce8d8bfc5910e62de7aff7ff8c1d9399bbe9b05e05e21403b2a3dfe62368"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/verify-python-backend-migration.mjs:21 \u00B7 scripts/verify-python-backend-migration.mjs:37 \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":"scripts/verify-python-backend-migration.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a2847e903cc8201b958a24956be21bc4372590acf0dc163cc6fafe55e51e0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/web/features/import-tasks/api/client.ts:52 \u00B7 apps/web/features/library/api/filtering.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/api/client.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe72ec6457ce9e6671b8b5e7749316cb346ace7bb4a25f05c69d808979aa7340"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): apps/web/features/management/management-logs-page.tsx:317 \u00B7 apps/web/features/management/management-logs-page.tsx:358 \u2014 the two spans are one implementation copied and then locally edited \u2014 219 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":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"826db0c68a0ee1ff42fe922a597817af16b381bd044c3ef6b83e8c7990ade406"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): apps/web/features/audio/api.ts:14 \u00B7 apps/web/features/books/api/client.ts:17 \u00B7 apps/web/features/reader/v3/api.ts:103 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/api.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"759b6a81174a7e80b4e012919e72a977f52350ac597f1de94295bb768d707470"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/web/features/books/book-detail-page.tsx:159 \u00B7 apps/web/features/books/ui/source-node-metadata-dialogs.tsx:62 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee41501e2aa822e4377df8959ad82fccc0a97419ae2856eb74e5afbacd28fc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/web/features/dashboard/api/dashboard.ts:30 \u00B7 apps/web/features/management/api/overview.ts:62 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/dashboard/api/dashboard.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"424e1182fae9e0065b233fb59621a6997950378b6b6e320fb383132dbb823520"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/chapter-core.ts:337 \u00B7 apps/web/features/reader/v3/original-publication/chapter-core.ts:378 \u2014 the two spans are one implementation copied and then locally edited \u2014 128 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":"apps/web/features/reader/v3/original-publication/chapter-core.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d8b6c7cfc95588802389d58913ea608ddd4dfd36080358a14cb2355b1bc16b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): apps/web/scripts/generate-i18n-catalog.mjs:30 \u00B7 apps/web/scripts/migrate-i18n-jsx-text.mjs:23 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-i18n-catalog.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa30e09010c899a602c4317b1baac530953aa25e8f601a5fab940fd624bc3115"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): scripts/e2e-flow-check.mjs:42 \u00B7 scripts/e2e-flow-check.mjs:62 \u00B7 scripts/python-api-runtime-smoke.mjs:33 \u00B7 scripts/python-worker-runtime-smoke.mjs:19 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-flow-check.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabfccdbb2eddc3a6a09162bde94898d2adfadbbf1c41bb404abf0ad123e5800"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/readium-web-poc/src/api.ts:37 \u00B7 apps/readium-web-poc/src/locator.ts:78 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/api.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5b85f2d48c1fcdd0193c6ebd2e4fbe2742556b45db0f7f888135989db5a78d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/web/components/audio/audio-mini-player.tsx:358 \u00B7 apps/web/components/audio/audio-mini-player.tsx:370 \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":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dfd4b68f2facec1ec65aea36653bab30e2934639829b6f7b7faf1ad6033cb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/readium-publication.ts:449 \u00B7 apps/web/features/reader/v3/adapters/readium-publication.ts:475 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2881a0b636455801e7acc1c8d606ae6a4fc88ad1b6ee3cf81240f6e63077f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): apps/web/features/settings/settings-page.tsx:372 \u00B7 apps/web/features/settings/settings-page.tsx:554 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a664c2b3bc5a612f51191f7bf3c6aed009b5acaf989d4766d989e42f5c53ce8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/web/components/directory/target-directory-picker.tsx:160 \u00B7 apps/web/components/layout/app-shell.tsx:575 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30430c03536a410199b75be239464e96b2fcc18a08f4219182c1450db639073"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:370 \u00B7 apps/web/features/settings/login-page.tsx:44 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b0dfc7558e4e51d95b1bd27098a85f181e16465fc685831a3ac34482506892"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/web/features/books/api/client.ts:124 \u00B7 apps/web/features/books/api/client.ts:385 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7229714915ecee7fff0e622b003e3dd8be32406aa8d56bd9d30b34baf9d33f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/chapter-core.ts:81 \u00B7 apps/web/features/reader/v3/original-publication/mobi-core.worker.ts:119 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/chapter-core.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3fe4e12a215a5c614035ce20873ca22c201f8969fa6da7f18c86fe2c34b308"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/web/features/reader/v3/presentation.ts:119 \u00B7 apps/web/features/reader/v3/presentation.ts:130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/presentation.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81eebd9ac337ea001f599a8fc5573f639af5564654ff5c395752c498df4f9d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/web/features/settings/api/import-preferences-client.ts:8 \u00B7 apps/web/features/settings/api/opds-settings-client.ts:5 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/api/import-preferences-client.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b751d7228820b8d6388c3bfc2de33d1d499a1428f26b96559ab5c544fe12362a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): apps/web/features/settings/center/library-scan-settings-panel.tsx:59 \u00B7 apps/web/features/settings/center/library-scan-settings-panel.tsx:82 \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":"apps/web/features/settings/center/library-scan-settings-panel.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaee3295c7dbec7a0c58843949b5b6e67de3ed990a3783285b9ddff0c23c5aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:633 \u00B7 apps/web/features/shelves/shelves-page.tsx:293 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa408639e451474338dbace8b1ae4b3fd5ad7673583222454f545f17a8198d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/web/features/library/api/books.ts:66 \u00B7 apps/web/features/shelves/api/schemas.ts:20 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/books.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c34928eeb4e92d2d126178864435bc51c9d996c8ca7dcad3a0949ff9b8c7a85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): apps/web/features/library/api/filtering.ts:36 \u00B7 apps/web/features/management/api/events.ts:32 \u00B7 apps/web/features/organize/api/facets.ts:28 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/filtering.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"df103c31ced5744b2c4f07e040a6103008d67d85ce49633cf230ab461d0cea76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/web/features/library/smart-filter-builder.tsx:144 \u00B7 apps/web/features/library/smart-filter-builder.tsx:160 \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":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e19f2c386ae0aea415ffd52c5850298751b630e9c1fcb418560ac941214e812"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): apps/web/features/organize/metadata-providers-panel.tsx:80 \u00B7 apps/web/features/organize/recognition-settings-panel.tsx:100 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b16bb8dd317f38a851d009dc68d45e86c229eaf7450afe96b9bb45206ac207"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/web/features/organize/recognition-settings-panel.tsx:129 \u00B7 apps/web/features/settings/center/email-settings-page.tsx:157 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/recognition-settings-panel.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dabc9b66ba1d0b5a44c50f446562fb83ed421160943f1b818629098e0b9d62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): apps/web/features/settings/center/account-panel.tsx:98 \u00B7 apps/web/features/settings/center/account-panel.tsx:119 \u00B7 apps/web/features/settings/center/account-panel.tsx:144 \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":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"790b2185d9d1d22378d26f25264a8ef52db2e6e30219eba30beadb415010ff29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): apps/web/lib/comic-preload.ts:5 \u00B7 apps/web/lib/comic-preload.ts:31 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"apps/web/lib/comic-preload.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76a032266da38f5f11e1199de13a66418af0091aeb02811b62b9b5cf2ab15ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/components/audio/audio-mini-player.tsx:87 \u00B7 apps/web/components/ui/select.tsx:130 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff60391a58c2d351a7c85fe04e606bf15b7245b05b981f82928f7994a4e640e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:842 \u00B7 apps/web/features/settings/center/settings-secondary-nav.tsx:107 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee819dbc26332095daea44dd81eba668a4ec85be7634c6ead41d4a85fd43df39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:1032 \u00B7 apps/web/components/layout/app-shell.tsx:1053 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec47bc89a501cb179923f35808f4807208b0e4cbdaa04af45c3e974c7f128f6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/components/system/pwa-client.tsx:546 \u00B7 apps/web/components/system/pwa-client.tsx:561 \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":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ebeedc56ba5033057fae833682d5cc915a9e2d3ff1d4a4ca1fe947b0051660"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/features/books/api/client.ts:473 \u00B7 apps/web/features/books/api/client.ts:497 \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":"apps/web/features/books/api/client.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d39f61a605f96efbc95550c4fb4fd8fec15a9bf9280578e4f001cd53b817f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): apps/web/features/dashboard/api/dashboard.ts:4 \u00B7 apps/web/features/library/api/bulk-operations.ts:38 \u00B7 apps/web/features/management/api/events.ts:23 \u00B7 apps/web/features/organize/api/facets.ts:19 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/dashboard/api/dashboard.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a6b8bee764ac6ae9275559a1c540221dac3a256404d9aa4f940813537e60e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/web/features/import-tasks/api/client.ts:52 \u00B7 apps/web/features/management/api/overview.ts:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/api/client.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3abc778de26c691a5f744426c8c0950171045dc3815d48a16e7eae6643a712b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/web/features/library/api/filtering.ts:125 \u00B7 apps/web/features/settings/api/libraries-client.ts:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/filtering.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"715ef7611f937b46df6933335bb27bba061dcd2a59f0260ac52a67968645c99f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/features/organize/organize-page.tsx:341 \u00B7 apps/web/features/organize/organize-page.tsx:383 \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":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b587b45604d10e79b74dc2232ac5c9e1151216fe5cf40d546dbc0f4fb8e75f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/mobi-core.worker.ts:312 \u00B7 apps/web/features/reader/v3/original-publication/text-publication.worker.ts:259 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-core.worker.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d00d86c611b2007a30d7651c9019ce498169670a494b2dc455bedfd91620e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/features/reader/v3/reader-v3-page.tsx:178 \u00B7 apps/web/features/reader/v3/reader-v3-page.tsx:200 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb52bebec0e46a42b4131facf14713ba4dd55b871723c127d8369ad9b5f9df5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/features/settings/center/opds-settings-page.tsx:41 \u00B7 apps/web/features/settings/center/opds-settings-page.tsx:56 \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":"apps/web/features/settings/center/opds-settings-page.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52024d75254a87ee2cbe547fbe13571986c7eca06990a4d6a693d6b0b61e0cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/features/shelves/shelves-page.tsx:247 \u00B7 apps/web/features/shelves/shelves-page.tsx:288 \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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b5ef00c61a2583bbd665e6f1029afbb22e96977af61cf56ef6be69f223ecf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): apps/web/features/shelves/shelves-page.tsx:942 \u00B7 apps/web/features/shelves/shelves-page.tsx:1001 \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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"0783843c23af56bfeee14dcad721be22dc95238df2aacde4bdeec261af63f6e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): apps/web/i18n/provider.tsx:76 \u00B7 apps/web/i18n/provider.tsx:101 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"apps/web/i18n/provider.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"69199b2d20733d3513a6558b3bd78ad6c5cb92c68c222661a0dd185b029612e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:113 \u00B7 apps/web/features/reader/v3/use-reader-pwa-surface.ts:7 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9254fde29ef24aeae4783c06dc940ad7f108f8e4e9314227bd4477676661571c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:544 \u00B7 apps/web/features/reader/reader-shell.tsx:622 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"082a3cc0f49bec5be081fa312ebc478deb29163ccb60f097d963d0afa07d0143"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/web/features/audio/audio-model.ts:88 \u00B7 apps/web/features/books/book-detail.ts:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-model.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca2eedb2ed490b5f414395ec879d0758794d288fbb88160ece9a5cd86a9e83c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/automation/api/client.ts:9 \u00B7 apps/web/features/automation/api/client.ts:17 \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":"apps/web/features/automation/api/client.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db3a3777d84a6a1bf777a42c4b0839aa2ebb51cc8789d94886d88f24d5253cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/automation/api/client.ts:10 \u00B7 apps/web/features/updates/api/operations.ts:6 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/api/client.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b304797610fca9ae4b57f269b18614ef158611c3f0d0b4e10ef379fa95ef452"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/books/book-detail-page.tsx:608 \u00B7 apps/web/features/books/ui/book-action-controller.tsx:186 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870ee0f08b0340b3643f41e3f07c3f6d1737a52f04002cc72b0904e79513198"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/dashboard/dashboard-page.tsx:176 \u00B7 apps/web/features/dashboard/dashboard-page.tsx:185 \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":"apps/web/features/dashboard/dashboard-page.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b388eb00974a74774ef2ea580494e0262956d833e73d8483005e78b966de9e67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/dashboard/model/continue-reading.ts:15 \u00B7 apps/web/features/library/api/books.ts:39 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/dashboard/model/continue-reading.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28754f3d814d9784e4f9656aa088e64031c47418da0af6fabfcfc8e13a7893d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/web/features/library/api/bulk-operations.ts:58 \u00B7 apps/web/features/library/api/filtering.ts:124 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/bulk-operations.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b9ab1260c533098874f8a39f6498d41b814f94ca9aeed63682a82724837e33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/web/features/library/api/bulk-operations.ts:59 \u00B7 apps/web/features/settings/api/libraries-client.ts:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/bulk-operations.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"888e4e6e60bc815f5cd33ca37fdf7f414ac8be62c495293f074d1bef548170d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/reader/api/client.ts:56 \u00B7 apps/web/lib/reader/v5-storage.ts:76 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/api/client.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"530aecedf43800ee609a5bd56514b7cbe13c5fb1d014cb6d795077657f94b4d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/comic-continuous.ts:223 \u00B7 apps/web/features/reader/v3/adapters/comic-track.ts:414 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-continuous.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2573e9c9c850b30bfc5fcf798932e62a0fabe7d267c6bf762e68b54cb23500"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/comic-continuous.ts:223 \u00B7 apps/web/features/reader/v3/adapters/pdf-adapter.ts:627 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-continuous.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dfea749d842ab3822bc163c56cf125e24a014bd096d14bb2ba53c368cdbdc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/comic-track.ts:147 \u00B7 apps/web/features/reader/v3/adapters/comic-track.ts:209 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4b74e8e49031a6be1ecb032adbb6524b98b00a9798500123d8180ba88fae75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/comic-track.ts:414 \u00B7 apps/web/features/reader/v3/adapters/pdf-adapter.ts:627 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4ff5d134c5480794dd5181e7a0dd5ec4cd332e9fa1e9e0ad196f6e7ab21d8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/mobi-core.worker.ts:200 \u00B7 apps/web/features/reader/v3/original-publication/mobi-core.worker.ts:228 \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":"apps/web/features/reader/v3/original-publication/mobi-core.worker.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d8df995fe7af05ef671b7db9bada37687198bf6b0799c0d44e0a7bd41f77dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/reader/v3/security/reader-safety-policy.ts:637 \u00B7 apps/web/features/reader/v3/security/reader-safety-policy.ts:659 \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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"626c5de2b38d09b69f54a8b0f759bf7b210ebd51092bc3cba9d3fd4959fc8314"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): apps/web/features/settings/center/account-panel.tsx:80 \u00B7 apps/web/features/settings/center/account-panel.tsx:96 \u00B7 apps/web/features/settings/center/account-panel.tsx:142 \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":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"113bfd4cc83f9df44231a9d4021272e842ef9da9447fd3ccf00f32d409ce5abd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/settings/center/account-panel.tsx:163 \u00B7 apps/web/features/settings/password-reset-pages.tsx:116 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56e787ddb0407dcd479b2aeb08270948c3ab6e5031fe0262d815e4801847681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/features/shelves/shelves-page.tsx:659 \u00B7 apps/web/features/shelves/shelves-page.tsx:676 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"504f0582d411f2967fb292dfd59db80977462d506b08021c8793dfeacf3bec0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web/lib/reader/v5-storage.ts:131 \u00B7 apps/web/lib/reader/v5-storage.ts:153 \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":"apps/web/lib/reader/v5-storage.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7767bc594bd7bda0b1e77f22e0fca9fca267a349a4de3e9ae35c3288310020"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/web/features/books/ui/book-shelf-dialog.tsx:21 \u00B7 apps/web/features/shelves/shelves-page.tsx:99 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-shelf-dialog.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f0192057b78d636130917c185b6949f70ca41481bb2d7a16b495233e9b57fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/web/features/import-tasks/import-tasks-page.tsx:96 \u00B7 apps/web/features/organize/classification-management-panel.tsx:27 \u00B7 apps/web/features/settings/settings-page.tsx:59 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dfbba2cf9f221eac968d4f6e7142f02d01ed5e4cfe5da2a782610877d64f96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/web/features/library/api/books.ts:40 \u00B7 packages/reader-core/src/preferences.ts:59 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/books.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c283e3d6329acd154de8e26b0146f1b1e759b7669e819403017ce044cbe38336"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/web/features/library/library-page.tsx:261 \u00B7 apps/web/features/settings/center/library-scan-settings-panel.tsx:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b654901d82cf167acf4e0dbc1fe0102955b372fa50a4817de23bbef367cec1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/web/features/library/model/filter-option-search.ts:22 \u00B7 apps/web/features/library/model/library-query-debounce.ts:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/model/filter-option-search.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7015c348681682dafcf4eee36f4f4c245dd19b482597768ab2c45590e14de8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): apps/web/features/organize/metadata-providers-panel.tsx:72 \u00B7 apps/web/features/settings/center/email-settings-page.tsx:83 \u00B7 apps/web/features/settings/center/email-settings-page.tsx:104 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"99251da07ed5605a8c895184ae792370b7395b2440b9f02ed2532b750153a1f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/pdf-adapter.ts:502 \u00B7 apps/web/features/reader/v3/adapters/pdf-adapter.ts:542 \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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eadd4e2de9f21b0aa5b51ed245b13ce07bef302566f1936bea6faaa34ed7a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/local-publication.ts:187 \u00B7 apps/web/features/reader/v3/original-publication/local-publication.ts:199 \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":"apps/web/features/reader/v3/original-publication/local-publication.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3440fa3b998e202d255f1224df9ad9b9aded8041af28e6af8b7ba0b8bb33a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): apps/web/scripts/generate-i18n-catalog.mjs:17 \u00B7 apps/web/scripts/migrate-i18n-jsx-attributes.mjs:16 \u00B7 apps/web/scripts/migrate-i18n-jsx-expressions.mjs:22 \u00B7 apps/web/scripts/migrate-i18n-jsx-text.mjs:15 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-i18n-catalog.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b77ed745ff9d4520cdbf11e0a42bf906abbe777a5ff5c007215ad68d02befcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): apps/web/scripts/migrate-i18n-jsx-attributes.mjs:138 \u00B7 apps/web/scripts/migrate-i18n-jsx-text.mjs:88 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d814c3b4a89b6d14322ec5c2db03ecb255234ccf60c3e847e789aaacedf625a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/components/directory/target-directory-picker.tsx:79 \u00B7 apps/web/features/library/upload-book-dialog.tsx:26 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d32178745ba9dfe3d07eae7edb32c28cbd03a1c6bc127d9ae25c7b0b1b4ca8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/components/layout/app-shell.tsx:433 \u00B7 apps/web/features/reader/v3/use-reader-pwa-surface.ts:53 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ff7a2bd53d0d058a9143ab769d44917f9dc25c274ce95b79629136bd7008b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): apps/web/features/books/api/client.ts:135 \u00B7 apps/web/features/books/api/client.ts:183 \u00B7 apps/web/features/books/api/client.ts:563 \u00B7 apps/web/features/reader/v3/api.ts:140 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"528d5f4406755aba6fbb04a9f55cb3dc5671be5c08a31876d747608aad308c44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/books/api/client.ts:635 \u00B7 apps/web/features/books/api/client.ts:642 \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":"apps/web/features/books/api/client.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"7621d4d95cd77bedbca69332646d1709a645d8222e6cb7083e2f8821d68166b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/books/book-detail-page.tsx:197 \u00B7 apps/web/features/books/book-detail-page.tsx:205 \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":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a074e01612c43bdf17aa2c7fb46f0fe212fa6d69dad4c77d5167e46583c31e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/books/kindle-send-modal.tsx:30 \u00B7 apps/web/features/library/library-batch-actions.tsx:169 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/kindle-send-modal.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cc0339d6c324e837d79304ee22127c5c1ba586c58b294b371f2c33f9fe3519"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/web/features/import-tasks/import-tasks-page.tsx:107 \u00B7 apps/web/features/library/library-page.tsx:103 \u00B7 apps/web/features/settings/center/email-settings-page.tsx:73 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ade855d761509a201e9606add15caa6716b1f23a8d09fe3bbf719ae154eb50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/web/features/library/library-batch-actions.tsx:168 \u00B7 apps/web/features/library/library-page.tsx:106 \u00B7 apps/web/features/settings/password-reset-pages.tsx:84 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d863a76720f4af0457fe317d3491eb88f557a062271f00cecb41f4b36875064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/web/features/library/library-page.tsx:105 \u00B7 apps/web/features/settings/login-page.tsx:36 \u00B7 apps/web/features/settings/password-reset-pages.tsx:83 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fea39d22fbfa4260e7a060bfe3f8b70819d802d4fd60fb012b9503ae700346b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): apps/web/features/management/management-logs-page.tsx:102 \u00B7 apps/web/features/organize/classification-management-panel.tsx:28 \u00B7 apps/web/features/organize/organize-page.tsx:212 \u00B7 apps/web/features/settings/center/account-panel.tsx:38 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e29754bee8b7cff2edcb42ed83590f4ef8398944a75dff4ebc1b7923be35730"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/organize/organize-page.tsx:101 \u00B7 apps/web/features/organize/organize-page.tsx:168 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e7b9ac968d8c14f2e1b432e49356f0d753696e7da705d944e6ee4e62eeeee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/comic-track.ts:184 \u00B7 apps/web/features/reader/v3/adapters/comic-track.ts:437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6d4717ff575869faa7c59ccf4ce3f62a93dfc3d039b643f878323ce639a593"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/pdf-adapter.ts:716 \u00B7 apps/web/features/reader/v3/adapters/pdf-adapter.ts:732 \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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0fd10b71ffa8e60e7ad677ea83cdfe355a2918f7abc9f32789a38f024512a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): apps/web/features/settings/api/import-preferences-client.ts:9 \u00B7 apps/web/features/settings/api/library-scan-settings-client.ts:4 \u00B7 apps/web/features/settings/api/opds-settings-client.ts:6 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/api/import-preferences-client.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f538a38a2c4100deed82c3291c065fee3af3b344ae5d5f0f6bee23a8f541fea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/settings/center/settings-secondary-nav.tsx:89 \u00B7 apps/web/features/settings/center/settings-tabs.tsx:23 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/settings-secondary-nav.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e08693b20860e441febf4bf3db40f31dc8ab5cf369a8a942b778d6ff270cb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/settings/center/users-permissions-page.tsx:394 \u00B7 apps/web/features/settings/center/users-permissions-page.tsx:407 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1343ae3def45bbc758fdf8f17d95a1b7e159d5b39d5d792b88ab419ef5f75fbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): apps/web/features/settings/settings-page.tsx:72 \u00B7 apps/web/features/settings/setup-page.tsx:39 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fc7cfff421de537721599a84f12a59176bfee803288a34a96d91eb6d5f7d84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/components/book/cover.tsx:20 \u00B7 apps/web/features/books/resource-cover-url.ts:4 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/cover.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"99699a513ec9af2362f4a10c77ee4597319c1f213c6c25f714f498c09f4666b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/components/ui/feedback.tsx:57 \u00B7 apps/web/features/books/ui/source-node-metadata-dialogs.tsx:102 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/feedback.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"843ae6f36c603a50b543abd531ebca39310cb428927637c51dbba4e744b9f460"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/audio/api.ts:210 \u00B7 apps/web/features/reader/v3/api.ts:210 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/api.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c1a9b28fb8301eef681acc31415d0057058941a9114321a00ed4dfc2f57b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/automation/api/client.ts:100 \u00B7 apps/web/features/settings/api/backups-client.ts:107 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/automation/api/client.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e31520a8224f8ea9ab44336bfa3dc65ccb72f6e1ecf32c5ecd6b0b597f033b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/books/api/client.ts:171 \u00B7 apps/web/features/books/api/client.ts:379 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"504334e15e9bba27088ebfe851bcd2e786c22c94a59ce37cc1b271195a028c26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/books/api/client.ts:196 \u00B7 apps/web/features/import-tasks/api/client.ts:184 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f3d08cbfb798b34f2823ad6d9c142e28896e431c333dac96a922bb2f891006"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/books/book-detail-page.tsx:463 \u00B7 apps/web/features/shelves/shelves-page.tsx:250 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8eda5be7637c072a45204c20cc48f8a349dbd5ab49a87e1d6bb84b9cd20379"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/books/metadata-lookup-modal.tsx:189 \u00B7 apps/web/features/books/metadata-lookup-modal.tsx:226 \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":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ae2ee24c2b1821bf11309873545640c4b6e6731436c45fcc089b26eec42bb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/web/features/books/ui/source-node-metadata-dialogs.tsx:27 \u00B7 apps/web/features/library/library-batch-actions.tsx:183 \u00B7 apps/web/features/settings/setup-page.tsx:44 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c74cdbaa143833d948b4447c167936ccb38702bac2ce2b2c5d57fbd320966"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): apps/web/features/dashboard/dashboard-page.tsx:45 \u00B7 apps/web/features/organize/classification-management-panel.tsx:26 \u00B7 apps/web/features/settings/settings-page.tsx:58 \u00B7 apps/web/features/shelves/shelves-page.tsx:87 \u2014 the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/dashboard/dashboard-page.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5da1bf275ca27eeb025854415ce74baaa85201d036d9a2a7a71e9eb7fe876e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/feedback/ui/feedback-dialog.tsx:99 \u00B7 apps/web/features/reader/v3/reader-engine-runtime.tsx:173 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"727419b64d19434522072739bdd5c6cf8357866a538d24e2e6456f085a5e918d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): apps/web/features/library/api/books.ts:157 \u00B7 apps/web/features/reader/v3/api.ts:440 \u00B7 apps/web/features/reader/v3/api.ts:450 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/books.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386cd23885177b4395b99a4fb2153f3ba0d603b97760b00fe3204964be1fc96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): apps/web/features/library/smart-filter-builder.tsx:216 \u00B7 apps/web/features/reader/reader-shell.tsx:1031 \u00B7 apps/web/features/shelves/shelves-page.tsx:827 \u00B7 apps/web/features/shelves/shelves-page.tsx:893 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"df56b329795239c40a71c79c06c13e6f2e904613fdef14c8ae6d792e6871da6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/management/management-overview-page.tsx:41 \u00B7 apps/web/features/organize/organize-job-detail-page.tsx:48 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/management-overview-page.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5ced7b848bd842db15f152600f5a0f7c2a9472ba43ce37ea6186efb407e2de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/reader/v3/adapters/comic-model.ts:106 \u00B7 apps/web/features/reader/v3/adapters/comic-model.ts:118 \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":"apps/web/features/reader/v3/adapters/comic-model.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42e3b1dd953a05d97a3d1b9425f55dcce7170c9132177d884c908b763e74e8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts:220 \u00B7 apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts:232 \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":"apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"186b7849fd26417dcb96f3492676301d9098f498b3c5c350bcb6acad3978852f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apps/web/features/settings/api/import-preferences-client.ts:22 \u00B7 apps/web/features/settings/api/import-preferences-client.ts:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"apps/web/features/settings/api/import-preferences-client.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"149db2b1962f1beb0cb922aedfeb912d4b9a11d03cbe4af1a2aa2d758480df7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/settings/api/libraries-client.ts:72 \u00B7 apps/web/features/settings/api/libraries-client.ts:88 \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":"apps/web/features/settings/api/libraries-client.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac73b719f87f6e43c5ca27004d18b8767f1ca9e3c6a916bb931f3016781c64c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/settings/center/account-panel.tsx:114 \u00B7 apps/web/features/settings/center/account-panel.tsx:140 \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":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eed1a6aea59df74b87706f2c40dacdd96ade70a3bdc2100f66b92c3e62f9815"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/settings/center/users-permissions-page.tsx:437 \u00B7 apps/web/features/settings/center/users-permissions-page.tsx:454 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"832e4950993bc3f9b3585ecf9010a2295bece00a54e943953218486897a8b8f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/shelves/shelves-page.tsx:852 \u00B7 apps/web/features/shelves/shelves-page.tsx:886 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"e196f590980ea12348b84779c65e24a811f1e047b8a3f6bea251776a554aef5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web/features/updates/model/release-notes.ts:7 \u00B7 scripts/validate-release-notes.mjs:11 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/updates/model/release-notes.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d699e5c11e1ed5481bafef28083bc6f027d07452130449ad5a60cd6a7f9cb11"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/web/features/reader/api/client.ts:1 reaches into another package with a relative path (../../../../../packages/reader-contracts/reader-http-error-statuses.json) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/api/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"325f0aecfb2ead0d604418752be3f21f155bfe2bd47e952f26c5c4373f4470a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/web/scripts/generate-i18n-catalog.mjs:8 reaches into another package with a relative path (../node_modules/typescript) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-i18n-catalog.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"809de4bb99dafb0659c6a124f7c5f22ea4602751662933d75300aabf321faa66"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/web/scripts/migrate-i18n-jsx-attributes.mjs:7 reaches into another package with a relative path (../node_modules/typescript) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9149295fa760c74aa2df927f02c2e4b752c63d29e2f881a57e870a026c2646"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/web/scripts/migrate-i18n-jsx-expressions.mjs:7 reaches into another package with a relative path (../node_modules/typescript) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/migrate-i18n-jsx-expressions.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27eafb7dc44c9f2f175abdca38ee7f6349df5c6f60dac21710c768c401148b3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/web/scripts/migrate-i18n-jsx-text.mjs:7 reaches into another package with a relative path (../node_modules/typescript) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/migrate-i18n-jsx-text.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ab288c03abeebb4b5931ee6cfa092c9a776f086219ede43dbb56d50edea99"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/web/scripts/prepare-pdfjs-worker.mjs:6 reaches into another package with a relative path (../node_modules/pdfjs-dist/package.json) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/prepare-pdfjs-worker.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6e2873e6940b046345bb31dc4ebe131644937970386381e701212e9895525a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: apps/web/scripts/prepare-pdfjs-worker.mjs:7 reaches into another package with a relative path (../node_modules/pdfjs-dist/legacy/build/pdf.worker.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/prepare-pdfjs-worker.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e626e4a02648eaedded86f269b6b104704fea7f0520d3cf870f7cc42fb4ccb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: prototypes/feedback-web/generate-icons.mjs:4 reaches into another package with a relative path (../../apps/web/package.json) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/generate-icons.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd2da203775f85d6a8cba3f9ecb9e779e33c32c240115d300fdfaa1d801f977"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/container_update_browser.mjs:4 reaches into another package with a relative path (../apps/web/e2e/reader-controls.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container_update_browser.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9777e36722b65f7c4635d134c1d82e64f51807a4f847b69fbaa2d5fbfa094351"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/container_update_browser.mjs:4 imports apps/web/e2e/reader-controls.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container_update_browser.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"916cd8cb548962b0422d65aafff290688ff47b239c5619c5452581f835bb6b62"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/container_update_browser.mjs:5 reaches into another package with a relative path (../apps/web/package.json) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container_update_browser.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aff28aed0835f7f2fc43ddeaa2e3d590b6e0c89f2f68f7ad2fb0c4d71444da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ShelvesPage (cyclomatic 146, cognitive 128): ShelvesPage has cyclomatic complexity 146 and cognitive complexity 128; 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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c712505f0ff51d8b8c0ea985576eff5f68a670890ac9d3781d046ef29b051dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReaderShell (cyclomatic 130, cognitive 126): ReaderShell has cyclomatic complexity 130 and cognitive complexity 126; 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c197fdf9cf4afa620e3fa66a057054de6d13bafcc92fd800f8089ed94a627c36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdateOperations (cyclomatic 93, cognitive 79): UpdateOperations has cyclomatic complexity 93 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/updates/ui/update-operations.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc32ef3e5d508d21e2a508ad9a6c37b7a0da653aca8a9bec325a37ec2b83463b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BookDetailPage (cyclomatic 81, cognitive 73): BookDetailPage has cyclomatic complexity 81 and cognitive complexity 73; 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":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9f95a8d49c52020eb3b2b3c580475551b9e2025ba3355234a919c22977ddce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateFactCase (cyclomatic 71, cognitive 38): evaluateFactCase has cyclomatic complexity 71 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"376f25c09a9bf898f18a58428339a25e1cf13aa74dae6f2e3021b1325b7564ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readerErrorMessage (cyclomatic 68, cognitive 67): readerErrorMessage has cyclomatic complexity 68 and cognitive complexity 67; 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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c461f11c0cc3f804cd1a30786c008361f75d1b0ddbdb598031993757a63ab093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AudioMiniPlayer (cyclomatic 62, cognitive 64): AudioMiniPlayer has cyclomatic complexity 62 and cognitive complexity 64; 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":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab164689211cacdce7ce6a4411073aa1d7befa8a3c9536a82203d32e7b13c904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LibraryPage (cyclomatic 56, cognitive 54): LibraryPage has cyclomatic complexity 56 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/library/library-page.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dcf5ea260b70cbd8ceed89056192175fc96652e4186443db15a88354d2a7d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchReaderBootstrap (cyclomatic 55, cognitive 51): fetchReaderBootstrap has cyclomatic complexity 55 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/reader/v3/api.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fa5f0d2fe4518d734ca1c68f4ae9dd937262566cfb9bd1949c56c13ab98cb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LibraryBatchDialog (cyclomatic 51, cognitive 47): LibraryBatchDialog has cyclomatic complexity 51 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 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":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"179e4af81d50e2a57d850f5b159ecdba63c74ac8ac50485c71e4b4702b00a299"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 44, cognitive 62): execute has cyclomatic complexity 44 and cognitive complexity 62; 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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"829655b4ae3030a5118d2d8af7c2775a8c10debdabf6c651e60b49cc4fe1120a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ResourceDetailView (cyclomatic 44, cognitive 42): ResourceDetailView has cyclomatic complexity 44 and cognitive complexity 42; 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":"apps/web/features/books/ui/resource-detail-view.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"775b679d65a1c7f6557790f84edf3d880bb37153df3b387533b94991432dc575"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPage (cyclomatic 40, cognitive 37): renderPage has cyclomatic complexity 40 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1872cdc94ae7b8de24fe74a0746c386b8ad2bd0078c9876107bf4cf82b1ce1d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppShell (cyclomatic 39, cognitive 35): AppShell has cyclomatic complexity 39 and cognitive complexity 35; 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":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"827380b7f1307b041bad84fa192148af0b025505fef8fdd4a8a1db7a7ac86cd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openEpub (cyclomatic 38, cognitive 63): openEpub has cyclomatic complexity 38 and cognitive complexity 63; 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5949fee64437229fa1ab0f2dc5285678457c2490e1c69ee5897dd296ad29f9a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAudioBootstrap (cyclomatic 38, cognitive 35): normalizeAudioBootstrap has cyclomatic complexity 38 and cognitive complexity 35; 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":"apps/web/features/audio/api.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"af15cd974bd05bdbb7a702a09738679194e458ac5f11cfe45555f112e7ec3752"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 37, cognitive 48): execute has cyclomatic complexity 37 and cognitive complexity 48; 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f74dbb7d3061823a64e612cab3501ca68e7ad450cd552f997adfc1f584a510b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 40): (anonymous) has cyclomatic complexity 36 and cognitive complexity 40; 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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"58acd5c1030feef56542bbd3ffa427df5602fd3b6439e76fd385bff664d171ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 33, cognitive 48): execute has cyclomatic complexity 33 and cognitive complexity 48; 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":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95381326ddd93305b6f9e437f3f86c91f39e1da71ae6e793e2d1d7a7e210294"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openElement (cyclomatic 33, cognitive 41): openElement has cyclomatic complexity 33 and cognitive complexity 41; 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a91d55ec90f6b0d1bf0e5f15b6ff49029844427ae0eb4faa80f7681a70ef9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReleaseAssets (cyclomatic 33, cognitive 38): validateReleaseAssets has cyclomatic complexity 33 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate-release-assets.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"091cd3c33ade75455a4b47e7f4c4994187707dc985421c1d59bfe055522aa2da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 38): (anonymous) has cyclomatic complexity 31 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/release-live.spec.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2d0f6f3efbc9f900ef73f74230d45c652f8b12be73f639843624e4a5043a9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializeFb2Chapter (cyclomatic 30, cognitive 51): materializeFb2Chapter has cyclomatic complexity 30 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/text-publication.worker.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"07454cab2fd05865fb125a4b3322d0551e3cde5a2c393f7653d661b34bd261ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRequest (cyclomatic 30, cognitive 28): validateRequest has cyclomatic complexity 30 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-request.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b206a1ee1868407201126bcb574f5d80714ad8ebc27a3bf986276669c8244926"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readerSessionReducer (cyclomatic 29, cognitive 27): readerSessionReducer has cyclomatic complexity 29 and cognitive complexity 27; 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":"packages/reader-core/src/session.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"64637258da4898256e231d77b1d8b57aefb9878f4c8b423abcd6880d4ee66f7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BookContentBrowser (cyclomatic 29, cognitive 23): BookContentBrowser has cyclomatic complexity 29 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03ba5744a88c57052fd72c3c9ea34205194b28d447fa050bc880b1e869e608e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invoke (cyclomatic 27, cognitive 38): invoke has cyclomatic complexity 27 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/book-action-controller.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a446cc5446d3e1585f8f08c51ceb6fdca120294e238bff708378ae7ff7a403"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 29): (anonymous) has cyclomatic complexity 27 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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3df2d0dee4b26332dde87b0fb5b6a2cd2d136986976f0da7db5c2f143819bad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function namespacesForElement (cyclomatic 25, cognitive 37): namespacesForElement has cyclomatic complexity 25 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"58adaf6ba8b47397b2abf891c4781648d87ec26a9ef76dfeaa5955cd4c860027"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 33): (anonymous) has cyclomatic complexity 25 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/automation-settings.spec.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2481c13381dce10e9bb486207f1dcc4469ada6d190d6906892dffd50a51128d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startFixture (cyclomatic 25, cognitive 32): startFixture has cyclomatic complexity 25 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 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":"apps/web/e2e/release-live.spec.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cfbaf3569384b1383bf1afcb2482a7c1ba26b122d049ee8f1ea03e19bc4db9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TargetDirectoryPicker (cyclomatic 25, cognitive 24): TargetDirectoryPicker has cyclomatic complexity 25 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":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6145b4adb823b235173be00810a573523e325a1da6cfaec019d714830149c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DirectoryPathPicker (cyclomatic 25, cognitive 23): DirectoryPathPicker has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0082e7dbe480c9ed52b8ae0b4a9de6624ab1677576cc194fedb46a569fe445"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MetadataLookupModal (cyclomatic 25, cognitive 21): MetadataLookupModal has cyclomatic complexity 25 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"72931a5ff31de44197cb908db791eb333da2189eae723ce16fea940788f9c430"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReaderEngineRuntime (cyclomatic 25, cognitive 18): ReaderEngineRuntime has cyclomatic complexity 25 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"47289277a30768597cb0e833d82dec573cff48118ed1864f66f25a3ca2cace75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dependencyAssets (cyclomatic 25, cognitive 12): dependencyAssets has cyclomatic complexity 25 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":"scripts/validate-app-packages.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"519c50666e705fafaab0a0bcf442268cb121332857bbc10147608ba6743aad3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translateDomNode (cyclomatic 24, cognitive 50): translateDomNode has cyclomatic complexity 24 and cognitive complexity 50; 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":"apps/web/i18n/provider.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"887833c08f1a56078c5f8227975d9cf04265a0e7056683e7da47dd8c7a08a0be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 33): (anonymous) has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"65919a55de41bcc85c5c67949c4412b964931326cc689f154bcef71331e49fbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 28): (anonymous) has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/release-live.spec.ts"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f9df5d4d0a68c10c7c247ececb14f3ef364be38f0fb557ea39d65e19dd1032"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeExpression (cyclomatic 24, cognitive 26): typeExpression has cyclomatic complexity 24 and cognitive complexity 26; 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":"apps/web/scripts/generate-reader-api.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8d429bf3ede06d8655aac6aabb7a04418fa7515ad3144945adc7a6f7b81f17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedResponse (cyclomatic 24, cognitive 24): readBoundedResponse 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":"apps/web/shared/api/bounded-response.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35a8fe6cbf8ba8a4c66547d5e3860a2c5808127c4e44b7e132f8350ebd7373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDoctype (cyclomatic 23, cognitive 54): findDoctype has cyclomatic complexity 23 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b3a83df812f658cc1901d2a8cfef80787a20689b751079d2499fc849f6ea47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStrictFb2 (cyclomatic 23, cognitive 33): parseStrictFb2 has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf37f47fb999ebd22bf520cd1a13898d9f3f83a0634d398b6569e824ff1d5f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openShelf (cyclomatic 23, cognitive 22): openShelf has cyclomatic complexity 23 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 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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"74915026ce71d510d4d25d583bfbb9c77d0434fdfa09b2d319ce763f94529573"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEntityDefinitions (cyclomatic 22, cognitive 33): parseEntityDefinitions has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aabf3b6dae08caf3676f7ea8e738660e68010d132fdc9f98de971f58aa1adaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function poll (cyclomatic 22, cognitive 22): poll has cyclomatic complexity 22 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":"apps/web/features/updates/application/use-update-operations.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0232ef9e7ea367bf9f4bc664a7e2c4900c688885adde0a740c84265083f010"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReleaseIndex (cyclomatic 21, cognitive 28): validateReleaseIndex has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate-release-notes.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"708743ef6eae1fad7cd7e85dca5cb60d5be3d20a1af1cc4190d40d2469ae1581"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 27): (anonymous) has cyclomatic complexity 21 and cognitive complexity 27; 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":"apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"648189d98d1cae9377da6fcd54bd90df35f5c8a87f5eb28a5052e2edc1b5a7dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeElement (cyclomatic 21, cognitive 27): closeElement has cyclomatic complexity 21 and cognitive complexity 27; 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b78185118ccae729433e4f045be194405abd234f4236205d0016ebfd80e805"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 25): (anonymous) has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/release-live.spec.ts"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9642faeef094b0feeaa4cc0aba76e0fffe3c8f1893e085ae5c7e4dc328ff10ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeServerLog (cyclomatic 21, cognitive 25): writeServerLog has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/server-exceptions.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4c2beb055692487ebdddf3ba382eee391f9a961388987d80e6d1a92ad4e2b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valueEditor (cyclomatic 21, cognitive 22): valueEditor has cyclomatic complexity 21 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":"apps/web/features/library/smart-filter-builder.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b7a187b597120290cf4ff0a5a3cbc57b109972b0c023ed5938b8fffb1a24f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UsersPermissionsPage (cyclomatic 21, cognitive 20): UsersPermissionsPage has cyclomatic complexity 21 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 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":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e040b19aee9dfbba7f30c7eac08a983932d03dee2c564f007185e50621ad2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 19): (anonymous) has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3dd15a41104ca2d7c74bf4950b7130587ca087479217d55a8b2159eea2ca65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveShelf (cyclomatic 21, cognitive 18): saveShelf has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2c95b9d0407a18e8e331e4e1b6e7d5942ba7b363d0d4fbba4d71bb4837bd95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapBookView (cyclomatic 21, cognitive 11): mapBookView has cyclomatic complexity 21 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":"apps/web/features/books/api/client.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6d7ae548db686c2ba66cd0a92a1ffbdaa0274733cc81a51c4b6603e0569f5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 39): (anonymous) has cyclomatic complexity 20 and cognitive complexity 39; 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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb3a1aac161bf06b5f51d5adf1d051ba87133c1af6b7c76a44c49cba85fecc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadInitialState (cyclomatic 20, cognitive 35): loadInitialState has cyclomatic complexity 20 and cognitive complexity 35; 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":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"de22381ea4e90032ca7ce635463f485bc5f73eec3a75d49c23a227d3fd981ec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 20, cognitive 29): apply has cyclomatic complexity 20 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":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0875a38aa4b133948718e9c652db26a44e1bdc101bdae277729904ad8c573963"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 28): (anonymous) has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d91dd55b62c6b542d552bcce40eed890e7764e179592516d24a25502dc554a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeAuthoredCss (cyclomatic 20, cognitive 25): sanitizeAuthoredCss has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8d522694a156eb054869361f850e670415f600413895c1576c7b7b644318d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function control (cyclomatic 20, cognitive 20): control has cyclomatic complexity 20 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5933e79c3eb1f42a5109e67e585ceb102fad35e30d6556d0278a1de2d4d11ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pointerUp (cyclomatic 20, cognitive 18): pointerUp has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/reader/v3/paged-track/paged-track-controller.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48b929658bb395c68c04d967cd9c3747622adc04fcbcbfcd324efc9e65899c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function anonymousRead (cyclomatic 20, cognitive 17): anonymousRead has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ghcr-updates.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffb4a11197aee15213ec90ee51ab2701a6df489aae0fd75d3936fd187b1b24d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function artifactRecord (cyclomatic 20, cognitive 11): artifactRecord has cyclomatic complexity 20 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":"apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1fb800cbbe6bd83bbbf14c07b5da59769b585e18460c2e0d653fd211a49613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopFixture (cyclomatic 19, cognitive 31): stopFixture has cyclomatic complexity 19 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":"apps/web/e2e/release-live.spec.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6573215becc56f082ef5f7094be768b607dfb9e01ab9365e9fed6836d98ff3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 19, cognitive 26): download has cyclomatic complexity 19 and cognitive complexity 26; 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":"apps/web/features/reader/v3/original-publication/browser-publication-store.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"014fa5341da2b828abebb113a7ce13e185164f3ee0c7fdb90cd1df068b3b6009"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSlot (cyclomatic 19, cognitive 23): renderSlot has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f433888f499bf975a5c21cfd2c50d6ab78131d113424d5882e42353b1c8b0b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 19, cognitive 20): open has cyclomatic complexity 19 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":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce85f3134bfabe34445c12e22ba61f3ec5e8dd85b82383afd590f00b5dede61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/settings-lazy-navigation.spec.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c4adc48f83f6ee2ef55fcf535d456b28b65fd9547d39ed50e23f3c5ef97709"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentMetadataValue (cyclomatic 19, cognitive 18): currentMetadataValue has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/books/model/recognized-metadata.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f370e16d96b9a3356c7c12372d13196b2afe40c54f78326a227ac4c643ac7a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectPdfCropBox (cyclomatic 19, cognitive 18): detectPdfCropBox has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"apps/web/features/reader/v3/adapters/pdf-layout.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"279df9823d45d9f95c2bc087313a4f644d5ed47a383bf6f2815502e750fc3535"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BookCard (cyclomatic 19, cognitive 17): BookCard has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/book-card.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa09205a9943f16aedc292aec1e5d0c914499b5eaa7120ac40b139e0af1683e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MultiValueCombobox (cyclomatic 19, cognitive 16): MultiValueCombobox has cyclomatic complexity 19 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":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3f2de55c39398b181feefbc0264d97195b9a3f8452b822473836cb8cc6c2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 16): (anonymous) has cyclomatic complexity 19 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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2276c88cb64d467a45b8dc20c7e3d9444bef8a30c72d43ae7fde1f1b1b0a89c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManifest (cyclomatic 19, cognitive 10): parseManifest has cyclomatic complexity 19 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ghcr-updates.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"278eb207fc9ed54216961ea082a66f104c6ece29faf8b2d6cc29eef77bc52ca8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preflightEpubArchiveEntries (cyclomatic 18, cognitive 36): preflightEpubArchiveEntries has cyclomatic complexity 18 and cognitive complexity 36; 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":"apps/web/features/reader/v3/security/epub-archive-safety.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"274def42000913adbf6a99594f99e74600411bb839453b2d191f8b0517780c6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/system-logs.spec.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaee4de65d46579bae9f37bf84b8bbed7f4712519bc467f5a5b351b2a308348a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OrganizeJobDetailPage (cyclomatic 18, cognitive 17): OrganizeJobDetailPage has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-job-detail-page.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"491076923aa0c16234f8f4fbb3932ccc869456f943e2701a80d7a4ee09c0235f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readerKeyIntent (cyclomatic 18, cognitive 17): readerKeyIntent has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/input-router.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f384a7cec2b41c075878211aab83a40a59c54fa7de7e0f4fa41433878ce75187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SettingsPage (cyclomatic 18, cognitive 17): SettingsPage has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e62a266d955b06246dbb41fe00a6590ffb2aadefe3118e9ac05ffcabdae61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 29): (anonymous) has cyclomatic complexity 17 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":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeac3e4923005d392281cbac3249914361558aa3d8c4bd1d88e92be2b6036e7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onInputKeyDown (cyclomatic 17, cognitive 28): onInputKeyDown has cyclomatic complexity 17 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/multi-value-combobox.tsx"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce4569931a7c6f4f18dba3ae6d044537ca20232fa250d36afe90a8f8273f2ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 26): (anonymous) has cyclomatic complexity 17 and cognitive complexity 26; 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":"apps/web/e2e/responsive-pwa-shell.spec.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8027b3b5dd1109a225c15548dc16a3dcb41451ae6ab7c2a3cd28418085b214de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readiumTotalProgression (cyclomatic 17, cognitive 24): readiumTotalProgression 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":"apps/web/features/reader/v3/adapters/readium-navigation.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"064687e7715a2d1e2832041110d38ca095aa71e99fe1d88506b010ef3c529652"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/application-updates.spec.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"553f8d9febc773f4f6efeb50554943f040ef22ebfe60221b4937550cce06a2f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTimeUpdate (cyclomatic 17, cognitive 21): handleTimeUpdate has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d5ad2750c7d0446585016e84061895b5c5b40eae085a7b0f1128dc9a79e5ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b28094ce0cdb37b34df3172c9447cfeb70f67926b0f1fe3d66914f7e6490607"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySelected (cyclomatic 17, cognitive 19): applySelected has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94e28689b96bd4ab1b939896937d87b83bcabf6ed6822bf01bfbd9eca43653c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 17, cognitive 17): open 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b9f621172db09515ff7d7e60a3889d64e616747983cc0d57f4639305843942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trackView (cyclomatic 17, cognitive 16): trackView 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a01fd30268195c130aeccef38d8c9a958265c7f3dcfc6e0c7180edaa7b0f447"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchChunkGroup (cyclomatic 17, cognitive 16): fetchChunkGroup 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":"apps/web/features/reader/v3/adapters/pdf-range-transport.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea7f09e783cf6b7cf9d7310fd04e4c8b320a7989ecaa8d8e6066f81b84e367d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DirectoryNodeRow (cyclomatic 17, cognitive 15): DirectoryNodeRow 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":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fdc2d0aee69b815f17f30bf73c86fa9d6e64201dbbe8fd84f51e1020d946f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publicationContext (cyclomatic 17, cognitive 12): publicationContext has cyclomatic complexity 17 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":"scripts/publish-android-beta.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c470a6635f00714d379f9a1c72d07d508a62eac103d3f10ce91e2021fbeef053"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rewriteAuthoredDocumentReferencesWithProfile (cyclomatic 16, cognitive 30): rewriteAuthoredDocumentReferencesWithProfile has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbbc1e5081aaec0bb9ce2c8335ae656a1bd26ae5453521347c1e40baf6cb6f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 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":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fa2ebf42e52632e4385bcc876cb41f4f9ac2be81ecdaedaac6554d8e8fe278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateMarkupCase (cyclomatic 16, cognitive 19): evaluateMarkupCase has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"743c0578be087909130dac13b9bab514f1cd037e68004be1365e931d56782005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReleaseMarkdown (cyclomatic 16, cognitive 19): validateReleaseMarkdown has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate-release-notes.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2891eb589102e2fdc41b2773080d42144507f9ffe0179586681ce8790aa3524"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf9f44cba184619e230e6a85c7bf53b4bc02763bfe9fb2dcd2b27868ff08dbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBackup (cyclomatic 16, cognitive 16): parseBackup has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/api/backups-client.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84354c8b590e912f84e7a222cbbe4ce04efbc88231bfe6488d1825a06dd8533"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJsonValue (cyclomatic 16, cognitive 16): isJsonValue has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader/v5-wire.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9103756d0755a379569f73eb5951ae8bb9a9dd75bd03b4a2adb3f1a770408fb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 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":"apps/web/e2e/responsive-pwa-shell.spec.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb256cd5beaea29244cec479926e7c5dd7bafd5aaef676984189d498f3906f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 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":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee32f3b11761ffa6b640a5245facc7c46395fb1a2a3da933ab0cbc57f6eb1cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function candidateMetadataValue (cyclomatic 16, cognitive 15): candidateMetadataValue has cyclomatic complexity 16 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":"apps/web/features/books/model/recognized-metadata.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1251a0a066c4b9f7095d1950a3cfdb931c1c50c5cacae04b5f18ffa4165fbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OrganizePage (cyclomatic 16, cognitive 15): OrganizePage has cyclomatic complexity 16 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":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d49d3f6f8b8d7b89259cb9a1b0f6f1800c8363334c1b450113cb212fbe8cb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"078a9658c688a10221bec92bff7314a4e3d8aac4c406dadf3c809b3da53a9f46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readerResourceFailure (cyclomatic 16, cognitive 14): readerResourceFailure has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/api/client.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efc721268b961852366de856a43558244bda8987cef58fa0ad7ad74713eec7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePagedTrackSettle (cyclomatic 16, cognitive 13): resolvePagedTrackSettle has cyclomatic complexity 16 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":"apps/web/features/reader/v3/paged-track/paged-track-physics.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2ce71de12a4a421d4b3bc91379c8beeea8e6b1a8157cfafa0c8285bea02cc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleProgressChanged (cyclomatic 16, cognitive 11): handleProgressChanged has cyclomatic complexity 16 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":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfedfea56a89e314b02ace74f265de4e382f7bca37f7a40338a92c9830af787"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invokeSourceNodeAction (cyclomatic 15, cognitive 22): invokeSourceNodeAction has cyclomatic complexity 15 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":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5e45071bcc0ad432ef19d6b0a8198371d61b4c8c63a851ba919dae5dba5eec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStartTag (cyclomatic 15, cognitive 22): parseStartTag has cyclomatic complexity 15 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12defabe90bb09eeea25abce0f0e156ab4ed7421344c66ffee347b140c480af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invokeResourceAction (cyclomatic 15, cognitive 17): invokeResourceAction has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e73575275b2f3469fe0d38bbdbca5484b69e432b8b038e382f37044069d4952"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 15, cognitive 16): open has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c434dbf681b6cccd5f39b99d76a08d5f7125694a420f84b9f64a21906bd3ea4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStructuredReleaseNote (cyclomatic 15, cognitive 16): validateStructuredReleaseNote has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate-release-notes.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdae350c6c68f13b0cc81d8257383052c01654991e02e794cdb0fea25a4f32d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseResponse (cyclomatic 15, cognitive 15): parseResponse has cyclomatic complexity 15 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":"apps/web/features/reader/v3/original-publication/text-worker-client.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51deef4716f7b7a2ba79a150156ef8623a0eca471c3f4f76168fb47c0ea6a96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAccount (cyclomatic 15, cognitive 15): createAccount has cyclomatic complexity 15 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":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9819502dc1e3ed759598fc0f03f7c38689a0657fce876f9603039ca0c6caffbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareAnchors (cyclomatic 15, cognitive 14): compareAnchors 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":"apps/readium-web-poc/src/locator-policy.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bf92ca9d2246bb3e8111f7da184b25754a4e1a020d4011198c5b1cbcbb7cd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ManagementOverviewPage (cyclomatic 15, cognitive 14): ManagementOverviewPage 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":"apps/web/features/management/management-overview-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e192b9da42149662e41b7739155d4d462edfb6b88f0ca3bd286b614000c920"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pagedTrackRecentVelocity (cyclomatic 15, cognitive 14): pagedTrackRecentVelocity 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":"apps/web/features/reader/v3/paged-track/paged-track-physics.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e349fbc23ac128fa710000366d831f992d77fbbfbd6f794307e474ec3f909d78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OpeningCover (cyclomatic 15, cognitive 14): OpeningCover 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":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a5302ce748e1ef6cc759c76082375b683c81718cd1a02bf51598c9b3765aa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EmailSettingsPage (cyclomatic 15, cognitive 14): EmailSettingsPage 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":"apps/web/features/settings/center/email-settings-page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"adca4ede226dadcba388994c30b232ff5abd23b890b223a735703aec9b20ca5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseShelfView (cyclomatic 15, cognitive 14): parseShelfView 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":"apps/web/features/shelves/api/schemas.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7969f5cabbdef93dde2c52f727e8bcbc4a76cb716063d793c5631152bfd357d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ShelfCard (cyclomatic 15, cognitive 14): ShelfCard 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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa69c73c0688de89cf8f68c9138343f53b96f51d1f9f7a0bfdc9cbef9d3eb546"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImportTasksPage (cyclomatic 15, cognitive 13): ImportTasksPage 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":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2544d27f8efa847b2dc502826da5f691ada53d6fc30b51ff4a82d6b0c1677725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 9): (anonymous) has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/e2e/first-run-setup.spec.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d52662e2387874e00469de788066fd41a96b334d51fca0bcf050bede7e51dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rewriteReferences (cyclomatic 14, cognitive 30): rewriteReferences has cyclomatic complexity 14 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe2b6e8eef9b3037c074e424ffdb84ac33bbf73b144788975ca696616d4335b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveArchivePath (cyclomatic 14, cognitive 22): resolveArchivePath has cyclomatic complexity 14 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d47afdaf715919adae0e48078552d7cd1b4e4a18fea499026983f569ecf433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 14, cognitive 19): submit has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d6fb6c09e01e64d1c426c05441e8e666f160aeb7e4e67946c29ff8c25fdbda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function response (cyclomatic 14, cognitive 16): response has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-worker-client.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5b3bd85793afbe187e00376302ea402985e090d78a5da71a55871044104af6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectCandidate (cyclomatic 14, cognitive 15): selectCandidate has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5742018a0402df90798f5c94b95b7df50d7f967a364d2a1cce4c1d2a6d27fa1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c2c41dc9650eb0dece9dfed27c81a6d3d1f556d45bbd490249f4cdce4f8d38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentPositionLabel (cyclomatic 14, cognitive 14): currentPositionLabel 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":"apps/web/features/books/model/current-position-label.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc64bb22610155fe5539848a0bc28cb63213444f4af8d16d2eab8f96ed6feed"}},{"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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f49c12d5b167356d6e5bacc3838cead81334135153c70338c9d6679161630b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GrantForm (cyclomatic 14, cognitive 13): GrantForm 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":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"14332dde414c036d8bff1247b46c2c22e18a6d7c7f2236c40590bcd347f27ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchSourceNodeMetadata (cyclomatic 14, cognitive 13): searchSourceNodeMetadata 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":"apps/web/features/books/api/client.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dac78a3f621e564b4d8baf90d6333bfa4886ae24cb9938090df335e43f2340"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7259a8245160a1e439b71d7497407a4ddb5663f66144f24e28f9742708b019"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ManagementLogsPage (cyclomatic 14, cognitive 13): ManagementLogsPage 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":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"da17f6757e07e30813c1218d9d25fe19686da849911261db0cf04f4ad224c169"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigateToItem (cyclomatic 14, cognitive 13): navigateToItem 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c4bd77310bd5faf2624889dbd4857fdea7b962c75f2124431177e355850cb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ResourceNavigationPanel (cyclomatic 14, cognitive 13): ResourceNavigationPanel 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef84147cebaf4ff8c62ed1d17227f01044f17781823b8c8d11005a2b1b1ef90b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDirectoryNode (cyclomatic 14, cognitive 13): parseDirectoryNode 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":"apps/web/features/settings/api/libraries-client.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d47400c1c9ec7c324e19da42673526652e0fd763884169f72ed96c0e51df35a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 13): main 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":"scripts/e2e-flow-check.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"590f64e13a7532bd035c5a91fcdea78b4461a92265ed047ce3a68ac99b7d75b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TargetDirectoryNodeRow (cyclomatic 14, cognitive 12): TargetDirectoryNodeRow has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec615d2c44057b3751e394911e1ef024897b6622d5badfb9ef1bcbbc5c6b982"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archiveIsUnsafe (cyclomatic 13, cognitive 30): archiveIsUnsafe has cyclomatic complexity 13 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"8703c29c6c244b7a9d77e501861b00b5d8fdd3e2d491632f528b7a1abb1f7187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 13, cognitive 19): visit has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c05b13e2e3ad0f080b0ad04b55af0ec7aca5b88c125371028c63c8b5f5f48dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeAdjacentStep (cyclomatic 13, cognitive 18): executeAdjacentStep has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"747259e67eb5e490d5ae21b8733c6acae8a05ca045ab3f893fd6edd45d82160b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Cover (cyclomatic 13, cognitive 17): Cover 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":"apps/web/components/book/cover.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"742551e0e235e0b80968fb92606371ec769dbd0129cb93b7a2435f6f49102115"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 13, cognitive 16): refresh has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8a230f20d2be89677234031f6860d2055725d3d08cef97a0bcba442f85544d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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":"apps/web/features/audio/audio-listen-redirect.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf99f59cae7039db08a5071174a5c0e79581ee551471cb71f10428922a9222d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapResourceDetailUnit (cyclomatic 13, cognitive 14): mapResourceDetailUnit 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":"apps/web/features/books/api/client.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"98158e7d6c77721be3b780ae9b3e0322d037fe64492d6ff93f439a93f399382d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createLocalPublication (cyclomatic 13, cognitive 14): createLocalPublication 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":"apps/web/features/reader/v3/original-publication/local-publication.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd39d390aa7a2c8f60f09a3402ec95ec07daae26a4da6c9c1cfaaf5e5f56f97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openMobiPublication (cyclomatic 13, cognitive 14): openMobiPublication 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":"apps/web/features/reader/v3/original-publication/mobi-publication.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"827d3be4426de6b8688ca3c5f9b5f68a06f8652090f9828e55764617f9866e2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openBook (cyclomatic 13, cognitive 13): openBook 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":"apps/web/features/reader/v3/original-publication/mobi-core.worker.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f667b8364955a7513ba2006b48bc4bff5827de1f6be2c27ae9798f5aa2e846a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReleaseFeed (cyclomatic 13, cognitive 13): parseReleaseFeed 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":"apps/web/features/updates/model/release-notes.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bbd316b29a52ae743b3b6eace124de3e72a4a5d445758b83e4ffb27a060778"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AutomationSettingsPage (cyclomatic 13, cognitive 12): AutomationSettingsPage 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":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e915c2ee8da9f69a2699703dd240b7ab0632fdc6e89cba7dacbcf2469d37fbe1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/ui/resource-detail-view.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6497bf9ea8ae11c9fb2cbba7088f49b78fd43fe77cfb9cc0b7eb4892d7d1cad9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"268c90d2b64efba49a66e10c37d48662fe6f8dbe2deef4391d22422d7f4d37c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReaderControlNavButton (cyclomatic 13, cognitive 12): ReaderControlNavButton 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":"apps/web/features/reader/ui/reader-control-primitives.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2236f561c722e25aaf2e1b490a5b5d7055da422f11b7f72f1741eef6a0a61329"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pdfErrorCode (cyclomatic 13, cognitive 12): pdfErrorCode 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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bf4f25e72af26308a0ca60b9bc596e8c8bae988ae79e70e1debbce596efcaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createReadiumEpubPreferences (cyclomatic 13, cognitive 12): createReadiumEpubPreferences 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":"apps/web/features/reader/v3/adapters/readium-presentation.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1f27dea0c640c2ff40fd34c46d9e0c38506670db3eff082a3d55dfa0016bfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modalForm (cyclomatic 13, cognitive 12): modalForm 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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d77a30370c93a6952b36fa6da4feb16e3c70c813a618191094b46eb40d9498"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-feed.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"16af5ed983154698b0bce16322c09efffeb6b44005a5a4e78ecbeaf5179690a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resourceIcon (cyclomatic 13, cognitive 11): resourceIcon has cyclomatic complexity 13 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":"apps/web/features/books/ui/book-download-dialog.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6725eb0603e8e5dc0ba900dc9165ba3b85b8acf920966e363605c5fece3aa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/comic-semantics-conformance.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9cb3289f5826146f8ba653286955df4c336b94acc03062ab3155542d503934"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executableCases (cyclomatic 12, cognitive 16): executableCases has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7fadee56f1ef47d4903cfd59abcfdadc8794d27cbabd46587f1b51e2486c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateWebReaderSafetyConformanceReport (cyclomatic 12, cognitive 16): generateWebReaderSafetyConformanceReport has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5d535bbcb84e072d23e988fbbc2d56d327bd954530d2580f12d3af6d81f75f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSlot (cyclomatic 12, cognitive 15): renderSlot 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":"apps/web/features/reader/v3/adapters/comic-continuous.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2eaa023783be0450a387cc599f2223a1c113757532a9520ccfd362f4c40fcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchCandidates (cyclomatic 12, cognitive 13): searchCandidates 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":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ccfe891185287c616b83eedbc4a176d65fd9aa645fb9f1be6cd01928f8f0ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function xmlEncoding (cyclomatic 12, cognitive 13): xmlEncoding 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc3161ae2249d10a75da60d720e7c0b21d5fa1b1aa6e7e3c4fa834bafcf7918"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeMarkup (cyclomatic 12, cognitive 13): sanitizeMarkup 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":"apps/web/features/reader/v3/original-publication/mobi-publication.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"765c734635dfd7fb432e1c34107ec8c4a6971fdd9c8f887814de84978cabd01b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 12, cognitive 12): handleKeyDown has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bef9a237c431a8ce697628f6976b65dc3c860158185131b420ba8312f8e399"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEpubFont (cyclomatic 12, cognitive 12): resolveEpubFont has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/epub-font.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b460e8d7a3c6ac5945b97e679158baa1e6909d5d3ddedc593bd6e4939e43b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addText (cyclomatic 12, cognitive 12): addText has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31a7b6db83e475e4c1d5838cb3b60cea7afc6098677006c5f56f57793c09511"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 12, cognitive 12): submit has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"102c7699d65fe1eedc7bba401cef4a7a0a68e5360e8be242d5f22ad06b15fc1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeSmartShelfRules (cyclomatic 12, cognitive 12): summarizeSmartShelfRules has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/smart-shelf-rules.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce3c510d1050050520988f5a40bf6d05079a0b62b80705dd62e30d467035a07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 12): main has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python-worker-runtime-smoke.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b3a52a466009dce0aa3ccdade98a5dd3054830ba57f29fbe216b66b3687daa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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":"apps/web/components/ui/context-action-menu.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcb3be71da26b724427af5dd9dab7616aeeea054e394409c0bae3750616b5b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BookActionController (cyclomatic 12, cognitive 11): BookActionController 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":"apps/web/features/books/ui/book-action-controller.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b5ac258ed8a5009f16fe069413016d191e2109b5668a9bdab106e7e059ca94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DownloadFolder (cyclomatic 12, cognitive 11): DownloadFolder 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":"apps/web/features/books/ui/book-download-dialog.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1186b6807c15d8867a0935425717aabf7c5515e680a06b1c682aeeb0a00de2f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ClassificationManagementPanel (cyclomatic 12, cognitive 11): ClassificationManagementPanel 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":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec6a79fb25679503c392b587c06328aff1cf4052e9c569a3602a6b6a877f542"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseToc (cyclomatic 12, cognitive 11): parseToc 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":"apps/web/features/reader/v3/original-publication/text-worker-client.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab8d79dd263d6b8cd2d26232d434ce9bd50d51196c1b1cb52e20de732e7049f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePagedTrackConfig (cyclomatic 12, cognitive 11): resolvePagedTrackConfig 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":"apps/web/features/reader/v3/paged-track/paged-track-config.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e094c11b970fc13bba80709d4ef33055598c64010ecdab8317997754ec08e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SystemHealthSettingsPage (cyclomatic 12, cognitive 11): SystemHealthSettingsPage 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":"apps/web/features/settings/center/system-health-settings-page.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"078c7416007f7249a1f8a2656fa181c6469c73de112edbda4f2b79e45307edea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteShelf (cyclomatic 12, cognitive 11): deleteShelf 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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe3102cb53c7f5e7793c8a8305cd8e218b52edb1d450f8c1fe07a085d3757a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 12, cognitive 10): read has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/pdf-range-transport.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1704f2516ae89bedd08861e82fa401b61e0a29370c220009b9a3d2927f8232"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43928b9280b56a6d50dea06685a063299a15c08c6ec3ad5a22546cd20ecf59a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LibraryWorkspace (cyclomatic 12, cognitive 10): LibraryWorkspace has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ddeee8df927a5a933abc165c93d07ce13aca3719c3f7dfae7c6bd38ce1c979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldBypass (cyclomatic 12, cognitive 10): shouldBypass has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/public/sw.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ceabb7e91fd85ef981c8c667d183554ad6b0a1b808dfa4d5cd14d25192c40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/epub-theme.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fa531d18d3041773ab0ca66be32724398ac20a1e938a9bceefa7f3fe203215"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readerPointerIntent (cyclomatic 12, cognitive 9): readerPointerIntent has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/input-router.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2de758b3f362ace18244b805b02235d4eed977a83210e1bc2e041cae7a8a58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function act (cyclomatic 12, cognitive 9): act has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/updates/ui/update-operations.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"294a1135da3fa2fde12bb4d99605eb2eb7168dda8ad2a54525745f8450a826c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeXmlEntities (cyclomatic 11, cognitive 20): decodeXmlEntities has cyclomatic complexity 11 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc25d0a66a9aaaf5a352e9ff8133f967eecdd87fb45a21ab8872a81c5b222fb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRequestVersions (cyclomatic 11, cognitive 16): validateRequestVersions has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-request.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce2f8f6db465cc85b9828d8d6b62f08706e526b09474288e6c4ca64826e5c3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForCatalog (cyclomatic 11, cognitive 15): waitForCatalog 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":"apps/web/e2e/release-live.spec.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"da439727b8b5ba2af920e79872c0b2a22e33b77d9c6e0db41e25473efcd76e58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPreferences (cyclomatic 11, cognitive 15): applyPreferences 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87b5009c0e2bac0589568c64e7231ccd6c5c3984bcaef30432995597a7cca0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeyDown (cyclomatic 11, cognitive 14): onKeyDown has cyclomatic complexity 11 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":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9006562e1a5a7b6c265d69345dd7a20bf085b9c91dfed47ba97384c37e837c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 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":"apps/web/e2e/feedback.spec.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b7fa4086b767b3cbe7a30cfa2687e8e881975bd83372e9bba6a9597e7ed7f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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":"apps/web/e2e/settings-lazy-navigation.spec.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4116d9833ffabf1c412f1d7279734b55e5807aa0b66d0e7dceb1db34f8fcb9f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFieldValue (cyclomatic 11, cognitive 12): renderFieldValue 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":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce67a5f66dd67db424edd696b234bffa6f3fe5256df0afab39a08de8d0126f10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function positionScrollResourceEdge (cyclomatic 11, cognitive 12): positionScrollResourceEdge 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":"apps/web/features/reader/v3/adapters/scroll-page-turn.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ed5805f403296ff0f483228c463cf6e714ad821fdf4fe6c4c9455ef3b52121"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeEpubArchivePath (cyclomatic 11, cognitive 12): normalizeEpubArchivePath 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":"apps/web/features/reader/v3/security/epub-archive-safety.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"319f708865f39f9432b4f5acbcee27fde1755a88c01088baa98eb83ff59a6447"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authoredUriDispositionWithProfile (cyclomatic 11, cognitive 12): authoredUriDispositionWithProfile 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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"25687152dcb975c1d4be42baebd1e1b2a6aed6b6a52219d465a1d6a9a08f9a91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function componentFunction (cyclomatic 11, cognitive 12): componentFunction 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":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96123b4931e6e10539d86e3b8d57ee4090241eb1f1096450d51541895c82a48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function componentFunction (cyclomatic 11, cognitive 12): componentFunction 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":"apps/web/scripts/migrate-i18n-jsx-expressions.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9345feae1bdfc0fdc71dc8559bb74a8e2f1cc9d36aa7ad5a34cbe4019e5f2dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKey (cyclomatic 11, cognitive 11): handleKey has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/context-action-menu.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2c069020151619136d67148dc0d92ea0928676bfb3ba58e021ca4aa7b34a84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 11, cognitive 11): save has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bef3d36df374ac7027a514fa36a480ff5357b1a9b1993ae681650b2dc267550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mutate (cyclomatic 11, cognitive 11): mutate has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b14fd40505f0e734ed89740a886b0c988106b998059862fdddeb2e23909b4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b121f8be6cb5bb61a5e0328f1115248d9f4864cd9438c18fc6c56c0f622d2cad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigateAdjacentScrollResource (cyclomatic 11, cognitive 11): navigateAdjacentScrollResource has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa7eaee4a38a88ef7595bb0376f610df7db1dd129200ebc4127c8a898d26961"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPreferences (cyclomatic 11, cognitive 11): applyPreferences has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b139527c31bd2be682ba82a50617f0ed5103b1b22914a61cc1782045302827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function advanceScrollViewport (cyclomatic 11, cognitive 11): advanceScrollViewport has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/scroll-page-turn.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"623686c926c80c621edecf9132a9222da08ea8f8cbcbb83fc607bc79f69eb9f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 11, cognitive 11): submit has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/login-page.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a52f30c4d02984df3b72c9e7f25e61cd02bce90c750cc0b2cb22d445495b51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFrameProbes (cyclomatic 11, cognitive 10): runFrameProbes has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da35976f3582ba9ae666f5053193ac71c427403942fbb5a340f1e2813467eef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CoverReadingProgress (cyclomatic 11, cognitive 10): CoverReadingProgress has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/book/cover-reading-progress.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0491bbfbe646e6c0d9c93d70bce9837093c3d318da086bf2f61efe6cc3df7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function KindleSendModal (cyclomatic 11, cognitive 10): KindleSendModal has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/kindle-send-modal.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8c20a1b92c8a885dc3f0c6d6e61c5f7741ea3ed04d6bec1b64d6c6e2896e53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/bulk-operations.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ee1b6fabaf052a197ae9c18035c42cc49052399250d7b2e516f21503320f2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/library-page.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3e8f4669a893c2aee431be23f7588384f66751e7daa2126bcb81b697cc6f58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reasonLabel (cyclomatic 11, cognitive 10): reasonLabel has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e1ef7eba037f2b993caded6e389a227300ae681b0d69aa6db24cc504a48ec2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readerV5ProgressQueryTransport (cyclomatic 11, cognitive 10): readerV5ProgressQueryTransport has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/api/client.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfdb076c1119d96fcfde0957af49db900fff4ed145557cedaa4135b7eb96bd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function feedbackModal (cyclomatic 11, cognitive 10): feedbackModal has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe8673ebfd0c3773a64b17dbd9f9dc2967e2fa1fab65d68ae1025e6c0afcf5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertDescriptor (cyclomatic 11, cognitive 9): assertDescriptor has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/browser-publication-store.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6918124de9117e616f19517672018a6fbe2bdd9059230ccc29ce6522d6c9b23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReaderV5Page (cyclomatic 11, cognitive 9): ReaderV5Page has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"322323cc674276827ec7dcddc38a412699315ebf4b1b183656abf36511d83375"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLibraryDirectory (cyclomatic 11, cognitive 9): loadLibraryDirectory has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/api/libraries-client.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8251d627eb1e248df149184d291d0ec0224c8bb566e09f35d2c85c6f87473c10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reorderLibraries (cyclomatic 11, cognitive 9): reorderLibraries has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/api/libraries-client.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec103637eec65e6ca037263718b8e907750aac5bf490c9ae7a1a41d30e7cec6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteLibrary (cyclomatic 11, cognitive 9): deleteLibrary has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/api/libraries-client.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fb64b27a1c30b8e63b18d08814b6c594968317eb35c465c6b799795e215914"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fba34d526cb31ca1ec92c845e4e4d5a22ee92297bc6e4bdcf08e24bba3c4171"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDeviceReaderPreferences (cyclomatic 11, cognitive 9): readDeviceReaderPreferences has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader-device-preferences.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b489ca7d452a91ea961427372e2df8a6698fb2493244bece76a86c582a0dad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReaderV5PositionReport (cyclomatic 11, cognitive 9): parseReaderV5PositionReport has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader/v5-wire.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5153324ef4c5fb507cf82a761dd9c0c1502cb1f026a2e1798e827635daf71c60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function environmentItems (cyclomatic 11, cognitive 9): environmentItems has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prototypes/feedback-web/prototype.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e267999c10d141758c8ce56488aef45b5d6a4a48a827a55f3591176ee2f8bbbe"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/reader-shell.tsx: 1454 lines of code: apps/web/features/reader/reader-shell.tsx has 1454 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccc84df897ac286e7c9964fd8863e1369f918318a87dcfccd7c7f520658d69d"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/audio/audio-playback-provider.tsx: 1088 lines of code: apps/web/features/audio/audio-playback-provider.tsx has 1088 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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f610d4fa77905fa8ec1c53d0a92432674076aeab954d51cb2994bdc011d54e5c"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/components/layout/app-shell.tsx: 1059 lines of code: apps/web/components/layout/app-shell.tsx has 1059 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":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d573f582ef475e39178844bd609ef608d333515297ddd097c50c72af02652098"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/shelves/shelves-page.tsx: 1047 lines of code: apps/web/features/shelves/shelves-page.tsx has 1047 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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e7320eec01487ffa174b8f72d1cd08ccc839aa2a21f5a48d7db676811d3ee4"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/adapters/pdf-adapter.ts: 1044 lines of code: apps/web/features/reader/v3/adapters/pdf-adapter.ts has 1044 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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54404ad9fb5064c0dbc1397d0ab15c5b6de59e7146e315703cfac0ed4f69077"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/scripts/generate-reader-safety-conformance.ts: 872 lines of code: apps/web/scripts/generate-reader-safety-conformance.ts has 872 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":"apps/web/scripts/generate-reader-safety-conformance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a91476f4a58cd2894879d5c9bf89a4ce001fb1668a89bcec26bc1391a2144b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/adapters/readium-adapter.ts: 839 lines of code: apps/web/features/reader/v3/adapters/readium-adapter.ts has 839 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":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a72fdd676f7e7d60f762be452822515d1091ad66dfc851cef7b857dc5a6e03"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/security/reader-safety-policy.ts: 784 lines of code: apps/web/features/reader/v3/security/reader-safety-policy.ts has 784 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":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7d5cb3f3c0a8cbc369b64c258cf181bae1991af87854d7d3a5bfd6b03c48ed"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/adapters/comic-adapter.ts: 758 lines of code: apps/web/features/reader/v3/adapters/comic-adapter.ts has 758 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c9ad9ef697c2df9f8180148d4d8e0f583927f65c4149af5f088613b931208"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/books/book-detail-page.tsx: 753 lines of code: apps/web/features/books/book-detail-page.tsx has 753 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":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98fe9b9efd309884faea136ade8ca182b7034807cd326f431be9cd7ac15c6cc"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/books/api/client.ts: 700 lines of code: apps/web/features/books/api/client.ts has 700 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":"apps/web/features/books/api/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e53b9069a2e8f23d294664e3c314a16d64bcde5874c5ca5333f686d266b431"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/library/library-page.tsx: 682 lines of code: apps/web/features/library/library-page.tsx has 682 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":"apps/web/features/library/library-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5c208763c14a95f322e5ba26d6e82752d0432e43f2150703e6a359cef2e689"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/settings/settings-page.tsx: 631 lines of code: apps/web/features/settings/settings-page.tsx has 631 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":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63c044fbb3c16bd2ef3888615b0caaaec85c023ce14d37f1f45b5a430093cea"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/reader-engine-runtime.tsx: 629 lines of code: apps/web/features/reader/v3/reader-engine-runtime.tsx has 629 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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d64bcac3a908e91f807080fa67c4562825fdf230e5c8264e7aa0166324ee54e"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/adapters/readium-publication.ts: 581 lines of code: apps/web/features/reader/v3/adapters/readium-publication.ts has 581 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daa6c4d513638f1ec0d8945dfbbd8b4894394e7758905d9b7623b92e441c083"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/components/system/pwa-client.tsx: 580 lines of code: apps/web/components/system/pwa-client.tsx has 580 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":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86e39f14ce315d87a99d813fe0dd65b733d8fa56b27fe8f9a5c027648d80ab9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/reader-v3-page.tsx: 579 lines of code: apps/web/features/reader/v3/reader-v3-page.tsx has 579 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":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e3dbd37a5ce0a4cfe66787ed96462d6d5014e2c669994ba625e5df7b938396"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/library/library-batch-actions.tsx: 555 lines of code: apps/web/features/library/library-batch-actions.tsx has 555 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":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"972a20a51e07219e8ec11109bad0c8dc7162b1d5d136903fb98e5ea96b602bb6"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/paged-track/paged-track-controller.ts: 541 lines of code: apps/web/features/reader/v3/paged-track/paged-track-controller.ts has 541 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":"apps/web/features/reader/v3/paged-track/paged-track-controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd78d0c974bd7b05f5424c6b0deaab2267a70649bbe85b15b2308bee7ea98c9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts: 497 lines of code: apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts has 497 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":"apps/web/features/reader/v3/original-publication/strict-fb2-parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997018385104ab18e260b6f2578e0b9f5c98d29b93e8893f4b086d64afeb7c5"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/books/metadata-lookup-modal.tsx: 447 lines of code: apps/web/features/books/metadata-lookup-modal.tsx has 447 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":"apps/web/features/books/metadata-lookup-modal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"078ddae6a901e637dc7bbcde16ecbe69db3c38e49dd2f2af0107e1b61996e2b9"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/settings/center/users-permissions-page.tsx: 446 lines of code: apps/web/features/settings/center/users-permissions-page.tsx has 446 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":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9dbd5f930f950fe491a7251f5f26cc248fe88a2a5bf370cae854bd94672647"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/lib/reader/v5-sync-coordinator.ts: 445 lines of code: apps/web/lib/reader/v5-sync-coordinator.ts has 445 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":"apps/web/lib/reader/v5-sync-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb920e027a5341c2bdee14170a122ac007bfdc039f9e96a4e7d3afe4e33afdb"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/api.ts: 433 lines of code: apps/web/features/reader/v3/api.ts has 433 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":"apps/web/features/reader/v3/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf5746f4a523e44e57e9dc0f0fe9b8fb09ea7e6da42e9255f5b6c8e5201ed4b"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/readium-web-poc/src/main.ts: 432 lines of code: apps/readium-web-poc/src/main.ts has 432 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dd0fce6cb360cf1e16544afe1fe523e2a975e74c0cb8af2de0d6c67d3251fa"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/components/audio/audio-mini-player.tsx: 427 lines of code: apps/web/components/audio/audio-mini-player.tsx has 427 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":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6cc8b53039dc7ea88c1a95a3f1c720acf5d9431643f3e93829ca993c5237ab"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/reader/v3/adapters/comic-track.ts: 414 lines of code: apps/web/features/reader/v3/adapters/comic-track.ts has 414 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":"apps/web/features/reader/v3/adapters/comic-track.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"503a5ae9b9238a8189ad9a1434dd1a746d401d3b1cce007ca111fa5d861ec292"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web/features/organize/organize-page.tsx: 412 lines of code: apps/web/features/organize/organize-page.tsx has 412 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":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77c782a4285deeaa14b96c85d7cb4df8e5969c867772fdb3b2c3e55fc5342ec"}},{"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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c97848485289a8d09e190bb464bc3d137ed81eca2a434c2947df30e97b1525"}},{"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":"apps/web/components/layout/app-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680c8174b61b0487f2409c23e1653c539a7e500dba264fbe23381bc65cb5709"}},{"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":"apps/web/features/shelves/shelves-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ffdf5a8a4ec3b11b5bda73a43bd44721c3d33ca5c0409932aa59745aeee027"}},{"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":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f6d350548afd2e4b76da4ee22686e118fa87cf7067890c8e96c843ed47031"}},{"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":"apps/web/features/books/book-detail-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d686e3e4e9c6bd86ec80f311c35273d0a06163261529f9a83fc7fd3ce8415228"}},{"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":"apps/web/features/library/library-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae0a9b4cd8667ba1a073aae697c32584f4fae02e121b4f2cd9f0dd9e2595369"}},{"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":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f4df0676a64e237a071062c0f089636cd3fb2cfa7c2fe25fe9975be72e3e71"}},{"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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"678b43af47c60bbed25975b167f84818bad0e5fc73dc552b83e1cfaaf557a124"}},{"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":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7e0b0d1a293f04532c2115f880d701c7ec0860912da3ba7d6e3f1d8880f936"}},{"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":"apps/web/scripts/apply-i18n-overrides.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e904ac02e77fc5f2ea4a4449a99c02430f9934aa2d17c9c42d044d95ca6cd9ca"}},{"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":"apps/web/features/reader/v3/reader-v3-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef406c23fd413aebd1865f44fd7c82f83cb4677ff1ec73f5ed5f5274b3e8b8c8"}},{"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":"apps/web/features/library/library-batch-actions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06c6fb3064630b7a5362c7c30979b56b4cfe53de2b97e245b75bc9c5a0b5ec3"}},{"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":"apps/web/features/settings/center/users-permissions-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb0fda30728928eb79231ce459ef09ee7616533ff3e9f481064f8038d635ef9"}},{"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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2513cf670712242ecb34f6b4cef1d8f9c01cd2f66e3325ca8dcb50bedec116"}},{"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":"apps/web/components/audio/audio-mini-player.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf8e98c6ce81fe0ee9169db1ce0bd85f9d0b0dd96f98bf8dda13e0e02a4c84c"}},{"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":"apps/web/features/organize/organize-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ce0a152cccec172f7a8553a4966e482e0d897428da96414c05907180d2c7e3"}},{"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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cd8c24f77c9c4271729a8c035df3640c8c4f56d8ded458cb91ec26eb0248c2"}},{"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":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0478597c17a57a659032d64f24a1883d5134f8edfe3c3f793d3eafd49690c7c2"}},{"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":"apps/web/features/settings/ui/directory-path-picker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b62124691e2ef8c0876427782b139fe416c68caa3550eae70e1add90a38f21"}},{"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":"apps/web/features/import-tasks/import-tasks-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f824b57eebe598052e7c3565eb1c718940b7cc40a6322f805dad74d5b2c504"}},{"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":"apps/web/features/settings/center/system-health-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2882e82032208ed47ad2bde34c1cc324d985d8f2014048b2b049bd15bf25d869"}},{"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":"apps/web/features/feedback/ui/feedback-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0188820371c32fcd258c282dd07ea2e00983fd82caafa2a92d502e2a19dc65c"}},{"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":"apps/web/features/settings/center/account-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ef75efd7ce3689db92b1c3a0ab6342c2cc7835e672ea565b028f8549040895"}},{"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":"apps/web/components/book/book-table.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c218adeb5b474084c3ca42945dc07422dd28b20b932c6d769d909dc8e61d1"}},{"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":"apps/web/features/settings/center/email-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94cff11a20b33b9af5a68d9167820ed38245282ddaa678dc318e9c96f3546f0"}},{"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":"apps/web/features/settings/setup-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de5639ca9c8cd6d161254295627111a0064f3280665cc443b721147f2766e6"}},{"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":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0001f0d47042f989a63a44914da2ddb8270401859f46f4b04912241a9f63c5"}},{"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":"apps/web/features/automation/ui/automation-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20768da99d6c07071cc040612fe65cff53b318fbe5f405dce6ba9e89f2949c"}},{"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":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b54649c4d2dca24f9f815dbaa34a6b6d216ceceb5eb9efdc7e551fc7cc7a8"}},{"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":"apps/web/features/organize/classification-management-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1738f34fbb1e4458d8a8073dc5c894611004641584f4ee384024de64369c1c1"}},{"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":"apps/web/features/organize/recognition-settings-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376805a5b043237891215d48f7d0f2c16221c19b3cf0882f186dd032c003a283"}},{"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":"apps/web/features/books/ui/source-node-metadata-dialogs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b227be276e60eb84635dd444ee78264029543832565ff730f530840669e6485f"}},{"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":"apps/web/features/settings/center/import-preferences-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95c1ade97e4505e453247687ad0f59b68e2a173f1ee5bc4121e605b9a9efb39"}},{"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":"apps/web/scripts/migrate-i18n-jsx-expressions.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb27265f0302f36330c2544156b9c2931d43c1b0bfcd83aa766b8c6808e393e"}},{"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":"apps/web/features/settings/password-reset-pages.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a0401b25167257e2437dc55a6b6b7ac7edd3f4b62fa345bf21f4c6823aaae9"}},{"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":"apps/web/features/settings/center/opds-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8933fa60f4cb5fb48afd5cbe0fc7d3741c3a6fba568ee8cb033e11185bbc10b1"}},{"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":"apps/web/features/settings/login-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174fb505567b946bae19a2893a2a0ff589457b5d020b7ff4a86467b3a6746a2"}},{"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":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93aba914e9513d6cdec3623889ceb86e69777456c2d60a8b99c12384fa5e4d3"}},{"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":"apps/web/features/reader/ui/reader-control-primitives.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee6cf5211dfc53151f86237329efed581b32fac9d7c26c982aed92de59202c5"}},{"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":"apps/readium-web-poc/src/locator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b330ff7c26ed0681a3d80ed8d46c190c29c61f9bb9bb5e98500ca83393ff29e2"}},{"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":"apps/web/features/books/ui/resource-detail-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7357dda4763acff2c3c2d931051eedf195de1fb0c9a28da845f988f0e2caa496"}},{"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":"apps/web/features/organize/organize-job-detail-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c017296f6fce7849413618a9ddea568ed5785b6a87d14543b06b33d745299ef3"}},{"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":"apps/web/features/management/management-overview-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1964ea8e9d563c0a4e2b0f9207ab9097b716ba7dd88817a004d5c3e7555457"}},{"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":"apps/web/features/books/ui/book-content-browser.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64477cf84db1705b166ca9e671ad22ca051d6c86a3c700c34449b70bf1c50f8"}},{"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":"apps/web/features/automation/api/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6250f3d54630af3afa4740b5d0140f3674b264eb939518f923fa0f472f853bca"}},{"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":"apps/web/features/settings/center/library-scan-settings-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6cfce64a8833f49c84bbbb3397ac2537ec5521a56cab551659c19ffe54a4ab"}},{"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":"apps/web/features/books/application/use-resource-wall-selection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd88de6afed537645429417a6d7deff7078db31945a7478cf619e488fd641ef"}},{"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":"apps/web/scripts/migrate-i18n-jsx-text.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26a2886c87513998742943a0272be47e4e64c485dfcca85b72a6a7e0f5d74f4"}},{"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":"apps/web/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2d556e92b6340069f9a4a6ea5e9280a90641e78b3f110269cd48a1e70c0f5c"}},{"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":"apps/web/components/book/book-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf8fa6b065461022b8bec3dae0e912d5e45b4fcb044b1e6bf29b0c4a92c7a69"}},{"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":"apps/web/features/settings/center/about-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fcfae4af863e2ce4c93cff3b4c5bd71e211c7f5c77abfaa45f848ef4c0a2e8"}},{"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":"apps/readium-web-poc/src/i18n.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b075bd064abe53b2bff144b4438b353537c85b8f377ad7a4b612dc75972af8e3"}},{"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":"apps/web/scripts/build-chapters-wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"083f0466e0eee5bc5a792e32fff0ab6ebf10e3d08bbb95364dc3f6a352d84f4c"}},{"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":"apps/web/features/settings/center/language-settings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2635fd405e8e81d37099bcb54cdcc117521679d9d1ee2132f6a592c0f792226"}},{"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":"apps/web/features/feedback/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e2b3a9d674d1ec6d3872301a9763ada42502e6c11ccf889ed7670f2f43736f"}},{"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":"apps/web/features/audio/audio-listen-redirect.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"264845870cc5ec844bc03087fcb97a7778c2838eb005b28c673699c2d610b346"}},{"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":"apps/web/scripts/build-mobi-wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a0fe4ff43bc4167e093b339af639d085539df1677aedae47229fa408107e42"}},{"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":"apps/web/features/reader/v3/use-reader-pwa-surface.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fa9958e5e3c53e160928ebd01c5d400cfea809b723b3fa1ec0dc6965e2403f"}},{"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":"apps/web/features/automation/application/use-automation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d8eb2164b5e18ce151ad6ba2470ad264e5308bd49667349a41b61bdfa1755"}},{"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":"apps/web/features/settings/center/settings-center-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30988b3b10854d4c3097367fdf6b5e7ab9ef9d998a52006b6d71bed02c8dac39"}},{"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":"apps/readium-web-poc/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad493ac505285e06a6975db6db839e2ec53e2a40a35f1852105b3bf500d2f61e"}},{"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":"apps/web/features/automation/model/configuration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10ab688faf6948faa553949c6cf375321cbee0cf5741cdd4a70a41633858c97"}},{"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":"apps/web/features/settings/center/library-import-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7abddffb688088ab7f347c42cfcef435a8c912f71ae872e147f8c2ed1100d9a"}},{"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":"apps/web/features/settings/center/settings-tabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"523a869c2b01aca5085a30e8fda84d2bf96417a48f4879231cb42847165a3e30"}},{"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":"apps/web/features/settings/ui/organization-mode-picker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"653b0942d5ad9763dacfd769d0955b10e35301e23df33ec83f7312dca7017d78"}},{"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":"apps/web/components/layout/compact-language-switcher.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6718e0de6676973c11ce637a1658f73a48d3d2613e108e3423695ecbed7f509"}},{"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":"apps/web/features/settings/api/opds-settings-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"191861fce8606fa53944e02a4a537c9704f34dee5115f7ac20e85fbfb823fc37"}},{"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":"apps/web/features/settings/center/organize-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbf070a8c372614a0d37cc344f524005a41428b1166d6494de79a74064e1f04"}},{"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":"apps/web/components/ui/resource-select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a5b9e8a7aedd4cf68d884080ab7914f3a33111f53e5f82a9f54c9f16f1e075"}},{"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":"apps/web/features/settings/api/import-preferences-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd12d247b0feb01c88495420566101e3c0cfc04e32c4d073ce89c7b269e6b31"}},{"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":"apps/web/components/ui/page-title.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43596ce3f3c5497aacb5b6d78ac8a35e7ee0b04fce45ebd5a35fdee68966363"}},{"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":"apps/web/features/management/management-nav.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ffe21acbe468be5f27222977fc096b4366adb4a747eb927ce5b30f219f89e6"}},{"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":"apps/web/features/reader/v3/adapters/readium-resource-identity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2132dcd1351c6b9122e3d4b99007facde9be9bf3360e9478364e56f4d6726883"}},{"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":"apps/web/app/offline/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d747eafeed08a9d2149238f2b73671f6ebcada285c029f2b6ccfbae9375a33"}},{"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":"prototypes/feedback-web/server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"173211936f71b59cc6931a914f98c2f5c160f4f61b4048631e7a76ed509098e0"}},{"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":"apps/web/features/reader/v3/adapters/reader-interaction.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2465886c1a1962879d50a3a245106c59567edceecd51006c468c7b299176adf9"}},{"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":"prototypes/feedback-web/generate-icons.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceed41a6f73bc2b337ff22ea6d76b9e5423cdc37df05150d20436a6c5d8c470f"}},{"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":"apps/web/features/settings/center/data-system-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7c6390457dd7e4017b52492a518581bdd7ca9a1ac2c0fa6534711cd5d5f070"}},{"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":"apps/web/features/feedback/ui/about-feedback-entry.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2b54fd36f7bdd1fca179ab45f0004b9b50ea723c0bd47b22096738dfb200e0"}},{"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":"apps/web/app/forbidden/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a837730a2e6aa53c5ecffa43e599b3f93d94460087d34593e4252dbb00ca6"}},{"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":"apps/web/app/manifest.webmanifest/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ae4d1779d20cc88f55c54059099828dd591866b01c7365b3616923af424d33"}},{"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":"apps/web/app/settings/organize/jobs/[id]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4696af14a68c49cd904969b548f38f80aae98e4603b4eb39f9841eef73fd4f30"}},{"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":"apps/web/features/settings/center/general-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6a6f6aed6bf51d213d679806dfdf1af1e8f8c8d456e3769662b15991b19bb8"}},{"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":"apps/web/lib/pwa/progressQueue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3347341e37b2c72417d673939e4a9598b32f7903771a75c686bd6399cb71212"}},{"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":"apps/web/i18n/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae27741c3d53524f92eabc16948cf47b54da14e141edb53798ba91488c0876d8"}},{"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":"apps/web/instrumentation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7fea1aa088773bb36ecd06435d1a37e2682d54c55a754edf311778ad52ae83"}},{"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":"apps/web/app/books/[bookId]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f02e92b1d79b9e1e9ae437cf411aa03dd0e98bc7cc68c04eea89a8164687c7a"}},{"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":"apps/web/app/listen/[resourceId]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f262f65e95e0c7e99aa05229e30324edf031fe03ff27d976b4a4656c0ab46f"}},{"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":"apps/web/app/organize/jobs/[id]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b299171d105d2f48534a418dc147f13282745a8be248d17dddfc16b6636ca6"}},{"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":"apps/web/app/reader/[resourceId]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94928797a6fb06904e078b5aac07801363230af92182e190d357aca4565afa4c"}},{"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":"apps/web/features/settings/center/system-logs-settings-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"861543494e03ec4ef301a533c3516ec8832f8a45a98dc39b508cf553eb7da538"}},{"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":"apps/web/app/settings/email/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49449cc0c7e581548c7da7d3f7465a9aa8f4a9c01746aef393d4559c1c25282f"}},{"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":"apps/web/app/settings/library/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bde6a75e7f8d720abfc57682264825d35cb846e31e0ba19bf2f859be5e6f56"}},{"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":"apps/web/app/settings/organize/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9487d907faa3ddc3c0600d51f09890d2404efef97dfc74ae5f00861008621ad4"}},{"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":"apps/web/app/forgot-password/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baceb2b403a01b8c668c8787122a566bd5daf33ade2ccfea92ba2f039458a136"}},{"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":"apps/web/app/import-tasks/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"172d6f0957091dedc4e5520df0a4adeba02b4b282701ae4d04c4f53f8cfd6c41"}},{"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":"apps/web/app/library/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8772914a695dd878206895ba8ef0fd929a79eb24a8b720ee1a261c053a9704"}},{"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":"apps/web/app/login/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67922511f24ad3d743279e30748ec538de8aa1dcf0a7c12c5ee079eaa65c3ef5"}},{"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":"apps/web/app/management/folders/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3a12d7e158b80d4d967576693058b2d425bb121226a2aeaa7bdd675c570592"}},{"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":"apps/web/app/management/logs/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec656d306d0d82d817059d4e884addf692ebc06ad38c7b9cf8848675e5a4740"}},{"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":"apps/web/app/management/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44e0e7bdf8c755848fffcb5cf60c2faee8b8bff5ba07e5c06bda2ed804f00d1"}},{"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":"apps/web/app/organize/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"627a931a76dc6c25f7886eecc0f2110bccbbc268fd5f9c1b5fb3a1e0ca2ebff6"}},{"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":"apps/web/app/organize/pending/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"793005b98243f8378ae2a77e14ccfa8c2daebbb795d98d2f146e445b47c873fb"}},{"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":"apps/web/app/reset-password/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b431b40449f5d388488512c4f2e1d1d3ff99c03773929cab918fdf612b5154"}},{"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":"apps/web/app/settings/about/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4c8e5203aff3c378b26e2c9987be9a84dd5919055403dba6cee3617a7a95f3"}},{"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":"apps/web/app/settings/automation/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c183de0e2437524d62195d10a1c18f4b0498bb3ba62932e148b7c1dac705f29"}},{"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":"apps/web/app/settings/data/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"992749d93592a49185a14755f7e319aac77c32415a643165eafbac954f7965a0"}},{"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":"apps/web/app/settings/health/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4b45e4e58fdbc55ddfc5ef389a42fb35c98d00113de63fb81015265ee13986"}},{"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":"apps/web/app/settings/logs/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd2350c88d1058177b843ebed43a5122f755baa9eabfe6718de93d0b46d1f99"}},{"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":"apps/web/app/settings/opds/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb2e773e513878efcc6d21870c1a84507eb301dc069f343abef2cb5e61da89e"}},{"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":"apps/web/app/settings/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28af513acd9bddd74bd21fe0aa521786b852d35675a4b0432b0e81ff59b008bb"}},{"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":"apps/web/app/settings/users/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cccc28313331258310b82e417bf0a9fd3c76df95d13d2a48516a8061083e48"}},{"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":"apps/web/app/setup/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7011741476d1535e72073a59a8b3dafa023edee03c1edbffbb2e6abdd0c8e64e"}},{"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":"apps/web/app/shelves/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3158560da2e9964cb20057d38b476eeab0245c38dd56613de572e64cccf558da"}},{"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":"apps/web/features/reader/reader-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3a802b8da93fd11cb4f8d723fc86a6f95f88b02d3f3a9122d10dd162a6e927"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~417 LoC): no import path from any entry point (101 application, 22 tooling, 171 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":"prototypes/feedback-web/prototype.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b838457f99a255829d2d64408ca59fbdf6d57b238310a116db90ccd0a28df8dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~98 LoC): no import path from any entry point (101 application, 22 tooling, 171 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":"apps/web/features/books/application/use-resource-wall-selection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348c70ea5cd3d7ef4d961c1138de7217056543889c3fbe8544d09f831c1921e6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~89 LoC): no import path from any entry point (101 application, 22 tooling, 171 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":"apps/web/components/book/book-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff991dbd85092752a0ce99e1efa18c95e098de1cd59ee93533efd7a20e6250b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (101 application, 22 tooling, 171 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":"apps/web/features/reader/v3/adapters/readium-resource-identity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b6083c414bc6578b3885532ed82f1104f32441e7e341a877b33cec9572ba30"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (101 application, 22 tooling, 171 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":"prototypes/feedback-web/generate-icons.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c101df4d2ac652773b72b4c76ee56d6c43be80e0fed6f106d003c07bb991343"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fetchAllBookResources\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe202d22459b6357798ca35ea217b647af1882143975f534ca3bcfb07c27bb9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateMetadataProviderOrder\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81cd70f4888e1f727b89f8dcad8914fccc69df1b2dae1034c5beb94d441abda"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateResourceReadingStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/api/client.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bcac7c67fa678cf956294c0a6043068240b1d82109d595729660a67f0a376b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027displayResourceNumber\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/book-detail.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6ee06148f84ee061e7f10254e3025bb1978ea989c56f9568d0c23dd94146ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027localV5ProgressPresentation\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/local-reader-progress.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc250d78ab34a794ae33bbd3aafd0a5f80a14121ad771c0820fd4e914ca59131"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ReaderQuickActionButton\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/ui/reader-control-primitives.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"da64f78110eaf6eb0cb697c5906b0c4cfd2118e66bd7d1b81adef03f54b19cf0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ContinuousItemState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/continuous-layout.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3952e75bdddfbb661240c0eb26b4223a85a01793888e65665c79e3bd479af128"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ContinuousOffsetIndex\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/continuous-layout.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"793bab702dcfc60a7cebe16d25d7c45d80d4964d254932c47cb152adc0711147"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027continuousPlaceholderRanges\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/continuous-layout.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d68429bb94dc6ea590c42702c1158589d383dd6877ad65b47cff96a587acec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027estimatedContinuousHeight\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/continuous-layout.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bedf75c455c0ca2780299a89db58b13808dd4c2ffcacd36dcd0ccf96208ee28"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027epubSurfaceColor\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/epub-theme.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f163c925a99b99a6a16f5c863cf3dde86286aed90cac58d539510e81b90815d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027epubSurfaceTextColor\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/epub-theme.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d1043f459bdd28b1fd71d7968060b8c15a9e41d7d93a060b164578bfd4f88d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027applyEpubThemeSnapshot\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/epub-theme.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c78eb19d27bee41f02ca31a5d547421c5292fdd9ab3b618f74632b77f34468"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027applyEpubDocumentSpacing\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/epub-theme.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"620b7a2f9935e099bb16c10fad3c308c251585ee773de0834ab5caef4aa3a5a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PagedTrackSettleReason\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/paged-track/paged-track-physics.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caeb8e19d54075a35fd85cd366e0bb2b2b624efa09a00b219ce6d48a210214a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027LocalizedReleaseNote\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/updates/model/types.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a8dbe259ac0c8be596642453c48df299f3f959c2b18e0795d4b05e10f65de6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasMessage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/i18n/messages.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c486606692df49540a13e4a38100fb0268395677cf8ae4eb2adeeeb2707ce1fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027messageKeys\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/i18n/messages.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e001e0a822c7253ac33c06462306bb2a3359fb0414f735d5df3a7515b2d7736"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clearAudioDevicePreferences\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/audio-device-preferences.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae297ec4e2a9208048a496827f4a597beff04d9174603e5a623752c5209fb2f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027comicPagedPreloadRadius\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/comic-preload.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d169a67f1140a1b7c7fa0d78c9d9abb039abd11f3f3dea9dbe73c0a2b510663b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027maxComicPagedPreloadPages\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/comic-preload.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"113a83f735da40c0844dd340ebd1828366a0809dee09afb37fac5ddd37b43482"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027comicPreloadAfterVisibleDelayMs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/comic-preload.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25b649735b6cc0da8bbeb1fb28d7968b4fe79879130d31370180afa769e0b01"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getReaderV5ProgressSyncCoordinator\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in apps/web/lib/reader/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in apps/web/lib/reader/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader/v5-sync-coordinator.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73a13bc4a652bf423ab5df23163f7fb489b0592ebd1e5ec278533a99b8c4c5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027READIUM_VERSION\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/readium-adapter.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cf858e2bd32f3796e95d7948b1d6d1e749ed2fbf57a20c572d515eb81be6dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027lowerSet\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/security/reader-safety-policy.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9a307087adba4ecb2275dddb6fe2177eed0076f28c6f5a3b5657c53938de15"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nonEmptyString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader/v5-wire.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c446909d2e238965c280be242dfb44555b0c4ecd2eeeba06e8301689c4db00"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@playwright/test\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container_update_browser.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb9542413a7b981dbdba6bdc82e79fe17d2ae858e3fe26f103a57dca5f66cbe"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027sharp\u0027 in production deps: Only test files import it (first: apps/web/e2e/comic-reader.spec.ts:2) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/package.json"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"73caa9c95356246c03a8cb81418bde20b288d08144a07ba5f62666b1749d84b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!event.shiftKey \u0026\u0026 document.activeElement === last\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/reader-shell.tsx, apps/web/features/reader/v3/reader-engine-runtime.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"af08b2c3ba09f7b6b3503a37dccb58fe5e5ba91f8e937d70a2528e0c69015c40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isRecord(payload) || !isRecord(payload.error) || typeof payload.error.message !== \u0027string\u0027\u0060 appears character-identically in 3 files \u2014 apps/web/features/settings/api/import-preferences-client.ts, apps/web/features/settings/api/library-scan-settings-client.ts, apps/web/features/settings/api/opds-settings-client.ts. 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":"apps/web/features/settings/api/import-preferences-client.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"973c65789c1b0af357bf3ab9593c22a0d0c241adab785fb2b051591d18ca32ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isRecord(payload) || payload.ok !== true || !isRecord(payload.data)\u0060 appears character-identically in 2 files \u2014 apps/web/features/settings/api/library-scan-settings-client.ts, apps/web/features/settings/api/opds-settings-client.ts. 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":"apps/web/features/settings/api/library-scan-settings-client.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"230534dff96180a986687030d0497b0baaf630de8e95fbe212654001455c01b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!manifestResponse.ok || manifest.schemaVersion !== 1 || manifest.abiVersion !== ABI_VERSION || manifest.emscriptenVersion !== \u00273.1.74\u0027\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/v3/original-publication/chapter-core.ts, apps/web/features/reader/v3/original-publication/mobi-core.worker.ts. 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":"apps/web/features/reader/v3/original-publication/chapter-core.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb24bb881e5230b8eca48d3343ef9dcad153bbd5bd69501e26ac868ad942651"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!node.readable \u0026\u0026 !(node.mountedOnly \u0026\u0026 node.path === \u0027/\u0027)\u0060 appears character-identically in 2 files \u2014 apps/web/components/directory/target-directory-picker.tsx, apps/web/features/settings/ui/directory-path-picker.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea57c2bd6828a2506a8cfbc8d4f87cc06bb304d6b47ea322e68e231b194dfc41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!response.ok || !isObject(payload) || payload.ok !== true || !(\u0027data\u0027 in payload)\u0060 appears character-identically in 5 files \u2014 apps/web/features/dashboard/api/dashboard.ts, apps/web/features/library/api/bulk-operations.ts, apps/web/features/management/api/events.ts, apps/web/features/management/api/overview.ts. 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":"apps/web/features/dashboard/api/dashboard.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"108cdb2d974b4acab4e3c2d090901bc1f95a6d892ecbf21dd2f859ded302806a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!rootRef.current?.contains(target) \u0026\u0026 !menuRef.current?.contains(target)\u0060 appears character-identically in 2 files \u2014 apps/web/components/ui/combobox.tsx, apps/web/components/ui/select.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be8d001a04f76f062c1b4cb6532c0953a93d32cb708e93af28200f9ce119fa3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 apps/web/features/updates/api/operations.ts, apps/web/features/updates/model/release-notes.ts. 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":"apps/web/features/updates/api/operations.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7514f2387500701c3a9e33b70bfc5a5b524c9bb7dec285d70e21cb4670b34c6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(ts.isArrowFunction(current) || ts.isFunctionExpression(current)) \u0026\u0026 ts.isBlock(current.body)\u0060 appears character-identically in 2 files \u2014 apps/web/scripts/migrate-i18n-jsx-attributes.mjs, apps/web/scripts/migrate-i18n-jsx-expressions.mjs. 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":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2f444761c4a69bb5f12fb703f8cd57599c40604b8a939dfe96c3b5f7e3c971"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060availableBelow \u003C Math.min(desiredHeight, 176) \u0026\u0026 availableAbove \u003E availableBelow\u0060 appears character-identically in 3 files \u2014 apps/web/components/ui/combobox.tsx, apps/web/components/ui/multi-value-combobox.tsx, apps/web/components/ui/select.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de35e49b33d545293755147153f32afa6e4c02d90612d03255265844b76e336"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cause instanceof ReaderSafetyPolicyError \u0026\u0026 cause.action === \u0027BLOCK_RESOURCE\u0027\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/v3/adapters/readium-publication.ts, apps/web/features/reader/v3/original-publication/mobi-publication.ts. 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":"apps/web/features/reader/v3/adapters/readium-publication.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb0373160509bec1bcb115e8101748a807e3ee7cba8921d697b63d4420487c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.exitCode !== null || child.signalCode !== null\u0060 appears character-identically in 2 files \u2014 scripts/e2e-flow-check.mjs, scripts/python-worker-runtime-smoke.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-flow-check.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c79d9bdfeeab61974550b51b38e8ae442026f82ca9dba6acd02ae395b570494"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.exitCode === null \u0026\u0026 child.signalCode === null\u0060 appears character-identically in 2 files \u2014 scripts/e2e-flow-check.mjs, scripts/python-worker-runtime-smoke.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-flow-check.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dcbbd9fec66b177f1baa7387d6d02058c95ee8b18613c65ce0f21e4cd2fae5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060configuredBasePath \u0026\u0026 configuredBasePath !== \u0027/\u0027\u0060 appears character-identically in 2 files \u2014 apps/web/lib/base-path.ts, apps/web/next.config.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":"apps/web/lib/base-path.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46001084d3e60d60b84f7d7aee560377beca3a80c8695d785fc698b3f95dbe8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.schemaVersion !== 5 || !Object.prototype.hasOwnProperty.call(data, \u0027progressSnapshot\u0027)\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/api/client.ts, apps/web/features/reader/v3/api.ts. 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":"apps/web/features/reader/api/client.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fff8ddbc3156e1a03acbf0f7c71e9bfa8263a2fa296609085fec459dd8d300"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isDirectory() \u0026\u0026 !entry.name.startsWith(\u0027build\u0027) \u0026\u0026 !entry.name.startsWith(\u0027.\u0027)\u0060 appears character-identically in 2 files \u2014 apps/web/scripts/build-chapters-wasm.mjs, apps/web/scripts/verify-chapters-wasm.mjs. 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":"apps/web/scripts/build-chapters-wasm.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e48780d66b7647b70f66de5401f206b1e260205fb76d8eef1bfe0b1b19e431"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isFile() \u0026\u0026 /(?:\\.c|\\.h|\\.cmake|CMakeLists\\.txt)$/.test(entry.name)\u0060 appears character-identically in 2 files \u2014 apps/web/scripts/build-chapters-wasm.mjs, apps/web/scripts/verify-chapters-wasm.mjs. 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":"apps/web/scripts/build-chapters-wasm.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"767bd28a8a5b579afc6e9e78bd7cc2b9b7d641929f36831784092edfaa9f1877"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isFile() \u0026\u0026 /\\.(?:c|h|cmake|txt)$/.test(entry.name)\u0060 appears character-identically in 2 files \u2014 apps/web/scripts/build-mobi-wasm.mjs, apps/web/scripts/verify-mobi-wasm.mjs. 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":"apps/web/scripts/build-mobi-wasm.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6da53ad9637fea6c7371b09275ce7893c0e7bec8b0fd6c5f59b5096129ee92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.defaultPrevented || event.button !== 0 || event.metaKey || event.ctrlKey || event.shiftKey || event.altKey\u0060 appears character-identically in 2 files \u2014 apps/web/features/settings/center/settings-secondary-nav.tsx, apps/web/features/settings/center/settings-tabs.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/center/settings-secondary-nav.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc2adf884763a92786cfc3a01655f5b2f7a9aaf55b59b6233380a302032474a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key === \u0027ArrowDown\u0027 || event.key === \u0027ArrowUp\u0027\u0060 appears character-identically in 3 files \u2014 apps/web/components/ui/combobox.tsx, apps/web/components/ui/multi-value-combobox.tsx, apps/web/components/ui/select.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/ui/combobox.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"581ae2bec230edbc8887d42f9838de087fd8b8c63e5634cc377e1725e091468b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.shiftKey \u0026\u0026 document.activeElement === first\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/reader-shell.tsx, apps/web/features/reader/v3/reader-engine-runtime.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe912dfb4ac162eaa6bb59aaa3048b2f1fe1858c20c056be41bf5909ce47993"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060extname(entry.name) === \u0027.tsx\u0027 \u0026\u0026 !entry.name.includes(\u0027.test.\u0027) \u0026\u0026 !entry.name.includes(\u0027.spec.\u0027)\u0060 appears character-identically in 3 files \u2014 apps/web/scripts/migrate-i18n-jsx-attributes.mjs, apps/web/scripts/migrate-i18n-jsx-expressions.mjs, apps/web/scripts/migrate-i18n-jsx-text.mjs. 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":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"822a8fe4bc6d214ffb3964d25bfdf2240dd0c1ee9fd37ddf6082c0bf356d2606"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060image.complete \u0026\u0026 image.naturalWidth \u003E 0\u0060 appears character-identically in 2 files \u2014 apps/readium-web-poc/src/main.ts, apps/web/features/reader/v3/adapters/comic-track.ts. 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":"apps/readium-web-poc/src/main.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483aa279f58786fc509c6bcee8b4254f589fab410d8ac40dd16a88fcd80ae91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isAbortError(reason) || reason instanceof StaleReaderOperationError\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/v3/adapters/comic-adapter.ts, apps/web/features/reader/v3/adapters/pdf-adapter.ts. 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee85de8321a617ec9b242f1257cf521030a2aa3562f4327228d622b37562ea2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isObject(payload) \u0026\u0026 isObject(payload.error) \u0026\u0026 typeof payload.error.message === \u0027string\u0027\u0060 appears character-identically in 6 files \u2014 apps/web/features/dashboard/api/dashboard.ts, apps/web/features/library/api/bulk-operations.ts, apps/web/features/library/api/filtering.ts, apps/web/features/management/api/events.ts. 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":"apps/web/features/dashboard/api/dashboard.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66d961233249d51eff66b9b4c85e4d0bad77e6694a7dc89423ef52fbed57e40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.position.presentation.displayPercent - right.position.presentation.displayPercent || left.createdAt.localeCompare(right.createdAt)\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/reader-shell.tsx, apps/web/features/reader/v3/bookmarks.ts. 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":"apps/web/features/reader/reader-shell.tsx"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd3e15e2bbaba9e40e788abdffb2f8a7d9c7990fff28b96bb83b540a21375d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason instanceof DOMException \u0026\u0026 reason.name === \u0027AbortError\u0027\u0060 appears character-identically in 4 files \u2014 apps/web/features/reader/v3/adapters/adapter-base.ts, apps/web/features/reader/v3/adapters/pdf-range-transport.ts, apps/web/features/reader/v3/reader-engine-runtime.tsx, apps/web/features/settings/ui/directory-path-picker.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/adapters/adapter-base.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4457cfb2b30e977c87d90f40d5bab9f8149c45ab6eedd7abed8af8044169d06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason instanceof Error \u0026\u0026 /^[A-Z][A-Z0-9_]\u002B$/.test(reason.message)\u0060 appears character-identically in 3 files \u2014 apps/web/features/reader/v3/original-publication/text-publication.worker.ts, apps/web/features/reader/v3/reader-engine-runtime.tsx, apps/web/features/reader/v3/use-reader-session.ts. 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":"apps/web/features/reader/v3/original-publication/text-publication.worker.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1651e5e52881cb7025f4f45913a1b0339a0fffacf83775cf75204de98ebeede1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason instanceof Error \u0026\u0026 reason.message === LOCATION_RESTORE_FAILED\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/v3/adapters/comic-adapter.ts, apps/web/features/reader/v3/adapters/pdf-adapter.ts. 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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff107024b81f2ecb82b95a74f0635b15dce74e8dccdbe184d016a4b3092fc61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason instanceof Error \u0026\u0026 reason.name === \u0027AbortError\u0027\u0060 appears character-identically in 2 files \u2014 apps/web/features/library/model/filter-option-search.ts, apps/web/features/reader/v3/paged-track/paged-track-controller.ts. 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":"apps/web/features/library/model/filter-option-search.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8595998542892f00de07e6231c78d8fdb8b3102e574a1fb4e925715a49464d43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason instanceof ReaderSafetyPolicyError || reason instanceof ReaderSafetyImplementationError\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/v3/original-publication/mobi-core.worker.ts, apps/web/features/reader/v3/original-publication/text-publication.worker.ts. 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":"apps/web/features/reader/v3/original-publication/mobi-core.worker.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"415c8451dea2d782974174748d1ca23c7c23738141a8649b40a12460f501ea21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060requestId === null || typeof ok !== \u0027boolean\u0027\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/v3/original-publication/mobi-worker-client.ts, apps/web/features/reader/v3/original-publication/text-worker-client.ts. 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":"apps/web/features/reader/v3/original-publication/mobi-worker-client.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43b11e260475e3b632db67b6d369bcae312c26d853b0376b074e1070fef61a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.ok \u0026\u0026 payload?.ok === true \u0026\u0026 payload?.data?.status === \u0027ok\u0027\u0060 appears character-identically in 2 files \u2014 scripts/e2e-flow-check.mjs, scripts/python-api-runtime-smoke.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-flow-check.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"05964ef66b6621d9dc481db4da76433e6c903046dfc46a92ba2d57d2e9b421c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060size \u003E= 1024 \u0026\u0026 index \u003C units.length - 1\u0060 appears character-identically in 2 files \u2014 apps/web/features/kindle/kindle-send-queue-page.tsx, apps/web/features/management/management-overview-page.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/kindle/kindle-send-queue-page.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3027dee4be6d5fecb088bb14495c5649a818b2674be321ca6e47dc39d72ea0c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ts.isFunctionDeclaration(current) \u0026\u0026 isUppercaseName(current.name?.text) \u0026\u0026 current.body\u0060 appears character-identically in 2 files \u2014 apps/web/scripts/migrate-i18n-jsx-attributes.mjs, apps/web/scripts/migrate-i18n-jsx-expressions.mjs. 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":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a1b58a863414635dc1c4b7baaf26318af2894aad663b0e07857fd33bb35998"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ts.isVariableDeclaration(declaration) \u0026\u0026 ts.isIdentifier(declaration.name) \u0026\u0026 isUppercaseName(declaration.name.text)\u0060 appears character-identically in 2 files \u2014 apps/web/scripts/migrate-i18n-jsx-attributes.mjs, apps/web/scripts/migrate-i18n-jsx-expressions.mjs. 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":"apps/web/scripts/migrate-i18n-jsx-attributes.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"72be0db6640c68d72855f5007ee04967308ac847e2879854e3fb4bf72e7c5385"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof crypto !== \u0027undefined\u0027 \u0026\u0026 typeof crypto.randomUUID === \u0027function\u0027\u0060 appears character-identically in 3 files \u2014 apps/web/features/audio/audio-playback-provider.tsx, apps/web/lib/reader/v5-storage.ts, apps/web/lib/reader/v5-sync-coordinator.ts. 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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"554e04ecd7ae881b4b2e94d8fb40811d246ccbdec03b4b1d8f8913d50f2a7534"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027number\u0027 || !Number.isFinite(value)\u0060 appears character-identically in 7 files \u2014 apps/web/features/automation/api/client.ts, apps/web/features/library/api/books.ts, apps/web/features/library/api/bulk-operations.ts, apps/web/features/library/api/filtering.ts. 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":"apps/web/features/automation/api/client.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d56413d7ebfe2bd61dbedc9d1893d36f390183b6952d6f37cd5d857efa89d2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027number\u0027 || !Number.isSafeInteger(value)\u0060 appears character-identically in 2 files \u2014 apps/web/features/reader/v3/original-publication/chapter-core.ts, apps/web/features/reader/v3/original-publication/mobi-core.worker.ts. 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":"apps/web/features/reader/v3/original-publication/chapter-core.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a2b76adc991f2505823b7587ca2de0c5e3330a998698048e872c210590902"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027number\u0027 || !Number.isSafeInteger(value) || value \u003C 0\u0060 appears character-identically in 2 files \u2014 apps/web/features/settings/api/backups-client.ts, apps/web/features/updates/api/operations.ts. 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":"apps/web/features/settings/api/backups-client.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"389f36074ec3cb195287bcf34e42adbee19b7c5049e0a47e29898c9f757bbb19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || value.trim() === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 apps/web/features/import-tasks/api/client.ts, apps/web/features/library/api/library-sources.ts. 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":"apps/web/features/import-tasks/api/client.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ea9853c9ae032d7b5c3a350255a6e1608d1e968c594821d5d1d3704af81c72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 7 files \u2014 apps/web/features/audio/api.ts, apps/web/features/library/api/books.ts, apps/web/features/reader/reader-shell.tsx, apps/web/features/reader/v3/adapters/readium-navigation.ts. 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":"apps/web/features/audio/api.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a20ea3b623a367e842661313775454a8ab5f27ce485fdeba63bb6a76458547"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isSafeInteger(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 4 files \u2014 apps/web/features/audio/api.ts, apps/web/features/reader/v3/original-publication/mobi-worker-client.ts, apps/web/features/reader/v3/original-publication/text-worker-client.ts, apps/web/lib/reader/v5-wire.ts. 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":"apps/web/features/audio/api.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"69afb33251217e4a8b130d991cad02899cd14f980c7d3ed12fffab92a09fbbf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 18 files \u2014 apps/readium-web-poc/src/api.ts, apps/readium-web-poc/src/locator.ts, apps/web/features/automation/api/client.ts, apps/web/features/dashboard/api/dashboard.ts. 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":"apps/readium-web-poc/src/api.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6024775db80797ed843fbf6126451a05e820f46b6f5cd4c95044f422362db7cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027string\u0027 \u0026\u0026 /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$/iu.test(value)\u0060 appears character-identically in 2 files \u2014 apps/web/lib/reader/v5-storage.ts, apps/web/lib/reader/v5-wire.ts. 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":"apps/web/lib/reader/v5-storage.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"509388e87d97ad33a9aa0515f58505af142c64a0ab181f98338c5b07e2b3ddee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027string\u0027 \u0026\u0026 value.trim()\u0060 appears character-identically in 4 files \u2014 apps/web/features/audio/api.ts, apps/web/features/dashboard/model/continue-reading.ts, apps/web/features/library/api/books.ts, apps/web/features/reader/v3/api.ts. 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":"apps/web/features/audio/api.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8f578500c03568dcee94b6476897c135115717b1f1e4d5534fe495b856b8a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof window === \u0027undefined\u0027 || !userId\u0060 appears character-identically in 3 files \u2014 apps/web/lib/audio-device-preferences.ts, apps/web/lib/reader-device-preferences.ts, apps/web/lib/user-preferences.ts. 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":"apps/web/lib/audio-device-preferences.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ab38009050cc896bace0b72c19dddb25b21847da21d038299d3b5fd7ef1e3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 12 files \u2014 apps/web/features/audio/api.ts, apps/web/features/dashboard/model/continue-reading.ts, apps/web/features/library/api/books.ts, apps/web/features/reader/api/client.ts. 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":"apps/web/features/audio/api.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b10498e8f56d177799b5416537c93fbbcf7c32eca9354642b1e8ea9b8276cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 value !== undefined \u0026\u0026 value !== \u0027\u0027\u0060 appears character-identically in 2 files \u2014 apps/web/features/books/model/recognized-metadata.ts, apps/web/features/settings/center/system-health-settings-page.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/books/model/recognized-metadata.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f4d04b3944870456fdd6339c33fc09a41254f478e425a62530a131e0dfefa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 apps/web/features/management/management-logs-page.tsx, scripts/release-request.mjs. 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":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68ebbde2b97f8bfa5bc40b40a98229114d7e573bbc3392d0a8b91702ee14899"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || (typeof value !== \u0027object\u0027 \u0026\u0026 typeof value !== \u0027function\u0027)\u0060 appears character-identically in 3 files \u2014 apps/web/features/reader/v3/original-publication/mobi-worker-client.ts, apps/web/features/reader/v3/original-publication/text-publication.worker.ts, apps/web/features/reader/v3/original-publication/text-worker-client.ts. 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":"apps/web/features/reader/v3/original-publication/mobi-worker-client.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfd0215ea69564397949510dc633133da20808b85b100ffb78190e8b520a5a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!requiresReauthentication || recoverable\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioMediaTransport.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioMediaTransport.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd84c260c2b60b16fd6dbc7762c74297eddde8d7a53e924718b92c6647f32cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060apiPath.startsWith(\u0022/api/\u0022) \u0026\u0026 \u0027#\u0027 !in apiPath\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSource.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2fd06e6c27d43a0ce1402e1c7c819142d6d52efd8d18e01786f298b74fe1aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060apiPath.startsWith(\u0022/api/\u0022) \u0026\u0026 \u0027#\u0027 !in apiPath \u0026\u0026 \u0027?\u0027 !in apiPath\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7839ecfbcf4e039832958e39978e16247b46ca6fd5d19bc2490d323c484ea78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chapterCount == null || chapterCount \u003E= 0\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d635189b3230d362d5e84242a36648cd4cf52500012bf6b47d5f769da794ba2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chapterId == null || chapterId.isNotBlank()\u0060 appears character-identically in 3 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderLocation.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b44cda334fdcf6e797454d17e46405c140085c9b93459f916f50b404f6e091"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chapterIndex == null || chapterIndex \u003E= 0\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioProgress.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioProgress.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46d32f6bc955737fa1505619f83202439e8406284b6d2f618696b34238b7d5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chapterTitle == null || chapterTitle.isNotBlank()\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioProgress.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioProgress.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9997d014bcd553daefb78f345a413ae114d64758ef438365190fc413a5a0eeb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character.isLetterOrDigit() || character in setOf(\u0027-\u0027, \u0027_\u0027, \u0027.\u0027, \u0027~\u0027)\u0060 appears character-identically in 3 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBookmarkSyncPort.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBootstrapGateway.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderPositionSyncPort.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/KtorReaderBookmarkSyncPort.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8949faff7d507fdf5c63b26f51bb5b464b231bdb87abf782d486fafa3384544b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060coverApiPath == null || coverApiPath.startsWith(\u0022/api/\u0022)\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6ca3e19af6ebe47af09abc436eee42e898aab2b1a416f04676a2effc8a4a3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060directory.exists() \u0026\u0026 !directory.deleteRecursively()\u0060 appears character-identically in 2 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AndroidDownloadCatalog.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/platform/persistence/AndroidCoverCache.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AndroidDownloadCatalog.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed898e0e64401791721c4d7f1065c20f0c8c3bef7f41f2dc3eac540e63baa9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060durationMillis == null || durationMillis \u003E= 0\u0060 appears character-identically in 6 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/model/AndroidAudioModels.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioProgress.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/model/AndroidAudioModels.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d03d545ca9bd8d1b190a4fe25994d75cdcf5c219d8717c7a09cc0364f08865"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060endMillis == null || endMillis \u003E= startMillis\u0060 appears character-identically in 2 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/model/AndroidAudioModels.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/model/AndroidAudioModels.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b045211f428231b0ad6060329d068a9f78985fd34ae4de2dc4fd0cd24df966"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060failureCode == null || failureCode.isNotBlank()\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/domain/Downloads.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBookmarkSyncPort.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/downloads/domain/Downloads.kt"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e0f71542ed707689b32fd944159f4023a2828b86946846d16cde1590bf39b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060header.size \u003E= 12 \u0026\u0026 header.copyOfRange(0, 4).decodeToString() == \u0022RIFF\u0022 \u0026\u0026 header.copyOfRange(8, 12).decodeToString() == \u0022WEBP\u0022\u0060 appears character-identically in 2 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c347caed820b2a6a5d917357d1ee6722879be1dbfcb1041452a197c7ad1937f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060header.size \u003E= 3 \u0026\u0026 header[0] == 0xFF.toByte() \u0026\u0026 header[1] == 0xD8.toByte() \u0026\u0026 header[2] == 0xFF.toByte()\u0060 appears character-identically in 2 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ImageDirectoryReadiumPublicationFactory.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/downloads/infrastructure/AtomicDownloadFileSink.kt"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d63ccaff6b8dde80af01f3312b60a2e25ec5fb3716e2185fc2cd9be1cf640a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060initialTarget == null \u0026\u0026 startupPositionSource in setOf( ReaderStartupPositionSource.LocalPending, ReaderStartupPositionSource.LocalOnly, Re\u2026\u0060 appears character-identically in 3 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"783132178a7bcc71b62adc4aa4ff0fef8ae7fbba79c0242bb16682ee8a70d030"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060localPosition != null \u0026\u0026 restorePage != null\u0060 appears character-identically in 2 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bc4870ed52be256d5842a46509107a63a8cb5864ba165f863fcf743a57685a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifestApiPath.startsWith(\u0022/api/\u0022) \u0026\u0026 \u0027#\u0027 !in manifestApiPath\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSource.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a319f950e62f9bf702633900d9d472b59ed94fe6059590ae95d8c418df139a08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageApiPathTemplate.startsWith(\u0022/api/\u0022) \u0026\u0026 \u0022{pageIndex}\u0022 in pageApiPathTemplate\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSource.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b929b24256a2727d8805b40f95f0b7a2327ba0f2684e07d23f74b59c2ffe0012"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060positionMillis \u003E= 0 \u0026\u0026 absolutePositionMillis \u003E= 0 \u0026\u0026 totalDurationMillis \u003E= 0\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/domain/AudioPlayback.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/audio/application/AudioSessionStateMachine.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"774f4061e7e40cbbbb9d2443bbb47a34fc3f56795188f613a0e603e380aa1b60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.error.kind == AppErrorKind.Forbidden || result.error.kind == AppErrorKind.NotFoundOrUnavailable\u0060 appears character-identically in 2 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/LibraryViewModel.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/library/application/DetailViewModels.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2d78c13b2017e4873dd1690e5c57a6b218bd229029ec186170b62db420e307"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root.requiredString(\u0022schema\u0022) != SCHEMA || root.requiredLong(\u0022version\u0022) != VERSION.toLong()\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/ReaderPositionJson.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/ReaderPositionSyncStateJson.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/infrastructure/ReaderPositionJson.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"070665aa8e959eafa2012da562e6941fcd93211e728f828a743a7a8aafaee24f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceFormat != ReaderSourceFormat.ImageDir || assetId == null\u0060 appears character-identically in 2 files \u2014 apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt, apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/domain/ReaderSource.kt. 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":"apps/mobile/shared/src/commonMain/kotlin/com/ermao/library/shared/modules/reader/application/ReaderBootstrap.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7330ed0cf4b5161ef1ba679aaeaa8bc6e1598d0390472b9f89eee58cc3468be3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startupPositionSource == ReaderStartupPositionSource.ServerSnapshot \u0026\u0026 remoteSnapshot != null\u0060 appears character-identically in 3 files \u2014 apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt, apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt. 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5eff7aa11b6428ab23794ffb6f05bf41406c760dc5f6eef6880f6fce04bf7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attempt and self._stop.wait( DATABASE_BUSY_RETRY_DELAYS_SECONDS[attempt - 1] )\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/services/metadata_lookup_queue.py, apps/api-python/app/services/organize_scheduler.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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6713db6119047d24fd7d1ca496d8b2788db402709ab1cd663f8e7700dacbf425"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b\u0022\u003C!DOCTYPE\u0022 in content.upper() or b\u0022\u003C!ENTITY\u0022 in content.upper()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/metadata/application/opf.py, apps/api-python/app/modules/metadata/infrastructure/standard_files.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":"apps/api-python/app/modules/metadata/application/opf.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a49026559ca2b09d5623a6496be2aaef6e6131ca3214fea90fe99727a34db7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060backup_path is not None and backup_path.exists()\u0060 appears character-identically in 3 files \u2014 apps/api-python/app/modules/library/infrastructure/recognized_metadata.py, apps/api-python/app/modules/library/infrastructure/resource_cover.py, apps/api-python/app/modules/library/infrastructure/source_node_cover.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":"apps/api-python/app/modules/library/infrastructure/recognized_metadata.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"befe0b5317b58b49e340da6afd5b37ac61b7cb8b85396b140168da151e926ce9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate == configured or not candidate.startswith(\u0022/\u0022) or Path(candidate).exists()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/publications/infrastructure/chapter_core.py, apps/api-python/app/modules/publications/infrastructure/mobi_adapter.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":"apps/api-python/app/modules/publications/infrastructure/chapter_core.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ab0583b1b1c569e9d3dc2f24ba32e86c9abaf3d6b38d4a79ce50894899c592"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate is not None and candidate.cover is not None\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py, apps/api-python/app/modules/metadata/application/local_metadata.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":"apps/api-python/app/modules/imports/application/readable_resource/process_import_task.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"364e918eae6da44106df642bda1edcffe086320fc786aaf5716da2c7fd102e1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate_path is not None and candidate_path.is_file()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/infrastructure/opds_runtime.py, apps/api-python/app/modules/media/presentation/http.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":"apps/api-python/app/infrastructure/opds_runtime.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e48189b8aa303df1b04b8d936d365f5ddee8fcbb2e3c3280fc21424d6d3dd5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060configured and Path(configured).is_file()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/services/audio_metadata.py, scripts/python_release_live_fixture.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":"apps/api-python/app/services/audio_metadata.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee301298707768c3f23e82a63a02c027f222eab0c8d6e77b43e91e675ee15d83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060db.scalar( select(func.count()) .select_from(LibraryImportTask) .where(LibraryImportTask.state == \u0022FAILED\u0022) ) or 0\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/system/infrastructure/import_status.py, apps/api-python/app/modules/system/infrastructure/management.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":"apps/api-python/app/modules/system/infrastructure/import_status.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b55a30718dfae76bfff03bddde84105af23477d4c7cb7623dc09b6b18a2973"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060db.scalar( select(func.count(LibraryBook.id)).where( LibraryBook.library_id == library_id ) ) or 0\u0060 appears character-identically in 2 files \u2014 scripts/python_backend_sample_smoke.py, scripts/python_release_load_precheck.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python_backend_sample_smoke.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4c7d9785e636e3631c475aab0970192a03dc69e0a54aa14c3ce1799df0094d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060db.scalar( select(func.count(LibraryReadableResource.id)).where( LibraryReadableResource.library_id == library_id, LibraryReadableResource.i\u2026\u0060 appears character-identically in 2 files \u2014 scripts/python_backend_sample_smoke.py, scripts/python_release_load_precheck.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python_backend_sample_smoke.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6258ed756d3a2dc693a9ee11b22b20c9e519a516ba7fd0033cae0c816d1987e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060db.scalar( select(func.count(LibraryResourceAsset.id)).where( LibraryResourceAsset.library_id == library_id, LibraryResourceAsset.import_sta\u2026\u0060 appears character-identically in 2 files \u2014 scripts/python_backend_sample_smoke.py, scripts/python_release_load_precheck.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python_backend_sample_smoke.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c5146593ee8e6e460070601a2b6c56b20a1d332f7bc2f454b2f825f50ba577"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grant is None or grant.user_id != user_id\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/automation/application/grants.py, apps/api-python/app/modules/automation/application/operation_management.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":"apps/api-python/app/modules/automation/application/grants.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed81a904f59600655a1c1dc24e6e7660b3d33ec11200d3ff387668bd3fb0fd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060incomplete.exists() or incomplete.is_symlink()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/updates/infrastructure/preparation_worker.py, scripts/container_image.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":"apps/api-python/app/modules/updates/infrastructure/preparation_worker.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f2c0e3c93b2fa97306ab7fb86ad4e0d3fe0de462cdeacab49c89b8852a3737"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_database_busy_error(exc) or is_database_operation_timeout(exc)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/auth/presentation/http.py, apps/api-python/app/services/metadata_lookup_queue.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":"apps/api-python/app/modules/auth/presentation/http.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7808e1f7787cae636d8ee534042fefda5ccbbc189c6e1357af5a3c69eedcbf02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(error, OSError) and error.errno == errno.ENOSPC\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/bootstrap/update_install.py, apps/api-python/app/modules/updates/infrastructure/preparation_worker.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":"apps/api-python/app/bootstrap/update_install.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2a15a46950ce79edb81172462d633b0605c5c1b854bdb7fd9e89f9d24f7161"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0022id\u0022)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py, apps/api-python/app/services/metadata_lookup_queue.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":"apps/api-python/app/modules/metadata/infrastructure/source_node_recognition.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de83b67b2d9a88c6506acc40a3323dcadf71602ffe334c03d903a910e19f684"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(path, str) and isinstance(recursive, bool)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py, apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"94986117eb700d3ad84a018b87a940250cae6cc0d15f1ae4aab7bff268c13599"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(resource_id, str) and resource_id\u0060 appears character-identically in 2 files \u2014 scripts/python_backend_sample_smoke.py, scripts/python_reader_position_acceptance_smoke.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/python_backend_sample_smoke.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"430adecf63076355cf36a9e87ed7edd9646f3c9f026ab44a4589836340bfa626"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, (int, float))\u0060 appears character-identically in 3 files \u2014 apps/api-python/app/core/time.py, apps/api-python/app/modules/automation/application/writeback_plans.py, apps/api-python/app/modules/library/application/recognized_metadata.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":"apps/api-python/app/core/time.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2e5602abc0fdf805adfa4fe7743a7383925d5746e9a695dc12faf39cc3b2ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and value.strip()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/services/download_executor.py, apps/api-python/app/services/organize_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":"apps/api-python/app/services/download_executor.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba4c4ccba7bfe4b5743e8a94c8ee6c58c1246ed7fcbdaf15890523e4c3c7c4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060later.state != \u0022SUCCEEDED\u0022 or later.libraryId != row.libraryId or later.finishedAt is None or later.finishedAt \u003C= row.finishedAt\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py, apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e623794b2abe58d6997b20e9517ec0fb87f7a1ec420426fec515beb20be2eb40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(content) \u003E MAX_OPF_BYTES or b\u0022\u003C!DOCTYPE\u0022 in content.upper() or b\u0022\u003C!ENTITY\u0022 in content.upper()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py, apps/api-python/app/modules/metadata/infrastructure/selective_opf.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":"apps/api-python/app/modules/metadata/infrastructure/selective_comicinfo.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"146869163b591b7c88bd833739e975f4a1d533a17060697f93e271351b861ec3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(content) \u003E XMP_BYTES_LIMIT or b\u0022\u003C!DOCTYPE\u0022 in content.upper() or b\u0022\u003C!ENTITY\u0022 in content.upper()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/infrastructure/pdf_embedded_metadata.py, apps/api-python/app/modules/metadata/infrastructure/pdf_writeback.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":"apps/api-python/app/infrastructure/pdf_embedded_metadata.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ead936a77b4917790df096aa2c80370722406e03fa8da18a85ad6fd8859af5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.get(\u0022zipEntryName\u0022) or unit.href\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/infrastructure/opds_runtime.py, apps/api-python/app/modules/media/presentation/http.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":"apps/api-python/app/infrastructure/opds_runtime.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48f480de93e3f52102ef5f5c22704788fff6eff2909665577a56d0ba3894592"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.get(f\u0022{{{OPF_NAMESPACE}}}role\u0022) or node.get(\u0022role\u0022) or refinements.get(str(node.get(\u0022id\u0022)), \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/metadata/application/opf.py, apps/api-python/app/modules/metadata/infrastructure/selective_opf.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":"apps/api-python/app/modules/metadata/application/opf.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"686fe3ebc5231e94209629be8f74858c52edf90c2947af5345e5ebf0eca841d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.id != root.id and node.physical_kind != \u0022DIRECTORY\u0022\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.py, apps/api-python/app/modules/library/infrastructure/source_node_commands.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":"apps/api-python/app/modules/library/infrastructure/local_cover_regeneration.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f303b79a33aa12b7469af21a9b557e3fd721c48060830215c6afe23486b685"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.id == root.id or not root_relative or node.relative_path.startswith(f\u0022{root_relative}/\u0022)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/library/infrastructure/source_node_commands.py, apps/api-python/app/modules/media/infrastructure/resource_repository.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":"apps/api-python/app/modules/library/infrastructure/source_node_commands.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"305a4e45831d27cfa587ba0c9dac92942db59dfd85217a252405780d5bd90bff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not is_database_busy_error(error) or attempt == len( DATABASE_BUSY_RETRY_DELAYS_SECONDS )\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/services/metadata_lookup_queue.py, apps/api-python/app/services/organize_scheduler.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":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83af6e4a3cf041f058a4c19076768641ea368432119ecb51e631b4d62e12ec0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(v, int) or isinstance(v, bool) or v \u003C 0\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/backup/infrastructure/archive.py, apps/api-python/app/modules/backup/infrastructure/inspection.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":"apps/api-python/app/modules/backup/infrastructure/archive.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7830148ffff032bba97b19670d71a45bc9fc059ca097b89acd4fcb0556571957"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, int) or isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/reader/infrastructure/exact_location_codec.py, packages/reader-contracts/verify-reader-safety-conformance.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":"apps/api-python/app/modules/reader/infrastructure/exact_location_codec.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"baacd7dceb649ca3d8a8b1c21f7cee9508fa68776c83d1b1d2789179bb0f17d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not marker.exists() and not marker.is_symlink()\u0060 appears character-identically in 2 files \u2014 scripts/container-entry.py, scripts/container_image.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-entry.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"09990d3462409f8141117975f835835a83d51a73f37796ec9d06212969cbdd82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not name or not normalized or normalized in seen\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/library/domain/facets.py, apps/api-python/app/modules/library/infrastructure/facets.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":"apps/api-python/app/modules/library/domain/facets.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf6977ce0c0cf212ad26e4559c6d01abce0fc70aa496075c07b879c230332b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not path.exists() or path.read_text(encoding=\u0022utf-8\u0022) != expected\u0060 appears character-identically in 2 files \u2014 packages/reader-contracts/check-reader-safety-boundaries.py, packages/reader-contracts/generate-reader-safety-policy.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":"packages/reader-contracts/check-reader-safety-boundaries.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"518d3b8acebd1096589acad990854aa4fb86b6d9d3715f23aa42c8f421e63627"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not resource_id or Path(resource_id).name != resource_id\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/imports/infrastructure/local_cover_publication.py, apps/api-python/app/modules/library/infrastructure/resource_cover.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":"apps/api-python/app/modules/imports/infrastructure/local_cover_publication.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0993bb6744ef2007bce0f834115aa3a1cd3d3c7db54ce827e70218524ed27d9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefix.startswith(b\u0022RIFF\u0022) and prefix[8:12] == b\u0022WEBP\u0022\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py, apps/api-python/app/modules/imports/infrastructure/sidecar_opf.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":"apps/api-python/app/modules/imports/infrastructure/readable_resource/adapter_registry.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"762bfc7d683ea583f845a468e70f5505bf21ca8fe466ce5840671182d17a0468"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous_stored_path and previous_stored_path != published.prepared.stored_path\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/library/infrastructure/resource_cover.py, apps/api-python/app/modules/library/infrastructure/source_node_cover.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":"apps/api-python/app/modules/library/infrastructure/resource_cover.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cc55f978a0810524f467324ebff97073a661bbe55dc70844e2b234fb3bab06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060published.backup_path is not None and published.backup_path.exists()\u0060 appears character-identically in 3 files \u2014 apps/api-python/app/modules/library/infrastructure/recognized_metadata.py, apps/api-python/app/modules/library/infrastructure/resource_cover.py, apps/api-python/app/modules/library/infrastructure/source_node_cover.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":"apps/api-python/app/modules/library/infrastructure/recognized_metadata.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6293bdc303a57fb64b77837558e1ed5a3912e84046c2d069e9a2d4ebc0474b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.exists() or request.is_symlink()\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/updates/infrastructure/preparation_worker.py, scripts/container_install.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":"apps/api-python/app/modules/updates/infrastructure/preparation_worker.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e584b6837a1114d0630c13f71386e67df76fcc41c4f6e1b38d2352930ab3fd2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolved != candidate or not resolved.is_file()\u0060 appears character-identically in 3 files \u2014 apps/api-python/app/modules/library/infrastructure/source_paths.py, apps/api-python/app/modules/media/infrastructure/http_streaming.py, apps/api-python/app/modules/media/infrastructure/resource_preview.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":"apps/api-python/app/modules/library/infrastructure/source_paths.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c776f1d2fc408e4b3469d744031cf1545b838e3a28675bb00851fb77e0e8d86a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolved == root or root in resolved.parents\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/media/infrastructure/http_streaming.py, apps/api-python/app/services/download_queue.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":"apps/api-python/app/modules/media/infrastructure/http_streaming.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eafb808e42415b4ea97191d36e895cbe0dc80c6e68cc087327d47af173dc27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root == real_target or is_inside_path(root, real_target)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/download/presentation/http.py, apps/api-python/app/modules/imports/presentation/path_helpers.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":"apps/api-python/app/modules/download/presentation/http.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1befadc5693786a6dc862114336a34350aed0d3901983e35ba3770a827ce548d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060split.scheme or split.netloc or split.query or split.fragment or not decoded or decoded.startswith(\u0022/\u0022) or \u0022\\\\\u0022 in decoded or \u0022..\u0022 in decode\u2026\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py, apps/api-python/app/modules/publications/infrastructure/txt_adapter.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":"apps/api-python/app/modules/publications/infrastructure/fb2_adapter.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5881207478f20cff789c0cca495db2939ef3486ec0ebe8a37f35b9ab0ac95c8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060str(error).strip() or error.__class__.__name__\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/core/safe_errors.py, apps/api-python/app/modules/system/domain/queue.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":"apps/api-python/app/core/safe_errors.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7652d9f63383c1c6a7f871409328ca86463b7392d23b93bd86fcccb5c7220e63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060to_timestamp_ms(event.get(\u0022createdAt\u0022)) or 0\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/modules/system/infrastructure/events.py, apps/api-python/app/modules/system/infrastructure/log_files.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":"apps/api-python/app/modules/system/infrastructure/events.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97bbc9198b0b206889d5a7e0a5dfb10647a03c54101a8545227457545250817"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wait_path == done_path and not wait_recursive\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py, apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5a7cc4982f1a92550dae666a40f9ff07139f416e4e1052838227501b04db6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wait_path == done_path or wait_path.startswith(done_path \u002B \u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py, apps/api-python/app/db/alembic/versions/0020_recheck_scan_gaps.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":"apps/api-python/app/db/alembic/versions/0019_backfill_scan_gaps.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"de60365ec8866be6c7b9eaea7f9779294a7570725cf1304c12fcbac96580d017"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060phase == .reading || phase == .background || phase == .closing\u0060 appears character-identically in 2 files \u2014 apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift, apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6aa15c760d340ad2d04b4c06702a7417caf79b98c2598cad4b36993093d024"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060progressCoordination == nil || progressCoordination?.allowsConfirmedLocalRestore == true\u0060 appears character-identically in 3 files \u2014 apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift, apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift, apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderSession.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderSession.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0565e99b3daec8428ef5f6cab173e29d5df9c731feae376c1704c72788f4ceef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.phase == .reading || session.phase == .background\u0060 appears character-identically in 3 files \u2014 apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift, apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderView.swift, apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosPdfReaderView.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosComicReaderView.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fb66f3d887b1e02aca748f2eb7d21013c806cfa8fb4a66b6d7f8e567158cba"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseReaderV5Presentation\u0060 is exported, takes a document from its caller (line 197) and hands it to \u0060isJsonValue\u0060, which calls itself at line 111 (\u0060isJsonValue\u0060) with a piece of \u0060value\u0060 (and at line 112) \u2014 and nowhere in \u0060isJsonValue\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. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060isJsonValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/lib/reader/v5-wire.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad88ceb70de6fe85b06c7b8edff1f8996904acf36e38f853e459bd9e2dc419cd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseShelfView\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 124 (\u0060parseShelfView\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060parseShelfView\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. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060parseShelfView\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/api/schemas.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1994693f2d4ef078a27d5cff3cef250190c4bbff4adfa7b74fdb5f13b12eea5b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parse\u0060 is not private, takes a value from its caller (line 42) and hands it on to \u0060normalizeMap\u0060, which calls itself at line 406 with a piece of \u0060raw\u0060 \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound, nor is the parser that builds the document given a nesting limit in this file. The walk therefore spends one stack frame (more through a lambda or a stream) 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; javac turns no recursive call into a loop. On the JVM\u0027s default 1 MB thread stack a recursive walk throws \u0060StackOverflowError\u0060 from about 500\u20132,000 levels on a cold first call and 6,000\u201317,000 once warmed up (OpenJDK 21 and 25). org.json, the W3C DOM, dom4j and StAX set no nesting limit of their own, Jackson before 2.15 none and 2.15\u002B 1,000 \u2014 on a cold JVM past the point the walk fails \u2014 and a \u0060Map\u003CString, Object\u003E\u0060 tree is as deep as whatever built it. \u0060StackOverflowError\u0060 is an \u0060Error\u0060, not an \u0060Exception\u0060: a \u0060catch (Exception e)\u0060 around the call does not stop it, and the request or the thread dies with it. Thread a depth argument through \u0060normalizeMap\u0060 and reject the value past a fixed maximum, configure the parser\u0027s nesting limit (\u0060StreamReadConstraints.maxNestingDepth\u0060, SnakeYAML\u0027s \u0060setNestingDepthLimit\u0060), or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/buildSrc/src/main/java/com/ermao/buildlogic/VisualTokenGenerator.java"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3179bdf401c3d77e7932a645d504c82042719fc7084d846f34648039054b38"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060process_metadata_lookup_task\u0060 is public, takes a document from its caller (line 709) and hands it to \u0060_parse_tags\u0060, which calls itself at line 196 (\u0060_parse_tags\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060_parse_tags\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_parse_tags\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/metadata_lookup_queue.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"97641f4ddaef6c57378973a5f13ce66c80356869d6594ff08a013185602e6432"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060metadata_candidate_title_values\u0060 is public, takes a document from its caller (line 139) and hands it to \u0060_metadata_title_strings\u0060, which calls itself at line 129 (\u0060_metadata_title_strings\u0060) with a piece of \u0060value\u0060 (and at line 134) \u2014 and nowhere in \u0060_metadata_title_strings\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_metadata_title_strings\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9315a99e3ccf540abc9fddb68efdf476da14f0a537dde72c225bac8fc6968a67"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060ok\u0060 is public, takes a document from its caller (line 24) and hands it to \u0060_normalize_timestamps\u0060, which calls itself at line 14 (\u0060_normalize_timestamps\u0060) with a piece of \u0060value\u0060 (and at line 18) \u2014 and nowhere in \u0060_normalize_timestamps\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_normalize_timestamps\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/schemas/responses.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec500d55913f5b60a5defd5b28c0e8afde9d841c64a7d657fc0221781e040a4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060xml_chapter_events\u0060 is public and takes \u0060root: ElementTree.Element\u0060 from its caller, and it calls itself at line 90 (\u0060xml_chapter_events\u0060) with a piece of \u0060root\u0060 \u2014 and nowhere in \u0060xml_chapter_events\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 \u0060xml_chapter_events\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/modules/publications/infrastructure/chapter_core.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"681d5e5355ee2e1849ec27d1291cec1c8ffdaad0a3a7f8377d593841b68a120f"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept an AbortSignal or the coroutine\u0027s cancellation: Only 53/68 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; Ktor, OkHttp newCall, URL streams) accept an AbortSignal or the coroutine\u0027s cancellation or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a \u0060signal\u0060 () and hand it to the request; in a Kotlin suspend function, make the request with a call that suspends \u2014 Ktor, OkHttp\u0027s \u0060executeAsync()\u0060, or a \u0060suspendCancellableCoroutine\u0060 that cancels the \u0060Call\u0060 \u2014 not a blocking \u0060execute()\u0060: \u0060withContext(Dispatchers.IO)\u0060 moves the call off the caller\u0027s thread but does not make it cancellable; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"21eeee9e423271c6ca8c1585dbd13becefdff0bcb29bcd0381c3b54ed97e04fd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: writeShelf: \u0060writeShelf\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/api/client.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e20d7069a9a4a66f63714141afea9ef5dec6356fe5b0b50b76cee07f104d04"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: deleteShelfById: \u0060deleteShelfById\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/shelves/api/client.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d46227c1ec63e11e21e8fb116049f87668ebfba48b0869a0c0f415c5e8a2a81"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: runBackupAction: \u0060runBackupAction\u0060 holds an AbortSignal but calls \u0060loadBackups(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060loadBackups(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/settings-page.tsx"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff8ba0c0c190ea47d3ce5f27324571e23551dd372a2ff5740f6c42b0ffa14ea"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadImportPreferenceSettings: \u0060loadImportPreferenceSettings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/settings/api/import-preferences-client.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba06214d8dea3ce7d081f46ddf403736a218398730ee22d7f007e401d18807a1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveReaderBookmarks: \u0060saveReaderBookmarks\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/api.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a3727866274a5252154bf80d4580e951b44078fc61e71b5ca94f1adca2c302"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadRuntime: \u0060loadRuntime\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/reader/v3/original-publication/mobi-core.worker.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"644c3fb7bed3bb943f411e856fe9a7d651f8db0c960a6eee9962dc5d51d58a03"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: saveOrder: \u0060saveOrder\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"93959cce103040b7684d0182e978185c55a8af12cba0683fae435b6ec82bead6"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: updateProvider: \u0060updateProvider\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/organize/metadata-providers-panel.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"839b1da31dc2e99e4686660eedaf656c0e59b04fc188304c12d29219d2f90708"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchManagementEvents: \u0060fetchManagementEvents\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/api/events.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb420969839d098ced837be861287150dbab9098d6408b08db764f5f7cc18fff"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchManagementEventDetail: \u0060fetchManagementEventDetail\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/api/events.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd5bcc666f9509629970dd4aadab428aed94eaf572ef2a036cc11fa4e61768f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadManagementLogFiles: \u0060downloadManagementLogFiles\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/management/api/events.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39500f2ab650620abaf96a225f4dd3fc15c630cb43ae107533379ff95a6a8f5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: postJson: \u0060postJson\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/bulk-operations.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d080b7067272c11868f5f1b3084a5e6d0956b43b01953747688c7ee4fe0df0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: updateBulkBookCovers: \u0060updateBulkBookCovers\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/bulk-operations.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceff466f581693bcce765cda70d8e5a2244e9abc4699d8df57e159897ec65644"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: postUploadedFiles: \u0060postUploadedFiles\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/features/library/api/save-uploaded-files.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9a61537f909fff662e64760aa510b2a97d0bad6bd4ac565409b71d5fed7730"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadInitialState: \u0060loadInitialState\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web/components/directory/target-directory-picker.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda2df2be3fc176178f37f82a3b7a17a8b73e3a4c216e5d1e3c5b467cb3eabeb"}},{"ruleId":"X24","level":"warning","message":{"text":"Document value reaches a markup attribute unescaped: \u0060value\u0060 carries text this program read out of a document \u2014 an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again \u2014 and it is written straight into the text of an element of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another \u2014 a crafted document becomes markup in what this code renders. Escape \u0060value\u0060 at this site, or validate it against the shape the position accepts before interpolating it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/infrastructure/comic_archives.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"138b28b467f5667002940fc1b4ca879b0b360df3693ff4e15fd2109364f5b83b"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060basePathFetchBridge\u0060 is text this program did not author, and it is written into the text of an element through \u0060dangerouslySetInnerHTML\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":"apps/web/app/layout.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"11faba12c62a09568d44bee4fc008e80b8745c2c7bb007601a699c2eea346fa4"}},{"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":"apps/web/lib/audio-device-preferences.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e767c1abbf9b545b1d7c0bce3394833d4e742aa74f3667c7d807fa145b3b6c"}},{"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":"apps/web/lib/auth-session.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1667155c57d29865cb976454c35b85566ecafddce2cd9c7f329bd208b74fbc"}},{"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":"apps/web/lib/server-exceptions.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff3ea7d2e371bc622f92dc45103ba89ed60bf57d66b6cec4a6ebab020bea894"}},{"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":"apps/web/lib/server-exceptions.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9fc2593f4b742888e36ffb6a9bceeb167861829ad79ffb65940e6cec490f34"}},{"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":"apps/web/lib/reader/v5-storage.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6946352a436f5a918c354ea3ebc46d614ab98c5497912b375d51063de38399f9"}},{"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":"apps/web/i18n/provider.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb1b2f69eb45f9d9156efb9a46bf37e08a2b2158ed1e1e11f2fbc6b8a9935bd"}},{"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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c60cb6083fa1ba11c1ff5d44738c6d42d6d35b562ad5a5ef2da296fffa54fb5"}},{"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":"apps/web/features/reader/v3/reader-engine-runtime.tsx"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"739248a0e9329499753a1d092aaa5402c823497af1b28d3b09cf20287a315b39"}},{"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":"apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f349345da7aae40f843cde34e13f601eb314e5d08e8ee42e76ebad53e8a6107"}},{"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":"apps/web/features/reader/v3/original-publication/indexeddb-publication-storage.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0814928ce741b03dc30a462a7fd0da18992dae33226214c56f6d4aed446b582e"}},{"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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee2bccf14351100e19dad48d76a409b5e1d610fcea9ac23f60097c3654af91a"}},{"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":"apps/web/features/reader/v3/adapters/comic-adapter.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5d989ed7ff58d6eebb25e6f6b8b25f36bf4fdb875b8d17fa367eba3cffcba3"}},{"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":"apps/web/features/reader/v3/adapters/pdf-adapter.ts"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8f9d4dc3a1f8b87609aaa3620928d2178747233b456871280172bdafb2977c"}},{"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":"apps/web/features/management/management-logs-page.tsx"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55daba1adc08d6675026f85293f6dea0c5f209f8b8b5c3327776b31b5ee1de4"}},{"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":"apps/web/features/library/library-page.tsx"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eb387fd0b7a255bec2ec243f0b631b9d14a0a81f2ca1fa59a9cade6bddff09"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eefe1aa4324027ff6703a97d10e172e46e78955a63eb23f11f8d6a077a0049"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e683fe458b691c6b40b235b64e07c88e3a65f0afd025e85e8fd4b92be424cb5"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd17a4ac735b41ea0b1961de0c85be39587e81db0fdc194cca1edfac3b9f49b"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc56a8eb5342f2dd8f585336a1fb5ebc51cf3fa51dad906c57942f8677a0689e"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2a017c7d34a69e8cbc27f9cc23e57f3b9147162d0b9dca8ed7f981c7784591"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"600c04bed289795508a22e61eee5dae7eb8adecd20113a8bd8b713abcda71d51"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a977f6eabddef1f2e874313562a516aa4a4fdc8e756252cd5dec83628d6e944"}},{"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":"apps/web/features/audio/audio-playback-provider.tsx"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b584a7ba6187987b5109571d7939991269aa0db1e92aae29520355a451249e"}},{"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":"apps/web/components/system/pwa-client.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec2661597d7694347fd915f6e8091622c2d966ebb8fa46e645dcc5400ae4751"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed9e49098730c19246e539f57e279cfac7fcc0026a6651d5c95e298f2d25c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/MultiDownloadSheet.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc2a02b5a3561a1b5670a4936f5a3fbbd33bb5e68a8e187fcf91e8fc0d64b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2b80d9ab533e6255621cc6abd0bd6eff15738d318b4bf0bc4a27829a177567"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"402a00b2d5f4737c3e7c468a7563cb2229a55f2afdff6e76fd801eec6708cc2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/NativeBookManagement.swift"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dda8f00530160c21c8949f20c420f7ca168b56a1fe020cfed79329aeaaa1ae6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd598c7c687eeb52e2ab25c78fe7855b5147727a2c9abf02bec11046425f6d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"b535899f8f60cb3c4904aeef854828951cf5ca12493ea5526c348b5a1edc4aab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Work/WorkDetailView.swift"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cae829d75114d05e49e715878e2df248d81233eec231733fcc4006a162a11f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbb1c1b1503be0d1cb660c82b148219b92976538be6796251d2e3d37187330d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ca8f38e105fd72203e4aae48946e5293ff969845f0c71904406fdcadfd1e28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4626a23e3481cb5329cd69c2a88b84e447fc407f7b2763ccb2d6bcd2706f60"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"89090fe3617da8f527fbac231917ff5fc353ff768508b108956014f7deec2994"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"13466ac983c8e02a520b049c2a4b64cfdebdeb0a8fac845af0ddfee2d91e539d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85a5f3b0db98b344294579cc593584a4c7d3c377d048e14d1e314f3c0ae1ab8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosEpubReaderSession.swift"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4717336ff397dedaad2ba31822a88827463a48a3eae00cded1024638773682"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderControlSession.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38ce75d02af3819d7a0a1d49a4cbf5a0d3044d98c1aaf43e6e4d8b4efc13a09"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Reader/IosReaderProgressStore.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf705a4f69557a0cfa6323bdae48fffc592d27a3a414012bbc96640999f384a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsViewModel.swift"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"85361cfb8fe9beddc68f4b28c9f6f64d168dcc2d34b0d657fb44a82917c039a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Me/SettingsViewModel.swift"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a114ed7fa634b9903a41abb49fbd2855309bf81d685d0c92220f9cffa4b534"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dacb36c5f15d5f5191bf09d29abf14f8328d530b1f6169970f2ef132d8fbc4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7c71e02b0c944217b394b5c9786da41cd5d3ba496fbcd8b6048e003c87b069"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e270d3b59760547a9bd941fbfc569f52bd6317ff4a07ba698701fc6af9f30cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Downloads/DownloadCenterStore.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"44da19a995749fb931c635cfd2994beaca652747c4860aeba14168cf50dd692c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioComposition.swift"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f0eacec35c4b0e0245679d32634357dc8da25d65699aa17e7e9456c0c5215"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioComposition.swift"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe3a16ee8b5b6e7e2b0eb088b826f37d1f166a7d667188e3b5ba0a612275ba9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioEngine.swift"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16924a64cc657f05564d24a918d233787c53e7e7c952fcf23e7a9c9262a8ccd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioEngine.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad0ce8b387aa5d1b9b7a4e200962aac7d3d9a41e2078980fdb6d9236cc0c20b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd966a3fa0071fd2041220eb783b7e6dff2ba62e41fc9cac3854d76bd5c31922"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"777dd9b88f6a309cdbd4c261e41b7827add8bc0c16e7b5e2fd9ce90ed7033df8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbfd998497a4291fae3f220ef4fd6491725a32696ee75b273ca742e8e4d7956"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bc721ffb8b75b2dcfd8d06923077f6988b0b2e56be76f4cde14508d8216f29"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/Audio/IosAudioPlaybackRuntime.swift"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1578d5874f03de6c98102cbcc500715a1296ce55b21356429b7975338ce11614"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Features/AdministrativeSettings/LibrarySettingsViews.swift"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab6513c9282fea77b2353904b46f46ee871b1a394f05eb91b983ccea9e09231"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"019bac223b1aa20f465a6de00ba51a5fda65616b423a9ab638c50b16caab8888"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Design/ContentComponents.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f30b71a8d7d8bec1cf5ca0eda7c9338a5401ab0a6eb1ea7bc4de94e250d3d69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Design/OperationFeedback.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad58768f991c94b4491e9f15b950f2b49d68843aebecdea896a23e02a486785"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa5d935b38e894ef4bb5bdb2cc0320b621ad9b027fe0a10131a154dfb63d621"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc79796ceb9d68dc49bb299e636c4fa12954555cfc9edd38d0df103a418e53c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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":"apps/mobile/iosApp/ErmaoLibrary/Application/ContentStores.swift"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"2596b1867714e9d8a3828863a3fc755de270353efe34dcee953204a3a944328c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderActivity.kt"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"730f3dba5b1c80a9e03abd15c0defb0b83fcca6739958a36925d9416a43366cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/presentation/ReaderScreen.kt"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd46d260c1de7edea0a1ee7f45f952f3393544e120bcfd8dadca48fa877934be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc795835f851315354e486f7ab7a4f7d28e0a48e05a41cb6b9cee3944f3220c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumComicSession.kt"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6a11011222cd81c1c370d850fef18043e103dc44ded27b9184c3b8256de70e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumEpubSession.kt"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"a903d9b6ee30be865c3e4a88eb8ac507840aad25e3cfc09abf18e6c9cbd35dfb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"022787a0e87206344fdb680c8db6b7729f0ac4a8d9c8ad9b1d9ff8e2962854ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ReadiumPdfSession.kt"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"578dcb0fb8a1183b3264055db4d82d9f62f59db959b0ac36cafd38c246583e76"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/ShukuPdfiumDocument.kt"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0957e20392db47f3d9cd04952d51e86f6ea8bcef5ddaa1a7c36f264012a6bd7d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fab93cd6c4c39e55bab01e0dc53d798d1ff7ac6f693bafcc42ab749600549d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3f7be7e626b4016177a6f45a4bb07b6c0891e82b25ba4f6ba32b3cb5ca3b80"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/audio/application/AndroidAudioPlaybackRuntime.kt"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c533e5a5b9295f0340a0527e4a0dc07c7564658db4953b04f37f327385f42b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: 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":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/bootstrap/MainViewModel.kt"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b13d8b3bbaf35c79d0e3f9286f46685c5c8d42636f8b4515b402312cfdb428b"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb6736d5c682183f19cfcc2f49c944cc192f77dfdc70cd1245cc5600b85071d"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31b76bd24e372bf09080eeac6edf7d01ebda3b4518287d61a8948b445d7a0f0"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b41ddbb57dcfe8f9751af489b0e774bcb9b9189ea88e1060df35201fae2d80"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/app/services/organize_service.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bb2519c46260bbeae4c9e980793c8799504186a0d345dd33b43dcf1b11d0f0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060commitBookmarkMutation\u0060 swallows every exception into \u00600.0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/mobile/androidApp/src/main/kotlin/com/ermao/library/features/reader/infrastructure/AndroidReaderBookmarkCoordinator.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"464b009b8fd047761af8441a39d7a74802dfb6c4641e6c00bf60bcd3c99a3f3e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_response_shape_ok\u0060 returns \u0060False\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/api-python/docs/openapi-audit/runtime_probe.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f681580ef046ddfc07b65113d27f9177df678a5b5488bcba72900b6beecf2f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readAudioDevicePreferences\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":"apps/web/lib/audio-device-preferences.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca29159ee8aa65740e1e6efa99f09d021c3bef6449ff4018d1de2fd1f0a68044"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060bookDetailReturnHref\u0060 swallows every exception into \u0060return \u0027/library\u0027\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":"apps/web/features/books/book-detail.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3072956c52af280998ba45eedf2ee5bb992e235d9dcf29421e9890a298da625"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readReaderBookmarks\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":"apps/web/features/reader/v3/bookmarks.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cf352dff2382108dee7fa6e36fe34ca23a8647045740e013373f4ced1bd2a3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060normalizedPath\u0060 swallows every exception into \u0060return \u0027\u0027\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":"apps/web/features/reader/v3/adapters/readium-resource-identity.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75a2102667a9faddbe81eaf60703555dff90c13fefb289c3a2e3851a1d52053"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-1188","guid":"90b5d93c-2e8f-7d58-b831-915e7ee4a150","name":"CWE-1188","shortDescription":{"text":"CWE-1188"},"helpUri":"https://cwe.mitre.org/data/definitions/1188.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-676","guid":"550e6fab-2881-3252-8a05-c688a6b19c14","name":"Use of Potentially Dangerous Function","shortDescription":{"text":"Use of Potentially Dangerous Function"},"helpUri":"https://cwe.mitre.org/data/definitions/676.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":227,"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."]}]}