{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"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":"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":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"strip_url_params.strip_url_params1 (cyclomatic 20): strip_url_params.strip_url_params1 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":"algorithms/string/strip_url_params.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b3434579d606c963dc76d5d2ae7115cb464cbd96371b6035d3c486b573e9ba"}},{"ruleId":"D1","level":"warning","message":{"text":"RBTree.delete_fixup (cyclomatic 18): RBTree.delete_fixup has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/data_structures/red_black_tree.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ecc6518e71a86bbcf4c5986cbd81902f1de6be7df802db6a250cd974e53911"}},{"ruleId":"D1","level":"warning","message":{"text":"bst_validate_bst.validate_bst (cyclomatic 16): bst_validate_bst.validate_bst 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":"algorithms/tree/bst_validate_bst.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a0c16c6a092d543eb5c0391e3216b6b1991535057b870b5faafe70b60015c4"}},{"ruleId":"D2","level":"warning","message":{"text":"strip_url_params.strip_url_params1 (cognitive 72): strip_url_params.strip_url_params1 has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (64 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 52). 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":"algorithms/string/strip_url_params.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf65f06b678474d2db964de05f53ff648ccd99c4e7b38dd300fea1698db4af61"}},{"ruleId":"D2","level":"warning","message":{"text":"RBTree.delete_fixup (cognitive 35): RBTree.delete_fixup has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 9, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/data_structures/red_black_tree.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d5b95fc58c41f0823ded5ab5e33678f8812d59f24202311879dedbdb845db3"}},{"ruleId":"D2","level":"warning","message":{"text":"text_justification.text_justification (cognitive 30): text_justification.text_justification has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/string/text_justification.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf0a03a24666ec25614aa0f66373d89d7f08ec4265c72c298e90de779f3d580"}},{"ruleId":"D2","level":"warning","message":{"text":"sudoku_validator.valid_solution_hashtable (cognitive 28): sudoku_validator.valid_solution_hashtable has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/matrix/sudoku_validator.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3748a2e6f84af2b15953358deb43113c2e73a9871dde1edced9900e1ea35f7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"count_islands_bfs.count_islands (cognitive 23): count_islands_bfs.count_islands has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/count_islands_bfs.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d45b9671e4cdf059626b4b34eecc43b32fb10e20c97a08709d0d4e5003de9"}},{"ruleId":"D2","level":"warning","message":{"text":"cycle_sort.cycle_sort (cognitive 22): cycle_sort.cycle_sort has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 3 (9 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/sorting/cycle_sort.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a9a238b6750a97e1290dc9a1e6e1d1de33365573a172546e19921e32de7acc"}},{"ruleId":"D2","level":"warning","message":{"text":"bellman_ford.bellman_ford_paths (cognitive 21): bellman_ford.bellman_ford_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/bellman_ford.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb30383beb29ada0b940c7f88d262a7bc478b7b0bfcaaeca41263c1e3489991"}},{"ruleId":"D2","level":"warning","message":{"text":"topological_sort_dfs.top_sort (cognitive 21): topological_sort_dfs.top_sort has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/topological_sort_dfs.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1059b813e1b6ab8737959c3287e0abf4a5c41f3cfe7a58c6af8c699ddc4047c2"}},{"ruleId":"D2","level":"warning","message":{"text":"bst_validate_bst.validate_bst (cognitive 21): bst_validate_bst.validate_bst has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 4, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/tree/bst_validate_bst.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f83e91f975fb8a72364c66c735e020b62342ac3ea88859799f67ac68470c36"}},{"ruleId":"D2","level":"warning","message":{"text":"three_sum.three_sum (cognitive 20): three_sum.three_sum has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/array/three_sum.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f15a3076e9ed2337282f776e33cd0aadecb898cf80f0f0a84a309bf71719e3"}},{"ruleId":"D2","level":"warning","message":{"text":"maximum_flow_bfs.maximum_flow_bfs (cognitive 20): maximum_flow_bfs.maximum_flow_bfs has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/maximum_flow_bfs.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0279688cbd7cd4041459e050c7c9d806206236c14798b4e7a541f52ba2aa2e"}},{"ruleId":"D2","level":"warning","message":{"text":"maximum_flow_dfs.maximum_flow_dfs (cognitive 20): maximum_flow_dfs.maximum_flow_dfs has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/maximum_flow_dfs.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c1486afd9457b4e57c71b7282098eeee8a8afb93cb9a311a73e07466f1febf"}},{"ruleId":"D2","level":"warning","message":{"text":"word_ladder.ladder_length (cognitive 20): word_ladder.ladder_length 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":"algorithms/graph/word_ladder.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8d11e8ea7903e419df0e82a1b127bbb49069127afb7c63f30736a54f1b476b"}},{"ruleId":"D2","level":"warning","message":{"text":"longest_palindromic_subsequence.longest_palindromic_subsequence (cognitive 20): longest_palindromic_subsequence.longest_palindromic_subsequence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/map/longest_palindromic_subsequence.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b6ea57be3426c48b553c8f1b09d1c4030bbd743b86c1b3cbdc0b822f310498"}},{"ruleId":"D2","level":"warning","message":{"text":"skyline.get_skyline (cognitive 19): skyline.get_skyline has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, loops 3 (7 pts), if/else 3 (5 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":"algorithms/heap/skyline.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a143d4f7cadef758aa12e0d628c238c1d33f999c6ad341bf933d6a0d7699bb"}},{"ruleId":"D2","level":"warning","message":{"text":"is_palindrome.is_palindrome_dict (cognitive 19): is_palindrome.is_palindrome_dict has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/linked_list/is_palindrome.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"755c50a6dfa7a59282584c05e9a0b336383d61ef0a32d5d5e6d3307d10f48756"}},{"ruleId":"D2","level":"warning","message":{"text":"sort_matrix_diagonally.sort_diagonally (cognitive 19): sort_matrix_diagonally.sort_diagonally has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/matrix/sort_matrix_diagonally.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaff5348042813ea0e3fa0ea497e696daf90bf46f0d4351734d0329d3d36cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"breaking_bad.bracket (cognitive 19): breaking_bad.bracket has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (9 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":"algorithms/string/breaking_bad.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2dc1c1dfe2ee8aa755aade77a6e22613cc9f7394ea0005a9abaa1d7072ae6c"}},{"ruleId":"D2","level":"warning","message":{"text":"maximum_flow.edmonds_karp (cognitive 18): maximum_flow.edmonds_karp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/maximum_flow.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a980bc59e6a3e202a6c7614fd4b3b2b8e72d3240e687013354391666bff83"}},{"ruleId":"D2","level":"warning","message":{"text":"intersection.intersection (cognitive 18): intersection.intersection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/linked_list/intersection.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ddbdb7ff317446d0bb78345be2f0ae3c4782e9f32afac5056f0909fc9e91c7"}},{"ruleId":"D2","level":"warning","message":{"text":"sparse_mul.sparse_multiply (cognitive 18): sparse_mul.sparse_multiply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 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":"algorithms/matrix/sparse_mul.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7a2d30421e336e87a9659bf0a7e9f3f1683365446c7c3bbfcba4bdefe8682d"}},{"ruleId":"D2","level":"warning","message":{"text":"spiral_traversal.spiral_traversal (cognitive 17): spiral_traversal.spiral_traversal has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/matrix/spiral_traversal.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4377f22462cad4745a1fca8c64fe7437ffbf6e800f1df02793f1f713b7099c8"}},{"ruleId":"D2","level":"warning","message":{"text":"bellman_ford.bellman_ford (cognitive 16): bellman_ford.bellman_ford has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 2 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/bellman_ford.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16bbfd709cad514ea523bb2340fa64b3fe2e46fb474e12ce1ec95b9f43a019d"}},{"ruleId":"D2","level":"warning","message":{"text":"check_bipartite.check_bipartite (cognitive 16): check_bipartite.check_bipartite has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 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":"algorithms/graph/check_bipartite.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21c24d434744ac61c27b0841fedf79c44ae9dc61238665ca64106aa6791ff56"}},{"ruleId":"D2","level":"warning","message":{"text":"dijkstra_heapq.dijkstra (cognitive 16): dijkstra_heapq.dijkstra has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), ternaries 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/dijkstra_heapq.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b476c7838eb0d3021409daeeaa921fd82f2d210e885266f052a2dc4494e7591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201326 lines \u00D7 2): algorithms/math/diffie_hellman_key_exchange.py:27-46 | algorithms/math/prime_check.py:18-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/math/diffie_hellman_key_exchange.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c051586178704bb6093221cfac7cf0d0dcc750d6ec403c0b0c530c72547f0d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201325 lines \u00D7 2): algorithms/math/extended_gcd.py:18-42 | algorithms/math/modular_inverse.py:18-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/math/extended_gcd.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"55657c6277a485c7f6ef5b92fd0a2591d68cc6b53f1eec91032ad99fe0da4c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): algorithms/math/generate_strobogrammtic.py:34-56 | algorithms/math/generate_strobogrammtic.py:89-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/math/generate_strobogrammtic.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"00da35a2d723339168990168b6b8df776b8b04a0a5ace41b2536cd9d7453429c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): algorithms/graph/maximum_flow_bfs.py:55-75 | algorithms/graph/maximum_flow_dfs.py:54-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/maximum_flow_bfs.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4163ed1f5ce81dc204e091215d3a4c79551ca7d5ef34cbb2946cea1ac9901806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): algorithms/stack/stutter.py:44-63 | algorithms/stack/switch_pairs.py:48-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/stack/stutter.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"603a44c69a89f0bbcfc99cdf8c4a9196c3262e9c35259049887f0aa0ec329876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): algorithms/backtracking/factor_combinations.py:18-35 | algorithms/graph/all_factors.py:48-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/backtracking/factor_combinations.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38871b720a1628cbfaaa127364e839200486c8c30b90ef0e36f68923868e542"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): algorithms/data_structures/red_black_tree.py:218-230 | algorithms/data_structures/red_black_tree.py:248-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/data_structures/red_black_tree.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dea1eab35727ffb1ad0a6bf93a15c56ab0ff63265cacde1123965c55026d2ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): algorithms/dynamic_programming/longest_increasing.py:72-84 | algorithms/dynamic_programming/longest_increasing.py:119-131 \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":"algorithms/dynamic_programming/longest_increasing.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7f1a4a2164a8457e404ee9814b2236f6ade36702285b3caa0cae79e7489148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): algorithms/stack/is_consecutive.py:36-47 | algorithms/stack/is_consecutive.py:67-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/stack/is_consecutive.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c58ad5a2821393a944a4637476560ce5df122e7c28eb047b456e3be710e87e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): algorithms/map/is_isomorphic.py:38-47 | algorithms/map/word_pattern.py:38-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/map/is_isomorphic.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c68291f6afdf6b833306a6e75f459e15ce63e776a27fa379b79a3eddfceb37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): algorithms/dynamic_programming/longest_increasing.py:61-69 | algorithms/dynamic_programming/longest_increasing.py:108-116 \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":"algorithms/dynamic_programming/longest_increasing.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb7566ecd76203ab3259fdf3bc0df0a7c2b248dc993b45ef5245bd9ff1d9e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): algorithms/stack/is_consecutive.py:77-82 | algorithms/stack/stutter.py:57-62 | algorithms/stack/switch_pairs.py:61-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/stack/is_consecutive.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2bc21053cf7fefe86f0d72f4fa0bf3d299f4eb8c1b2713713eaf50eff6579f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): algorithms/tree/binary_tree_views.py:117-122 | algorithms/tree/binary_tree_views.py:151-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/tree/binary_tree_views.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f9d8f9bc0fe42b652c1038b877feb457a906f96b84e555fd6439bf735fc3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): algorithms/dynamic_programming/k_factor.py:53-57 | algorithms/dynamic_programming/k_factor.py:69-73 \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 \u0060algorithms/dynamic_programming/k_factor.py:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/dynamic_programming/k_factor.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c105648b3ab1898468fcb2e957d65f3926363ea2adbcd12bbdc4b05992cad65e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): algorithms/math/diffie_hellman_key_exchange.py:50-66 | algorithms/math/find_order_simple.py:20-43 | algorithms/math/find_primitive_root_simple.py:21-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The 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":"algorithms/math/diffie_hellman_key_exchange.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ca778eec3ad2f3450204c4cfecd57bf471d399fb399b38fc04a8389746d97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): algorithms/math/diffie_hellman_key_exchange.py:70-86 | algorithms/math/euler_totient.py:18-40 | algorithms/math/find_primitive_root_simple.py:41-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/math/diffie_hellman_key_exchange.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b3f0af0ca6094bb51b0f661aa917aa1198407e9204579d044792bbeca198f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BST (LCOM4 4): BST\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/data_structures/bst.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c70cba9772f9847206ac61cc9f547746a55dad180b90f20c83a0d6ac907a240"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 9 significant file(s) lose their only recent owner: algorithms/math/diffie_hellman_key_exchange.py, algorithms/data_structures/heap.py, algorithms/graph/__init__.py, algorithms/data_structures/bst.py, algorithms/data_structures/avl_tree.py, algorithms/tree/path_sum2.py, algorithms/math/rsa.py, algorithms/compression/elias.py (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9edbd19bdafb0a6a444f50eab73663315ca0ddd870f5dd8290ff2e049813ee73"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 4 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (13 single-owned of 71 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 71 of the 405 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: algorithms/data_structures/veb_tree.py, algorithms/string/strip_url_params.py, algorithms/string/is_palindrome.py, algorithms/compression/lzw_compression.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The document begins with a one-line badge banner (\u0027Minimal, clean, and well-documented implementations of data structures and algorithms in Python 3.\u0027) before any description of what the project is or does. Expand on the overview to explain which specific algorithms/data structures are implemented (e.g. sorting, graphs, trees) and how they differ from a generic \u0027data structures and algorithms\u0027 set."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate intent with inconsistent signatures. One method is an instance method on a specific data type (Interval) returning a list of that type, while the other is a standalone function accepting raw lists and returning raw lists. This forces the user to choose between using the class or the function for the same logical operation.: Remove the standalone \u0060merge_intervals\u0060 function and expose the logic via the \u0060Interval\u0060 class, or remove the class methods and keep only the standalone function. Standardize on one approach (preferably the standalone function for utility libraries, or the class if encapsulation is key). (signatures: algorithms.array.merge_intervals.Interval.merge(intervals: list[Interval]): list[Interval] | algorithms.array.merge_intervals.merge_intervals(intervals: list[list[int]]): list[list[int]] | None)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2a1d03167953743cef21ed9d86ef7c2050f5b8788f37d1e66516f5a66217ec8"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent key type constraints. \u0060HashTable\u0060 restricts keys to \u0060int\u0060, while \u0060SeparateChainingHashTable\u0060 allows \u0060object\u0060. This creates confusion about which hash table implementation to use for generic keys, as the base name \u0060HashTable\u0060 implies general usage but is restricted.: Align key types. Either restrict both to \u0060int\u0060 (if performance optimization for integers is the goal) or allow \u0060object\u0060 (or \u0060Hashable\u0060) in both to support general-purpose usage. Rename \u0060HashTable\u0060 to \u0060IntHashTable\u0060 if the restriction is intentional. (signatures: algorithms.data_structures.hash_table.HashTable.put(self, key: int, value: object): None | algorithms.data_structures.separate_chaining_hash_table.SeparateChainingHashTable.put(self, key: object, value: object): None)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44a5451f2775c72167d9e3c7803f6d15ecb3503840322a56f279fe8d61493711"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent naming for deletion. While \u0060del_\u0060 is used to avoid Python keyword conflicts, it is inconsistent with standard library conventions (e.g., \u0060dict.pop\u0060 or \u0060list.remove\u0060). More importantly, the inconsistency lies in the fact that \u0060del_\u0060 is used here, but other structures like \u0060Union\u0060 use \u0060unite\u0060 or \u0060remove_key\u0060 in BTree. However, the primary issue is the inconsistency with \u0060remove_duplicates\u0060 which uses a full name. A more critical inconsistency is between \u0060del_\u0060 in HashTables and \u0060remove_key\u0060 in BTree for the same conceptual operation.: Standardize removal methods across data structures. Use \u0060remove(key)\u0060 or \u0060delete(key)\u0060 consistently. If \u0060del_\u0060 is kept for HashTables, consider renaming \u0060BTree.remove_key\u0060 to \u0060BTree.del_\u0060 or vice versa for consistency within the library. (signatures: algorithms.data_structures.hash_table.HashTable.del_(self, key: int): None | algorithms.data_structures.separate_chaining_hash_table.SeparateChainingHashTable.del_(self, key: object): None)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"38f0e39b06e80dc1fab9046ca6150a5cdbe8f81668596872bf6916b32fbace17"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent handling of None inputs. \u0060rotate_v3\u0060 explicitly handles \u0060None\u0060 inputs and returns \u0060None\u0060, while \u0060v1\u0060 and \u0060v2\u0060 do not show this signature (implying they might crash or are not intended for None). This creates an inconsistent API surface where the same operation has different null-safety guarantees depending on the version chosen.: Ensure all public methods in the \u0060rotate\u0060 module handle \u0060None\u0060 consistently, either by raising an error or returning \u0060None\u0060. Ideally, provide a single public entry point that handles this, or document the behavior clearly and align signatures. (signatures: algorithms.array.rotate.rotate_v1(array: list[int], k: int): list[int] | algorithms.array.rotate.rotate_v2(array: list[int], k: int): list[int] | algorithms.array.rotate.rotate_v3(array: list[int] | None, k: int): list[int] | None)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fa315f971e12fbca7c761f953f17561f8170010bf0478b1de77aa766d03e16ed"}},{"ruleId":"D22","level":"warning","message":{"text":"While \u0060peek\u0060 is consistent between Queue and Stack, it is inconsistent with \u0060PriorityQueue.pop\u0060 which retrieves the highest priority item but removes it, and \u0060Heap.remove_min\u0060 which also removes. More critically, \u0060PriorityQueue\u0060 does not expose a \u0060peek\u0060 method in the signature list, whereas \u0060Queue\u0060 and \u0060Stack\u0060 do. This is an inconsistency in feature parity across similar LIFO/FIFO structures.: Add a \u0060peek\u0060 method to \u0060PriorityQueue\u0060 and \u0060AbstractHeap\u0060 to maintain consistency with \u0060Queue\u0060 and \u0060Stack\u0060 interfaces. (signatures: algorithms.data_structures.queue.AbstractQueue.peek(self): object | algorithms.data_structures.stack.AbstractStack.peek(self): object)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"46ba730e3a37644b15f45fb34e16e9eea3f7e2e301693f3a17a2765d0fa221a7"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (21830 LoC, 429 module-visible types across 22 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"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":"dc8a0b6a29052aa48bc18119bec50c3d6534e9f540be1132524d3deef2404b78"},"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":"c71f9d2f46a400fef4695b6c044d91bbe4ee4c3ce19515aa25a6358741b89850"},"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":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 71 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 71 of the 405 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: algorithms/data_structures/red_black_tree.py, algorithms/data_structures/veb_tree.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/data_structures/red_black_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4987a775a9b887549a68d9dfa808446cefa55e0e8debb73bb77a08811178dfb"}},{"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":"algorithms/data_structures/veb_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b7f2ec8b198fecee7d0d4e5a03128d97435ce31c42f2c4c87c4645ab1d786a"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f565882c0a115fb9578e0145fd6b0e800a1762ed087db622de4d0ffa7bcb5dc2"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it\u0027s spread across several top-level directories, so there\u0027s no one place that says \u0027this is the product\u0027."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README.md links to \u0060algorithms/map/longest_common_subsequence.py\u0060, but \u0060algorithms/map/longest_common_subsequence.py\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85864071a30ab325207b0475304e4f6aa1b79c8e2996b50e4173a6d35a328ea"}},{"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 2052 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060new_array[src][k] \u003E 0 and visited[k] == 0\u0060 appears character-identically in 2 files \u2014 algorithms/graph/maximum_flow_bfs.py, algorithms/graph/maximum_flow_dfs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/maximum_flow_bfs.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"18208202e4438163365b3a5b83935caee018e49aae1ca08336956dbdf8c585ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.left is None and node.right is None and val == sum\u0060 appears character-identically in 2 files \u2014 algorithms/tree/path_sum.py, algorithms/tree/path_sum2.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/tree/path_sum.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6df1e72eac35930e56082e07694847451d54e80b4de42fc86e9cab34304356"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root.left is None and root.right is None\u0060 appears character-identically in 2 files \u2014 algorithms/tree/binary_tree_paths.py, algorithms/tree/bst_depth_sum.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/tree/binary_tree_paths.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8fe531285a8cf710ad3f80c8fa3c7a89d68f3734b80ce0c36dbfdd8d1d4f2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root.left is None and root.right is None and root.val == sum\u0060 appears character-identically in 2 files \u2014 algorithms/tree/path_sum.py, algorithms/tree/path_sum2.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/tree/path_sum.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57134259e2a6b4bed0c62d5b7579df5b7a5e440d5908493a737d923d3b3b2a1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060find_path\u0060 is public and takes \u0060start: Any\u0060 from its caller, and it calls itself at line 47 (\u0060find_path\u0060) with a piece of \u0060start\u0060 \u2014 and nowhere in \u0060find_path\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060find_path\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/find_path.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e709e816126f6df3b5fc68fdc8f26764896b130161b86d1e07a7fac2b731fe"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060find_all_path\u0060 is public and takes \u0060start: Any\u0060 from its caller, and it calls itself at line 83 (\u0060find_all_path\u0060) with a piece of \u0060start\u0060 \u2014 and nowhere in \u0060find_all_path\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060find_all_path\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/find_path.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5029b76d67f307b856fd9ce3cc4684c2df81fd99d93f477b3a54fa12b5dd8222"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060find_shortest_path\u0060 is public and takes \u0060start: Any\u0060 from its caller, and it calls itself at line 120 (\u0060find_shortest_path\u0060) with a piece of \u0060start\u0060 \u2014 and nowhere in \u0060find_shortest_path\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060find_shortest_path\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/graph/find_path.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c808252273355495a233745ef46bb221f4cb9d411ba762cd9c960cf5e830a22"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060__eq__\u0060 is public and takes \u0060other: object\u0060 from its caller, and it calls itself at line 602 (\u0060self.__eq__\u0060) with a piece of \u0060other\u0060 \u2014 and nowhere in \u0060__eq__\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060__eq__\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"algorithms/math/polynomial.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdf687b30d7708e2c6a01853b0edc3e97084aa271c7e9e2bda1a390f0b1581f"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-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-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"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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/"}]},{"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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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":5,"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."]}]}