{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"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":"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":"Styles.css_lines (cyclomatic 89): Styles.css_lines has cyclomatic complexity 89 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/styles.py"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd404b895b45e4e4b64cbe0bb37a86c0889f441aae6fa14829cd792269da9524"}},{"ruleId":"D1","level":"warning","message":{"text":"TextArea._render_line (cyclomatic 52): TextArea._render_line has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c444c03c311bcf4036590c82fbffafa77269412846fe9eb1bb5a3febe28be455"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesCache.render_line (cyclomatic 45): StylesCache.render_line has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_styles_cache.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe3d4df0bd0229e84750a47b6314808492a624dea3b16bc7353baca0238c1c4"}},{"ruleId":"D1","level":"warning","message":{"text":"GridLayout.arrange (cyclomatic 41): GridLayout.arrange has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/grid.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b04e447ed286da9a0949ddfa1a707f32787dba69738026adec4ef72204d3458"}},{"ruleId":"D1","level":"warning","message":{"text":"XTermParser.parse (cyclomatic 33): XTermParser.parse has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_xterm_parser.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4972a120a0627311ebae797cd9d073b031526fb7da007e0b4bff69cd41d47bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"Widget._get_box_model (cyclomatic 31): Widget._get_box_model has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa5207b7499bd34d8fbe31040ecb54703d320f20659432bb486e9c8206361b"}},{"ruleId":"D1","level":"warning","message":{"text":"markup.parse_style (cyclomatic 29): markup.parse_style has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/markup.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b474e229413d82e36cfde4a2a0c9b698b463626acee705c1f8840116fd06ff91"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen._forward_event (cyclomatic 29): Screen._forward_event has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"a473bbdac6ad092b77304935881862fd0f2162ce26341ca73db44a714cdbb12c"}},{"ruleId":"D1","level":"warning","message":{"text":"App.on_event (cyclomatic 27): App.on_event has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"0634eaee71c91987c61b9f1eda220f19bfbe208659dabb71371e5ec5aa2eec11"}},{"ruleId":"D1","level":"warning","message":{"text":"markup._to_content (cyclomatic 27): markup._to_content has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/markup.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1304ef5a45882c708593a656ade9a4c34b8e013c10fd9d795d3468fc0c3c31d"}},{"ruleId":"D1","level":"warning","message":{"text":"Style.style_definition (cyclomatic 25): Style.style_definition has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/style.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d420bc44239bd36f5dcfada1abb8159786d84581f2afbf6a7414b0f20155b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Markdown._parse_markdown (cyclomatic 25): Markdown._parse_markdown has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_markdown.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"704b13bcc09ab9768d7135f0f1fb081fa117b6fb048d532175451f1b9f3dd87f"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorSystem._generate (cyclomatic 24): ColorSystem._generate has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/design.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34ee95295f355fad773f4872a3200b699328244c098edc91a6d5fc7d2b87120"}},{"ruleId":"D1","level":"warning","message":{"text":"parse.parse_rule_set (cyclomatic 23): parse.parse_rule_set has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/parse.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eca790dde81e18ae5a68abd5606928be5a323f1ae7ffb2d1de4c41021cfc821"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectoryTree._reload (cyclomatic 23): DirectoryTree._reload has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_directory_tree.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e07b383dd048a555d99870c3b39cb503f4bfe75ca59a33a843956e7c1c3047"}},{"ruleId":"D1","level":"warning","message":{"text":"Stylesheet.apply (cyclomatic 22): Stylesheet.apply has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/stylesheet.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0795d3cb40f98f833c809fdb8adf9847958412750fd0588de3b8307e528e80cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Animator._animate (cyclomatic 21): Animator._animate has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_animator.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e763a882677fd79f6765fad3dd450320b1e0131784772f1853e2bd5cdf2b05"}},{"ruleId":"D1","level":"warning","message":{"text":"_import_app.import_app (cyclomatic 21): _import_app.import_app has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_import_app.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7957b5b98b1662e716026af65462f77c69d3a569e28e0305d1ec98ea0f836c09"}},{"ruleId":"D1","level":"warning","message":{"text":"Style.markup_tag (cyclomatic 21): Style.markup_tag has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/style.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffea0fbd999bd44ffe08a8bc4e65065af01c456a99607c471edf7d285d0fa75"}},{"ruleId":"D1","level":"warning","message":{"text":"Style.__add__ (cyclomatic 21): Style.__add__ has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/style.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca137c589bfa4ead2af1f467ba6d383cc1ff3f8bcbd4cd4b8c4d7f1e768b9ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Widget._refresh_scrollbars (cyclomatic 21): Widget._refresh_scrollbars 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":"src/textual/widget.py"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"117d6fa01fa22dbf39d6452e027c00ab56d0c3092680c69304fd0864d8b0f473"}},{"ruleId":"D1","level":"warning","message":{"text":"Widget.scroll_to_region (cyclomatic 21): Widget.scroll_to_region has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6bf4e723433fda8b2e2d0eaeb0bf416aeadd0fda22f83e4744bb8aecec5ac"}},{"ruleId":"D1","level":"warning","message":{"text":"XTermParser._parse_extended_key (cyclomatic 19): XTermParser._parse_extended_key has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_xterm_parser.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0501ea08d749e073677964efe204fc2ba885c8b713d404d963a001e8554866"}},{"ruleId":"D1","level":"warning","message":{"text":"App.__init__ (cyclomatic 19): App.__init__ has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fba0916cc7c8d23f35a4ac797ac28792d99858d91fd81ef78c2e5e203a9dc8a"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagePump._process_messages_loop (cyclomatic 19): MessagePump._process_messages_loop has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/message_pump.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7dfaf0d851baaf54b71acb21c71c7a1e3fc4a92060b4270d15d7a2f8e6a4b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Selection.get_span (cyclomatic 19): Selection.get_span has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/selection.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0202b47c65777fe055b1f3ea4344d8fb134e2fdf58f4572ce0ecf821088769"}},{"ruleId":"D1","level":"warning","message":{"text":"parse.substitute_references (cyclomatic 18): parse.substitute_references has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/parse.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cc0dc1b773140d6ea345982ec7d8d28e5ea751134ea13280b78787a885d956"}},{"ruleId":"D1","level":"warning","message":{"text":"TextOpacity.process_segments (cyclomatic 18): TextOpacity.process_segments has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/text_opacity.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec66a032597d6da10acc94dcad8efe6e89cdb39f47af0e286ea42ce2714a641"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen._refresh_layout (cyclomatic 18): Screen._refresh_layout has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f0ecb4af7776acd3e52d8eb71af3b17f425c0048ce98650fdbd92d6c017a8a"}},{"ruleId":"D1","level":"warning","message":{"text":"Widget._scroll_to (cyclomatic 18): Widget._scroll_to has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a9f78c5ce018b0ec8956cc603ea1ffbcefe215bfaedd520a94995deb70c0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree._render_line (cyclomatic 18): Tree._render_line has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tree.py"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff28a8af892aed3264f324fb5e06bc85f3283e80aca66536c6a1397f9713934e"}},{"ruleId":"D1","level":"warning","message":{"text":"Compositor.get_widget_and_offset_at (cyclomatic 17): Compositor.get_widget_and_offset_at has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"705810cd5e58e8176274460b6acfe66904381068c578794e52a7d03124e68aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"_wrap.compute_wrap_offsets (cyclomatic 17): _wrap.compute_wrap_offsets has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_wrap.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"721199820ac8fcbd72f05bb2e35649f3ccf1be0a946e1989602bfa8cb9d62664"}},{"ruleId":"D1","level":"warning","message":{"text":"Color.parse (cyclomatic 17): Color.parse has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/color.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"078d3b22be3a2b27ff9ac746da487e8c3b55cee04cb6b68a9df5e91a2be90548"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamLayout.arrange (cyclomatic 17): StreamLayout.arrange has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/stream.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b5154a12392b98a5572268487d49d9cbc7bc9d01206d4f32fd4812ea2333d6"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagePump._get_dispatch_methods (cyclomatic 17): MessagePump._get_dispatch_methods has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/message_pump.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"219adef6729ceeb9773e39cfe14cbcbb576ca00343f3f531e42e0a495b7cd11f"}},{"ruleId":"D1","level":"warning","message":{"text":"Strip.align (cyclomatic 17): Strip.align has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/strip.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6315fecbf3b298c65a7e1722322e1c447f9ce90538c401fc17c6b224a0f7a5"}},{"ruleId":"D1","level":"warning","message":{"text":"_resolve.resolve (cyclomatic 16): _resolve.resolve has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_resolve.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b91ed368fa5e727e6f915149e8af8972058d2c58cd0d7beafc724138843f5c8"}},{"ruleId":"D1","level":"warning","message":{"text":"_resolve.resolve_box_models (cyclomatic 16): _resolve.resolve_box_models has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_resolve.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"199e5e55c2d451e256d43d450cc04d05437852cacdbda62fe621315c12a59ed3"}},{"ruleId":"D1","level":"warning","message":{"text":"_segment_tools.align_lines (cyclomatic 16): _segment_tools.align_lines has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_segment_tools.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"72551462ef6edbafbd3fa744791c0d48cccb6879e9c78a0775051077bc6bd1d5"}},{"ruleId":"D1","level":"warning","message":{"text":"BindingsMap.apply_keymap (cyclomatic 16): BindingsMap.apply_keymap has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/binding.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aa8ab4394ee01fcd9ddd543d5a036e64fd5c66a27334990ae7282ac1c0a7e0"}},{"ruleId":"D1","level":"warning","message":{"text":"_FormattedLine.to_strip (cyclomatic 16): _FormattedLine.to_strip has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"2640849262ee3c58d72919f286592d7c64e0099d3aa51d7afba0402b7b7180ea"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesBuilder.process_hatch (cyclomatic 16): StylesBuilder.process_hatch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e88b4c628b284b6290661e48ad187f6aa3422bb40dc1501efbd735259c0768"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.get_token (cyclomatic 16): Tokenizer.get_token has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/tokenizer.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ffded2daaea29af86eed3090d13079e74da12c92b1c5535e6e59b7759445f"}},{"ruleId":"D1","level":"warning","message":{"text":"Bar.__rich_console__ (cyclomatic 16): Bar.__rich_console__ has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/bar.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"129c35cb9a64cc12bb2bbedbc5145a84bf7d6a822595a39bf752d84fab1fa35e"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownBlock._token_to_content (cyclomatic 16): MarkdownBlock._token_to_content has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_markdown.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"14388589759f0356cdf43ddfc8f58dc718f9fce03f6d8604dd5b935c055263bb"}},{"ruleId":"D1","level":"warning","message":{"text":"RichLog.write (cyclomatic 16): RichLog.write has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_rich_log.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b834e5fcaeb40aec10b6e499de0f29aa23850ffd048a84803c664fb3aca91952"}},{"ruleId":"D2","level":"warning","message":{"text":"Styles.css_lines (cognitive 88): Styles.css_lines has cognitive complexity 88 (threshold 15). Drivers by points: if/else 77 (81 pts), boolean chains 5, 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":"src/textual/css/styles.py"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"63179306cde29c48cb5c9c76ddee7a3f2c4ced07e9345955ddc94b7e8bbf5b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"XTermParser.parse (cognitive 82): XTermParser.parse has cognitive complexity 82 (threshold 15). Drivers by points: if/else 19 (60 pts), loops 4 (11 pts), error handling 3 (8 pts), boolean chains 3 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_xterm_parser.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca8ae4e6a00633f353e66d6790dab57115324647c8a4d195e0723d0b116bc84"}},{"ruleId":"D2","level":"warning","message":{"text":"TextArea._render_line (cognitive 82): TextArea._render_line has cognitive complexity 82 (threshold 15). Drivers by points: if/else 29 (45 pts), ternaries 9 (19 pts), boolean chains 13, loops 2 (4 pts), error handling 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be03d71f0b00905d6b11f42d0e41e6906957d8354ea1d20e634bea7ca5ecfc"}},{"ruleId":"D2","level":"warning","message":{"text":"GridLayout.arrange (cognitive 79): GridLayout.arrange has cognitive complexity 79 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 11 (24 pts), boolean chains 10, error handling 2 (8 pts), ternaries 4 (6 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/grid.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0930c55430eeb7f165e03c6d16614b1d1ece5c48e24d2fec101479ebdba18287"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesCache.render_line (cognitive 69): StylesCache.render_line has cognitive complexity 69 (threshold 15). Drivers by points: if/else 21 (32 pts), ternaries 10 (22 pts), boolean chains 15 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_styles_cache.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc41e070f8f4e1fd4dd9ac0ad8aab4e88c0a98046fa33039982ad047374563b"}},{"ruleId":"D2","level":"warning","message":{"text":"markup._to_content (cognitive 66): markup._to_content has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 4 (11 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/markup.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe1b9b3e5698740ab813992c6a9c10bbd46f52c7f314ca5a9014878b310a624"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen._forward_event (cognitive 66): Screen._forward_event has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (48 pts), ternaries 2 (10 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd30163219dd9fe7c72838ace0088c60f13da856841246734e75eb0919158c3"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagePump._get_dispatch_methods (cognitive 61): MessagePump._get_dispatch_methods has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (45 pts), loops 4 (14 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/message_pump.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e277395b4c7e855e707a381be388bb08b38f902aca1cdc4e38979642de149a"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsMap.apply_keymap (cognitive 58): BindingsMap.apply_keymap has cognitive complexity 58 (threshold 15). Drivers by points: if/else 7 (35 pts), loops 6 (21 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/binding.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae12910982cebd4a296521abfb2ffbfa9546cff7ea6b268c21345e93c0ce019c"}},{"ruleId":"D2","level":"warning","message":{"text":"markup.parse_style (cognitive 57): markup.parse_style has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 2 (5 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/markup.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ceb724468a8f5d5749c09bc4a84eae0bdf097dc4eac38f85d18752f106f422"}},{"ruleId":"D2","level":"warning","message":{"text":"App.on_event (cognitive 56): App.on_event has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (35 pts), error handling 3 (12 pts), boolean chains 9 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"1315e144d148bea7692204d759eb2ab89f991bc6c097cf9fc756eb4d9f370332"}},{"ruleId":"D2","level":"warning","message":{"text":"Stylesheet.apply (cognitive 56): Stylesheet.apply has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 5 (10 pts), ternaries 2 (4 pts), boolean chains 2 (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":"src/textual/css/stylesheet.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cfb923e3eaeb97afd82982a45716d808d37690c00372a41d7be307e6977a27"}},{"ruleId":"D2","level":"warning","message":{"text":"_wrap.compute_wrap_offsets (cognitive 48): _wrap.compute_wrap_offsets has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_wrap.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e27b73718a1ff31bc62d187cfdd9caaa96799620cb6c16058b3477889ecfee1"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.substitute_references (cognitive 44): parse.substitute_references has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 5 (17 pts), boolean chains 1, ternaries 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/parse.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cf3e323df746987d4c71f2a764e170758e528a4b0af4ba25a02340a7b85df2"}},{"ruleId":"D2","level":"warning","message":{"text":"ChopsUpdate.__rich_console__ (cognitive 42): ChopsUpdate.__rich_console__ has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd266ec425da5f1d01a918c5306b274c73719c0554f344dcdcaaf2413186c49"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagePump._process_messages_loop (cognitive 40): MessagePump._process_messages_loop has cognitive complexity 40 (threshold 15). Drivers by points: error handling 8 (21 pts), if/else 3 (8 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/message_pump.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3e1cdd571183cabd8592db69b3e9e8815e4027609907e2ee80104c6fea968d"}},{"ruleId":"D2","level":"warning","message":{"text":"TextOpacity.process_segments (cognitive 39): TextOpacity.process_segments has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/text_opacity.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e084b36581a4ac743188b5aabdcb54858a27b456d33166fb6966484c794ebb03"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorSystem._generate (cognitive 38): ColorSystem._generate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 12, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/design.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea53e5651fe66d18be7857703410bfb085ef90bc17cea76901659996815672"}},{"ruleId":"D2","level":"warning","message":{"text":"Style.style_definition (cognitive 38): Style.style_definition has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 7 (14 pts), loops 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":"src/textual/style.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80b78a5047f163f3afa3796504dc6fc412f8d2cec119bd9689097ce91db949e"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen._refresh_layout (cognitive 36): Screen._refresh_layout has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (9 pts), boolean chains 1, error handling 1, 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":"src/textual/screen.py"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5484f7e96fb5dfabeaa50357e3f289745a99335f5c5d1e3605308d871036e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Widget._get_box_model (cognitive 36): Widget._get_box_model has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 13 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c3df196bd8b88b98c750be46f1ae12e9488f88a0b5828773746da824c06e57"}},{"ruleId":"D2","level":"warning","message":{"text":"_import_app.import_app (cognitive 35): _import_app.import_app has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 5 (12 pts), boolean chains 7 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_import_app.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3957135c15bd28908960b2fc01b2f4c5424f503c3201f1c84e543927f9028675"}},{"ruleId":"D2","level":"warning","message":{"text":"Style.__add__ (cognitive 35): Style.__add__ has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 13 (26 pts), if/else 4 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/style.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"096c5e6f8686e7129ec6fec770f520403422003d8d3d06f73487fee187c2b6d6"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryTree._reload (cognitive 35): DirectoryTree._reload has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 5, error handling 1 (3 pts), loops 3, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_directory_tree.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf97fe28bf7256ad118b8977e5ec90573c152d18ab5d8fd241cdf642233f24e"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree._render_line (cognitive 35): Tree._render_line has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tree.py"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c16e8defbd92f70fb9ae82c7d02e0a38634722badb09c202cb4b1195504bd43"}},{"ruleId":"D2","level":"warning","message":{"text":"Compositor.get_widget_and_offset_at (cognitive 34): Compositor.get_widget_and_offset_at has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"684838802b9e66af0d1c0903e04b13bfa47f291993bc7ad6f0b7f74c95f61e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"XTermParser._parse_extended_key (cognitive 34): XTermParser._parse_extended_key has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 7, ternaries 2 (5 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_xterm_parser.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"57105b594ba1850a3eb8fa8446968d67b9c52c37255c6823c2d8d9b51384511b"}},{"ruleId":"D2","level":"warning","message":{"text":"_resolve.resolve (cognitive 33): _resolve.resolve has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 1 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_resolve.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d011e0f87abcd50e7defde95d58d5fc47e8f7ab2c9528e3256d6bff6cdabf448"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.parse_rule_set (cognitive 33): parse.parse_rule_set has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (10 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/parse.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f795599700b2e686279320b96dffaab2399997242d0820416011875539d98e"}},{"ruleId":"D2","level":"warning","message":{"text":"Widget._check_refresh (cognitive 33): Widget._check_refresh has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 1 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae337e82660f146af29b54de37e3474ac7c98ab96f7faf0505df8ed142f78bc"}},{"ruleId":"D2","level":"warning","message":{"text":"StringEnumProperty.__set__ (cognitive 32): StringEnumProperty.__set__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_style_properties.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5ae689ceeccd67fe98d2fb896976af956095c99d8eddfde8f53b08966d322c"}},{"ruleId":"D2","level":"warning","message":{"text":"walk.walk_depth_first (cognitive 31): walk.walk_depth_first has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/walk.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e9afbdf70fa900bcee9c8c22916913fdd56a7702c7a5c4d1bcd609784013f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown._parse_markdown (cognitive 31): Markdown._parse_markdown has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (30 pts), 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":"src/textual/widgets/_markdown.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9860dcbdc3b801dece0045d2b428c649ee5ccdeab158988832c6ffb39763115b"}},{"ruleId":"D2","level":"warning","message":{"text":"TextArea.find_matching_bracket (cognitive 31): TextArea.find_matching_bracket has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe488c12a309d7d7977293703a4254a5c75facc86c1601d2e8c6c50cf0c5692"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.compose (cognitive 30): compose.compose has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), error handling 3 (7 pts), loops 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/compose.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eeb5968562b8bece1a31757342c51cf6a9c223412a1b4cd3477842d1467ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"Style.markup_tag (cognitive 30): Style.markup_tag has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 7 (14 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":"src/textual/style.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bb0ac98e188df94554d1a057b0ca876527ceaff208b4dc0a84df0bf51e6d25"}},{"ruleId":"D2","level":"warning","message":{"text":"_Template.insert_text_at_cursor (cognitive 30): _Template.insert_text_at_cursor has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_masked_input.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a7d565d219388e37adb74511e709a2dd6b21eff1a6cffe45e95916bb8d4f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Widget._scroll_to (cognitive 29): Widget._scroll_to has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 6 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bde79cf0fe566b47b8ad8f12cfccfc8513324202bc433d90ea5fdc665afe71"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTable._update_dimensions (cognitive 29): DataTable._update_dimensions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (11 pts), ternaries 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":"src/textual/widgets/_data_table.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb92ede95fa94f6864bcc8ec32c3d9537063fbf6a3d29ea54c0bb9af17da7388"}},{"ruleId":"D2","level":"warning","message":{"text":"EventMonitor.run (cognitive 28): EventMonitor.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (8 pts), boolean chains 1, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/win32.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d35fd2abe374e624ef0f6aeb3315baea15bd6b2e760a49b1639b9beaeb8d006"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamLayout.arrange (cognitive 28): StreamLayout.arrange has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (8 pts), boolean chains 5, 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":"src/textual/layouts/stream.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2df278002ad3fe33f9f8d6b0ce93035460286c8d179e40024bc9e2d953d5629"}},{"ruleId":"D2","level":"warning","message":{"text":"Input.render_line (cognitive 28): Input.render_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 2 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_input.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db903e6fbb82b1c6a22325da77431244cdb2b4475cfc48ee9cbb21f4dad068c"}},{"ruleId":"D2","level":"warning","message":{"text":"Animator._animate (cognitive 27): Animator._animate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, ternaries 2 (3 pts), 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":"src/textual/_animator.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b125786e1cd4742dc3e869a929c8f2ea7ff2a6e08a18588b0ef40740ba054670"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.get_token (cognitive 27): Tokenizer.get_token has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/tokenizer.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aaa275aefeffffb2046f95e3c35f66a7350d378d9ea1c5facc52a269de2003"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas.render (cognitive 26): Canvas.render has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (8 pts), ternaries 2 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/canvas.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"468daa14b5fd53077a6cc596c21eff743863f17db944bc3ff065c9ca2d66882f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScrollBarRender.render_bar (cognitive 26): ScrollBarRender.render_bar has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/scrollbar.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d2a74fdea64f4f470193f4f248d386ba397f72a62a880750a17b86b6457e39"}},{"ruleId":"D2","level":"warning","message":{"text":"Selection.get_span (cognitive 26): Selection.get_span has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 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":"src/textual/selection.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40d550f0cc06fe469f5fe4525b3148ad961cec70a18730566e3a3d120948302"}},{"ruleId":"D2","level":"warning","message":{"text":"Strip.align (cognitive 26): Strip.align has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/strip.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c8e4565a5d7ca05a9d69d186b5409e0bac5c7279671676fa098279b7a3e3bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Strip.crop (cognitive 26): Strip.crop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/strip.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"68174513ff122a3b8fb7ce785ea4c309616e0a0ccf5254d2b3fcfccce0722fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"match._check_selectors (cognitive 25): match._check_selectors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/match.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f5641fbfc27aeeb526228f56369c08b25229b20651724f1add4b2cc8d3b5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Sparkline.__rich_console__ (cognitive 25): Sparkline.__rich_console__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (7 pts), boolean chains 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":"src/textual/renderables/sparkline.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a7f1c2496bac462c83328a3a598e9e661d22cd38006ec6b117035e600de36a"}},{"ruleId":"D2","level":"warning","message":{"text":"Widget.scroll_to_region (cognitive 25): Widget.scroll_to_region has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ffa1fced30d04a942f74429033a47b0fff35007863691401b1ad8dae4ebf4b"}},{"ruleId":"D2","level":"warning","message":{"text":"_arrange.arrange (cognitive 24): _arrange.arrange has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (8 pts), boolean chains 1, 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":"src/textual/_arrange.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdc84c78a7a60f811c36e07108aef84c0a303d8e58b99f818d6cdece83f69e4"}},{"ruleId":"D2","level":"warning","message":{"text":"XTermParser._sequence_to_key_events (cognitive 24): XTermParser._sequence_to_key_events has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_xterm_parser.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a4840a3ece1c8738fadc8e6298ea3c343306e96449c4212553fd554c51f372"}},{"ruleId":"D2","level":"warning","message":{"text":"App.__init__ (cognitive 24): App.__init__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 6 (7 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a8720cd6e590a16b1c5c093cfee9edaecbc3bc197d4af90485cdafa2100a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"DOMNode.query_one (cognitive 24): DOMNode.query_one has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, 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":"src/textual/dom.py"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2115d50c6820d1c8fb848604bfd97cef89bebda4cdbf5bbd07496daf0dbcebd"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundScreen.process_segments (cognitive 24): BackgroundScreen.process_segments has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 4 (13 pts), if/else 5 (8 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/background_screen.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fbe96643eba6a5e0a2027e0a99a269ae24871726842157b37bf23da8159c15"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen.focus_chain (cognitive 24): Screen.focus_chain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84deeffb55862698d6cf168eb10720fed11080f1937c624d38e5d2ee8bb8c39"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen._handle_mouse_move (cognitive 24): Screen._handle_mouse_move has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a82619abdeb1efb13d515a89fecb0da09b2680f4efaab498a2d397393bc3987"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen._check_auto_scroll (cognitive 24): Screen._check_auto_scroll has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 1, 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":"src/textual/screen.py"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e3001197eba7b3c7b2ad710d7bb9f4cbe3aebf1d0591b3d83cb17956fd144f"}},{"ruleId":"D2","level":"warning","message":{"text":"_resolve.resolve_fraction_unit (cognitive 23): _resolve.resolve_fraction_unit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_resolve.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fc28fb008681967de822ba46a5c8a485fd89f9f7f19c80d827786d7bbfa391"}},{"ruleId":"D2","level":"warning","message":{"text":"_segment_tools.align_lines (cognitive 23): _segment_tools.align_lines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_segment_tools.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7fad35ecff57bdf6d483b062d975d025c07fbdbb17bf7a868c833bb6e7a461"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesBuilder.process_hatch (cognitive 23): StylesBuilder.process_hatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcf23f84258c7d6b546c7e760fd02c8511bbcb8073e64a7a7e8b3cee5c33864"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight.guess_language (cognitive 23): highlight.guess_language has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 3 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/highlight.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b54136c2b1675d446842d6c25d2ef209c38e6056752e1bc204339b21cd2e09"}},{"ruleId":"D2","level":"warning","message":{"text":"Footer.compose (cognitive 23): Footer.compose has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 5 (6 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_footer.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c9e14d83681cde8c1fd1bf7ad8493e9bddb409568aca85bd0d7b2caf903c86"}},{"ruleId":"D2","level":"warning","message":{"text":"Content._divide_spans (cognitive 22): Content._divide_spans has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58546861ba4badc87d9c8087704b5ccef261fd3ae4f334cbbcd254fe1fb07fe"}},{"ruleId":"D2","level":"warning","message":{"text":"RichLog.write (cognitive 22): RichLog.write has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 1 (2 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":"src/textual/widgets/_rich_log.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3a33e83d0c952c727e1260e468ebff0967ca9c794c70212d6cfddaefd94479"}},{"ruleId":"D2","level":"warning","message":{"text":"TextAreaTheme.apply_css (cognitive 21): TextAreaTheme.apply_css has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_text_area_theme.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d7c769d5deabf33e356fea38a7e197b8e68f5e87d7502902a52fbff86fd05c"}},{"ruleId":"D2","level":"warning","message":{"text":"Content._wrap_and_format (cognitive 21): Content._wrap_and_format has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 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":"src/textual/content.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b317e44b0d13f5a7bd05da0abe3845f57177c1b699d29d6db3638cd733a45f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTable._render_cell (cognitive 21): DataTable._render_cell has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"f330756b83beb6373e33e49bdf15e5d4d8bc9ff055c1d535f40236ecb7a81f26"}},{"ruleId":"D2","level":"warning","message":{"text":"TextArea.render_line (cognitive 21): TextArea.render_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fd57ba743809be203cbaf391e993189167756a088a4a5972ee0f4944eaefe5"}},{"ruleId":"D2","level":"warning","message":{"text":"Compositor._regions_to_spans (cognitive 20): Compositor._regions_to_spans has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b893c3e2f6a591a20af787d67425630e17b9c0ee350aa4aacb78f9cafee7663"}},{"ruleId":"D2","level":"warning","message":{"text":"_resolve.resolve_box_models (cognitive 20): _resolve.resolve_box_models has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, ternaries 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":"src/textual/_resolve.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff2b96cdcdceb538656e1c980246c4d131a34927fe9947ee77372c2afc7bd19"}},{"ruleId":"D2","level":"warning","message":{"text":"_FormattedLine.to_strip (cognitive 20): _FormattedLine.to_strip has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (7 pts), boolean chains 3, ternaries 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":"src/textual/content.py"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8373aea686c271d68f4283f71435f05882558205ea416f5629bee551a9c9a116"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorProperty.__set__ (cognitive 20): ColorProperty.__set__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (7 pts), loops 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":"src/textual/css/_style_properties.py"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ccf9800920f965a4653514762f6b71315b65232a9b30b77b5abe54f0b310d7"}},{"ruleId":"D2","level":"warning","message":{"text":"DOMNode.query_exactly_one (cognitive 20): DOMNode.query_exactly_one has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), 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":"src/textual/dom.py"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef10ca27ce59c15668707574b0f8cd67ef4ab4a110584d9f83ee3a8ccca5816"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDriver.run_input_thread (cognitive 20): WebDriver.run_input_thread has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (7 pts), error handling 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/web_driver.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"db812bb3adebfe59b41fae821a8f037fb205962f68212cbae4a8589d611d58bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen._binding_chain (cognitive 20): Screen._binding_chain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f66a7ee4b4f7c6caf86a5e44772d50f7ac5ed68cf1372bd43eeee03f6b5a4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Signal.publish (cognitive 20): Signal.publish has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/signal.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a545404c42a081464374039c2d2e9d85c99e684d708a1255733c94154c8552"}},{"ruleId":"D2","level":"warning","message":{"text":"_Template.__init__ (cognitive 20): _Template.__init__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_masked_input.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0edfe576cc708622f73afdcde898c36a5d4476ca27333c21dbc5f38b1585f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_layout_resolve.layout_resolve (cognitive 19): _layout_resolve.layout_resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 3 (6 pts), boolean chains 5, 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":"src/textual/_layout_resolve.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c2c9a59d341a53d3df9a04e091c098cfe57c87676a8e4e5c7941afa3883b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"XTermParser.parse_mouse_code (cognitive 19): XTermParser.parse_mouse_code has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (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":"src/textual/_xterm_parser.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"95906fd25302e4c46256d78ea29b15c4241ce5ae01cad49da637620974acc0a6"}},{"ruleId":"D2","level":"warning","message":{"text":"App._display (cognitive 19): App._display has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":3821}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d013481803dbea3073d78c4554044aa45109e8da358445af432493fe13c411b"}},{"ruleId":"D2","level":"warning","message":{"text":"Content.expand_tabs (cognitive 19): Content.expand_tabs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e4d87fe93f8e3fdae3b5ff3aad7313cb5db1c01311432235a095977e2d4243"}},{"ruleId":"D2","level":"warning","message":{"text":"StyleFlagsProperty.__set__ (cognitive 19): StyleFlagsProperty.__set__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_style_properties.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"0298bd7f6a48ff0128c61687bdbbe0e1e462362f189f6a51ecb71a90f5e8b2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesBuilder._parse_border (cognitive 19): StylesBuilder._parse_border has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (7 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f7132320d7495a4c1f0c5197d7b713f449920a949a0280d502e363e7bff4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Widget.get_visual_style (cognitive 19): Widget.get_visual_style has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 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":"src/textual/widget.py"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea82d802cc7de4bade00db7e0103d7f45033136cfa17d695cdc985451b3b6ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"Widget._refresh_scrollbars (cognitive 19): Widget._refresh_scrollbars has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 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":"src/textual/widget.py"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"565cd98c5ba9753ab8914f4a81f5e7a12dfbbec2ef791de17e26ff8226e2e73c"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeNode.add (cognitive 19): TreeNode.add has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tree.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d462c3a42097098a949fd0c5d454dce40d21cafe8d352f8651e2b73b31c99638"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesCache.render (cognitive 18): StylesCache.render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_styles_cache.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ca98378c464fb192b02c34c2c1bd6daa84a46440c961878db52ada3303e3ff"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandPalette._search_for (cognitive 18): CommandPalette._search_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (5 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/command.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eabb2ce939dc8fcd8da72482f8b867b9505b7d17b7f6f1f32810d414c247f5"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesBuilder.process_keyline (cognitive 18): StylesBuilder.process_keyline has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e4aa92c92a6111894b8ae00a912c1a669ab8bfd67136389892b98d3e01ee3e"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownBlock._token_to_content (cognitive 18): MarkdownBlock._token_to_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_markdown.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8d42799d27c301b08858152b2f5d01d79461d3c3da88059c7e1d51f07f94ba"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionList.add_options (cognitive 18): OptionList.add_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_option_list.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e05aa276a3aee0853f7b85e112b19aacf9b8bf991ae09f991e54a303c50fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"Logger.__call__ (cognitive 17): Logger.__call__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (3 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/__init__.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c3ff9ae5430eb00423a43c5653c1f981da7aedbb5a0a45c64d8d9e4661ac02"}},{"ruleId":"D2","level":"warning","message":{"text":"_segment_tools.apply_hatch (cognitive 17): _segment_tools.apply_hatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_segment_tools.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c74af3e552aa199a5b7a83ef9eb213df28241d03b68d1dad9e5306e483457"}},{"ruleId":"D2","level":"warning","message":{"text":"Content.__getitem__ (cognitive 17): Content.__getitem__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70b55b7cdaf35175846f52b30fd947518d03566c99e6bd3086721356fba1c42"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesBuilder.process_transition (cognitive 17): StylesBuilder.process_transition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 3 (6 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c7329308297025823a9eb47a71ec55acf0c212e95e5f56fb90c7c915db9f18"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.parse_declarations (cognitive 17): parse.parse_declarations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/parse.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8335e89c971422ff354b40cd232da363eca29c48ca716615ca1ca145e90612b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Stylesheet.replace_rules (cognitive 17): Stylesheet.replace_rules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/stylesheet.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37c4e863449a123a2aa6ed5cc8941d6fec10b57d55de703fc98568fcc5de4eb"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentNavigator.get_location_home (cognitive 17): DocumentNavigator.get_location_home has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/document/_document_navigator.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4fc7d3a306eb7a9ac0f1c51590c741b880bc0fe7d93daacd7d83ecd5c8d28b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChopsUpdate.render_segments (cognitive 16): ChopsUpdate.render_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1357a6940e322c5e88c8970d58c98f66450e5e7fe9348b2d1113e392351363"}},{"ruleId":"D2","level":"warning","message":{"text":"Compositor._render_chops (cognitive 16): Compositor._render_chops has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"df446273005f888865ef44726f93d9318b973280059ffaad3b1be65584c56c41"}},{"ruleId":"D2","level":"warning","message":{"text":"Content.from_rich_text (cognitive 16): Content.from_rich_text has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (6 pts), if/else 6, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee20fa4bc040adbb9e4f8ea56eeab8ce6a0043453d26d5e749c76a39e7045f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesBuilder.process_color (cognitive 16): StylesBuilder.process_color has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d8681da0decdded3bc701aaaa342dc66ecf92fec250811037333ec29fb921e"}},{"ruleId":"D2","level":"warning","message":{"text":"Stylesheet.update_nodes (cognitive 16): Stylesheet.update_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/stylesheet.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"621a670166efd8e88539a1c8e158d265e9b9fe4547c994a43d5b1d4b67ad5990"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteStreamParser.feed (cognitive 16): ByteStreamParser.feed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/_byte_stream.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"870594825e45c65c18910e646d636626acb7df7a2f319df75ccb510853b1f541"}},{"ruleId":"D2","level":"warning","message":{"text":"Bar.__rich_console__ (cognitive 16): Bar.__rich_console__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 3, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/bar.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961d77da94f1a3e83b26924f617fd46b21ce766168750fc1ed6b323068aed9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen._move_focus (cognitive 16): Screen._move_focus has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c89ec56e45a6794748c9c8fdb4d7a105af53f6df285c445091d754e0622c96c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextArea._set_document (cognitive 16): TextArea._set_document has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 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":"src/textual/widgets/_text_area.py"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49c54bb1e9b9f7e4dd0c68afc6deb458e37730ff0ad136fee41ab11c0591e2e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 180 methods. The bar is 30 methods; this is 150 over it, 6.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a6f5b8603ad4e121438b048f33949d4311533ca197272109dd84c71df6f2d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/widget.py: FileTooLong \u2014 2827 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2327 over it, 5.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":"src/textual/widget.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"102b698fe824ab10e2fa504eaf6c563bdee90348f8fc454f5d569fd13153c371"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Widget: TooManyMethods \u2014 167 methods. The bar is 30 methods; this is 137 over it, 5.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":"src/textual/widget.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f3b3ba9056fe180438addddeec14972e772fbc18b5c2b4ea5f07b9b9bd6a64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/app.py: FileTooLong \u2014 2596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2096 over it, 5.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9449123c971c8546a4ea6114ece1a2e99146862de5b9862929f9713ef99dbeae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextArea: TooManyMethods \u2014 108 methods. The bar is 30 methods; this is 78 over it, 3.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"66feedf818f51e86e9ddf450beb30b9d9c007a7073dd8a0d9d9844d86ba107d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/_data_table.py: FileTooLong \u2014 1626 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1126 over it, 3.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b30113772100e229eb02629918f7598a68d70474c3fb0e5f2fc4f8219f99d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/_text_area.py: FileTooLong \u2014 1467 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 967 over it, 2.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"979865b320243014072f00b60060b5d3aaa3df00552dd1059b7be87c736c7f14"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataTable: TooManyMethods \u2014 88 methods. The bar is 30 methods; this is 58 over it, 2.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":"src/textual/widgets/_data_table.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0240a91edd60f64fc0982736aa7da49683ecb3d62f99fc1ad2d451f3d95cffd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Screen: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c91e80536925838c3417bc55d41cdd5c360e036a43abc94bda94655480fd45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/screen.py: FileTooLong \u2014 1271 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 771 over it, 2.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":"src/textual/screen.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3a93020b3cb1e17f6bd2b548c7497c3291ff41e4fc0bdda6c8a50323a1cd13"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StylesBuilder: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e08c6c84845122899ac2df88cdadc173256aae3de99e6618f40262e5fbaaab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/content.py: FileTooLong \u2014 1092 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 592 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6363bd639f81b5d0d4db4b2e89fc0f220ede0df9635a96b089eab1df85cd0e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/_styles_builder.py: FileTooLong \u2014 1031 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 531 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b836ae3d6223e9f04045d2379fafc4c50cefd5e23889573e115f311b1749ea4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/dom.py: FileTooLong \u2014 991 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 491 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0304311a88ad1c7b0d460288ff6f5de12209e73121e5d050d1e683b17fe1be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/styles.py: FileTooLong \u2014 930 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/styles.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c933a725d3b7af6f1d25a38031029d745c062ac9ad5997bb9ac9c341da169e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/_tree.py: FileTooLong \u2014 919 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 419 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a314a3e40d91d9782a29873c10056a9e4f23f1cdd59a943615cefc91a591bc1c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tree: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tree.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"671f0fcb356d9330993605b27d13cf621df092c3814af34dfead81041f425d7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/_markdown.py: FileTooLong \u2014 907 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 407 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_markdown.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75062d7ca986f3e78eeb14218d6a1e4e1938dc6a766c061b47522c279fbc8988"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Content: 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":"src/textual/content.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fb9fccda5df4ec0f8996b8b1a246572ac6b80ed5143cf3dfc04fcb26564bb9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Input: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_input.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad253fec98e8987d7903a49aae797d9b99c57a9ecadd9bcab5bca22f101b6e17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DOMNode: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6e8b067934f631f7e5767b8c5d26039f179d06e1b54191ca987eb3679f57ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OptionList: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_option_list.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7c446b7c3376b80cbbc1752621563afca48b6ceb44df52733d2c13216ed503"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/_compositor.py: FileTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 266 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f073f7b4e9b5af5dea719a8d88597f31d5059cf402a167226acf6100716f5059"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/_style_properties.py: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 218 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":"src/textual/css/_style_properties.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aa8db5356112544d98105ce37339e24e8d009662c12c93938ab845b2a31ba2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/_input.py: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_input.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f211e1a48e23aa5e7bcc859d188991c98af9d0232dbc345f091e1ecaf280004"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MessagePump: 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":"src/textual/message_pump.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"01886d1309514b9ffce246c82420b5d4e4678e44968874bf1feeaeee5ec3c009"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/command.py: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/command.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12853c014db1e3b06683f9aa4d45269036f6c157147f6ee1b5d6aed507fbcefb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/geometry.py: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/geometry.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6c755e2a96b1f7fa97781b4b4cceb2f0fd33956c6cee81b9d4fbe446a4de7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: textual/message_pump.py: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/message_pump.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65abb5eabdd818288452c84e8a9a43b7a7e7cb135a0932a64f640a8f9699c746"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Strip: 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":"src/textual/strip.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"453817b5e207e5c5d41875f1121677109bca9fb3545dbb9233b858692478ea5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/_option_list.py: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 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":"src/textual/widgets/_option_list.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75407d1dbe22efabb934e239e49f762584147100e5a7fabe6d94a0b28f83ca73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (96 corresponding lines): src/textual/layouts/horizontal.py:25-120 | src/textual/layouts/vertical.py:23-124 \u2014 These two members are one piece of code written twice and then edited apart: 96 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/horizontal.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"74283042261b5b0d1f903ce12ef7aec99dc59d2ea7037c6b8195989d34918b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/textual/style.py:167-205 | src/textual/style.py:209-237 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/style.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e291bfd395a07f10cc09c025d0adb5c6718687653b71e5c4db10c5e0bca6036a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): src/textual/drivers/linux_driver.py:419-468 | src/textual/drivers/linux_inline_driver.py:122-177 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"d476a44c4af09b8e54156854bf4f92f313802fdd6ef37838bc8ee3bce4be545d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): src/textual/_segment_tools.py:204-274 | src/textual/strip.py:177-261 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_segment_tools.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a017de0240eae5086a3b3dc3254e7a0662c4d2d68e22e7016e598a3e322fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): examples/json_tree.py:26-65 | src/textual/widgets/_tree.py:792-835 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/json_tree.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa0d5e9a209f717b1161166cfde1bf95984948958fa1840728b568cac35692e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/textual/css/_styles_builder.py:1087-1110 | src/textual/css/_styles_builder.py:1113-1136 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cdf9eabc79fb0d362dfdd9acbe1a949f61c5c8ba4c3f5b3202bc5b09372085"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): src/textual/widgets/_text_area.py:1725-1767 | src/textual/widgets/_text_area.py:1770-1816 \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":"src/textual/widgets/_text_area.py"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a888b42af05488cbf735e8ceaba99eea7344ba1700f15df6452ffd985fead87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/textual/dom.py:1086-1120 | src/textual/widget.py:4170-4211 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85b5c2ac387da14e968e6ea11250d77932abf25b7a9c3d04cc0ef46d180e2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/textual/widgets/_data_table.py:1794-1830 | src/textual/widgets/_data_table.py:1833-1868 \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":"src/textual/widgets/_data_table.py"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bc2aa8eef79b98e34ae73f3361b09c9b1b4af3947963d52350022427c436cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): src/textual/document/_document_navigator.py:269-314 | src/textual/document/_document_navigator.py:317-359 \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":"src/textual/document/_document_navigator.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f961a56f56c15f38219743e64363bb85ece0ec8cda147cfb71ce3dbfff248df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): src/textual/renderables/background_screen.py:38-91 | src/textual/renderables/tint.py:39-86 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/background_screen.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4400724059712649a15df70b93f9e9e041a7ca03ff1c60a1c990881f91d4335e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/textual/widgets/_data_table.py:2705-2726 | src/textual/widgets/_data_table.py:2729-2750 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc76d20d8ceee4dbcf953f0d49142c29cab61bc8a902e793f61c661a1bac9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/textual/css/_styles_builder.py:643-660 | src/textual/css/_styles_builder.py:998-1017 \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":"src/textual/css/_styles_builder.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"d580826b1c29b941ab3ce048be2511f73a75db7b902f8d281a902d9b852e65c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): src/textual/app.py:4811-4872 | src/textual/app.py:4884-4952 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":4811}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ef021cca7a7f9da8d9a54d5b6bdac37786bef9413589c63c5479e7483572a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/textual/widgets/_data_table.py:1518-1542 | src/textual/widgets/_data_table.py:1545-1560 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f160e53232207c74f7395010c30020b42435b5335778ff7adffb5f837d75a5e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/textual/cache.py:143-166 | src/textual/cache.py:169-181 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/cache.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"848d524fde926f66c55a38c0885d50531106b0c3eae2d2483405afd353bb2196"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/textual/css/_styles_builder.py:663-673 | src/textual/css/_styles_builder.py:676-686 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"463b7f2cad7a10dceb08092f51c71f9811a76756891c468b423269ab9d95e30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/textual/widget.py:2874-2924 | src/textual/widget.py:3734-3778 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a5aa275796c7af70e6576f31cf57b131deaff36d27c24f1fb87256573dfd36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 20\u002B corresponding lines): src/textual/css/_styles_builder.py:226-248 | src/textual/css/_styles_builder.py:286-310 | src/textual/css/_styles_builder.py:350-369 | src/textual/css/_styles_builder.py:372-391 | src/textual/css/_styles_builder.py:394-415 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38131cf729a32342080b8af555a94239e5e837f5f074d5013b8349573d85c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/textual/content.py:1117-1139 | src/textual/content.py:1183-1209 \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":"src/textual/content.py"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7efe6c521068906203a4f03a610401eb7e9fc14c8f32b4c4146210aa7edfd2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/textual/content.py:1269-1293 | src/textual/content.py:1301-1327 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58ff4d982a4614e0b24480e96f7fa1b5f7b658c10571cf138a218bdd1d666fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/textual/drivers/linux_driver.py:358-373 | src/textual/drivers/linux_inline_driver.py:287-303 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41aabf9e99698a5ac2a64b89e3104bf869f531cd83ebc63ec792bc9fad91374"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/textual/widgets/_directory_tree.py:564-573 | src/textual/widgets/_directory_tree.py:576-585 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_directory_tree.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"155c7e83724c6334d273c20be255bade4ec9b8678a395d3026c26afe97143ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/textual/validation.py:321-339 | src/textual/validation.py:370-388 | src/textual/validation.py:425-440 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/validation.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d66ce675fb19ec4aa0d69a8c725ffacb94643991a15bea4920f6966c93d6f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/textual/widgets/_input.py:571-609 | src/textual/widgets/_masked_input.py:527-552 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_input.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de23612efd3be68cb0f5575b45a16b7373315f277c22d69cba5bfb7de857a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/textual/events.py:555-568 | src/textual/events.py:701-715 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/events.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c627617a7ab6b103585213e3174003747709240e29e1efe978b0e0172b5b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/textual/drivers/linux_driver.py:108-126 | src/textual/drivers/linux_inline_driver.py:59-77 \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":"src/textual/drivers/linux_driver.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fde0322a9e926855bdf0c5a71cfc92d04bffe9752667dc27aaacf286d3090d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/textual/css/_styles_builder.py:689-697 | src/textual/css/_styles_builder.py:1272-1280 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e51e4c936785ea0248b24af28743299098ac4b776cb84837c2ab9ebb05043f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/textual/widgets/_tabs.py:826-849 | src/textual/widgets/_tabs.py:852-874 \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":"src/textual/widgets/_tabs.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"faebfde689f15b43427352b892efa4527946ececbbdcf784e5f89fabd04dfa1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/textual/drivers/linux_driver.py:376-396 | src/textual/drivers/linux_inline_driver.py:310-325 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"11323b11d0a9ec0fb8d690bcb05e3fed79909b6be8b2f9ed9d2e97b9212336b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/textual/css/styles.py:1421-1448 | src/textual/widget.py:2528-2554 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/styles.py"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"433ab4b30a72bcd5f5acfd71b378b43a88b9830afc4f5e8673185f4bcff5aae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/textual/geometry.py:779-796 | src/textual/geometry.py:800-817 \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":"src/textual/geometry.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff49f0a82154ab384b8011c18a4fc095192947f2e4dd497d9b1b73e840ac495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/textual/dom.py:1400-1415 | src/textual/dom.py:1428-1447 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf67adb7c8de5f4de8c4a477080f25079dcd95fd06025eee2906c4f356e9118a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/textual/widget.py:3827-3851 | src/textual/widget.py:3854-3875 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6163b1e4bfbd205069510de5f2ff52faf33e4e5db161daa4606d3f9fed27e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/textual/widgets/_tabbed_content.py:625-636 | src/textual/widgets/_tabbed_content.py:648-659 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tabbed_content.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1808e9a9313eaf1e22053e4c183a016e68359f8e38dd6b062136bbe066b9783"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/textual/widget.py:933-945 | src/textual/widget.py:949-961 | src/textual/widget.py:965-975 | src/textual/widget.py:979-989 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"09425d0feda935597d2ad7e477a1e7625a4cde317ebed0216bf3af905c4640f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/textual/css/_styles_builder.py:825-836 | src/textual/css/_styles_builder.py:839-850 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca87f4ee16276f94de147bc9798b6a09579e790a0ec9fe5e2e06cf89a05dfc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/textual/renderables/_blend_colors.py:7-27 | src/textual/filter.py:132-149 \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":"src/textual/renderables/_blend_colors.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c82a0e303fa83ccb27961db56dfd502c10a423b5c47f63dc55a6a3d1547692"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/textual/command.py:376-384 | src/textual/system_commands.py:43-64 | src/textual/theme.py:536-544 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/command.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d058806ff9a145a3bcf5dc304ab490802aef56648258f470cf0115691c884639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/textual/app.py:1133-1158 | src/textual/scroll_view.py:140-166 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3002f1450563813f2a30a5abe4bc45c7cf2edf42c9eddf85cc45cbd763ccc2e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/textual/reactive.py:463-472 | src/textual/widgets/_label.py:62-73 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/reactive.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e197e6bd5f7302a4bc25900975accf32b03e6266dbf9cb7f2f664c5d0d42b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/textual/app.py:4469-4480 | src/textual/screen.py:1007-1018 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e299b32a6caa3578b9b9730f10a7094978dcd8e4e951cc90fe6171b6bb43c0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/textual/widgets/_directory_tree.py:374-387 | src/textual/widgets/_tree.py:848-863 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_directory_tree.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d79f81c4fde0b68194107a741678100f308ea49f028d0e10451a9d3ad798416"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/textual/widgets/_content_switcher.py:49-69 | src/textual/widgets/_list_view.py:143-157 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_content_switcher.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd8ab126c215e610d9f62accc46f06415d6ba528673e4704e3d2762618bb1fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201338 lines \u00D7 2): src/textual/style.py:430-464 | src/textual/style.py:469-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/style.py:430\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/style.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43650c7104e3a12f059ad8fc61cf8d2101e0c5fc04f698cc30f27aa922b81e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): examples/json_tree.py:33-65 | src/textual/widgets/_tree.py:803-835 \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 \u0060node\u0060 to \u0060TreeNode\u0060 in one and \u0060TreeNode | None = None\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":"examples/json_tree.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fe74fb081829eb6dbd3b2648fccd5a4dd2a418886a41657ab76269110a4ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/textual/drivers/linux_driver.py:419-451 | src/textual/drivers/linux_inline_driver.py:122-154 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 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, \u0060src/textual/drivers/linux_inline_driver.py:155\u0060 calls \u0060isinstance\u0060 and \u0060src/textual/drivers/linux_driver.py:452\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1b23163ef2bd324eb55520cb2915c5cc292328dff91c43f8f75caaeab896f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/textual/dom.py:1091-1114 | src/textual/widget.py:4176-4199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dda9c7bc7de4f8b67be61c75dd968b8c5cb966e8aef36b59104d98ad3a9d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/textual/style.py:167-188 | src/textual/style.py:209-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/style.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f62cdd5dc07a7168fa2c086e4814994f2b16c541bda5ff4a3911f56eca57b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/textual/drivers/linux_driver.py:256-275 | src/textual/drivers/linux_inline_driver.py:217-236 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f8d7a35e459d607460f643ea0ca917e9ec3eb82b09374380bb84cb9ac2c1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/textual/renderables/background_screen.py:73-91 | src/textual/renderables/tint.py:67-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/renderables/tint.py:67\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/background_screen.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2c9352ed30745c740df1e3da594eb65516fb3e3d7a2033ee41e8ed3ab834eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/textual/app.py:4853-4869 | src/textual/app.py:4933-4949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/app.py:4853\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 before the matched lines, \u0060src/textual/app.py:4852\u0060 calls \u0060getattr\u0060 and \u0060src/textual/app.py:4932\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":4853}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bab29037a417610cadc08a080c0c579a610ffcc95a5449c6790a425408e316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/textual/renderables/text_opacity.py:110-126 | src/textual/renderables/text_opacity.py:131-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/text_opacity.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efacea45427e6d1f3ece728eda3ede7b99dbedff00e7e0cf1bf4d67441e6953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/textual/widgets/_text_area.py:1744-1759 | src/textual/widgets/_text_area.py:1791-1807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/widgets/_text_area.py:1744\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeedd81813f91be67446a7c1cad69c67ef702e9695da8ea5cd57ec086228dbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/textual/drivers/linux_driver.py:108-123 | src/textual/drivers/linux_inline_driver.py:59-74 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"356c939e4aac8298725949045c7f1eb2d30bf96f6f7d0e3fe371d65feda07d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/textual/drivers/headless_driver.py:21-34 | src/textual/drivers/linux_driver.py:113-126 | src/textual/drivers/linux_inline_driver.py:64-77 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/headless_driver.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc2d12769dbaeef2efa2460185cf89d1b06e12efb44f7228e0b454f2a8b70e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/textual/css/_styles_builder.py:741-754 | src/textual/css/_styles_builder.py:1236-1247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/css/_styles_builder.py:741\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"50875ccfef1a7e6a5395359a93977aa0aa8b9f0b8e9b358812d2e4b4915df780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/textual/css/_styles_builder.py:1097-1110 | src/textual/css/_styles_builder.py:1123-1136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/css/_styles_builder.py:1097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77c5b0f3cd12a6c5797d35f461e8d085a0d51f9d575ff08c0bcdb7208248c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/textual/dom.py:1507-1520 | src/textual/dom.py:1617-1630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb307d43ac8019b1510600f8686b40e767ca69172cf7a58681d10b386f73e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/textual/layouts/horizontal.py:73-86 | src/textual/layouts/vertical.py:78-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/layouts/horizontal.py:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/horizontal.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac51112efe1514f41168a71fd17e1453c9663a24fc8cc425815a7f03da03f0f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/textual/drivers/linux_driver.py:358-370 | src/textual/drivers/linux_inline_driver.py:287-299 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e672f0d2ef6957a2ca9ece317a3dcb78ca56f4d7394fa72bb06662c04746bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/textual/drivers/linux_driver.py:454-466 | src/textual/drivers/linux_inline_driver.py:163-175 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 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, \u0060src/textual/drivers/linux_inline_driver.py:160\u0060 calls \u0060isinstance\u0060 and \u0060src/textual/drivers/linux_driver.py:453\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a7cbcd484ac78b1e2bb62bdfb89e4e1068e949d80aa9581cfd42992dd32a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/textual/_compositor.py:196-207 | src/textual/_compositor.py:252-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3833a2ca344582b21a0307e0fec4a0695bd2c5edeed4ebfcd09c3841dafe631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/textual/_styles_cache.py:434-442 | src/textual/_styles_cache.py:471-482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_styles_cache.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6c349d6ce7af46b43d41e429c340e2f97fead39b42944a687b8fb8147a5cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/textual/cache.py:156-166 | src/textual/cache.py:173-181 \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":"src/textual/cache.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f9a8bc96a2fc10d65607d4c10cafe1016dd38da14b8f594435724cf1e3ff5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/textual/layouts/horizontal.py:25-35 | src/textual/layouts/vertical.py:23-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/layouts/horizontal.py:25\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/horizontal.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d7055f6257a9eb0ae220e2ceb41c04c9b2811e6f850274a5ee5a5ee526ccc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/textual/widgets/_data_table.py:2705-2715 | src/textual/widgets/_data_table.py:2729-2739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bde6eca2c83aa2ce988d7e4539bda6aa3bc5e557e9fc07e66050290be6bdb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/textual/css/_styles_builder.py:1020-1029 | src/textual/css/_styles_builder.py:1032-1041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"e203410e79a5b194add637af76beeeabb8640cf887d72e22487e70531a973883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/textual/widgets/_data_table.py:2321-2333 | src/textual/widgets/_data_table.py:2339-2348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/textual/widgets/_data_table.py:2321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad884017d41c5c1c3005742363f3467fafb63175a5534dc6bfc5206187544d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/textual/css/_styles_builder.py:663-670 | src/textual/css/_styles_builder.py:676-683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ad6f4d1492966edd03dd4615793bf75b800493a16531d0d99959a0cf0fd36d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/textual/css/_styles_builder.py:1087-1094 | src/textual/css/_styles_builder.py:1113-1120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_styles_builder.py"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c3db86bb47a2e9b4040ce16bd86bc4beade69efac647186b4143a637863ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/textual/validation.py:332-339 | src/textual/validation.py:381-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/validation.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6daed9541261b979394c9fac0c2da177281f402aac822c0bfe5dddfb1106f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/textual/validation.py:332-337 | src/textual/validation.py:381-386 | src/textual/validation.py:434-439 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/textual/validation.py:329\u0060 calls \u0060isinstance\u0060 and \u0060src/textual/validation.py:431\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/validation.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4257580802734e4706131ac508a59908099c22be06fa907584a42efa9cbb8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/textual/__init__.py:86-91 | src/textual/app.py:1744-1749 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/__init__.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c585c717b048b134020bbcbf137e8b17b06c8d4c7c18cb3749d0c9d30037647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): docs/blog/snippets/2022-12-07-responsive-app-background-task/blocking01.py:13-37 | docs/blog/snippets/2022-12-07-responsive-app-background-task/blocking02.py:14-41 \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":"docs/blog/snippets/2022-12-07-responsive-app-background-task/blocking01.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"db74649d5f476d4f7dbf16caa1c0b1a959d3e384d61eb96f968fba569e09b29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/textual/drivers/linux_driver.py:129-140 | src/textual/drivers/linux_driver.py:177-185 | src/textual/drivers/linux_inline_driver.py:80-90 | src/textual/drivers/linux_inline_driver.py:93-101 | src/textual/drivers/windows_driver.py:57-65 | src/textual/drivers/windows_driver.py:68-76 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 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":"src/textual/drivers/linux_driver.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"744ba9abd571ad99db81ebf1f6637de0c46b6b1e7004fff4a162ead45f2ae01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/textual/drivers/linux_driver.py:328-340 | src/textual/drivers/linux_inline_driver.py:257-269 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0e148f28093e04148ef9cacdf3e2df49a4a9dbbed149059a89e0391358010a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/textual/drivers/linux_driver.py:404-416 | src/textual/drivers/linux_inline_driver.py:107-119 \u2014 before extracting anything, compare \u0060src/textual/drivers/linux_driver.py\u0060 and \u0060src/textual/drivers/linux_inline_driver.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeb49f69aff7eba0a4064739ee1793f154bfc772a86008ad7dfe031ce23faa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/textual/widgets/_list_view.py:183-198 | src/textual/widgets/_option_list.py:920-927 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_list_view.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dbdd2c0d67e2f9c5863727e5b32096bafa0bc1cd270d7b84437828d3396c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): docs/examples/styles/border_all.py:10-27 | docs/examples/styles/outline_all.py:10-26 \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":"docs/examples/styles/border_all.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0503e9cc7709b8cc82f4a894b71533f5c9e92e6d337d89103ee45eb0d22f6d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): docs/examples/guide/workers/weather01.py:24-35 | docs/examples/guide/workers/weather02.py:24-35 | docs/examples/guide/workers/weather03.py:26-37 | docs/examples/guide/workers/weather04.py:27-38 \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":"docs/examples/guide/workers/weather01.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b798420c51982536a2af8cab2169fd61ea971910941d0998a58ba8a5ae658f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): docs/examples/guide/widgets/checker01.py:13-31 | docs/examples/guide/widgets/checker02.py:26-43 \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":"docs/examples/guide/widgets/checker01.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"02be78cebf7481527604e063a7ffeef866778e26ffedfb709b1132e359ffd52c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): docs/examples/widgets/radio_set.py:12-39 | docs/examples/widgets/radio_set_changed.py:12-31 \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":"docs/examples/widgets/radio_set.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a439737af225df597925a4abad77b4daadd75d2b1ca88de34b030dc14193f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): docs/examples/styles/height_comparison.py:16-27 | docs/examples/styles/width_comparison.py:16-27 \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":"docs/examples/styles/height_comparison.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c96ef20513baf9911b36518436b4a1bd4949ffad51900205d165ef11395eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): docs/examples/guide/widgets/fizzbuzz01.py:9-18 | docs/examples/guide/widgets/fizzbuzz02.py:10-19 \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":"docs/examples/guide/widgets/fizzbuzz01.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c720cf51d620fd170dc85b967bf0edee65f05ac213dceb1fae74812eef905b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): docs/examples/widgets/progress_bar_isolated_.py:41-44 | docs/examples/widgets/progress_bar_styled_.py:42-45 \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":"docs/examples/widgets/progress_bar_isolated_.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e965bdb7c376f1c24c6866af30f3e684683edf836b44a07d59b9b4566a769e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): docs/examples/tutorial/stopwatch.py:25-28 | docs/examples/tutorial/stopwatch05.py:24-27 | docs/examples/tutorial/stopwatch06.py:25-28 | src/textual/demo/game.py:393-395 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/tutorial/stopwatch.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0656c1d4e8fbc4088eb03d30f1db6eab179b2002637aab17e32fd9bf5a24db5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): docs/examples/guide/actions/actions06.py:20-23 | docs/examples/guide/actions/actions07.py:20-23 \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":"docs/examples/guide/actions/actions06.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24ca8d0365f5e1e86da5ddf8e1d7ba765ce872132db4d8c122a29b389edeeb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): docs/examples/guide/reactivity/set_reactive01.py:61-62 | docs/examples/guide/reactivity/set_reactive02.py:61-62 \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":"docs/examples/guide/reactivity/set_reactive01.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4720e0908eabc43bc5f44577d403ac15b4723d4bce40517f66de23441cf46e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): docs/examples/guide/compound/byte02.py:45-48 | docs/examples/guide/compound/byte03.py:50-53 \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":"docs/examples/guide/compound/byte02.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fffc79aaa2bbd810a883862b9316c1498f4f9ed7c83b1bc409388a6442ed20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): docs/examples/guide/styles/border01.py:19-21 | docs/examples/guide/styles/outline01.py:20-22 \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":"docs/examples/guide/styles/border01.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e958b8886d8567eabc9dba6ad2a4091f35f65c3b5897a3c82788e40b7b8a907f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): docs/examples/how-to/containers06.py:27-29 | docs/examples/how-to/containers07.py:27-29 \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":"docs/examples/how-to/containers06.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d336293906a0935b153dd1a34fd7dc09ea10c44653fd4d8df04246098a2cbf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): docs/examples/widgets/radio_set.py:12-27 | docs/examples/widgets/radio_set_changed.py:13-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060docs/examples/widgets/radio_set_changed.py:12\u0060 calls \u0060VerticalScroll\u0060 and \u0060docs/examples/widgets/radio_set.py:11\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":"docs/examples/widgets/radio_set.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c722f88a3eb0f8ef3716358aac958790cb1b08ec9c43ff4593de827c4f733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): docs/examples/guide/workers/weather01.py:24-35 | docs/examples/guide/workers/weather02.py:24-35 | docs/examples/guide/workers/weather03.py:26-37 | docs/examples/guide/workers/weather04.py:27-38 \u2014 before extracting anything, compare \u0060docs/examples/guide/workers/weather01.py\u0060 and \u0060docs/examples/guide/workers/weather02.py\u0060 as WHOLE FILES: 96% 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060docs/examples/guide/workers/weather04.py:40\u0060 calls \u0060on_worker_state_changed\u0060, \u0060log\u0060 and \u0060docs/examples/guide/workers/weather01.py:38\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":"docs/examples/guide/workers/weather01.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d009a5b9234b9ab14044f0b666210921caa4684640957573f87db60f014275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/examples/widgets/selection_list_tuples.py:10-20 | examples/theme_sandbox.py:364-374 \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":"docs/examples/widgets/selection_list_tuples.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8348016cc23ffb4f68dca77ad2e384b5231cf7b1792d6195ed425687bf2046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): docs/examples/styles/height_comparison.py:18-27 | docs/examples/styles/width_comparison.py:18-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/examples/styles/height_comparison.py:18\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":"docs/examples/styles/height_comparison.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0f455e1207d3212093d752588fd14d7cf9e466d5aa3334289a2b0fadf5b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): docs/examples/widgets/selection_list_selected.py:16-25 | docs/examples/widgets/selection_list_selections.py:12-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/examples/widgets/selection_list_selected.py:16\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, \u0060docs/examples/widgets/selection_list_selected.py:26\u0060 calls \u0060Pretty\u0060 and \u0060docs/examples/widgets/selection_list_selections.py:22\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":"docs/examples/widgets/selection_list_selected.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"213da2f7e364ef7dfc1abe45a851debf2331aca4befed75c8df6b295147e9a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): docs/examples/styles/border_all.py:10-16 | docs/examples/styles/outline_all.py:10-16 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/examples/styles/border_all.py:10\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":"docs/examples/styles/border_all.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"400cba41e8b2f975e146534e7384139a2050f3b61ef2d54b70394f83f5179bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): docs/examples/styles/border_all.py:21-27 | docs/examples/styles/outline_all.py:20-26 \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 \u0060docs/examples/styles/border_all.py:21\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":"docs/examples/styles/border_all.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bc2bee59a6e7f34ff1401ff6b896cacb98222bd5e9a49001be9d1175be4ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/examples/app/question02.py:9-14 | docs/examples/app/question03.py:27-32 \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":"docs/examples/app/question02.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d9a03b40681dbdebe1bbe81821c108bfa8d03a490bfbf0a729625eb8b500ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): docs/examples/app/question_title01.py:11-17 | docs/examples/app/question_title02.py:12-22 \u2014 before extracting anything, compare \u0060docs/examples/app/question_title01.py\u0060 and \u0060docs/examples/app/question_title02.py\u0060 as WHOLE FILES: 94% 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. 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":"docs/examples/app/question_title01.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fda59553aa79a38e6706d55d5f85f33252b93a92653c573606e0d88dcba5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): docs/examples/guide/reactivity/refresh01.py:13-24 | docs/examples/guide/reactivity/refresh02.py:13-24 \u2014 before extracting anything, compare \u0060docs/examples/guide/reactivity/refresh01.py\u0060 and \u0060docs/examples/guide/reactivity/refresh02.py\u0060 as WHOLE FILES: 89% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/guide/reactivity/refresh01.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"61763f2c2e3fceac0292164fb647808d1e43381033f4890d4d599fbf26315141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/examples/guide/styles/colors.py:7-12 | docs/examples/guide/styles/widget.py:7-12 \u2014 before extracting anything, compare \u0060docs/examples/guide/styles/colors.py\u0060 and \u0060docs/examples/guide/styles/widget.py\u0060 as WHOLE FILES: 100% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/guide/styles/colors.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e862ea52ea9d667a6585de35d92774532f7d2574875125e04dc4c45ab4104d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): docs/examples/guide/styles/dimensions01.py:16-22 | docs/examples/guide/styles/dimensions02.py:16-22 | docs/examples/guide/styles/dimensions03.py:16-22 \u2014 before extracting anything, compare \u0060docs/examples/guide/styles/dimensions01.py\u0060 and \u0060docs/examples/guide/styles/dimensions02.py\u0060 as WHOLE FILES: 95% 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. 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":"docs/examples/guide/styles/dimensions01.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087ae59a228244a08deb58231bd034f56dcabd83f6b2045b9609a9c1c059f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): docs/examples/guide/widgets/hello03.py:27-42 | docs/examples/guide/widgets/hello04.py:38-53 \u2014 before extracting anything, compare \u0060docs/examples/guide/widgets/hello03.py\u0060 and \u0060docs/examples/guide/widgets/hello04.py\u0060 as WHOLE FILES: 96% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/guide/widgets/hello03.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9680fbca5a17e4519f82aa4e16bdcfbf09a7e4efb0be9b86569b55d6151f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): docs/examples/how-to/inline01.py:18-26 | docs/examples/how-to/inline02.py:25-33 | docs/examples/widgets/clock.py:18-26 \u2014 before extracting anything, compare \u0060docs/examples/how-to/inline01.py\u0060 and \u0060docs/examples/how-to/inline02.py\u0060 as WHOLE FILES: 95% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/how-to/inline01.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed6af3c9a8bf442b7134b5a3d230568b22dab6d1656f329b3dd36c475e28dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): docs/examples/how-to/layout.py:45-64 | docs/examples/how-to/layout05.py:31-48 | docs/examples/how-to/layout06.py:45-62 \u2014 before extracting anything, compare \u0060docs/examples/how-to/layout.py\u0060 and \u0060docs/examples/how-to/layout05.py\u0060 as WHOLE FILES: 94% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/how-to/layout.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"44707c749bd735ee056a66338398081077266101e1223d9d0403ee3a30c330a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): docs/examples/tutorial/stopwatch02.py:14-36 | docs/examples/tutorial/stopwatch03.py:14-37 | docs/examples/tutorial/stopwatch04.py:14-44 \u2014 before extracting anything, compare \u0060docs/examples/tutorial/stopwatch02.py\u0060 and \u0060docs/examples/tutorial/stopwatch03.py\u0060 as WHOLE FILES: 100% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/tutorial/stopwatch02.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5706ccfaf0e02d5ae67066aa207a1c579c715f7b8c2126b2aaec6a28f77108a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): docs/examples/widgets/progress_bar_isolated.py:14-30 | docs/examples/widgets/progress_bar_styled.py:15-31 \u2014 before extracting anything, compare \u0060docs/examples/widgets/progress_bar_isolated.py\u0060 and \u0060docs/examples/widgets/progress_bar_styled.py\u0060 as WHOLE FILES: 84% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/widgets/progress_bar_isolated.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8c25d2659bee662e571ef8eb7903e8e3347793a5b0773d28edbdf2117e668b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/examples/guide/animator/animation01.py:7-11 | docs/examples/guide/animator/animation01_static.py:10-14 \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":"docs/examples/guide/animator/animation01.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8a0ca7d329a3f8a9bf5e60355dd3007f79ff212a5f60cf317b5e6024c3834c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/examples/guide/compound/byte02.py:92-96 | docs/examples/guide/compound/byte03.py:103-107 \u2014 before extracting anything, compare \u0060docs/examples/guide/compound/byte02.py\u0060 and \u0060docs/examples/guide/compound/byte03.py\u0060 as WHOLE FILES: 93% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/guide/compound/byte02.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"71683d48df7103fad03f6e2977c86a817a31ec22f288e5b8d8d408914fc14c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/examples/guide/dom3.py:10-20 | docs/examples/guide/dom4.py:12-22 \u2014 before extracting anything, compare \u0060docs/examples/guide/dom3.py\u0060 and \u0060docs/examples/guide/dom4.py\u0060 as WHOLE FILES: 100% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/guide/dom3.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01e10d4c43c7e9a644e2677425e528cddfad93e18cdef3821641fb3d235d615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): docs/examples/guide/layout/grid_layout1.py:9-14 | docs/examples/guide/layout/grid_layout3_row_col_adjust.py:9-14 | docs/examples/guide/layout/grid_layout4_row_col_adjust.py:9-14 | docs/examples/guide/layout/grid_layout7_gutter.py:9-14 | docs/examples/guide/layout/grid_layout_auto.py:9-14 \u2014 before extracting anything, compare \u0060docs/examples/guide/layout/grid_layout1.py\u0060 and \u0060docs/examples/guide/layout/grid_layout3_row_col_adjust.py\u0060 as WHOLE FILES: 92% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/guide/layout/grid_layout1.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb62a3781a8be2019cecd8072d07001918b1a327249a852bf3da1e27cea2322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/examples/guide/layout/grid_layout5_col_span.py:9-14 | docs/examples/guide/layout/grid_layout6_row_span.py:9-14 \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":"docs/examples/guide/layout/grid_layout5_col_span.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c109cafc1a4e5544cc17f466af53d546781316919b14bc7a430bed9d8f8ac914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): docs/examples/guide/screens/modal01.py:19-24 | docs/examples/guide/screens/modal02.py:19-24 | docs/examples/guide/screens/modal03.py:19-24 \u2014 before extracting anything, compare \u0060docs/examples/guide/screens/modal01.py\u0060 and \u0060docs/examples/guide/screens/modal02.py\u0060 as WHOLE FILES: 89% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/guide/screens/modal01.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0337312e0652bfd1d10049e6707aa3b7ab1fd6fa300351e0e1a0fa998a30da7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): docs/examples/styles/color_auto.py:9-13 | docs/examples/styles/opacity.py:9-13 | docs/examples/styles/text_opacity.py:9-13 \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":"docs/examples/styles/color_auto.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"53be826e5ad8917cb9c6748894c1803eb2044831cb6dba1db6a8b1369ec4bcaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/examples/styles/column_span.py:10-18 | docs/examples/styles/row_span.py:10-18 \u2014 before extracting anything, compare \u0060docs/examples/styles/column_span.py\u0060 and \u0060docs/examples/styles/row_span.py\u0060 as WHOLE FILES: 94% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/styles/column_span.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c594f04163c08777b77f888cb2b9b04199aae0d5af90e7c36a916b4a60ad68c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): docs/examples/styles/link_background.py:9-24 | docs/examples/styles/link_background_hover.py:9-24 | docs/examples/styles/link_color.py:9-24 | docs/examples/styles/link_color_hover.py:9-24 | docs/examples/styles/link_style.py:9-24 | docs/examples/styles/link_style_hover.py:9-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/styles/link_background.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7bbad6755651c1a6f153407bc7fec4a8f9dfdbefd63b7847b196f1c89d97da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/examples/styles/max_height.py:10-15 | docs/examples/styles/min_height.py:10-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/styles/max_height.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83757f238138e5c4d5a405775c5097266b75b59b3440d7b7afe380e16afad5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/examples/styles/max_width.py:10-15 | docs/examples/styles/min_width.py:10-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/styles/max_width.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"442f08f903742980cee3fbbd1b58ea60b7dd8de4ad91207e76f315acdabc0779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/examples/tutorial/stopwatch.py:51-61 | docs/examples/tutorial/stopwatch06.py:51-61 \u2014 before extracting anything, compare \u0060docs/examples/tutorial/stopwatch.py\u0060 and \u0060docs/examples/tutorial/stopwatch06.py\u0060 as WHOLE FILES: 92% 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 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/tutorial/stopwatch.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea5ca1eaa069d48c9f0ce058995d464954398028d1591343f0ad5bd82ce0a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): docs/examples/tutorial/stopwatch.py:64-68 | docs/examples/tutorial/stopwatch05.py:41-45 | docs/examples/tutorial/stopwatch06.py:64-68 \u2014 before extracting anything, compare \u0060docs/examples/tutorial/stopwatch.py\u0060 and \u0060docs/examples/tutorial/stopwatch06.py\u0060 as WHOLE FILES: 92% 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 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/tutorial/stopwatch.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f9d4791a2d13ace669084c2a2bcbd4e7723543926e3a0bca70ecdc2f13078e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/examples/widgets/progress_bar_isolated_.py:15-19 | docs/examples/widgets/progress_bar_styled_.py:16-20 \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":"docs/examples/widgets/progress_bar_isolated_.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef59b2da5500659a1a003463fc02df70ca2fd4a54ee5c8c45b957edfb7f8e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/examples/styles/border_subtitle_align.py:9-19 | docs/examples/styles/border_title_align.py:9-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/examples/styles/border_subtitle_align.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ca21b420ec439e3f67a5190eaa28ecc3884cdc4c1c6edd89d5ee2e26868869"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Widget (LCOM4 22): Widget\u0027s methods fall into 22 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa80f63a970d24fdaf430a4b23d566e6e7971bb1ecbdd305911e9363d4a2a45e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DOMNode (LCOM4 15): DOMNode\u0027s methods fall into 15 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5817ce3f64f07760b5a431021d20f96d093a7a0a55949a2cb1de2bd032da46a9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DOMQuery (LCOM4 12): DOMQuery\u0027s methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/query.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd79c739acf02603b6ba32d3cc395fb891780012461da864ca9508ad5960157"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: App (LCOM4 9): App\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"981143814b68669097877f514b64dcb4575fd447783794187b7b440b3922cf6d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Screen (LCOM4 9): Screen\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4979a55775fec5fef06438df615336be82b986ec2ddf1d0a2b6bfe91975ae2d8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TabbedContent (LCOM4 9): TabbedContent\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tabbed_content.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"98779399197a3a4b7ecbb60dbbc022bcbedd6494c1082402c73f5d7fef296799"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StylesBase (LCOM4 8): StylesBase\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/styles.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"db118e9faa10fafeb7ebe3112a4b98af826f4bbd1f7051bec44621eb94d9aeb0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Tabs (LCOM4 8): Tabs\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tabs.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63941eb8642f4108b495dd4e03c944fcd6ac1a76a9bdfae69dd106b40e16bce"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Message (LCOM4 6): Message\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/message.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"37936d187b4c809eda63dd33195fc6c6c5ba2e852c66885a2e1ffb6259638bc0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Button (LCOM4 5): Button\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_button.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40ec9f09465404c554ae681ec60bcb5a8edb6b29b422d857ca6fa1720e66ba5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MarkdownViewer (LCOM4 4): MarkdownViewer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_markdown.py"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6df282a4b94e80d7efafb8bcebaa716f97405b442fb150fc03bea6d5bcc2c4b"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_select_width_auto: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022This test is flakey (why)?\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/snapshot_tests/test_snapshots.py"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e5dd8206c12b11a060b228f1a4ff04842c843fdc71c91669fea765300c7a0"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_app_resize_order: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Flakey on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/snapshot_tests/test_snapshots.py"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c9204689744d74bf043bf94f8ec94d8dbe3b5e5c5d2fcb42acc3d6d795b8f7"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 38 significant file(s) lose their only recent owner: src/textual/screen.py, src/textual/dom.py, src/textual/content.py, src/textual/widgets/_markdown.py, src/textual/geometry.py, src/textual/_compositor.py, src/textual/strip.py, src/textual/_styles_cache.py (\u002B30 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8499b02306a89d932714aabb3a3908f7f41307b5aeb3085d743d81adfc09fdbe"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (40 single-owned of 152 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 152 of the 237 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/textual/document/_document_navigator.py, src/textual/document/_wrapped_document.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Why is this flakey? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/snapshot_tests/test_snapshots.py"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f4cf134cd312586622384dec5558b5e6d30c2bccf55a7c225ce311b7fb5b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Is this fixable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/snapshot_tests/test_snapshots.py"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a75b554d51c8b334e8d2e276ccd712ad538d70d34f3682353bcbe92ca69241"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: more tests. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/input/test_input_key_movement_actions.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45cac4e9e96127c4074698f188c771ec07c57b07f8253a9994e5c8ca69aeca3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: tie breaker on CSS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/css/test_inheritance.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3bcb3e3b4f920cb63564f3b0e1c90b42d4b04ed39c4c172a033cd41f92c34e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add a \u0060Parsable\u0060 protocol \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_animator.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f09336aabfb4ceba0425b7f1dd47b04076261e4b0849cbae336b370587a500c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is a bit of a fudge, need to ensure it is impossible for layouts to generate this value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_arrange.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b768bf38db933cdd2a47c47dea91e283bb24270282675b964642e514071a767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: crop to x extents \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compositor.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded58a5e9ea9f1995b790eea0c062def8f7dfba76b713ebe41d5c9e3c627867"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Duplicate values need to be managed to ensure consistency, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_two_way_dict.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25630683766ddd908907a44a90a905c078516a204f7235a5a3da8e8ca0dd91f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Workaround for Ghostty erroneous negative coordinate bug \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_xterm_parser.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ae3aee8254b7779ac50b21b1535649bffac5cb63b70d6bd538eca9c4ea3740"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: iTerm is buggy in one or more of the protocols required here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_xterm_parser.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa83598cbdda73e3f8d6f24e055452075c090978690c16c038a90fe8d96a19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should this be configurable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8477632f4d91372bc0893cd2561ff0918c57a04ba46fcb78cbd4b8afade4c7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Enable by default after suitable testing period \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25c7e5247ef6783f1f19bf99f4f638979fb9ab1df9b357a048e92322376ed63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Catch specific exceptions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1a7a762913e3fd49e301c50ac98d1d49ef9e005dd3308b47a8ed997627fb8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Can this be more efficient? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"6086d8e464e8f2f967e5571b948d69d6739140baeba3a0b683b49ed3d04d133c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is a little inefficient, it is only used by full justify \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/content.py"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e885eea01c4dc44f3e4e8af40e781f686acf63109aa60a3bf78c793bed64371"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This will forget what the original \u0022display\u0022 value was, so if a user \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"979c5ce6f646b43461ff57bfeba80e446c338cfaa1f1678effce9f05703d16eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Currently doesn\u0027t handle overlapping regions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/geometry.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"095a7afe424fed397945b40f96831f7e5738d1cdde192fb0fb4e2b8cf186b1b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Calculating a focus chain is moderately expensive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"29100ce632d9ee88ca988a3a0c2e66d6b4d50e6bec31110e55945f382ff73959"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This will cause the widget to refresh, even when there are no links \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4d6b5297afb0b16fddeb704869c44bce3c5125ab7ef23f04cff3aebbf72035"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: configure animation speed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5283da6b8c7e8b8444bf84b2b326f6a696d57a75778ada3af0b4e33bf400e9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Feels like a hack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f4897cf23d813d07077140cf6378acadbc9c558f22b7adbe801345a26c1d0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: If there are no columns: do we generate them here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7180d16af5e50eaed5b6d5582a7fd1bb5ecab4ddf093a2866ca48a7b9ca845"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This should really be in a component class \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"17be3182d391cd9539d21145e617702c5784837f786e9401a76e011274f59105"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO - check with width: auto to see if layout=True is needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_input.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e887ce5da92682737c7fb67654173c05a581232345013c8082d3246eb54ef169"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Inherited from previous version. Do we always want this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_option_list.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"deca3e185609994a39d68842d79417869fb45f2dfebb2d73fcd9bbeeb2d4d5ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Refresh only if the affected option is visible. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_option_list.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a89518d02ef459438eeb35cc8abc678002dc59d2894e01a027e013e7fa123f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO - this is wrong because if we trim a long line, the max width \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_rich_log.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ba97ad04daf779e4c331a1af6a8668e2952fbb69f5c0f643e347953e34770c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is rather crufty and hard to fathom. Candidate for a rewrite. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_selection_list.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc03eedf1c22e0d009e428043932ec21689119fb6874e4f28d7f1ef464a74c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is not a reliable way of getting the base style \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_selection_list.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a99e7f12bb963de12f52d0ae045face47d70cbdca8daf1ec3841dc3504d3f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Lets not apply the division each time through render_line. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"125c8f4b27b117b8589888c86901924d9ea8b83f3a9545a7b3ef7512afac7a5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO cache result with edit count \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_text_area.py"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e35bb967ff27368c77f6a8974583717384706ec97be7f2111e61950f1769514"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: log this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9925199d155f0772f196574e8c13278a0b442e5ca2ae31422c476493d22f9d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: log this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_inline_driver.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe54ae4c8bfc30f70c3e10ebade8e2b6620ad5b36516dcb1d2f2a525c96e8cdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: log this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/windows_driver.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3f6bfff0fcd98f534d63bd771c94a3c145d908b4d4dd5b7f2a089ea2e35ebc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add a dedicated form label \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/demo/widgets.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9122fb7f3f938bedb0ac6561afd61df25ff0f0036b3cbff4f366a0dd29161dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: More helpful errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/query.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39473a9cfa64bdfb4187388caeb5a780d1fdc4c344cb9801aa666b14f77d124"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Highlight column number \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/tokenizer.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc0177079f82d3a2592c9c237d3b0d2540a90bc4e8a6b07b46696ebf81dfdd"}},{"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":"6167106a2775e74b24b29797d594215186b1dfa1ab5d946795e02d4c58731860"},"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":"87808a45bd88d3b2359e0072d25df28a108c17d0b95efd04ab209e82bcc47b6f"},"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":"ddc49ef52c93f5d89390c80bf8f0444bb97743496eeea781d1b7fcf904a3ea48"},"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":"565cb0a25235d1502010c8d34a025c6ae5aeb826c7d5e305b97bb45399050c67"},"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":"b9517cc4ae56162be6ef5c2593f4757b2854c319ee602e4c89f34f65769f92a5"},"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":"fdd80ff4efa055538dc59aafc5e380459b7d05030fbc7ee936f19fa678b3e896"},"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":"d6fe94a626a312be394736372295a40164e422829d75b68f6c0fc732ade5b947"},"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":"63c7bc148da41cae6fe6e776b909b1b9a76b65fe84101449dbaac45e0e014f1a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"620c6ebad53b26a05dc94c82f144bbb461128772a99e7ce400a98e250227fa6b"},"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":"83d6e722a205036843c4ae44685f7abe46df57d57759b782f4bdddeaabc4afa8"},"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":"c522754108f326e30555ef34e3341c68e8bab30d4e0daf62f5693b72acc768d1"},"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":"e315a27704efca6b2ea046d8517c7ac56a05155b77c49bddf6380e8f542848df"},"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":"1c5f5d1ab0bc26912d48027111b721feef15cf7edf51b8c20b14a10bbf453b95"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"0cf60037f60d515db609556b125e0e1e75a7cfc4919b8decd4718fde203cadd2"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"9cfc315b8b25e9ba9db141919ab04b649804140b2134d10a9e29799f65ba51d8"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"bde79a2a601f6726c003946ac4e8de64559c34c0454a4be86b636a8f5ad305f9"},"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":"daa66fe124d8047b4a4a88e732cc04978e07abab170634d016902c8d12a65212"},"taxa":[{"id":"CWE-502","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":"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":"ffb7a752cb060e77421af7bdaeda8badc16f81520c8fb2986621cced5d100678"},"taxa":[{"id":"CWE-502","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":"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":"445217ae1cfcdf5ee10732d632e80f4af16e623369a8e5cec45f28cc03276da7"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"680e22897be25776c3d9b97c6329a86f7c447900515be47118ee38f62e9bb8e1"},"properties":{"dependency":{"package":"anyio","version":"4.11.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4024","PYSEC-2026-4025"],"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":"a8d7ee7d92330b592270b74052f5dc1e7c0571a7f49c979de8e50493ad1d5cc3"},"properties":{"dependency":{"package":"certifi","version":"2025.10.5","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82660e0b4e39ee81af785d3a50d959300693f687db98b548cb1b189d8225cfb8"},"properties":{"dependency":{"package":"gitpython","version":"3.1.45","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]","[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]","PYSEC-2026-2160","PYSEC-2026-2161","PYSEC-2026-2162","PYSEC-2026-2163","PYSEC-2026-3783","PYSEC-2026-3784","PYSEC-2026-3785","PYSEC-2026-3786","PYSEC-2026-3787","PYSEC-2026-3788","PYSEC-2026-3836","PYSEC-2026-3837","PYSEC-2026-3838","PYSEC-2026-3839","PYSEC-2026-3840","PYSEC-2026-3841","PYSEC-2026-3842","PYSEC-2026-3843","PYSEC-2026-3948","PYSEC-2026-3949","PYSEC-2026-3950","PYSEC-2026-3951","PYSEC-2026-3952","PYSEC-2026-3953","PYSEC-2026-3980","PYSEC-2026-3981","PYSEC-2026-3982","PYSEC-2026-3984","PYSEC-2026-3995"],"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":"a29f263778e825bf8eadc8c9692de02d57030b82e547ac6d180ae1c7bdc3c168"},"properties":{"dependency":{"package":"h11","version":"0.14.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-348"],"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":"4b9a13efe0de3fb03210be30f1d2173cfd6719b0323b416003a5b842136ae5ff"},"properties":{"dependency":{"package":"aiohttp","version":"3.13.1","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]","[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]","PYSEC-2026-1097","PYSEC-2026-1099","PYSEC-2026-1100","PYSEC-2026-1101","PYSEC-2026-1105","PYSEC-2026-1106","PYSEC-2026-1107","PYSEC-2026-1109","PYSEC-2026-2094","PYSEC-2026-2095","PYSEC-2026-2096","PYSEC-2026-2097","PYSEC-2026-2098","PYSEC-2026-2099","PYSEC-2026-2100","PYSEC-2026-2101","PYSEC-2026-2102","PYSEC-2026-2103","PYSEC-2026-2104","PYSEC-2026-2105","PYSEC-2026-2106","PYSEC-2026-2107","PYSEC-2026-2108","PYSEC-2026-2109","PYSEC-2026-2110","PYSEC-2026-2111","PYSEC-2026-2112","PYSEC-2026-2113","PYSEC-2026-237","PYSEC-2026-3545","PYSEC-2026-3546","PYSEC-2026-3547"],"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":"2120f0c15fae0b4230471746f471edf07bd2bcf9bcf243f016956225dcc3b085"},"properties":{"dependency":{"package":"black","version":"24.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2120","PYSEC-2026-2121"],"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":"9080234b447e4c243c1367dc391d23d653d29190f407bf72360ba31e9f7cfc40"},"properties":{"dependency":{"package":"msgpack","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3625"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91b0bdb8ec1988232cfaaf43bcec2a2756f943ae20193b72c6fbc87163cbd430"},"properties":{"dependency":{"package":"pymdown-extensions","version":"10.16.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2999","PYSEC-2026-3609","PYSEC-2026-3654"],"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":"7a23d5e3a71a901fdfe7193423c79676924f434807ec561279abd044a90b4b34"},"properties":{"dependency":{"package":"urllib3","version":"2.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-141","PYSEC-2026-1994","PYSEC-2026-1996","PYSEC-2026-1998","PYSEC-2026-4175","PYSEC-2026-4177"],"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":"7e5dd8fab392358b28707e721c1714748b1a4e462af5e3910ce678b7cd1b45f1"},"properties":{"dependency":{"package":"virtualenv","version":"20.35.3","advisory":"[GHSA redacted]","aliases":["BIT-virtualenv-2026-102925","BIT-virtualenv-2026-102930","BIT-virtualenv-2026-102937","BIT-virtualenv-2026-102938","BIT-virtualenv-2026-113714","BIT-virtualenv-2026-113715","BIT-virtualenv-2026-113716","BIT-virtualenv-2026-113717","BIT-virtualenv-2026-113718","BIT-virtualenv-2026-113719","BIT-virtualenv-2026-113720","BIT-virtualenv-2026-113721","BIT-virtualenv-2026-113722","BIT-virtualenv-2026-113723","BIT-virtualenv-2026-113724","BIT-virtualenv-2026-113725","BIT-virtualenv-2026-113726","BIT-virtualenv-2026-113732","BIT-virtualenv-2026-113776","BIT-virtualenv-2026-22702","[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]","PYSEC-2026-2009","PYSEC-2026-4011","PYSEC-2026-4012","PYSEC-2026-4013","PYSEC-2026-4014"],"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":"42ec3155922e9c69d9bc406e1a44019d24098bc5a9904e89bdbdbc0038db9a8a"},"properties":{"dependency":{"package":"filelock","version":"3.19.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-1374","PYSEC-2026-1375"],"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":"828d4099c97229d263ea70ee20741ff2c4ac7fa33aab1a2196e30b7caef1b7e2"},"properties":{"dependency":{"package":"idna","version":"3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-215"],"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":"b9e7772103f3593201ca6694ceb67a82669678918772f2364b90046d44ff3095"},"properties":{"dependency":{"package":"mkdocs-material","version":"9.6.22","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3864"],"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":"434bd2441b6365e470bf2d31b2b538ff2f59a06f110a5f60b97fbc7f0ee22bb4"},"properties":{"dependency":{"package":"multidict","version":"6.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e4dbe7e9695515a0d7a1e102cfd6f945ff78be9b32a034e39af4fa75cf9c1c3"},"properties":{"dependency":{"package":"pygments","version":"2.19.2","advisory":"PYSEC-2026-2987","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"src/textual/highlight.py","line":6}}}},{"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":"b49563991adfa9353c0b07a1fe651f05489bdc7f024e1f9bf4ef85e75be9ef34"},"properties":{"dependency":{"package":"pytest","version":"8.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"reachability":{"kind":"test-or-tooling","file":"tests/animations/test_environment_variable.py","line":1}}}},{"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":"9edcd40a6812c6113a8657acb535febe1f89cd2986f9a63ddd93351836de3a80"},"properties":{"dependency":{"package":"requests","version":"2.32.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-2275"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_masked_input.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9144c8222f6d6bbdb922d8e64bef8cedf6bfb0e4b29368533e2c544affb2b5aa"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 18 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/textual/document/_document_navigator.py, src/textual/_text_area_theme.py, src/textual/document/_wrapped_document.py, src/textual/document/_document.py, src/textual/document/_syntax_aware_document.py, src/textual/widgets/_rule.py, src/textual/document/_history.py, src/textual/_wrap.py (and 10 more) (19 orphaned of 152 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 152 of the 237 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/document/_document_navigator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2b73028704f7fcd9edd19b19d93e0c231088951687e7b2bac1a6ae856da530"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_text_area_theme.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fb64726d40ecf63d15376557d052f1d53139c95c818dd7c3c4699945a22338"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/document/_wrapped_document.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0874b0110bb6308658e967893bdb669b4bf11f216865b73f851e7405982212"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/document/_document.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f178cd5802efb43123c518cde7a978fdc491a4aca1a71b330cc748a999369a3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/document/_syntax_aware_document.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e4baa5dd00db4920aa546c3b76e324cb7244930862473fd57e5e847689c116"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_rule.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1af668fe92cab91aa7e8d334ef57cb24ab08e0cf7a86337ed485ea7c8314021"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/document/_history.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d228cb180afb19a9c8ad3f51f9ffa28735768de369bcddeb5a73661db9a7281c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_wrap.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e31bffc74fdbf80bc877143b2e6874d2e90cd4ab058648c2df7ae6139782576"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/document/_edit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9388ea39ce2c4a5c5a0cd4d0e10778f01499435c2647484cc0733676252d6f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_widget_navigation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"374a417ce5e3c36edb0d9e8a0da1284e9d5d1647c3e0f11c977b0578f7743837"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/renderables/sparkline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"315d952e9dbd8df15c43b4d4811c24b8870fa68fd1b54c8399945eb638ed57e5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/gen_easings_tests.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f67e2117c08ceb31419eac6ce1f2e54751ae35e0329e484fd392664c9248441"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/suggester.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9086402cd1cd58f09fa15d56123a7ade9c48418f12f418bbdee659ec448b78"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_easing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3199c87f10cc46786bd38da2e98d9e0f5e80b69d85ca41574ec3a36b2ce9fdcf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/notifications.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16354539d054841f91a92c3b2cbf07d9949c20c05ecd4f7354cf980648233ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/expand_tabs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deef4a7ed4d8a31ec75de1fe5dbbed8de90b23d8f30c0c9176400260f705a8df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_compat.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"307ef405dd64297249c7a6a60b55891a302f21c426f017c5719f948d9b19f164"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/_help_renderables.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb196d91e24572e930fd7513558428cc881689d8b603b86186ffc9c144d81ca"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: horizontal.py \u2194 vertical.py: \u0060src/textual/layouts/horizontal.py\u0060 and \u0060src/textual/layouts/vertical.py\u0060 change together 81% of the time (22 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 22 shared commits counted here, the most recent 3 are \u00602e2d5d58\u0060 fix stack error; \u00606fd17979\u0060 remove timers; \u0060ba4a2ba7\u0060 add greedy \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/horizontal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2a8c285c7cef9f2b3ef214f8dd77f075956edaff6c3ebb843c664b535b72ae"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: constants.py \u2194 types.py: \u0060src/textual/css/constants.py\u0060 and \u0060src/textual/css/types.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 8 shared commits counted here, the most recent 3 are \u0060fec5571e\u0060 scrollbar visibility rule; \u006044129f0e\u0060 flat buttons; \u00609f93a358\u0060 no wrap \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/constants.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95af57e7eda7c63f0f77c47d8761ebed3333668f00cd0371b7b0436906c462a"}},{"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":"6a7d8ad9f15246753d00e8476fa948b745d9c007883122dbc86ca0a50b71a636"},"taxa":[{"id":"CICD-SEC-4","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":"fcb368dae2053737897c3a61910678e597dfa0af05dd9c59908cb76215e8057f"},"taxa":[{"id":"CICD-SEC-4","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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"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":"C2","level":"warning","message":{"text":"No authorization: This repository serves requests \u2014 a request handler (app.run() (src/textual/__main__.py:8) \u2014 and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/__main__.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"966c9de897394b8e7bb8faf25ae4df7a215be007ea3a752f171c1b6ef09a0282"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060_do_long_operation\u0060 is async and calls time.sleep \u2014 a blocking call inside async code stalls the event loop \u2014 every other task on it waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/blog/snippets/2022-12-07-responsive-app-background-task/blocking02.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"85122c91b0e36cd560f204794106b1c2fa931afd97c09ba5528d6aa0ea75f349"}},{"ruleId":"X1","level":"warning","message":{"text":"Blocking \u0060sleep\u0060 inside an \u0060async def\u0060: This \u0060async def\u0060 runs on the event loop\u0027s thread, and \u0060time.sleep\u0060 blocks that thread: for the whole delay no other coroutine, request or callback on the loop makes progress \u2014 the Python form of blocking on a task. Use \u0060await asyncio.sleep(\u2026)\u0060, which suspends only this coroutine. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the loop with \u0060await asyncio.to_thread(\u2026)\u0060 (or \u0060loop.run_in_executor(\u2026)\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_sleep.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"818fd1bef126fe14c862ceb59c020745f162aa87b2f0784a6649e937298fcf8e"}},{"ruleId":"X1","level":"warning","message":{"text":"Task from \u0060asyncio.create_task\u0060 is not kept: The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python\u0027s documentation for \u0060asyncio.create_task\u0060: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled \u2014 it surfaces, if at all, as \u0022Task exception was never retrieved\u0022 in a log. Keep the task: \u0060await\u0060 it, gather it, start it in an \u0060asyncio.TaskGroup\u0060 (\u0060async with asyncio.TaskGroup() as tg: tg.create_task(\u2026)\u0060), or, for genuine fire-and-forget, add it to a set and \u0060task.add_done_callback(tasks.discard)\u0060 with a callback that also reads its exception."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/blog/snippets/2022-12-07-responsive-app-background-task/blocking02.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca04b15dda8dbc877aec88320a4fb9a3785c1e23a3844c13f4ed6047ceb4497e"}},{"ruleId":"X1","level":"warning","message":{"text":"Blocking \u0060time.sleep\u0060 inside an \u0060async def\u0060: This \u0060async def\u0060 runs on the event loop\u0027s thread, and \u0060time.sleep\u0060 blocks that thread: for the whole delay no other coroutine, request or callback on the loop makes progress \u2014 the Python form of blocking on a task. Use \u0060await asyncio.sleep(\u2026)\u0060, which suspends only this coroutine. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the loop with \u0060await asyncio.to_thread(\u2026)\u0060 (or \u0060loop.run_in_executor(\u2026)\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/blog/snippets/2022-12-07-responsive-app-background-task/blocking02.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"57186d42a41cadd41f30bde9854b59526a112a39175d7b92cecd02a4bb51db0c"}},{"ruleId":"X1","level":"warning","message":{"text":"Task from \u0060asyncio.create_task\u0060 is not kept: The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python\u0027s documentation for \u0060asyncio.create_task\u0060: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled \u2014 it surfaces, if at all, as \u0022Task exception was never retrieved\u0022 in a log. Keep the task: \u0060await\u0060 it, gather it, start it in an \u0060asyncio.TaskGroup\u0060 (\u0060async with asyncio.TaskGroup() as tg: tg.create_task(\u2026)\u0060), or, for genuine fire-and-forget, add it to a set and \u0060task.add_done_callback(tasks.discard)\u0060 with a callback that also reads its exception."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/blog/snippets/2022-12-07-responsive-app-background-task/nonblocking01.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf132860698c09cf3808cd143958b31df1d7c2d82975aba9ee567416bf06a37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before is not None and after is not None\u0060 appears character-identically in 3 files \u2014 src/textual/app.py, src/textual/widget.py, src/textual/widgets/_tree.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/app.py"},"region":{"startLine":3593}}}],"partialFingerprints":{"codehealthFindingId/v1":"5300d94e9a58bb997c5acf9d2cdde1d22f3f192bb2daa67c9765deb923b53116"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character is not None and character.isprintable()\u0060 appears character-identically in 2 files \u2014 src/textual/widgets/_input.py, src/textual/widgets/_text_area.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_input.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"635b5e0bf4e00548c15ededc3062b10917fef178a65cfc97d4f0dbe93e01effb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_rule(\u0022auto_color\u0022) and styles.auto_color\u0060 appears character-identically in 2 files \u2014 src/textual/dom.py, src/textual/widget.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/dom.py"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc10c97cd90390fba38ef79b665f08fc7866974cf28d471281f3da75c6463d6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(node, Widget) and node.is_scrollable\u0060 appears character-identically in 2 files \u2014 src/textual/css/stylesheet.py, src/textual/widget.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/stylesheet.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a3d5bb604698a599645314ff1fc079a075acd19e3af809a5743829fac5b1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.final_value == other.final_value and self.duration == other.duration\u0060 appears character-identically in 2 files \u2014 src/textual/_animator.py, src/textual/css/scalar_animation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_animator.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7420c1490b0b1a77fac71c11cfd56566b54a913778d0a47f4c8da5795fa3c23c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060show_horizontal_scrollbar and show_vertical_scrollbar\u0060 appears character-identically in 2 files \u2014 src/textual/css/stylesheet.py, src/textual/widget.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/css/stylesheet.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdabb43b593152ce59a54ccf453f153d62e14b5df72a4e24a37a31e7716f2ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060styles.has_rule(\u0022position\u0022) and styles.position == \u0022absolute\u0022\u0060 appears character-identically in 2 files \u2014 src/textual/layouts/horizontal.py, src/textual/layouts/vertical.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/layouts/horizontal.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5683f366cae20f02b7ea7db9990a49715dbad113ff88fc5aac132e59f1484990"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060add_json\u0060 is public, takes a document from its caller (line 791) and hands it to \u0060add_node\u0060, which calls itself at line 819 (\u0060add_node\u0060) with a piece of \u0060data\u0060 (and at line 824) \u2014 and nowhere in \u0060add_node\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060add_node\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_tree.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"12465311250b00a74380f7844ef7d473414e8ef588bf4150f737fb9792c32184"}},{"ruleId":"X27","level":"warning","message":{"text":"Collection is structurally changed while it is being enumerated: \u0060self._data\u0060 is walked directly by the \u0060for\u0060 on line 1860, and line 1862 calls \u0060del self._data[\u2026]\u0060 inside the loop body \u2014 a change to the size of a dict this file builds. The loop\u0027s next step raises \u0060RuntimeError: dictionary changed size during iteration\u0060, so every pass that reaches this call ends the loop by exception and the remaining items are never seen."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widgets/_data_table.py"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1ca320d7c862babf5b61962bb01df5e2625cf411f85b8e6af6d2704b3f39ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_debug.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e983563bbbab51efa9103aec4463d8c819383bc286b0a7771c63fb61c2c46830"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_dispatch_key.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3979e278203d7dfee7c0ec436b64b844efc20b26d47dc1e5ef563240f3bff7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/_work_decorator.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"affa8d8b033415c044b4faed2ed0b3b18b0770b2823e7edbe874dd61bf60d165"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/highlight.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19f9c0ebfbf3df0409b355b4497c80bcfe61c50b9139ffcd66e99df38dedcac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/pilot.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca90abe0798654880cd8b21678c3d557ef7a574699aa6c1aeedf84553b367b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/screen.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0f01b35526a7fcf1f3d0cc23afe40559bcc8c666727e9d1c6128b35efa1d30"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/widget.py"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a09a80a655a55990a8255e3ae756cc3fb3244c5ac869754c983e9a9b2006302"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/_input_reader_windows.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a0c6c159252647fd20f450cd7f45707112ecdf1c721d571b16786f6c821484"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_driver.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c28a109549bd01eecda95393d444e3d1181aceedee88c8d8174b0bbeccf3e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/linux_inline_driver.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe926f01accd733b23c906524fa24c17e56851e34adb141effcf1e7caf2ad689"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/textual/drivers/windows_driver.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"be36bec9ed2a4a7cf99d88adf573c220c1901a78fc52833285b99da63eafcf87"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060get_content_width\u0060 returns \u00602\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":"src/textual/widgets/_button.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"78801f6037b4bd710bc5d1e7b1d0e3f94bc4d0f54b37bdf9dee4088f13476999"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"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"}]}],"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":40,"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."]}]}