{"$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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"nodes.whitespace (cyclomatic 114): nodes.whitespace has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/black/nodes.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc397c5462fc48a1bbad95a7d2e2b8e139c00ab530064f72cdca016bdec249ff"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen.normalize_invisible_parens (cyclomatic 68): linegen.normalize_invisible_parens has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"df262109f51bacb546d5dc7ab01d791829bf6a5ae505b1161175f53959589588"}},{"ruleId":"D1","level":"warning","message":{"text":"black.main (cyclomatic 59): black.main has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/black/__init__.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a8aa8f1f04848d8b10df0f660be7ea648110792d8c72ab852414e3ba7054a6"}},{"ruleId":"D1","level":"warning","message":{"text":"EmptyLineTracker._maybe_empty_lines (cyclomatic 55): EmptyLineTracker._maybe_empty_lines has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a159945fd40965c03c793d58f5d1bc4f309288467a7649d9c1c7b8f4177dc54"}},{"ruleId":"D1","level":"warning","message":{"text":"black.get_features_used (cyclomatic 53): black.get_features_used has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8e0d63afbaefd48cf6412637dbffd1b189e6208dcf947618ffd0bf8ac23c67"}},{"ruleId":"D1","level":"warning","message":{"text":"comments._generate_ignored_nodes_from_fmt_skip (cyclomatic 48): comments._generate_ignored_nodes_from_fmt_skip has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a23cf012912713e322b6dced0307d2352355d0b2c85ae203bf310b331590eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"EmptyLineTracker._maybe_empty_lines_for_class_or_def (cyclomatic 46): EmptyLineTracker._maybe_empty_lines_for_class_or_def has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f54d508c60ded9784de3b6d5143ac1a98d52c28057353f523ea1c16c31b12bf"}},{"ruleId":"D1","level":"warning","message":{"text":"lines.can_omit_invisible_parens (cyclomatic 45): lines.can_omit_invisible_parens 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/black/lines.py"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24b265d94c3b00889740a5b42232d1726d9c24a11354f101f012bda76375838"}},{"ruleId":"D1","level":"warning","message":{"text":"comments._handle_regular_fmt_block (cyclomatic 30): comments._handle_regular_fmt_block has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e83da8c447f9fa4e7be051f2bbd3558a9bc24bd0a8a58f3d2870e07342e97d4"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen.delimiter_split (cyclomatic 30): linegen.delimiter_split has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd906130852010ddd39d0cd035122218ae036048c3376e7466194c15cf4e3d0"}},{"ruleId":"D1","level":"warning","message":{"text":"lines.is_line_short_enough (cyclomatic 30): lines.is_line_short_enough has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f330b7dec979d3359aed8077c6b011342fb9075a06b38a07c09e38cfbc5d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"StringMerger._validate_msg (cyclomatic 30): StringMerger._validate_msg has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be8134b90c562f515e4ed1d6a59d8830748a9b40415f17fd8fa561f26e825ac"}},{"ruleId":"D1","level":"warning","message":{"text":"brackets.is_split_before_delimiter (cyclomatic 29): brackets.is_split_before_delimiter has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/brackets.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"635810b9ee2761df38e185cf49ee2a7679e17564ff6ffc4c835dfe0ddc0863d3"}},{"ruleId":"D1","level":"warning","message":{"text":"StringParenWrapper.do_transform (cyclomatic 29): StringParenWrapper.do_transform 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/black/trans.py"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec13c7703e527628c8b735aa84cffef022bc1862f4157160f5350f739c30d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen.maybe_make_parens_invisible_in_atom (cyclomatic 27): linegen.maybe_make_parens_invisible_in_atom has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f817cbda87f46c0499d0d50618c12f9a543297f4e4c11d3e1b14588bbd2591d"}},{"ruleId":"D1","level":"warning","message":{"text":"StringParenStripper.do_match (cyclomatic 27): StringParenStripper.do_match 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/black/trans.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"66add5e610bf684690ced7e6a986e0d381be549a4753a92440ad41b8ebd586d8"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen._first_right_hand_split (cyclomatic 26): linegen._first_right_hand_split has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eced5ea0664564b2458da40239ebb8cc2c683a35d6c9f6fa1f995e0d031ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"EmptyLineTracker.maybe_empty_lines (cyclomatic 25): EmptyLineTracker.maybe_empty_lines has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aebbe29fa10828d625b65c93f580b0a20657a57da684877e0dd0628bb90d89"}},{"ruleId":"D1","level":"warning","message":{"text":"black.get_sources (cyclomatic 24): black.get_sources 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/black/__init__.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"713d0a889541b88636a2e385784737b4122d8b75d33755a76b4ea6570626e012"}},{"ruleId":"D1","level":"warning","message":{"text":"LineGenerator.visit_power (cyclomatic 24): LineGenerator.visit_power 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/black/linegen.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"694286fb0d82716e2a46823c66e3d01e806efb73efb5911997a36b023b303173"}},{"ruleId":"D1","level":"warning","message":{"text":"concurrency.schedule_formatting (cyclomatic 23): concurrency.schedule_formatting 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/black/concurrency.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d37dcc060fd0f5af1846f708975b305a276dc829a31d357c55a3e768941e839"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen.left_hand_split (cyclomatic 22): linegen.left_hand_split 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/black/linegen.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"249b26552e352a04db1b68f515fd556c0aa2a745d71bcee76720a71cf6e06025"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen.transform_line (cyclomatic 21): linegen.transform_line 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/black/linegen.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba5c7dd4964b5c453a4f61744e9354c9b671ca6c02748acf07082f88d510ae4"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseStringSplitter._get_max_string_length (cyclomatic 21): BaseStringSplitter._get_max_string_length 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/black/trans.py"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"e234178740aedf98a3e5b21995478b944ec9623a542afeac540ec7b5588f625a"}},{"ruleId":"D1","level":"warning","message":{"text":"black.reformat_one (cyclomatic 20): black.reformat_one has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac02a58b4fb744ad4699b9589af0e7478c810d96c76746cc92511d1a07c8335d"}},{"ruleId":"D1","level":"warning","message":{"text":"LineGenerator.visit_STRING (cyclomatic 20): LineGenerator.visit_STRING has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f140724cbeeb8e31d45a19ecf3b2b06c1be4acfd950c805efae93fb2eb5438"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen.right_hand_split_with_omits (cyclomatic 20): linegen.right_hand_split_with_omits has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8a283ea01428fead0c2bdf9e8f90de519e09fb86bece68c907d848bc12931d"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen.generate_trailers_to_omit (cyclomatic 20): linegen.generate_trailers_to_omit has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07cd81e19fc01e8a433b915b166ce2a759451e46b48af7d7b7e086fc01f307f"}},{"ruleId":"D1","level":"warning","message":{"text":"ranges._convert_unchanged_line_by_line (cyclomatic 20): ranges._convert_unchanged_line_by_line has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/ranges.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb5dab19a1c351b2ddc67818115c84e65dd01ae970db2facbdfa80645cc6ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"StringSplitter.do_transform (cyclomatic 20): StringSplitter.do_transform has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"555b8fcf65000b2cf0735c44b6a17ebb4b07646b2324c4230e06c9a1bdd40c31"}},{"ruleId":"D1","level":"warning","message":{"text":"comments.generate_ignored_nodes (cyclomatic 19): comments.generate_ignored_nodes 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/black/comments.py"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf15a5283e2faefebb83d587c9aaa5de94df086ada3d6d47da2237a90910628"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen._prefer_split_rhs_oop_over_rhs (cyclomatic 19): linegen._prefer_split_rhs_oop_over_rhs has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"655fe296fe9aa25d43f3016a9dd507f2033e7cdca25876c7e59980c3ad5190b1"}},{"ruleId":"D1","level":"warning","message":{"text":"strings.normalize_string_quotes (cyclomatic 19): strings.normalize_string_quotes 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/black/strings.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefbdbe92615e68e001d9bb646f81bda844e4791f2f8817598899f0f7ab6e3cd"}},{"ruleId":"D1","level":"warning","message":{"text":"StringSplitter.do_splitter_match (cyclomatic 19): StringSplitter.do_splitter_match has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1276b276f8e43dfe0b4ed5f74183db9e7e568582a3a0faa6f04f1d425b8e1e6"}},{"ruleId":"D1","level":"warning","message":{"text":"black.read_pyproject_toml (cyclomatic 18): black.read_pyproject_toml has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"978545c868c056875a1a486c101eee212a0036619948046c52c1a225e55a019c"}},{"ruleId":"D1","level":"warning","message":{"text":"comments._handle_comment_only_fmt_block (cyclomatic 18): comments._handle_comment_only_fmt_block has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2c6fe6b6736553a232a6ce668ce0688a83f61500294ef97441f0b82970a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"linegen._maybe_split_omitting_optional_parens (cyclomatic 17): linegen._maybe_split_omitting_optional_parens 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/black/linegen.py"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"98534984471d6aa23b3f7abfb3eebaf4860fd129b2572e8cb97f95a36cc59e27"}},{"ruleId":"D1","level":"warning","message":{"text":"parsing._stringify_ast (cyclomatic 17): parsing._stringify_ast 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/black/parsing.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"718ac1c630ec392ec39a94268cb19d4614bab39d280241ec40d10feed364fd87"}},{"ruleId":"D1","level":"warning","message":{"text":"StringParenWrapper.do_splitter_match (cyclomatic 17): StringParenWrapper.do_splitter_match 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/black/trans.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"3392c0fd30a6ae6328e87b1168c3481cf22ab6043b6099b36b41e3fa69d6707a"}},{"ruleId":"D1","level":"warning","message":{"text":"files.gen_python_files (cyclomatic 16): files.gen_python_files has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/files.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0040a80b681cb55b666f1eb560dec26ac749c3a91fb110c0c93c130d300c4e69"}},{"ruleId":"D1","level":"warning","message":{"text":"Line.append (cyclomatic 16): Line.append 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/black/lines.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead3c69db6399b27ee4c2824485d05d3d5f5adac9726dc6eefa816deb07a5daa"}},{"ruleId":"D1","level":"warning","message":{"text":"strings.normalize_fstring_quotes (cyclomatic 16): strings.normalize_fstring_quotes 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/black/strings.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36bcd10827671312d6ee0d581dbdbfeff1f4bf650a632a0d20973d08a890603"}},{"ruleId":"D1","level":"warning","message":{"text":"StringMerger.do_match (cyclomatic 16): StringMerger.do_match 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/black/trans.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de7feb6db0904acf9ffdf8eff14f3e6ed24fbaf79090861cc084b94ecbc1e69"}},{"ruleId":"D2","level":"warning","message":{"text":"nodes.whitespace (cognitive 140): nodes.whitespace has cognitive complexity 140 (threshold 15). Drivers by points: if/else 49 (108 pts), boolean chains 28, ternaries 1 (4 pts) (nesting depth added 62). 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/black/nodes.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"247344be48a1d52462f947e0419c8d0c2b48f359ac209ccf47d95b68dd05eab3"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.normalize_invisible_parens (cognitive 112): linegen.normalize_invisible_parens has cognitive complexity 112 (threshold 15). Drivers by points: if/else 26 (76 pts), boolean chains 22, loops 5 (14 pts) (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"50df6cfa62136723498d1c1ac67051db9664d47d2b842336bdf1da20c5d26f20"}},{"ruleId":"D2","level":"warning","message":{"text":"black.main (cognitive 94): black.main has cognitive complexity 94 (threshold 15). Drivers by points: if/else 40 (64 pts), boolean chains 15, error handling 3 (6 pts), loops 2 (6 pts), ternaries 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eef69bb29c92ea7fa1faa836455bd532d46601693b4aefc520d9f164d5f999"}},{"ruleId":"D2","level":"warning","message":{"text":"comments._generate_ignored_nodes_from_fmt_skip (cognitive 88): comments._generate_ignored_nodes_from_fmt_skip has cognitive complexity 88 (threshold 15). Drivers by points: if/else 20 (51 pts), boolean chains 17, loops 7 (17 pts), ternaries 1 (3 pts) (nesting depth added 43). 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/black/comments.py"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1b7be8e8843c0fc8e656e9ad95e03da9502c496d797f2f643a18ef129dfe34"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyLineTracker._maybe_empty_lines (cognitive 70): EmptyLineTracker._maybe_empty_lines has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (34 pts), boolean chains 24, ternaries 3 (11 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"367781cf1779274152a83a2a4c6bd98b20b6f32e91f312dc7b0a0e39a15b90c1"}},{"ruleId":"D2","level":"warning","message":{"text":"lines.can_omit_invisible_parens (cognitive 69): lines.can_omit_invisible_parens has cognitive complexity 69 (threshold 15). Drivers by points: if/else 26 (44 pts), boolean chains 15, loops 4 (10 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7ad9577f9f0499275c2efd2f896607c45440944709019e454797925c986bca"}},{"ruleId":"D2","level":"warning","message":{"text":"black.get_features_used (cognitive 68): black.get_features_used has cognitive complexity 68 (threshold 15). Drivers by points: if/else 14 (41 pts), boolean chains 18, loops 3 (9 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0054ada123708f655c83048805ac3385b5a958a25b264354c7de3b703894074"}},{"ruleId":"D2","level":"warning","message":{"text":"LineGenerator.visit_power (cognitive 68): LineGenerator.visit_power has cognitive complexity 68 (threshold 15). Drivers by points: if/else 12 (57 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 46). 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/black/linegen.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2cdf57b8aea20a4db04618ab6b6fcb13556f1ef9f1e63fe6866db1ef2b7306"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyLineTracker._maybe_empty_lines_for_class_or_def (cognitive 58): EmptyLineTracker._maybe_empty_lines_for_class_or_def has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 19, 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/black/lines.py"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"419dc7c61e09fcf664af1fdc5a15b6840f15e6848b98d3fd0b55e34c0cd40140"}},{"ruleId":"D2","level":"warning","message":{"text":"black.get_sources (cognitive 50): black.get_sources has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff30ba129e206d3ea5a709ebd594930f980d434b9b621d85faf4571cf6f2d161"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen._first_right_hand_split (cognitive 50): linegen._first_right_hand_split has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 8, ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 23). 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/black/linegen.py"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"022f43e1eb6073d9db9a9769cdc006fce875ac5ef4c5787ac2eb44013e1578f7"}},{"ruleId":"D2","level":"warning","message":{"text":"lines.is_line_short_enough (cognitive 50): lines.is_line_short_enough has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 10, loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6809eacc4a5f0d3e405f5977ee9c80ef5cd9e066c22b3351f433d3cbe6852b"}},{"ruleId":"D2","level":"warning","message":{"text":"comments.generate_ignored_nodes (cognitive 46): comments.generate_ignored_nodes has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (38 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7702bb2d6ebd70a919bc55cc7741fbb6868b1974883013d067922ba7451f0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"StringMerger._validate_msg (cognitive 46): StringMerger._validate_msg has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"872d2e82d125ea31f7d99118cc7e5a588c7de74cdbbe6e2d9bff556294d432ab"}},{"ruleId":"D2","level":"warning","message":{"text":"comments._handle_regular_fmt_block (cognitive 45): comments._handle_regular_fmt_block has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 8, ternaries 4 (8 pts), loops 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d924dd97caedfe5e673e42ecde2084ebaeac6d169ae51495a857cd807d52b82"}},{"ruleId":"D2","level":"warning","message":{"text":"LineGenerator.visit_STRING (cognitive 44): LineGenerator.visit_STRING has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (35 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8c93d65fa5ef8410837dfbc1911a1504838132761c4b978b16d6c43627b959"}},{"ruleId":"D2","level":"warning","message":{"text":"ranges._convert_unchanged_line_by_line (cognitive 42): ranges._convert_unchanged_line_by_line has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (10 pts), boolean chains 5 (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/black/ranges.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe58583c37dcfc48609c3daeecc43c35a92e4adf076e2d1e8eb5b83a710898d"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParenWrapper.do_transform (cognitive 42): StringParenWrapper.do_transform has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 6, loops 3 (5 pts), ternaries 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/black/trans.py"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"101183d898579fe1dc37737c2b3e91ce6a6084aa78c77905b0de7a29adf123d6"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParenStripper.do_match (cognitive 41): StringParenStripper.do_match has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"381d56c053339d82cd3488f9dea349d49a1d80eec5bff425bf2753ee39a4b00f"}},{"ruleId":"D2","level":"warning","message":{"text":"blackd.parse_python_variant_header (cognitive 40): blackd.parse_python_variant_header has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), ternaries 2 (8 pts), error handling 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/blackd/__init__.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa8a61a517de45fedd4795cbbb1ec2c7d30b154eb26945ae09c9a0cb18c366"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.delimiter_split (cognitive 39): linegen.delimiter_split has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 11, error handling 2 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"03072bd728333ca36e5fbaa0e7aa0e36f74651084990cb05c2d9aa7ed7b6e113"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.generate_trailers_to_omit (cognitive 38): linegen.generate_trailers_to_omit has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 2 (7 pts), boolean chains 4, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9c559072e1ca798978f1c358cb13e440440c8b7922cc118213f450a59901f1"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseStringSplitter._get_max_string_length (cognitive 38): BaseStringSplitter._get_max_string_length has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 5, loops 2 (4 pts) (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/black/trans.py"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b0cbf5c527cde13542f7c88976ab4dfe8bfc9c8acc256ebc6941c94c953ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.left_hand_split (cognitive 37): linegen.left_hand_split has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 7, loops 3 (4 pts), ternaries 1 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cf933273801d4f15e4e8f4631c2a37553e1b010637356693de809990aeae13"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.right_hand_split_with_omits (cognitive 36): linegen.right_hand_split_with_omits has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 6, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9caee2ffe7675d83f98161087d14f0f3ea4b7a600576dfcf26b79682fa6739d"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.maybe_make_parens_invisible_in_atom (cognitive 34): linegen.maybe_make_parens_invisible_in_atom has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 17, if/else 9 (17 pts) (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7a5101cc1b29ea1078919188d157676a9a124e7a356761eabb5b2ca8ab26c4"}},{"ruleId":"D2","level":"warning","message":{"text":"StringSplitter.do_transform (cognitive 34): StringSplitter.do_transform has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d01ffb18b51ac693af636468d0dee1206194852994735a8349471f45c61dd98"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParenWrapper._assign_match (cognitive 34): StringParenWrapper._assign_match has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (7 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a1a9cd5d8db559247c1bab65fd724864cd352af254ecfb68c97d49183c42c5"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParenWrapper._dict_or_lambda_match (cognitive 34): StringParenWrapper._dict_or_lambda_match has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (7 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"287ade7d1c78ada1fb2d5beeb7d9544581a1cfd1635a8804adee29b900b081e0"}},{"ruleId":"D2","level":"warning","message":{"text":"concurrency.schedule_formatting (cognitive 32): concurrency.schedule_formatting has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (4 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/concurrency.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"638b87f129c74bd98fd84abe89f8892730f6840fa7e7967d8f141608779d4169"}},{"ruleId":"D2","level":"warning","message":{"text":"StringMerger.do_match (cognitive 31): StringMerger.do_match has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (10 pts), boolean chains 5 (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/black/trans.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ce7b78447867b1437d63ecea6bd2b63ed8ca472ca4d8af7582e1c454d26d30"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParenWrapper.do_splitter_match (cognitive 30): StringParenWrapper.do_splitter_match has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1226593e3e7b45b004314dfe272fd70f68773412664279ebe134f988835c31"}},{"ruleId":"D2","level":"warning","message":{"text":"brackets.is_split_before_delimiter (cognitive 29): brackets.is_split_before_delimiter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 14 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/brackets.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b438ade636c200e39cfe5c0b875616a6ef8f400bead671caa32b813dd2cbec"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.transform_line (cognitive 29): linegen.transform_line has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"472cf3ab1642e321062dc85fd784592ef094bc8dea69e4207d6fcc80d417d8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"parsing._stringify_ast (cognitive 29): parsing._stringify_ast has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (9 pts), boolean chains 4, error handling 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/black/parsing.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f547e4da80092a87cb81e4a8ac6a634c762b43a0764804b611d68237f700af9a"}},{"ruleId":"D2","level":"warning","message":{"text":"black.reformat_one (cognitive 28): black.reformat_one has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f317055bbaaa84f24e0f2c0419852a93e78cd8e6f32025ebe8f9dd0f81931ce"}},{"ruleId":"D2","level":"warning","message":{"text":"files.gen_python_files (cognitive 28): files.gen_python_files has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/files.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e07079fc76f6a40337dff3d18dd10582f17136a3e69f5ce39ac1375c6cab7cf"}},{"ruleId":"D2","level":"warning","message":{"text":"trans.iter_fexpr_spans (cognitive 28): trans.iter_fexpr_spans has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeb5caf61a5c42adc61ca6483bb05bf519ee3d1f98a147e51d9c392fcad2c88"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyLineTracker.maybe_empty_lines (cognitive 26): EmptyLineTracker.maybe_empty_lines has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 15, if/else 6 (10 pts), ternaries 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5088582e35de3149f8649ef07fe98c4192774f3c73f5b122587b14e327f93c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"comments.convert_one_fmt_off_pair (cognitive 25): comments.convert_one_fmt_off_pair has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56d62a639db5545c5b455e4ba7b7b32298e0d8f56f34de67eb3bdfcd33aee13"}},{"ruleId":"D2","level":"warning","message":{"text":"strings.normalize_string_quotes (cognitive 24): strings.normalize_string_quotes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/strings.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9542aeac0a9bdd2099ae51d8abceb9e5dc9d4643c6e73ea77edc60ce43f52c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"comments._is_kept_as_text (cognitive 22): comments._is_kept_as_text has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02afa28cb4ed0bb58d4fdf87601f733e3123ff8a2261bd825e2052747a2fc4f"}},{"ruleId":"D2","level":"warning","message":{"text":"comments._handle_comment_only_fmt_block (cognitive 21): comments._handle_comment_only_fmt_block has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/comments.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5976b9e8075bd466634ab3fcfe6ab88189a2f0babfbcdd0d13bd498f268fdba8"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen._prefer_split_rhs_oop_over_rhs (cognitive 21): linegen._prefer_split_rhs_oop_over_rhs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef69e67ebbcfc3b3c7948cb51b4ecd521925c815550d042472c2a0bc9fcf839f"}},{"ruleId":"D2","level":"warning","message":{"text":"lines.can_be_split (cognitive 21): lines.can_be_split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, 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/black/lines.py"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"39300206cae58bd17f51c4bcac9ff1d3e8313b62691627fb0083a2d1d4c7d5cc"}},{"ruleId":"D2","level":"warning","message":{"text":"StringMerger._merge_one_string_group (cognitive 21): StringMerger._merge_one_string_group has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"07239445dd8c14a901f324efef5958afd59350e83789171a2d5a0c0aeefeb1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParenWrapper._assert_match (cognitive 21): StringParenWrapper._assert_match has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (2 pts) (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/black/trans.py"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"400691ce3e9e5bc2269aa8a04b6161dd7b24c422384dbaae2e703904fd9ae1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"black.read_pyproject_toml (cognitive 20): black.read_pyproject_toml has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2918ee30c092664bf40165910122c2b5a8a7d0f96e0be84f0de7ae6dc978afdf"}},{"ruleId":"D2","level":"warning","message":{"text":"comments.list_comments (cognitive 20): comments.list_comments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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/black/comments.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"537f88a7779b79b9efc13ddd509045b5cf13340590ba552fff5cce91e381dac7"}},{"ruleId":"D2","level":"warning","message":{"text":"comments._get_compound_statement_header (cognitive 20): comments._get_compound_statement_header has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, 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/black/comments.py"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30aadf1c53d4eef933e33470dfb3dc123e0e53998fe5cf091a9b6cb2b83365d"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen.bracket_split_build_line (cognitive 20): linegen.bracket_split_build_line has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 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/black/linegen.py"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d375d1d11c7d76b20b96d2daba8d937f8f6b42e9253a649ea98394a38938e33"}},{"ruleId":"D2","level":"warning","message":{"text":"ranges.adjusted_lines (cognitive 20): ranges.adjusted_lines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/ranges.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ce84eb9e13c9214ee86b2ce8c4342dc6a6321c4c178534d86885bcf1b3c43e"}},{"ruleId":"D2","level":"warning","message":{"text":"StringParenWrapper._binary_match (cognitive 20): StringParenWrapper._binary_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af9338bd2fc2a991ae844e696dcf6877ecfb506a15f3d0b8864eda0d8cc28df"}},{"ruleId":"D2","level":"warning","message":{"text":"BracketTracker.mark (cognitive 19): BracketTracker.mark has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, 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/black/brackets.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad734c0afcde7dfcfbf9efb1eaab81b9bfb9fdceb1c03deb92790c41ebd22fa"}},{"ruleId":"D2","level":"warning","message":{"text":"LineGenerator.visit_STANDALONE_COMMENT (cognitive 19): LineGenerator.visit_STANDALONE_COMMENT has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73a4ce3aa9f900cf07236a18d2c6289045eab5b2f41290d48e413239c001cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"LineGenerator.visit_simple_stmt (cognitive 18): LineGenerator.visit_simple_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"463d3a352eae9fd498ba862015c989dbc1692ce15baf52386869589967e9d604"}},{"ruleId":"D2","level":"warning","message":{"text":"LineGenerator.visit_comp_for (cognitive 18): LineGenerator.visit_comp_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"869a743ce45868a07790a3f768a32ce7b920f7379183e81974421b62248448d0"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen._maybe_split_omitting_optional_parens (cognitive 18): linegen._maybe_split_omitting_optional_parens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"36019c7b34023b0b5eaa74f3f25bd496996a4dbca9f74efcde7d6f459d4fe34a"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyLineTracker._if_stmt_branch_has_func_named (cognitive 18): EmptyLineTracker._if_stmt_branch_has_func_named has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b475e9c3a39273dd4d668ef76ea362d0ec6f836888182fee6d5361d8cdac0a32"}},{"ruleId":"D2","level":"warning","message":{"text":"strings.normalize_fstring_quotes (cognitive 18): strings.normalize_fstring_quotes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/strings.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b3c408c398c773d2a656e508c28a95b74a40a4e390c247f1677f103b4587fe"}},{"ruleId":"D2","level":"warning","message":{"text":"black.get_future_imports (cognitive 17): black.get_future_imports has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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/black/__init__.py"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"449232aa227bfab57ee0c846c10bfa967d695460f3fbadb9411f90bc21406fec"}},{"ruleId":"D2","level":"warning","message":{"text":"concurrency.reformat_many (cognitive 17): concurrency.reformat_many has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/concurrency.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be361a6722af2e3f0edf1a7b919800053f4a26e40d18126ef4a574fd4edc6d8"}},{"ruleId":"D2","level":"warning","message":{"text":"linegen._can_defer_dict_key_delimiter_to_rhs (cognitive 17): linegen._can_defer_dict_key_delimiter_to_rhs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa74ebaf259ea1fceb0d534bf775335ee20cf5f08612531b26f47234ca2fc682"}},{"ruleId":"D2","level":"warning","message":{"text":"Line.append (cognitive 17): Line.append has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a037c1c6a60b1567c14089a5f28136862171cd7cb65860af6a3450051477d5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"nodes.is_one_sequence_between (cognitive 17): nodes.is_one_sequence_between has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 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/black/nodes.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c82f6823d94fffac6237e840decec6fdd5bd1c380d8234f6873ed301679ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ranges._calculate_lines_mappings (cognitive 17): ranges._calculate_lines_mappings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 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/black/ranges.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"484e0fb2c2edfa68eb6db3bc6a77e3feecb94937b9732642b6403e97e9489985"}},{"ruleId":"D2","level":"warning","message":{"text":"StringSplitter.do_splitter_match (cognitive 17): StringSplitter.do_splitter_match has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2c462eb302be77f8b1fe02ae52600528b3be5c226a8a5cf11454691e0c1e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Line.contains_uncollapsable_type_comments (cognitive 16): Line.contains_uncollapsable_type_comments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b844f35b6c1c56b135cc2eea66c3a4013e5c52452e662325c4534419be8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ranges._get_line_range (cognitive 16): ranges._get_line_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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/black/ranges.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f372758d755497e4698e3c280a5b02165ad90fea83b4def03e8a8f1be6d4cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"StringMerger._merge_string_group (cognitive 16): StringMerger._merge_string_group has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"358e5596c3bc20fdc5e7643c978a17ccfeba316e1ea7ad18531dc74ef4f8baf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: black/linegen.py: FileTooLong \u2014 2121 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1621 over it, 4.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a817e2959e7759bdaf49c4e43e867ff6d4a0cfcbd27bc6edf8547d20bb85b33c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: black/__init__.py: FileTooLong \u2014 1428 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 928 over it, 2.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/black/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f02b9c6b0941012d720a22b6ec0dfe3afd93167b271c6068ac2fda59d3cdfdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: black/lines.py: FileTooLong \u2014 1259 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 759 over it, 2.52\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/black/lines.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87930d381265079e0e780acb694e87aff868cb88ecfd94349f9c54131a6bfe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: black/trans.py: FileTooLong \u2014 1259 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 759 over it, 2.52\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/black/trans.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b46b27224060fee0150e5e917f73807cf3e4caefd92ea83652db1c603263a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: black/nodes.py: FileTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 253 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/nodes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc00079ba2a517504bf104e5ba304df158dbff12b78def666fc90f5882af03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/black/trans.py:2298-2347 | src/black/trans.py:2401-2442 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/black/trans.py"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"385b63e6e7008f81962beae05897cd94faa758ba58e44f93d54a8699e7c99a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/black/linegen.py:728-744 | src/black/linegen.py:749-765 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d02eccf714fa33c9a4d4d9cb28bad549266360c9c2b28de8b80cce0e2b645f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/black/trans.py:2184-2205 | src/black/trans.py:2236-2259 \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/black/trans.py"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb92220c7e7aa8696f1eb290b8661c46815b3dba6dfbc685c333b2081eae4cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/black/linegen.py:2238-2248 | src/black/linegen.py:2269-2279 \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/black/linegen.py"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f19cf68a2f30ca134d0700b2a2945685e4c970087e6f7b8ac0bd286df99537c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/black/linegen.py:1601-1610 | src/black/lines.py:313-322 \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/black/linegen.py"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"2007cc91901ccb3d4bb4417316027dd8acfe2c704c5e2d2aa5cbd337e6044f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/black/trans.py:2318-2332 | src/black/trans.py:2418-2432 \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/black/trans.py"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf864110cccf3b399b3b6e84e606c30fb780fc6c7cc82f6a9d09f56e54f0a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/black/linegen.py:728-737 | src/black/linegen.py:749-758 \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/black/linegen.py:728\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/black/linegen.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"c361e20f3abb4567a20a6f36c3faa15255dba22d2b7a01594a230c62cda48a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/black/parsing.py:100-109 | src/black/parsing.py:119-128 \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/black/parsing.py:100\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/black/parsing.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eed55c14414e81e95972b3a65d0dab9c337b080db2319e1c128d206b9e2193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): scripts/release.py:200-220 | scripts/release.py:223-241 \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":"scripts/release.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4716496b89d194f5134625eb9ee49b64f6f6a4289b7e2b0518b753007cf60b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/black/linegen.py: src/black/linegen.py changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in linegen.normalize_invisible_parens at line 2394. 21 of those changes were fix/bug commits, and the other 33 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:34:44 -07:00\u0027 --until=\u00272026-11-13 15:34:44 -07:00\u0027 --full-history --no-merges -- src/black/linegen.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/linegen.py"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"619dc302e1ed8aed2494a5bbfe3b7319e43cd2f4f4698256ede57d69b5d98cd4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/black/__init__.py: src/black/__init__.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in black.main at line 563. 4 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:34:44 -07:00\u0027 --until=\u00272026-11-13 15:34:44 -07:00\u0027 --full-history --no-merges -- src/black/__init__.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/__init__.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e17059719e3df8ba42fceca0d733a8727f4bc4ded10f3a367a526bdb55c5ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/black/lines.py: src/black/lines.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in EmptyLineTracker._maybe_empty_lines at line 1018. 8 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:34:44 -07:00\u0027 --until=\u00272026-11-13 15:34:44 -07:00\u0027 --full-history --no-merges -- src/black/lines.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/lines.py"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f93f43cae597cd1a441e8fb5a94a0ddd570a2449b8399acfc4ad7c43385d921"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/black/trans.py: src/black/trans.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in StringParenWrapper.do_transform at line 2470. 5 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:34:44 -07:00\u0027 --until=\u00272026-11-13 15:34:44 -07:00\u0027 --full-history --no-merges -- src/black/trans.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d9472a66e08c4b63d6bd20b7bebebbe576f2465368fb365875138e3008159"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/black/ranges.py: src/black/ranges.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ranges._convert_unchanged_line_by_line at line 394. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:34:44 -07:00\u0027 --until=\u00272026-11-13 15:34:44 -07:00\u0027 --full-history --no-merges -- src/black/ranges.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/ranges.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"82667580627ad6611db8ac0b93cfcd8047a16600f51afee5f005c334cccd188f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/black/concurrency.py: src/black/concurrency.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in concurrency.schedule_formatting at line 179. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:34:44 -07:00\u0027 --until=\u00272026-11-13 15:34:44 -07:00\u0027 --full-history --no-merges -- src/black/concurrency.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/concurrency.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2260bb5dd117b11baad5d1818a00a614f3083cc982419194f688a7fdcf9e29ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: action/main.py: action/main.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is main.read_version_specifier_from_pyproject at line 52), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CGitHub Action: fix venv working dir (#5611)\u201D; \u201CFix GitHub Action crash on dependency-group includes (#5479)\u201D; \u201CSupport version specifiers in \u0060tool.black.required-version\u0060 for GitHub Action (fixes #4406) (#5399)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:34:44 -07:00\u0027 --until=\u00272026-11-13 15:34:44 -07:00\u0027 --full-history --no-merges -- action/main.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"action/main.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f653c860e3098ffe84011b64d8e5d9fd7993dbe41cb1bdd0308ed8f37fe3e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Some comment about why this function is crap but still in production. \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/data/cases/comments.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"153ce7867d24a6cdc00fff01ca229a38212f48d18aa3043f07866ed934e98b48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: \\r\\n? \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/data/cases/comments2.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d313ffb3f5940f1bec85b8c73aba635f37bae21c45c0170cf952ffa5de81007"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: \\r\\n? \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/data/cases/comments2.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee6b25fdbef99e94de2c70aee9a837c775e2c2ffccd8c9eb2a6aa64c98708a9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # xxx \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/data/cases/fmtonoff_comment_only_with.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e892847e4cbc84807e6563f0a68641a5ead0485024f6c2a243217608364c65e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # xxx \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/data/cases/fmtonoff_comment_only_with.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"56442c6912d636daa3bbc5f703a698437982628ba7f087bf33b029bce4b8c9ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Uncomment Implementation to format f-string children \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/black/linegen.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b07f7ffaea4a3d114263d6d9922640980b51151fadaea030838e5059a6d4f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support Python 4\u002B ;) \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/black/parsing.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6388f382ed1fe0f13e2f00f2425717d0022e3f66d5f05faf2aabb3fda30d0b83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: only used in currently disabled f-string formatting \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/black/strings.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b0ac0b159c25ea3b7c23e469810afa9a9272a049e089e7822e5b519458f297"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # HACK: The following \u0027if\u0027 statement is a hack to fix the custom \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/black/trans.py"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ef25328425864526cb6f6feca47089640ff828f058bac01eed6d45bdd6c8e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove after a while since this is deprecated in favour of SRC \u002B OPTIONS. \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":"action/main.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f173d1c58ac5959bd584f4a7393fa75bc610b10c56c298c35607b69e6fdc2e72"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyproject.toml\u0060 makes this repository a deployable product (line 110)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 85 % of calls cross a namespace and only 56 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c853ff8320125b57fde4428c571defcbb38303f397589364c93b47758813657d"},"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":"82667b3290a4c2178564ad6b0f7b23078fed0de824fb2cb1f475e1eebebcdb21"},"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":"d794e2ec4399b89240e65b56e45547340e684c33612166f84fce82bce89cd3da"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4efc3e89746d62aacfeb74b46c3e3aacaa5326d86d7217b50d2ed47b345a19ed"},"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":"b0e972ff5f185054848ef6766ace8626530f03d3521d71f4e0f88160c601842e"},"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":"a72d110b685ed90877ddf007473a192590c29386ec9c9b9c574204bcb9abb859"},"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":"e5f17a0179204d56e0d05a765ba75280e15d0ab06cfbfbf225c81ebf792b2a00"},"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":"95c9c3c1493824938377d59964201bdbc1d3902af06e81b33c954867286f9130"},"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":"4a91d3774746cff798305e04a251863e156474679daad416aa216c7e61717bba"},"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":"b32b89726b382607c910b1e5ee0e69cba7b9c4fd49bd118caa21b30769701559"},"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":"80235a7b18658d8d786af3862932c2d89f6d05d59e5c495fe291e5b7712b5abd"},"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":"dcd623fd99ce869d503bd69024f3787c8e56ca4a4072a72cc3b159fdeed6b989"},"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":"e33decc9c3e8d828fdd1928939be68174670039e4328ef438be888fa2f8109f4"},"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":"6517d92340d80689ca3b468cdd36aaabb112acf33a08932a9ac9f19605599422"},"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":"ab8ce016c05617d2bea946f803bbeb3700de85a9611a8808cd4bc113313a14a3"},"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":"89dcbe293b10e8c9c5c7873b5343c40b0d69535e8fffa4304aa4bdef37d59a7e"},"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":"e65596f2177e54bb0282e858a13201970e2d22972f731b5cd7957e4beb4a9b7a"},"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":"2de2472448f6fc3a60f7c03d08a8fd2f5b476a1cfa723ef00fc841268147fe60"},"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":"4aff21f3245703b38c7ce5c96ed5bbb0fae301858ce0a0a5b1a71803b0dcdd9c"},"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":"205f5797aef45b9cfb400a1d413c34b3249131357fd442092c491d8717fb40ca"},"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":"3b9a37e68389ff141c13fc58f74eb680fb2093f375e050c6009ad53cd9f95d18"},"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":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62ba3f391b97d680ac34e630794a6a7fc0f3b16bd44bab9e323085ff4fa2c944"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ff1ee9dd5615e2d512c1b5a7eb9a731208830cdc6ec1c07d8913d2a5c081e3c"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03400874d601518163011eed910f9aa5e00eb019cf0566ef4de3c1acc82a453a"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bb6012d51a83b80a5187734be3dbab8f8958b97cc0ead1c5175ed7f11e12c3d"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b80dbffb56afc2216e6904a3ca349a6fc6f6bdc6882349d0e2ac745035356d6f"},"taxa":[{"id":"CWE-1357","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d15df5171d54d9a3cfe919193b940b95eb1db599610449c8b68164e072da6651"},"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":"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":"profiling/mix_huge.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f494247a1c58cc1c0d8fa425c29832687d6ee060d23da3674bee64adaadbc647"}},{"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":"profiling/list_huge.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa66e895939e6b0b173ccebffa307f344f74937e3407f45da71cd9fad4245cf"}},{"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":"profiling/mix_big.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdaa66fd38b10501cb2c2941cd3e195a2fad13ec8e3528fa7f3398bbfc3d8e8"}},{"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":"profiling/list_big.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1353402da17031352fe06be131321d7800718e6c9fae160460fd304cb886c2f2"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 2 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: profiling/mix_small.py, scripts/generate_schema.py (6 orphaned of 29 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; 29 of the 43 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":"profiling/mix_small.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f31fd8c68a33e03478ffecc0b6c56f199e64a7587fa14e78f99e8449570bc05"}},{"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":"scripts/generate_schema.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f196b0f28321c4e3324bc7c6f3446d1b49c3589950c6a104dc4c67932d65fe21"}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"C2","level":"note","message":{"text":"Thin authorization enforcement: Only 1 place(s) refuse an unauthorized caller \u2014 too few to demonstrate default-deny across handlers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1240e406e864a89e38d5e3fa370dee11971db94808c3db2fda9b41bf2e5b8efb"}},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 13 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/changelog.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060aiohttp.ClientSession(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/blackd/client.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b6a0d608fdd30997b245ad29e6b2a6551bc52929252bd0b9fb859bffdb90d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060max_delimiter_priority\u0060 returns \u00600\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/black/brackets.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e733e158f514f2d2c15907d40ef5082d36952617425f8c0414e7eb69fc927997"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":32,"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."]}]}