{"$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":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01: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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"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":"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":"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":"sieve_of_atkin.sieve_of_atkin (cyclomatic 20): sieve_of_atkin.sieve_of_atkin 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":"maths/sieve_of_atkin.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1482e0b44fe6bc3dd2a3a90184c4c099970e9274f5b05a0ee7a5a941adcf9042"}},{"ruleId":"D1","level":"warning","message":{"text":"conways_game_of_life.new_generation (cyclomatic 19): conways_game_of_life.new_generation 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":"cellular_automata/conways_game_of_life.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde027f77e39e5e393f3e5545a2ad0d5c22141439645acfd6c28cdaaff76a3ea"}},{"ruleId":"D1","level":"warning","message":{"text":"RedBlackTree.remove (cyclomatic 19): RedBlackTree.remove 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":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"437c58b18c71c5b6af105db3eaab5b12dec6f33bf964085ea131d6ddd70ebb03"}},{"ruleId":"D1","level":"warning","message":{"text":"RedBlackTree._remove_repair (cyclomatic 19): RedBlackTree._remove_repair 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":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f60f9bdbd750fd1478ca25da22936a33be58bf93555588ee3a0621a1cfa13c6"}},{"ruleId":"D1","level":"warning","message":{"text":"BinomialHeap.merge_heaps (cyclomatic 19): BinomialHeap.merge_heaps 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":"data_structures/heap/binomial_heap.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca631efd0f21f1cd1b9eaba7b03d16f19c056549e854664e1d4b9fd61b68d7e"}},{"ruleId":"D1","level":"warning","message":{"text":"canny.suppress_non_maximum (cyclomatic 19): canny.suppress_non_maximum 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":"digital_image_processing/edge_detection/canny.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9739e12a1535243ae19678c2ad04efea653d0b670626e10dcca43a2a39afa70"}},{"ruleId":"D1","level":"warning","message":{"text":"sol1.next_term (cyclomatic 18): sol1.next_term 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":"project_euler/problem_551/sol1.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ddae9707fff33196f9f506583e9f90fdf58b10c42f8f6c78eda5a58c466c77"}},{"ruleId":"D1","level":"warning","message":{"text":"min_window_substring.min_window (cyclomatic 18): min_window_substring.min_window 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":"strings/min_window_substring.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0726e0d6f5e9a8b4314fe54bed7ad6383ccbb545c8242910007791ae8c0070fc"}},{"ruleId":"D1","level":"warning","message":{"text":"deterministic_miller_rabin.miller_rabin (cyclomatic 17): deterministic_miller_rabin.miller_rabin 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":"ciphers/deterministic_miller_rabin.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"79137e237313012644ce41b3565f016c85ce1d69c5bc598f17ad83b9d60a9a78"}},{"ruleId":"D1","level":"warning","message":{"text":"rgb_hsv_conversion.hsv_to_rgb (cyclomatic 17): rgb_hsv_conversion.hsv_to_rgb has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"conversions/rgb_hsv_conversion.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"996bb34cd4f8bb5325d1ce433d06ff5eb9bae4fdb457c83760c7598d1374c420"}},{"ruleId":"D1","level":"warning","message":{"text":"RedBlackTree._insert_repair (cyclomatic 17): RedBlackTree._insert_repair 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":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"19778fbcbb624e380581cb6992f58ac63b99e03af5d848e38b7497c5fff5c5ba"}},{"ruleId":"D1","level":"warning","message":{"text":"hamming_code.receptor_converter (cyclomatic 17): hamming_code.receptor_converter has cyclomatic complexity 17 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashes/hamming_code.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a428a84480be2812f0c4be4964ba4eb0b49f5dbe8836234d864033aedcf4fe34"}},{"ruleId":"D1","level":"warning","message":{"text":"simultaneous_linear_equation_solver.solve_simultaneous (cyclomatic 17): simultaneous_linear_equation_solver.solve_simultaneous 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":"maths/simultaneous_linear_equation_solver.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ea44d2d3052adebfdc3d11a9c3952202eb8a0359af6abb0f15908e7e4bccd2"}},{"ruleId":"D1","level":"warning","message":{"text":"sol1.solution (cyclomatic 17): sol1.solution 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":"project_euler/problem_049/sol1.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c34ffcb637d3ddfcd6eee22c342dd5518ad6721ceea57f976f84568b0450f"}},{"ruleId":"D1","level":"warning","message":{"text":"BinomialHeap.delete_min (cyclomatic 16): BinomialHeap.delete_min 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":"data_structures/heap/binomial_heap.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d733299b2e8770a32dd1274bf85c927704817bbda5a10955c66fd374907d3e9"}},{"ruleId":"D1","level":"warning","message":{"text":"EdmondsBlossomAlgorithm.maximum_matching (cyclomatic 16): EdmondsBlossomAlgorithm.maximum_matching 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":"graphs/edmonds_blossom_algorithm.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bf40338fb578d1efcf541ca081fbdbe8f26e93849420f7ef7a48c30d4206f3"}},{"ruleId":"D1","level":"warning","message":{"text":"polynom_for_points.points_to_polynomial (cyclomatic 16): polynom_for_points.points_to_polynomial 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":"linear_algebra/src/polynom_for_points.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f35b168f80e4e10ef3eba689e40c1cda0b81edbb9dbe75e62cacfd3252a276"}},{"ruleId":"D1","level":"warning","message":{"text":"sol1.solution (cyclomatic 16): sol1.solution has cyclomatic complexity 16 (threshold 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":"project_euler/problem_111/sol1.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc292a09174ae8cdeba0f657bb43e238f040c86506c06ae6840065dbac3d2aea"}},{"ruleId":"D2","level":"warning","message":{"text":"EdmondsBlossomAlgorithm.maximum_matching (cognitive 50): EdmondsBlossomAlgorithm.maximum_matching has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/edmonds_blossom_algorithm.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabbefc8c675cb4c6d0e2fb8d66b578dc72846e2eb5095547513a2c786c95fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"travelling_salesman_problem.crossing (cognitive 47): travelling_salesman_problem.crossing has cognitive complexity 47 (threshold 15). Drivers by points: if/else 5 (21 pts), loops 5 (19 pts), error handling 1 (7 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genetic_algorithm/travelling_salesman_problem.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc9ea503cbc9fda374588f8be76c576e71ee8c3d9ed63846c61b8ce037f3051"}},{"ruleId":"D2","level":"warning","message":{"text":"RedBlackTree.remove (cognitive 46): RedBlackTree.remove has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (42 pts), boolean chains 4 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aa35b29a6b2afd4bd107b80108fb83d46dc0f385d10a7d99962fb5fcf3680a"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.solution (cognitive 45): sol1.solution has cognitive complexity 45 (threshold 15). Drivers by points: if/else 6 (32 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_180/sol1.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7fd28f56c3e3d46d78d60f821f938b469dfbf345074577b6ad4c3fd4f19789"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.solution (cognitive 43): sol1.solution has cognitive complexity 43 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 4 (18 pts), boolean chains 1 (nesting depth added 28). 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":"project_euler/problem_111/sol1.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ae12ba9730773dd7a0e19127126ff68b1be438b909677d44b0eeac2c5118d"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.solution (cognitive 41): sol1.solution has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 7 (14 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_049/sol1.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fe4934df24603153c7700a65a8900c85d498a1d9c18287d79089964d9b4277"}},{"ruleId":"D2","level":"warning","message":{"text":"RedBlackTree._insert_repair (cognitive 39): RedBlackTree._insert_repair has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (36 pts), boolean chains 3 (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":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75e9e6b6a5fddf0c9405d3943af9303ba618da5524cce2674345447794c6b86"}},{"ruleId":"D2","level":"warning","message":{"text":"conways_game_of_life.new_generation (cognitive 38): conways_game_of_life.new_generation has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cellular_automata/conways_game_of_life.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9367cc4b108dd55dcef7ed791a85f945253d3dc3e61a863007564adc1cee834d"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.next_term (cognitive 38): sol1.next_term has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 4 (10 pts), boolean chains 4 (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":"project_euler/problem_551/sol1.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a436205bfc5adc4299072a56e63485ec2404f2a2fcc86397fd9c21cd8855f820"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_heuristic_astar.multi_a_star (cognitive 37): multi_heuristic_astar.multi_a_star has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 5 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/multi_heuristic_astar.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25f122e242882853936800c6236da87a7fc494243e120a960e3171534001616"}},{"ruleId":"D2","level":"warning","message":{"text":"hamming_code.receptor_converter (cognitive 35): hamming_code.receptor_converter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 5 (6 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 14). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashes/hamming_code.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3990e6936a909dc177a326f8a58546b7d203fabcf4efb7332c1efa442bb9791"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectedGraph.cycle_nodes (cognitive 34): DirectedGraph.cycle_nodes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (DirectedGraph.has_cycle, Graph.cycle_nodes, Graph.has_cycle) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfb66f65b27347d7eea73a1f17926826213c68caa1ad4c6a7b6752ae568f270"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectedGraph.has_cycle (cognitive 34): DirectedGraph.has_cycle has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (DirectedGraph.cycle_nodes, Graph.cycle_nodes, Graph.has_cycle) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc6a707b18fc22a062095fb92099e31628b65c73dc53ce33a25212db05e9d51"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.cycle_nodes (cognitive 34): Graph.cycle_nodes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (DirectedGraph.cycle_nodes, DirectedGraph.has_cycle, Graph.has_cycle) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9613d43d03c88d827f648845a72eae997a62da2d7c8140f54cf90eec6d17ad4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.has_cycle (cognitive 34): Graph.has_cycle has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (DirectedGraph.cycle_nodes, DirectedGraph.has_cycle, Graph.cycle_nodes) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"239241bd0a9658221ee59677ae8cd492c7deebdf588feed439d92c7be8996536"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_heuristic_astar.expand_state (cognitive 34): multi_heuristic_astar.expand_state has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 3 (8 pts), boolean chains 2 (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":"graphs/multi_heuristic_astar.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0facd8b05b48db49208b05d5a8e2ef7220cf6a72809afcb22c9be3675b0f40be"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.solution (cognitive 34): sol1.solution has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (7 pts), ternaries 1 (6 pts), boolean chains 3 (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":"project_euler/problem_142/sol1.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"59403f1d9afb732916dde081fec64a388412716428a2cba482e0d2359b509f93"}},{"ruleId":"D2","level":"warning","message":{"text":"min_window_substring.min_window (cognitive 34): min_window_substring.min_window has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"strings/min_window_substring.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d8c8982d4a3625fa35ff9b3e5b2cabe24c2523e38118676bb5918ea8552ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"sieve_of_atkin.sieve_of_atkin (cognitive 33): sieve_of_atkin.sieve_of_atkin has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maths/sieve_of_atkin.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd37e7143c73e0ffea15a7379a9feeb57c252046ec9c6ed1dd3f98868b9576a1"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.solution (cognitive 32): sol1.solution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 7 (14 pts), ternaries 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_092/sol1.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d201a88546a277d5324dab28b76f816b2e13f5199b9acd70522e2ee22734e46"}},{"ruleId":"D2","level":"warning","message":{"text":"hamming_code.emitter_converter (cognitive 31): hamming_code.emitter_converter has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (5 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 14). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hashes/hamming_code.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e2b93d51663f52633782f8e33c6b17f5b68f2454195667a946d331dc68702d"}},{"ruleId":"D2","level":"warning","message":{"text":"infix_to_postfix_conversion.infix_to_postfix (cognitive 30): infix_to_postfix_conversion.infix_to_postfix has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/stacks/infix_to_postfix_conversion.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadb332f8d221b1eeaa76a9eed4954e458fb846a643551d2bf1c7f5d8ed51121"}},{"ruleId":"D2","level":"warning","message":{"text":"canny.suppress_non_maximum (cognitive 30): canny.suppress_non_maximum has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (19 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"digital_image_processing/edge_detection/canny.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"732cc1bff54b10746794e8db380924356891aaab6ea6b36656dca0edd0dcdfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.boruvka_mst (cognitive 29): Graph.boruvka_mst has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/minimum_spanning_tree_boruvka.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a090e8c8d1924a974e28a96446db2159979ff5f377632de29ee87f8e4ce02731"}},{"ruleId":"D2","level":"warning","message":{"text":"BankersAlgorithm.main (cognitive 29): BankersAlgorithm.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/bankers_algorithm.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e9d3be1c7e33e429c62fae847aa0c21609b0eff243b0f87a9ecb2447b98a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"quine_mc_cluskey.selection (cognitive 28): quine_mc_cluskey.selection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 7 (13 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":"boolean_algebra/quine_mc_cluskey.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8788a692daff0714ad3d0277bb10f841dd8532ed4637e7e2aab051d8fc84130e"}},{"ruleId":"D2","level":"warning","message":{"text":"optimal_binary_search_tree.find_optimal_binary_search_tree (cognitive 28): optimal_binary_search_tree.find_optimal_binary_search_tree has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (17 pts), loops 4 (7 pts), if/else 1 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dynamic_programming/optimal_binary_search_tree.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb567002c1ee3edf099474d84282b838268ff7f65ca78354b5fb2709cd18f05"}},{"ruleId":"D2","level":"warning","message":{"text":"dbscan.dbscan (cognitive 28): dbscan.dbscan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (7 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":"machine_learning/dbscan.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4336c57d258e374012820941b25f89f7baeb981804b1d59fd557acfb54fa4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"graham_scan.graham_scan (cognitive 28): graham_scan.graham_scan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (4 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":"other/graham_scan.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f4ca492fc4872449909130ebfb91237abb97bae2df523d2addbf90a99d9ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"BinomialHeap.merge_heaps (cognitive 27): BinomialHeap.merge_heaps has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/heap/binomial_heap.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"552d30a988958348f5adda5128c575fde00c693347fff9c67457c1e43d1c9a08"}},{"ruleId":"D2","level":"warning","message":{"text":"simultaneous_linear_equation_solver.solve_simultaneous (cognitive 27): simultaneous_linear_equation_solver.solve_simultaneous has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 6 (9 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":"maths/simultaneous_linear_equation_solver.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1577754672150f66bcd02cbec03ffa08f36f9e428a7daf449a4900ab08adefda"}},{"ruleId":"D2","level":"warning","message":{"text":"simulated_annealing.simulated_annealing (cognitive 27): simulated_annealing.simulated_annealing has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"searches/simulated_annealing.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f60c81efcae8c51e9d0961d8d8dd1b07c5ff670d9c57da771b2b527ec8d7e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.boruvka (cognitive 26): Graph.boruvka has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/boruvka.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff645ac6b82756541e0b5d7aed82ac8fe20d1e72eb388ef248d540b07b26c50"}},{"ruleId":"D2","level":"warning","message":{"text":"travelling_salesman_problem.travelling_salesman_dynamic_programming (cognitive 26): travelling_salesman_problem.travelling_salesman_dynamic_programming has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/travelling_salesman_problem.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cccc0d9eee680dff64abd92286fa282f7b9d51bd3f052fdcdd463f4db150ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"primelib.kg_v (cognitive 26): primelib.kg_v has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (9 pts), boolean chains 4 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maths/primelib.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8914e980c2fb92bde4e97c3b92f296f4e48f421686d84c794a984d6e168d6aab"}},{"ruleId":"D2","level":"warning","message":{"text":"BinomialHeap.delete_min (cognitive 25): BinomialHeap.delete_min has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/heap/binomial_heap.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ca45720a4f748f2d792d63c9d253cc308c23faf710ba76d4705837e5f190cf"}},{"ruleId":"D2","level":"warning","message":{"text":"polynom_for_points.points_to_polynomial (cognitive 25): polynom_for_points.points_to_polynomial has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linear_algebra/src/polynom_for_points.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4735df2b0513cd8840e42d793decc8afbbf2cc611f81118a1e5c889c5b0eaa41"}},{"ruleId":"D2","level":"warning","message":{"text":"rank_of_matrix.rank_of_matrix (cognitive 25): rank_of_matrix.rank_of_matrix has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 4 (10 pts) (nesting depth added 16). 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":"linear_algebra/src/rank_of_matrix.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c192096ea094055f9f29b5aaadc06d1e776bb971d8d54c02685376e3552b4a83"}},{"ruleId":"D2","level":"warning","message":{"text":"postfix_evaluation.evaluate (cognitive 24): postfix_evaluation.evaluate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/stacks/postfix_evaluation.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ab20c6af5fe472cb4f2de8fe3ec11fd8eb8277ed5144c68a383629fa335e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"convex_hull.convex_hull_bf (cognitive 24): convex_hull.convex_hull_bf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (6 pts), boolean chains 2 (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":"divide_and_conquer/convex_hull.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8666084b97ce02f28572dfb006975d36ada2b9684db60579d37c828cfdd1f0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"needleman_wunsch.needleman_wunsch (cognitive 24): needleman_wunsch.needleman_wunsch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 pts), ternaries 2 (6 pts), boolean chains 3 (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":"dynamic_programming/needleman_wunsch.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"245a655b984a42649013f0e510edcdda4401e325ed207321c81b8c9895459e95"}},{"ruleId":"D2","level":"warning","message":{"text":"BidirectionalAStar.search (cognitive 24): BidirectionalAStar.search has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/bidirectional_a_star.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da731e5b355905acb327e3b0d3bf63a2741a9b3578c0ced0e5e1eb397d87670"}},{"ruleId":"D2","level":"warning","message":{"text":"SmoSVM.fit (cognitive 24): SmoSVM.fit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 2, error handling 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":"machine_learning/sequential_minimum_optimization.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a3e841bc2cf85776330870745247bd2fc95a448eb64f10e9747979dda68f45"}},{"ruleId":"D2","level":"warning","message":{"text":"three_sum.three_sum (cognitive 24): three_sum.three_sum has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 3 (7 pts), boolean chains 3 (nesting depth added 14). 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":"maths/three_sum.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0056762e480cebf224ee185f67ef3fac9212fd3be868c74601aaca3288e0dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"hill_climbing.hill_climbing (cognitive 24): hill_climbing.hill_climbing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"searches/hill_climbing.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f74de5633446006a764a39ee6d31a79d1c462b36b037f2318a91c277e9a592"}},{"ruleId":"D2","level":"warning","message":{"text":"wa_tor.visualise (cognitive 23): wa_tor.visualise has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 4 (9 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cellular_automata/wa_tor.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"85786c4c8ecf619d33843f030df3d2e810ab34fdfa232d74380e55022c05d450"}},{"ruleId":"D2","level":"warning","message":{"text":"decrypt_caesar_with_chi_squared.decrypt_caesar_with_chi_squared (cognitive 23): decrypt_caesar_with_chi_squared.decrypt_caesar_with_chi_squared has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), error handling 1 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ciphers/decrypt_caesar_with_chi_squared.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fdcc3d4f5404bed79060a4bcac555404df2b4ba28a4661aeeb5b02dad7c7ec"}},{"ruleId":"D2","level":"warning","message":{"text":"strassen_matrix_multiplication.strassen (cognitive 23): strassen_matrix_multiplication.strassen has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"divide_and_conquer/strassen_matrix_multiplication.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceeae9b444939cea34fb1f76ed7faa490892e0eeabde93c7c4f5d53ec384a87"}},{"ruleId":"D2","level":"warning","message":{"text":"Dinic.max_flow (cognitive 23): Dinic.max_flow has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 2 (8 pts), boolean chains 2 (nesting depth added 14). 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":"graphs/dinic.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f093758b23c6b45da1dbff9f81cc4804c22f0582dcf3ee655f465578665ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"brent_method.brent_method (cognitive 23): brent_method.brent_method has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maths/numerical_analysis/brent_method.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b190192ab6449763fca7de7f594ba71058baaeb7ca18caeca34a0c01584c814"}},{"ruleId":"D2","level":"warning","message":{"text":"spiral_print.spiral_print_clockwise (cognitive 23): spiral_print.spiral_print_clockwise has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 7 (10 pts), boolean chains 1 (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":"matrix/spiral_print.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"143d0cf5c6ff3d26dc6308ac9b355860732c585f43ebe7560e5a113ab2391877"}},{"ruleId":"D2","level":"warning","message":{"text":"RedBlackTree._remove_repair (cognitive 22): RedBlackTree._remove_repair has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7 (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":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bbd1296e003be0a54e192e68a72b36e239adc8a0e86ecac8cc09f231981cde"}},{"ruleId":"D2","level":"warning","message":{"text":"SplayTree._splay (cognitive 22): SplayTree._splay has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 2 (4 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":"data_structures/binary_tree/splay_tree.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d472af82d2b3f7a1f329f7fde7962422484cc96fac622fe8bee25650105c9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"segmented_sieve.sieve (cognitive 22): segmented_sieve.sieve has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (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":"maths/segmented_sieve.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af8e71af4ac0b5a24ab477f11bc35004083f54d4842d71e37bfc29131f9ddb"}},{"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":"sorts/cycle_sort.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e73ffdb342514f338ba923c64515a6f60dc16dfb21c71d3692e6850868fc536"}},{"ruleId":"D2","level":"warning","message":{"text":"power_sort.power_sort (cognitive 22): power_sort.power_sort has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sorts/power_sort.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af5549be363d590c46315975bf3ff4f9edff44878f5f094677883d5b4f5716a"}},{"ruleId":"D2","level":"warning","message":{"text":"deterministic_miller_rabin.miller_rabin (cognitive 21): deterministic_miller_rabin.miller_rabin has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 4 (5 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":"ciphers/deterministic_miller_rabin.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6dbb926436811d8a24f39c6642c46e12b34fab00feb02ddb9013474a18541b"}},{"ruleId":"D2","level":"warning","message":{"text":"set_matrix_zeroes.set_matrix_zeroes (cognitive 21): set_matrix_zeroes.set_matrix_zeroes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/arrays/set_matrix_zeroes.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f99fe66a6aea14fc8fcc0c23a2b0781166165e4af49785a6d8915cc93b958d"}},{"ruleId":"D2","level":"warning","message":{"text":"astar.astar (cognitive 21): astar.astar has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/astar.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a30654fb9402c048cfd44e3409d03f922a9f8d1bb78d0fbbf5d68c6f3cdf00"}},{"ruleId":"D2","level":"warning","message":{"text":"tabu_search.find_neighborhood (cognitive 21): tabu_search.find_neighborhood has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 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":"searches/tabu_search.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccc77a318b6357ec1c04b60aa10adb79e4f9001f1bab658608142b0dc54990f"}},{"ruleId":"D2","level":"warning","message":{"text":"tabu_search.tabu_search (cognitive 21): tabu_search.tabu_search has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"searches/tabu_search.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b5606fefdbd9136a6f896f1c33cc0df54a6029cce5cb2056b6afb609be7807"}},{"ruleId":"D2","level":"warning","message":{"text":"find_triplets_with_0_sum.find_triplets_with_0_sum_two_pointers (cognitive 20): find_triplets_with_0_sum.find_triplets_with_0_sum_two_pointers 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":"data_structures/arrays/find_triplets_with_0_sum.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8052e49857a9c69d8f7f9ef57693fe7b6b3a7b7066388a01b1e8dc6c8c5e2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"dijkstra_binary_grid.dijkstra (cognitive 20): dijkstra_binary_grid.dijkstra has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/dijkstra_binary_grid.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"786b883f36fc49ae04108a5ad492e863ea0c6e68078d8162b02a92ec7803799e"}},{"ruleId":"D2","level":"warning","message":{"text":"frequent_pattern_graph_miner.create_edge (cognitive 20): frequent_pattern_graph_miner.create_edge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/frequent_pattern_graph_miner.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ed2838225d067534e4c669f4d79436f85f1f30a561d754e473ef1e50931978"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.slow_reversible_numbers (cognitive 20): sol1.slow_reversible_numbers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 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":"project_euler/problem_145/sol1.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a15fc6726eeb86dba8806cdce4a46d1d5da56ea1d38c6145052680cb34c0e81"}},{"ruleId":"D2","level":"warning","message":{"text":"mosaic_augmentation.update_image_and_anno (cognitive 19): mosaic_augmentation.update_image_and_anno has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (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":"computer_vision/mosaic_augmentation.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41dafdc1b3905e09de064c04d3c81d4c8ead18329a414b1f06bbb8f7fc52efc"}},{"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":"data_structures/linked_list/is_palindrome.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe47228fb94fb87017df01319c3a6bf26a5ab746dbd0364057fe8aad90467bae"}},{"ruleId":"D2","level":"warning","message":{"text":"a_star.search (cognitive 19): a_star.search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/a_star.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca79f116095a62e4326e5335bc56ea1988e9f82e363960cdb06e36077f9a1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"check_bipatrite.is_bipartite_bfs (cognitive 19): check_bipatrite.is_bipartite_bfs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/check_bipatrite.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"663d06ee94c316619901964de95777336ecc3b8d067218e0304d95ead46a497d"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectedGraph.topological_sort (cognitive 19): DirectedGraph.topological_sort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"31222d09b7b30ad9924917b64d12e7e30b1c6964bf58008282e5a5dcd89abe6a"}},{"ruleId":"D2","level":"warning","message":{"text":"SmoSVM._choose_a1 (cognitive 19): SmoSVM._choose_a1 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 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":"machine_learning/sequential_minimum_optimization.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"660f96b7ef73523f278d9d68420c311da5025faa1849ea026f46ed02c254a1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"inverse_of_matrix.inverse_of_matrix (cognitive 19): inverse_of_matrix.inverse_of_matrix has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (5 pts), boolean chains 3, match/switch 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":"matrix/inverse_of_matrix.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc04ff74819d022d358f13b72164c3e8d6253d9f1e6d2509d7266e48448129a"}},{"ruleId":"D2","level":"warning","message":{"text":"enigma_machine2.enigma (cognitive 18): enigma_machine2.enigma has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ciphers/enigma_machine2.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae73845e5b6b716c23ac8b58ff157d3e1ff59a7d3a066d95bb1c2cb62695109"}},{"ruleId":"D2","level":"warning","message":{"text":"MaxFenwickTree.update (cognitive 18): MaxFenwickTree.update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/binary_tree/maximum_fenwick_tree.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"86eca715b66d8ea660c8f79b79041d2c66edcd8200136d39569846a3d04a1d22"}},{"ruleId":"D2","level":"warning","message":{"text":"infix_to_prefix_conversion.infix_2_postfix (cognitive 18): infix_to_prefix_conversion.infix_2_postfix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/stacks/infix_to_prefix_conversion.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7946c6dcd2612314f01681ccaaf99dabc94635d890cc9f982fa7934c4f6b5341"}},{"ruleId":"D2","level":"warning","message":{"text":"kth_next_greater_element.find_kth_next_greater_element (cognitive 18): kth_next_greater_element.find_kth_next_greater_element has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (4 pts), boolean chains 3 (nesting depth added 7). 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":"data_structures/stacks/kth_next_greater_element.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c887cae4bcbd84702a3bdceffe97d0c2145933e20fabd1807c216b6c72df95"}},{"ruleId":"D2","level":"warning","message":{"text":"basic_graphs.dijk (cognitive 18): basic_graphs.dijk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/basic_graphs.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad4f121760474dcbda7ef95d811951cee00c126165797d26809979b8d4340e0"}},{"ruleId":"D2","level":"warning","message":{"text":"multi_heuristic_astar.do_something (cognitive 18): multi_heuristic_astar.do_something has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 3 (7 pts) (nesting depth added 7). 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":"graphs/multi_heuristic_astar.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d365538b9c86a28f06ae37bbf3305c45229e2f19563f43a3d3a89dc3d211711c"}},{"ruleId":"D2","level":"warning","message":{"text":"gauss_jordan.gauss_jordan (cognitive 18): gauss_jordan.gauss_jordan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"linear_algebra/gauss_jordan.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfe5c08dd109902864a95a5631d35aa2a5f547b01af389f75b245989e1ec63d"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.solve (cognitive 18): sol1.solve has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_101/sol1.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"84967982ac1f418aefb4b86699b6d56acf05a1cf0519ab69c69475189f45a56c"}},{"ruleId":"D2","level":"warning","message":{"text":"non_preemptive_shortest_job_first.calculate_waitingtime (cognitive 18): non_preemptive_shortest_job_first.calculate_waitingtime has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scheduling/non_preemptive_shortest_job_first.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e885445da99b00e751775cf753ac7b77c48f4f94a8e2a40263dc13631b07b1"}},{"ruleId":"D2","level":"warning","message":{"text":"quine_mc_cluskey.check (cognitive 17): quine_mc_cluskey.check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (8 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":"boolean_algebra/quine_mc_cluskey.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8758867746ef049204d4d6143f2f6feaf37a578fbba5dd123027911161f0b05c"}},{"ruleId":"D2","level":"warning","message":{"text":"basic_graphs.krusk (cognitive 17): basic_graphs.krusk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/basic_graphs.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd5bae7db15fc7bcd651e31fedb5486c41090e61871e8c684a6dd42222ce1d"}},{"ruleId":"D2","level":"warning","message":{"text":"AStar.search (cognitive 17): AStar.search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/bidirectional_a_star.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"987e725ae8acc03c429f47cc75e19f7334258993ff6ddd75f627aa31da26847b"}},{"ruleId":"D2","level":"warning","message":{"text":"gaussian_elimination_pivoting.solve_linear_system (cognitive 17): gaussian_elimination_pivoting.solve_linear_system has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (8 pts) (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":"linear_algebra/src/gaussian_elimination_pivoting.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab78737fe643bffd0e825bf43130c6922b052e27751182ac9e7cfa3d72e191fa"}},{"ruleId":"D2","level":"warning","message":{"text":"linear_discriminant_analysis.main (cognitive 17): linear_discriminant_analysis.main has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 1 (2 pts), ternaries 1 (2 pts) (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":"machine_learning/linear_discriminant_analysis.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a66e669ac1e41cf68a08f9d1f20323f3e25bc0de10c075c88a607246d2848b3"}},{"ruleId":"D2","level":"warning","message":{"text":"PushRelabel.max_flow (cognitive 17): PushRelabel.max_flow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 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":"networking_flow/push_relabel.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36bca6bc377597a64306e6a9a141792c8cb6095711a9ade85ae67f6ac519424"}},{"ruleId":"D2","level":"warning","message":{"text":"Perceptron.training (cognitive 17): Perceptron.training has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (5 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":"neural_network/perceptron.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa786167c82f9cbd2e91d66968fe96d33d836026091436f4395bf8ed4cb1c262"}},{"ruleId":"D2","level":"warning","message":{"text":"scoring_algorithm.calculate_each_score (cognitive 17): scoring_algorithm.calculate_each_score has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (8 pts), loops 3 (7 pts), match/switch 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":"other/scoring_algorithm.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c201da47d522f5020fd7f94276f1373b10e91e79ee7a4648a1301be33795ef"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_insertion_sort.merge_insertion_sort (cognitive 17): merge_insertion_sort.merge_insertion_sort has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sorts/merge_insertion_sort.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4a1f8eec309793b235ebf139493a3cf6ac568c138e6fa53c6e1785923481b3"}},{"ruleId":"D2","level":"warning","message":{"text":"strand_sort.strand_sort (cognitive 17): strand_sort.strand_sort has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sorts/strand_sort.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69f27ba9a2292426f2263642c2144ba49b1d2793a29fa4a9f32f713707ef3b5"}},{"ruleId":"D2","level":"warning","message":{"text":"wildcard_pattern_matching.match_pattern (cognitive 17): wildcard_pattern_matching.match_pattern has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"strings/wildcard_pattern_matching.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65f973153a90477d119180dac77fe4417edffcf9969004a27bd5597b06e618d"}},{"ruleId":"D2","level":"warning","message":{"text":"crossword_puzzle_solver.solve_crossword (cognitive 16): crossword_puzzle_solver.solve_crossword has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backtracking/crossword_puzzle_solver.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"55493e88f01b85dc716c964fdc9ede3cbb5ba45a370dac6fd6ff2ba6c10803d6"}},{"ruleId":"D2","level":"warning","message":{"text":"WaTor.run (cognitive 16): WaTor.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cellular_automata/wa_tor.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ae5b79072074be518203b1ecb9bd3a3ce7fd3c2287d61482312b6cc31f2de7"}},{"ruleId":"D2","level":"warning","message":{"text":"avl_tree.del_node (cognitive 16): avl_tree.del_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/binary_tree/avl_tree.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cb3ed7226b9974594f6f0143dcf6d6846f200d6e2b802439d8ab53072238d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SkipList.insert (cognitive 16): SkipList.insert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/linked_list/skip_list.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce0f7d5ea8f514cbc815a7e105861ec4e35dd532af336fe79ea1e9771b053f9"}},{"ruleId":"D2","level":"warning","message":{"text":"longest_common_subsequence.longest_common_subsequence (cognitive 16): longest_common_subsequence.longest_common_subsequence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dynamic_programming/longest_common_subsequence.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b410166358b4ae9aa3d1d4b10443bed96ff0114a98a7e9a1b2c62aa448511384"}},{"ruleId":"D2","level":"warning","message":{"text":"rotating_calipers.rotating_calipers (cognitive 16): rotating_calipers.rotating_calipers has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (7 pts) (nesting depth added 7). 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":"geometry/rotating_calipers.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0ac42924e4c867d56f11002a6a49652b71f596b673800087fa7fe9b9341826"}},{"ruleId":"D2","level":"warning","message":{"text":"basic_graphs.topo (cognitive 16): basic_graphs.topo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 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":"graphs/basic_graphs.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f53e5c92544396c8fdd3ccd5301b70951c3fe139dac3f83694d20622c0f8208"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowNetwork._normalize_graph (cognitive 16): FlowNetwork._normalize_graph has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4, boolean chains 2 (nesting depth added 5). 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":"graphs/edmonds_karp_multiple_source_and_sink.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1880047c50692b5faa68d9880ed03cc592726ad664cb7995eb1328af4bb4a78"}},{"ruleId":"D2","level":"warning","message":{"text":"simultaneous_linear_equation_solver.simplify (cognitive 16): simultaneous_linear_equation_solver.simplify has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (6 pts) (nesting depth added 7). 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":"maths/simultaneous_linear_equation_solver.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8849e0c7e7a752384a2d54eb2d0b29932e5a6a27a2361bca6fbbd8588ccf425d"}},{"ruleId":"D2","level":"warning","message":{"text":"Matrix.__init__ (cognitive 16): Matrix.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"matrix/matrix_class.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7d2b57c5541a872b8cf08e20ad0cf5e607c565c5198c54f6b7f02cdf8d4d13"}},{"ruleId":"D2","level":"warning","message":{"text":"davis_putnam_logemann_loveland.find_unit_clauses (cognitive 16): davis_putnam_logemann_loveland.find_unit_clauses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (5 pts), match/switch 1 (4 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":"other/davis_putnam_logemann_loveland.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f708b2b9d8981f3ed0e1109e8f8602d197fa7ff6e260bb79018cff5bf581ad"}},{"ruleId":"D2","level":"warning","message":{"text":"sol1.solution (cognitive 16): sol1.solution has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_087/sol1.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e94b6fe4a09d43c2eb438fe35f93a596a3b8303495248288a0ed80dce4560c"}},{"ruleId":"D2","level":"warning","message":{"text":"hacktoberfest_prep_update._request (cognitive 16): hacktoberfest_prep_update._request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/hacktoberfest_prep_update.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d7b259984d78208480f923c1a2f4b6c20d124054afcdbc56067475673df282"}},{"ruleId":"D2","level":"warning","message":{"text":"BoothsAlgorithm.find_minimal_rotation (cognitive 16): BoothsAlgorithm.find_minimal_rotation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"strings/booths_algorithm.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4599e15d6dbe3f8390d2c66251cd6777744981a17a21f3603a14607baa718"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IndexCalculation: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"digital_image_processing/index_calculation.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ca9e6a526794be188486ca0ed53f81ec8a7c9e5301288a9d74d0844e74b0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binary_tree/red_black_tree.py: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2bb2c82d2f28e90631a12baa52e96df079585839d67cb888173b41ac0b7647"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 47 shared lines): graphs/directed_and_undirected_weighted_graph.py:231-280 | graphs/directed_and_undirected_weighted_graph.py:283-331 | graphs/directed_and_undirected_weighted_graph.py:500-549 | graphs/directed_and_undirected_weighted_graph.py:552-600 \u2014 These 4 members are variants of one another: a block of 47 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e85d502d66711e94d56a56e62a086c7e2c0828c911c744ec3605fc8abf41d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): project_euler/problem_003/sol1.py:18-48 | project_euler/problem_007/sol2.py:19-49 | project_euler/problem_007/sol3.py:20-50 | project_euler/problem_010/sol1.py:18-48 | project_euler/problem_010/sol2.py:20-50 | project_euler/problem_027/sol1.py:27-59 | project_euler/problem_037/sol1.py:21-56 | project_euler/problem_041/sol1.py:21-56 | project_euler/problem_046/sol1.py:26-61 | project_euler/problem_049/sol1.py:33-68 | project_euler/problem_058/sol1.py:41-76 \u2014 These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_003/sol1.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d417a5422e3237284f482272a69b29a4080812ea004b2aef9b57b5b04c5b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2): ciphers/base58.py:65-136 | ciphers/base64_cipher.py:65-136 \u2014 before extracting anything, compare \u0060ciphers/base58.py\u0060 and \u0060ciphers/base64_cipher.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"ciphers/base58.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"911c91a8a7af8c30b3ad6901d409d8329ea89b3b52ca474d2351591ec82179d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): ciphers/base58.py:5-61 | ciphers/base64_cipher.py:5-61 \u2014 before extracting anything, compare \u0060ciphers/base58.py\u0060 and \u0060ciphers/base64_cipher.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ciphers/base58.py:5\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":"ciphers/base58.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dad4fa9a5401948326b16b03111038177b073ad753cc1624228c14f0002352e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 3): data_structures/linked_list/__init__.py:26-75 | data_structures/linked_list/kth_element_from_end.py:53-102 | data_structures/linked_list/partition_linked_list.py:53-102 \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":"data_structures/linked_list/__init__.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89b8f690771209f20ca3cd6d5eafd99b8af8cb87c217fa44f4950302217337a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201347 lines \u00D7 2): maths/maclaurin_series.py:9-55 | maths/maclaurin_series.py:61-106 \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 \u0060maths/maclaurin_series.py:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maths/maclaurin_series.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"568163155eedc756457b989d88dec3206ab53219c3301ce099fa80151e75e97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201346 lines \u00D7 2): other/number_container_system.py:21-66 | other/number_container_system.py:78-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/number_container_system.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"961d861e0614b7e83aa5c2a97c46eddc2faa8aa4e9cff569100457b09a21bc7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201345 lines \u00D7 3): electronics/carrier_concentration.py:13-55 | electronics/electric_conductivity.py:11-55 | physics/shear_stress.py:17-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060electronics/carrier_concentration.py:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"electronics/carrier_concentration.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4806812c7fb5c424712f6a02505c6435dc1b2db9899935d0c33324a1e468c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201344 lines \u00D7 2): graphs/directed_and_undirected_weighted_graph.py:141-184 | graphs/directed_and_undirected_weighted_graph.py:452-494 \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":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8168400dc976b1386be0f492d14fce4148c10e37621e1afb16139ed5a8385dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): maths/find_max.py:34-76 | maths/find_min.py:33-75 \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":"maths/find_max.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"894e35fcb3144d1348946ac1274ed5e95b5fb02065626a54fc1f4f1a57f12931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201342 lines \u00D7 2): maths/series/alternate_harmonic_series.py:2-43 | maths/series/harmonic.py:11-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"maths/series/alternate_harmonic_series.py"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa114d0d9ee54cfd3e021def319ea97d0ad370973c26d9fd2c70a1dd9369fc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): graphs/directed_and_undirected_weighted_graph.py:76-116 | graphs/directed_and_undirected_weighted_graph.py:385-425 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphs/directed_and_undirected_weighted_graph.py:426\u0060 calls \u0060count\u0060 and \u0060graphs/directed_and_undirected_weighted_graph.py:117\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e844977d3f6a03845ed0cb62ee916e9cff28f8d217e01866f53fe8b781172eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): conversions/endianness.py:238-275 | conversions/endianness.py:279-316 \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":"conversions/endianness.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdd441b85085ec2a35bd667fa6a30f1f7f1f823dcd4d14de0d93b5365f7edc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): computer_vision/pooling_functions.py:9-45 | computer_vision/pooling_functions.py:65-101 \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":"computer_vision/pooling_functions.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b7b03ef6ae6e6563bd821729a2bffcde13857dfaac124a9e27dee1928a806f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201337 lines \u00D7 2): maths/area_under_curve.py:16-48 | maths/numerical_analysis/numerical_integration.py:16-52 \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":"maths/area_under_curve.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14275bab200c9001208f502bab7cec8cfe98a2bf265d8ebbb1735fd7b30c0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201336 lines \u00D7 11): project_euler/problem_003/sol1.py:18-48 | project_euler/problem_007/sol2.py:19-49 | project_euler/problem_007/sol3.py:20-50 | project_euler/problem_010/sol1.py:18-48 | project_euler/problem_010/sol2.py:20-50 | project_euler/problem_027/sol1.py:27-59 | project_euler/problem_037/sol1.py:21-56 | project_euler/problem_041/sol1.py:21-56 | project_euler/problem_046/sol1.py:26-61 | project_euler/problem_049/sol1.py:33-68 | project_euler/problem_058/sol1.py:41-76 \u2014 before extracting anything, compare \u0060project_euler/problem_010/sol1.py\u0060 and \u0060project_euler/problem_010/sol2.py\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"project_euler/problem_003/sol1.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"164da507583a92d7b5dfe4ff52b641fa3d0f668ee69643118f13f3e9994c51a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201334 lines \u00D7 3): bit_manipulation/fast_walsh_hadamard_transform.py:13-46 | bit_manipulation/fast_walsh_hadamard_transform.py:87-112 | bit_manipulation/fast_walsh_hadamard_transform.py:147-172 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bit_manipulation/fast_walsh_hadamard_transform.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c66be13f99e01c880b11210b4ab78d30db124e660b0adbc9098a6fd7397171b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): graphs/directed_and_undirected_weighted_graph.py:249-280 | graphs/directed_and_undirected_weighted_graph.py:518-549 \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 \u0060graphs/directed_and_undirected_weighted_graph.py:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3d1508465f23ddb90b3999822fad6f3d11a29ec77a9a970c07e9647ddc9cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): graphs/directed_and_undirected_weighted_graph.py:301-331 | graphs/directed_and_undirected_weighted_graph.py:570-600 \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 \u0060graphs/directed_and_undirected_weighted_graph.py:301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphs/directed_and_undirected_weighted_graph.py:602\u0060 calls \u0060all_nodes\u0060, \u0060list\u0060 and \u0060graphs/directed_and_undirected_weighted_graph.py:333\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"08501ebf5a035c4fc124e91f4deaf00aee27bd8e81d18c2da4cd05b7104381de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): machine_learning/gaussian_mixture_model.py:88-118 | machine_learning/gaussian_mixture_model.py:167-196 \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":"machine_learning/gaussian_mixture_model.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76a66d023f540f0dac8bb9331f7e388b16321482db98b72841538f9097139ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201331 lines \u00D7 2): web_programming/fetch_anime_and_play.py:73-103 | web_programming/fetch_anime_and_play.py:126-153 \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":"web_programming/fetch_anime_and_play.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae11f29821005a22da5cdeb56bf56a95d7aecc5aa2cb54b32d011d9d1b5ba65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201330 lines \u00D7 3): data_structures/binary_tree/mirror_binary_tree.py:57-80 | data_structures/binary_tree/symmetric_tree.py:39-68 | data_structures/binary_tree/symmetric_tree.py:72-101 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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":"data_structures/binary_tree/mirror_binary_tree.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c11046d35ac2d564f7089aac8fdfae4678fe8572c152235a3ffcb10a858058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): electronics/full_wave_rectifier.py:10-39 | electronics/half_wave_rectifier.py:10-39 \u2014 before extracting anything, compare \u0060electronics/full_wave_rectifier.py\u0060 and \u0060electronics/half_wave_rectifier.py\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"electronics/full_wave_rectifier.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9794261399395e9d78e541631c82362024d160415405315d634b9ee068d33a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): maths/persistence.py:2-31 | maths/persistence.py:41-70 \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":"maths/persistence.py"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"292540799ed4f6c9cdd59671684ec2edaa30f4c24a5bc3c5af5fa2c9ec339d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 3): project_euler/problem_050/sol1.py:23-51 | project_euler/problem_051/sol1.py:25-53 | project_euler/problem_234/sol1.py:24-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_050/sol1.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86d5feec84072cbaa28c16de1137e8baa84c14ff334202e339b4f043555b283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 4): graphs/directed_and_undirected_weighted_graph.py:231-257 | graphs/directed_and_undirected_weighted_graph.py:283-309 | graphs/directed_and_undirected_weighted_graph.py:500-526 | graphs/directed_and_undirected_weighted_graph.py:552-578 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7338c95ee5d0eb152ec73dd7467d04f831feaa900286bd2466aceb82cd8c5642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): blockchain/diophantine_equation.py:75-100 | maths/modular_division.py:83-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060blockchain/diophantine_equation.py:75\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":"blockchain/diophantine_equation.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c59506804e3344e5bf029e6e44e42b1896b371408afcbffaae844307c1fb6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): other/alternative_list_arrange.py:2-28 | strings/alternative_string_arrange.py:2-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/alternative_list_arrange.py"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dada50b460b007d28136f6568845325384f897433643adba398838f5d753fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): graphs/graph_centrality.py:63-88 | graphs/graph_peripherality.py:61-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"graphs/graph_centrality.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"42741a32de035f1b4dfbc843f63f873ef9c1df2a459ab8c1aa3b4700e91a5c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201325 lines \u00D7 2): maths/fibonacci.py:117-141 | maths/fibonacci.py:162-174 \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":"maths/fibonacci.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5682894c9da3ae3ae58a2871ba0e5e48b58e00f9c3d9c2054040ee89a81f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): graphs/graph_centrality.py:92-115 | graphs/graph_peripherality.py:90-113 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/graph_centrality.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a079c1359d08c4ecc68ce511713b7e18b48460ff7f08de7e656af17a028fca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): hashes/hamming_code.py:110-132 | hashes/hamming_code.py:197-218 \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 \u0060hashes/hamming_code.py:110\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":"hashes/hamming_code.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1df6fc0bfeef90547f0ff83c25699d810f1f800be05eafb849f4d0e678a828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): digital_image_processing/morphological_operations/dilation_operation.py:41-61 | digital_image_processing/morphological_operations/erosion_operation.py:43-64 \u2014 before extracting anything, compare \u0060digital_image_processing/morphological_operations/dilation_operation.py\u0060 and \u0060digital_image_processing/morphological_operations/erosion_operation.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"digital_image_processing/morphological_operations/dilation_operation.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e6ae2ece1da6cd726ef5df791e9fccc5e6cd65947d55911049ad758ac46f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201321 lines \u00D7 2): project_euler/problem_187/sol1.py:18-38 | project_euler/problem_800/sol1.py:17-30 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_187/sol1.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f9262303a49cb190b3217045fabe3358c75042ee1b3487aec63004a1c3cbfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): graphs/directed_and_undirected_weighted_graph.py:260-279 | graphs/directed_and_undirected_weighted_graph.py:311-330 | graphs/directed_and_undirected_weighted_graph.py:529-548 | graphs/directed_and_undirected_weighted_graph.py:580-599 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphs/directed_and_undirected_weighted_graph.py:602\u0060 calls \u0060all_nodes\u0060, \u0060list\u0060 and \u0060graphs/directed_and_undirected_weighted_graph.py:333\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"623f06a972dbc673fd7f8f141105c9af40cc05506ee198df3481ce1b45ee644d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): data_structures/binary_tree/diff_views_of_binary_tree.py:129-148 | data_structures/binary_tree/diff_views_of_binary_tree.py:178-196 \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":"data_structures/binary_tree/diff_views_of_binary_tree.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e53b966c2e654ee29616e38b37f1b3a545c655a96b16b3c5f55bc98bb40289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): networking_flow/dinic.py:68-87 | networking_flow/push_relabel.py:68-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networking_flow/dinic.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5855727616a9b1f57de534c4eab61ead6928a2d95a16641602250dbfc5ea0a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): project_euler/problem_111/sol1.py:17-35 | project_euler/problem_124/sol1.py:12-31 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_111/sol1.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fa37661dd831fd42d66c11d0c2e5135142249913867c094e2aec7a550c3a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): graphs/bidirectional_a_star.py:136-154 | graphs/bidirectional_breadth_first_search.py:80-93 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphs/bidirectional_a_star.py:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/bidirectional_a_star.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6e29bad6593ece4c4d3e771b99c19005a530d9d6c6d516025cf043c061dc2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): data_compression/lempel_ziv.py:87-104 | data_compression/lempel_ziv_decompress.py:58-75 \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":"data_compression/lempel_ziv.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f2777afb4ac59be18e6baf28bd083f73de05237987a419a85b89a4e08ea98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): other/lfu_cache.py:233-249 | other/lru_cache.py:247-264 \u2014 before extracting anything, compare \u0060other/lfu_cache.py\u0060 and \u0060other/lru_cache.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/lfu_cache.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"691ec57f3154156e15c9ed39141bcc760a7d6b72585cec7bd86c97e9132d4895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): data_structures/linked_list/doubly_linked_list.py:216-232 | data_structures/linked_list/singly_linked_list.py:378-394 \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":"data_structures/linked_list/doubly_linked_list.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1cc424ec0de9032c56bc8155f0927b26d0143f3197a619374cfa262df9cc4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): audio_filters/butterworth_filter.py:216-231 | audio_filters/butterworth_filter.py:254-269 \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":"audio_filters/butterworth_filter.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6a094620bf0a7a72d6273f97b95cbd8b981d9f4aa95c8ca0a7d43ad07725a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ciphers/running_key_cipher.py:7-22 | ciphers/running_key_cipher.py:30-45 \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":"ciphers/running_key_cipher.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b48fdb7313576e26d606f54755d439275ac0a33fcaa14b446fa8416243b1748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): computer_vision/flip_augmentation.py:46-61 | computer_vision/mosaic_augmentation.py:58-73 \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":"computer_vision/flip_augmentation.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6216476e2ecec986ea29f493e7f04836863108a1f58a32b728ac39abe5491a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): divide_and_conquer/mergesort.py:42-55 | sorts/power_sort.py:179-194 \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":"divide_and_conquer/mergesort.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fefed7cfe60f7251b981588041a00791c70ee644b583ad480faa65f3fc18859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): financial/expected_shortfall.py:23-36 | financial/value_at_risk.py:24-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"financial/expected_shortfall.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4897fe8ebcf9604affb4b0c8e4b69769cbd90b80bc2588d465e3e7e5bdcc3c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): graphs/bidirectional_a_star.py:119-131 | graphs/bidirectional_a_star.py:236-250 \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":"graphs/bidirectional_a_star.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3bda38933593bfb69eaec36b2bf4def920f5b1d6c05f18c6ddbfade2b8fe93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): machine_learning/sequential_minimum_optimization.py:530-544 | machine_learning/sequential_minimum_optimization.py:550-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060machine_learning/sequential_minimum_optimization.py:530\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":"machine_learning/sequential_minimum_optimization.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"587977bb130534a2da2d33da19ba9eeb5117a40498a0bf12cf75cb6a3d5c5bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): hashes/hamming_code.py:88-101 | hashes/hamming_code.py:178-191 \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":"hashes/hamming_code.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc27c96d6a79034cac7442a570382db29d1175c155a1a48b7054ecba2e8c6781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): scheduling/cpuschedulingalgorithms.py:118-131 | scheduling/cpuschedulingalgorithms.py:165-178 \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 \u0060scheduling/cpuschedulingalgorithms.py:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scheduling/cpuschedulingalgorithms.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3badb7e87be4e8ac740435c46fad519facbf0ef99ffaf2809d9e6fcbe72838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scheduling/cpuschedulingalgorithms.py:94-106 | scheduling/cpuschedulingalgorithms.py:142-154 \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 \u0060scheduling/cpuschedulingalgorithms.py:94\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":"scheduling/cpuschedulingalgorithms.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"483aedbef74f7f03f5677242e478c43f6b1704fbd944bf95073beb3830bef95a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): ciphers/mono_alphabetic_ciphers.py:17-28 | ciphers/simple_substitution_cipher.py:68-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \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":"ciphers/mono_alphabetic_ciphers.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ba6f36f91e53882fa04d5473cb966b4fdf310ab7f89d635380c30fdacbd74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): conversions/astronomical_length_scale_conversion.py:79-90 | conversions/length_conversion.py:110-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"conversions/astronomical_length_scale_conversion.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4970479903de4794289844a26e1bce867ff2380ba703226e082bb9988ea6480a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): data_structures/queues/priority_queue_using_list.py:190-201 | data_structures/queues/priority_queue_using_list.py:215-226 \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":"data_structures/queues/priority_queue_using_list.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e7a5be70fe3b00d2c204a207e65e2f30b5573ec8c7fa15722ca900f6adef77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): other/lfu_cache.py:268-278 | other/lru_cache.py:284-295 \u2014 before extracting anything, compare \u0060other/lfu_cache.py\u0060 and \u0060other/lru_cache.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/lfu_cache.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5623581096304b297f65b734f5f17fafdedf5c05e3f5a5902829e7fbf6c857a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): searches/ternary_search.py:95-106 | searches/ternary_search.py:150-160 \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":"searches/ternary_search.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5686175dd46be5963c9c97614f21dc28e1931c31b0100899b53b9c2c8461fb89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ciphers/elgamal_key_generator.py:41-51 | ciphers/rsa_key_generator.py:44-54 \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":"ciphers/elgamal_key_generator.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eeeb5a12565b3619d6499ac49ce81bbc4a9fe7ee2a32223267d89be5ce0ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): data_structures/binary_tree/lazy_segment_tree.py:55-65 | data_structures/binary_tree/lazy_segment_tree.py:92-108 \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":"data_structures/binary_tree/lazy_segment_tree.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fde2ce78d7fdc16e82e2c82b1b11f35a88f5f2c8da54a0279d1cee55c4ad14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphs/basic_graphs.py:165-175 | graphs/basic_graphs.py:315-325 \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":"graphs/basic_graphs.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f81df21ffd928a1632c554d91686d650f99da2ded60a00374b4b7fba54b6ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): other/davis_putnam_logemann_loveland.py:324-334 | other/davis_putnam_logemann_loveland.py:337-346 \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":"other/davis_putnam_logemann_loveland.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc390b2825d120cf39453526c1580d6dcc1df0456828053d1cd81e7277c7968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): project_euler/problem_180/sol1.py:126-136 | project_euler/problem_180/sol1.py:155-165 \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":"project_euler/problem_180/sol1.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6f0c333c448971a93d73dee2496c9953e0df9d7b927381542fc1009371ac69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): dynamic_programming/minimum_partition.py:52-59 | dynamic_programming/sum_of_subset.py:15-23 | maths/special_numbers/weird_number.py:68-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dynamic_programming/minimum_partition.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5536fd8ef001dc45a8cc472c827771ec7e86aa4f6e8134b52cc69a313d1cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): maths/sum_of_digits.py:53-61 | matrix/pascal_triangle.py:167-175 \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":"maths/sum_of_digits.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2802c7f8264e25635c441213bc5f6ec77ea520108eb6a87d052c2db4b76a5d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphs/directed_and_undirected_weighted_graph.py:131-138 | graphs/directed_and_undirected_weighted_graph.py:442-449 \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":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6da7e5b15795f9760cf604b1a5aebed5cb77d4d755c2096c9aa12d660b349b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hashes/hamming_code.py:165-172 | hashes/hamming_code.py:194-201 \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":"hashes/hamming_code.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d56494a74183b4a86d8687f8c18af4759a19adb9eb72830592c8d5465a6ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): maths/numerical_analysis/adams_bashforth.py:158-165 | maths/numerical_analysis/adams_bashforth.py:203-208 \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":"maths/numerical_analysis/adams_bashforth.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bf8679242f8cd6c76e8ef10b2cfee311599c924e6c6c0fde64718db80c38b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): searches/tabu_search.py:54-61 | searches/tabu_search.py:62-69 \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":"searches/tabu_search.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2346a759ed73d4da54ebad97a30f7b276fe7d30d11b746e2bd72a00aa93c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): web_programming/fetch_anime_and_play.py:41-52 | web_programming/fetch_anime_and_play.py:147-154 \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 \u0060web_programming/fetch_anime_and_play.py:41\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":"web_programming/fetch_anime_and_play.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"701825029ceca84960445dff2ce415378ae3654a8429ee53baa6162dc95e7876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): web_programming/fetch_anime_and_play.py:40-51 | web_programming/fetch_anime_and_play.py:96-103 | web_programming/fetch_anime_and_play.py:147-153 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060web_programming/fetch_anime_and_play.py:40\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web_programming/fetch_anime_and_play.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"10efa95cbbd13dded88a619e082963413322853fdc744eb0a27642cc37b856a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ciphers/playfair_cipher.py:102-108 | ciphers/playfair_cipher.py:134-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ciphers/playfair_cipher.py:101\u0060 calls \u0060prepare_input\u0060 and \u0060ciphers/playfair_cipher.py:133\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ciphers/playfair_cipher.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b198f357a6441b689e6ec331d1ca3e760d81b4dd94e48b60174c4c4f7c142ac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): digital_image_processing/edge_detection/canny.py:49-55 | digital_image_processing/edge_detection/canny.py:58-64 \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":"digital_image_processing/edge_detection/canny.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a880a9a6227beff2ac1a645165c64e3857b4b3f754e981f2415c76182b1ba406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphs/basic_graphs.py:11-17 | graphs/basic_graphs.py:24-30 \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":"graphs/basic_graphs.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"356d79123ad699792c20e46a002db60c61993da15d26c79c1cbcc685ad7517b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphs/edmonds_blossom_algorithm.py:240-248 | graphs/edmonds_blossom_algorithm.py:251-257 \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 \u0060graphs/edmonds_blossom_algorithm.py:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/edmonds_blossom_algorithm.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9289771764afc02c58b7ed88c85967467dde8c8e212bc435ee9f397a7f804ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): maths/numerical_analysis/adams_bashforth.py:121-127 | maths/numerical_analysis/adams_bashforth.py:207-213 \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 \u0060maths/numerical_analysis/adams_bashforth.py:121\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":"maths/numerical_analysis/adams_bashforth.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eff4b563e772385a932614fa085c20c6afb2511576ee6ec3e638b4bea55a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ciphers/hill_cipher.py:128-133 | ciphers/hill_cipher.py:177-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ciphers/hill_cipher.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a289fe517323d54683bd1adf7070290f9e04fd097f7d843e9eeb30f0bf64f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): dynamic_programming/integer_partition.py:35-40 | project_euler/problem_076/sol1.py:42-47 \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":"dynamic_programming/integer_partition.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c58411f7c386120086257a8108cab9d7de50dcf7126dcfad59f268d6804e38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphs/bidirectional_a_star.py:99-104 | graphs/greedy_best_first.py:112-117 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060goal\u0060 to \u0060TPosition\u0060 in one and \u0060tuple[int, int]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/bidirectional_a_star.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43dc6b9c4438ee1c671acc52a02f6b2c6b88895d51fc4eff9320a1c2e08bbd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): matrix/inverse_of_matrix.py:117-121 | matrix/inverse_of_matrix.py:124-128 | matrix/inverse_of_matrix.py:131-135 | matrix/inverse_of_matrix.py:138-142 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060matrix/inverse_of_matrix.py:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"matrix/inverse_of_matrix.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16eaf05c05ff70707f1d90b78551bfc7348c34d0a968a209ceebb6c17a0ec31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): graphs/directed_and_undirected_weighted_graph.py:30-34 | graphs/directed_and_undirected_weighted_graph.py:355-361 | graphs/directed_and_undirected_weighted_graph.py:363-369 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/directed_and_undirected_weighted_graph.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"355242898e3f19a01d22ed89ea4ac7daf3268bbd8ae49e2ef0374d86976c509d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): audio_filters/butterworth_filter.py:232-236 | audio_filters/butterworth_filter.py:270-274 \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":"audio_filters/butterworth_filter.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b50128b0bd6e36eff1e97826deb0619cc975917b1237fb4614008502b4bbcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ciphers/bifid.py:26-38 | ciphers/polybius.py:25-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. 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":"ciphers/bifid.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"332c05b995d0203b6c450eb457ec25da5a4d95634db619f142e3cd418dd0b676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): computer_vision/flip_augmentation.py:116-124 | computer_vision/mosaic_augmentation.py:175-183 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060number_char\u0060 to \u0060int = 32\u0060 in one and \u0060int\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"computer_vision/flip_augmentation.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbb836cf8be025a928a3ecc49653b9b5355511534bcdaedf0a4592f60fbd1d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): data_compression/lempel_ziv.py:12-25 | data_compression/lempel_ziv_decompress.py:11-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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":"data_compression/lempel_ziv.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e05f054a4279ee69976d0217af8de4bc19b9413dbd9ec130419fefc3674944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): data_structures/linked_list/kth_element_from_end.py:19-36 | data_structures/linked_list/partition_linked_list.py:19-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. 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":"data_structures/linked_list/kth_element_from_end.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3b8cdaa7f7b8d6b79a0d42991e618ebadf209b8acbc9fb32a361dfc9403cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): digital_image_processing/morphological_operations/dilation_operation.py:8-20 | digital_image_processing/morphological_operations/erosion_operation.py:8-21 \u2014 before extracting anything, compare \u0060digital_image_processing/morphological_operations/dilation_operation.py\u0060 and \u0060digital_image_processing/morphological_operations/erosion_operation.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"digital_image_processing/morphological_operations/dilation_operation.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb19f12b63293b675c23b28955f4ea3a92c4848904e7143b802ef3809962a5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): genetic_algorithm/travelling_salesman_problem.py:94-103 | graphs/ant_colony_optimization_algorithms.py:103-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"genetic_algorithm/travelling_salesman_problem.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde6ff214c9cda85114bb0ed523b574dd311b789b5fb745910e3a919a66cb89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): geometry/graham_scan.py:92-110 | geometry/jarvis_march.py:45-55 | geometry/monotone_chain.py:34-60 | geometry/rotating_calipers.py:36-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. 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":"geometry/graham_scan.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d824932993436fe1f1e30ffb9dcd825714c2eb09a604701e0ea4df4493ba64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): graphs/bidirectional_a_star.py:162-171 | graphs/bidirectional_breadth_first_search.py:99-108 | graphs/greedy_best_first.py:169-178 \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":"graphs/bidirectional_a_star.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3856f43654ea001acabbd69178bdec1bb43f20f150f878b8594fe863b44fb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): machine_learning/dbscan.py:33-49 | machine_learning/mean_shift.py:36-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/dbscan.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b18553ff1be14f65952a58dfa5861d7cb25643a5c80262f3934e42a66ad9a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): maths/chinese_remainder_theorem.py:20-32 | maths/modular_division.py:113-126 \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":"maths/chinese_remainder_theorem.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"036f7c70fe92a09afa8b4c3df12cae15a92b9052f65d89b5ef135d0138d3e1b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): maths/chinese_remainder_theorem.py:60-71 | maths/modular_division.py:44-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 both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maths/chinese_remainder_theorem.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"342e3d3ca5b3286a386d359300b1514ae51b211e20be6f31c4dd4eb76580dcd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): networking_flow/dinic.py:58-65 | networking_flow/push_relabel.py:60-65 \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":"networking_flow/dinic.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"982b40b86df9f58e3dca7f4364d247aeb587292488a34e6cd2a4c21aa6f2927d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): other/lfu_cache.py:106-112 | other/lru_cache.py:104-110 \u2014 before extracting anything, compare \u0060other/lfu_cache.py\u0060 and \u0060other/lru_cache.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/lfu_cache.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a2c7ecd17e9f5c778a8ab45daf6200d78ae4c7997e07b2955b3f7e5bc95ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): other/lfu_cache.py:148-161 | other/lru_cache.py:130-143 \u2014 before extracting anything, compare \u0060other/lfu_cache.py\u0060 and \u0060other/lru_cache.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/lfu_cache.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62e2c6a1aee65b70ce46c5fd2f07ffd9b10fba31149504d47d82be98ea1bd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): other/lfu_cache.py:200-205 | other/lru_cache.py:213-218 \u2014 before extracting anything, compare \u0060other/lfu_cache.py\u0060 and \u0060other/lru_cache.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/lfu_cache.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d88ceef9455b43da5322f68d98762d64605f03410bef9f49850f1ddd47a43b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): other/lfu_cache.py:208-216 | other/lru_cache.py:221-229 \u2014 before extracting anything, compare \u0060other/lfu_cache.py\u0060 and \u0060other/lru_cache.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"other/lfu_cache.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee556e53bef1670629227325182fda7841d34a78c089493dd863a67329f56821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): physics/lens_formulae.py:54-76 | physics/lens_formulae.py:82-105 | physics/mirror_formulae.py:85-104 | physics/mirror_formulae.py:108-127 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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":"physics/lens_formulae.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c069c4aa98e755d02bb1102f82bd871af2a6ec6c9638f6d713763399086b779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): physics/lens_formulae.py:111-131 | physics/mirror_formulae.py:62-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"physics/lens_formulae.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"923d95e25cea37231b99f53f47624c6626292c98a4cb17b89d3be3779fe11ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): project_euler/problem_012/sol1.py:27-38 | project_euler/problem_012/sol2.py:32-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 \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":"project_euler/problem_012/sol1.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c4192cd26063d1d1aedf844a9d27fa230faac9dbcd9bcb7c74fe99ce05de57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): scheduling/non_preemptive_shortest_job_first.py:73-88 | scheduling/shortest_job_first.py:79-92 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scheduling/non_preemptive_shortest_job_first.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5747b2035b7b6c9201ac4b2dcdbf21ce34658bd4bdbb197202c1cfeda708d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphs/bidirectional_a_star.py:257-262 | graphs/bidirectional_breadth_first_search.py:158-163 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphs/bidirectional_breadth_first_search.py:170\u0060 calls \u0060testmod\u0060 and \u0060graphs/bidirectional_a_star.py:267\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/bidirectional_a_star.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8a33188c5f9f9ea6b7037bf4d765ea14e448424109a32050456f98f90e5b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): graphs/breadth_first_search.py:27-38 | graphs/depth_first_search_2.py:36-55 \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":"graphs/breadth_first_search.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"808ef8b8b0b1c612a98bcd37c36786dfe72274586c734a55df1b1647a707b285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): data_structures/binary_tree/avl_tree.py:103-107 | data_structures/binary_tree/avl_tree.py:119-123 \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":"data_structures/binary_tree/avl_tree.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b63d5c98b246c0085c264d6c4ef0d5e53ad8b81b8e6d732747738eb9beee2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): data_structures/binary_tree/red_black_tree.py:666-670 | data_structures/binary_tree/red_black_tree.py:677-681 \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":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46029845a666e705c01d5ce69b3bcc1954c9164bb13fb952de7fd6868e179a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphs/minimum_spanning_tree_prims2.py:255-259 | graphs/minimum_spanning_tree_prims2.py:264-268 \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":"graphs/minimum_spanning_tree_prims2.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde7a906c0528e14ee2095dd4bd0aaff3fb21d90d414c086631bf33fe88bb9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): project_euler/problem_018/solution.py:50-55 | project_euler/problem_067/sol1.py:39-44 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_018/solution.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8abdfb922254d8f9718bf03d9f891c785739c0d7b4152b260fc0bef3625829"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PokerHand (LCOM4 5): PokerHand\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"project_euler/problem_054/sol1.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b5605d04b9ada99ffc82e5cb2306d658c3021ea05be4bbb55b6d06a55c8f7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: data_structures/linked_list/merge_sort_linked_list.py: data_structures/linked_list/merge_sort_linked_list.py changed 13 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is merge_sort_linked_list.get_middle at line 42), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix\u201D; \u201CFix doctests\u201D; \u201CFix\u201D; \u201CFix\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-07-21..2026-10-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-21 19:31:26 -09:30\u0027 --until=\u00272026-10-19 19:31:26 -09:30\u0027 --full-history --no-merges -- data_structures/linked_list/merge_sort_linked_list.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/linked_list/merge_sort_linked_list.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aeff9ae38b23ca4f37d2706b3a16362f37c6da3c74a8eb9809eeb726d8ccae"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 13 significant file(s) lose their only recent owner: scripts/hacktoberfest_prep_update.py, audio_filters/equal_loudness_filter.py, neural_network/perceptron.py, data_structures/binary_tree/splay_tree.py, fuzzy_logic/fuzzy_set_operations.py, machine_learning/local_weighted_learning/local_weighted_learning.py, networking_flow/push_relabel.py, networking_flow/dinic.py (\u002B5 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"838e5cd00e26646cd89badd5cc15349864cc21b82307cd2d2164d88bfb0008f0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 7 significant file(s) lose their only recent owner: graphs/frequent_pattern_graph_miner.py, hashes/sha1.py, graphs/minimum_spanning_tree_boruvka.py, data_structures/queues/priority_queue_using_list.py, machine_learning/astar.py, graphs/prim.py, data_compression/huffman.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ffd7b66994a61bd06d3d92e728c9de2563b2f89e4c968b30bae9dabce412e8b3"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 5 significant file(s) lose their only recent owner: dynamic_programming/needleman_wunsch.py, bit_manipulation/fast_walsh_hadamard_transform.py, geometry/rotating_calipers.py, strings/suffix_automaton.py, geometry/monotone_chain.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"da305ffb91c64f98dbbead2e7fb3fd1de5db17084174dc43e412140e158e2a86"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 5 significant file(s) lose their only recent owner: neural_network/optimizers/muon_optimizer.py, neural_network/optimizers/adam_optimizer.py, neural_network/optimizers/nesterov_accelerated_sgd.py, neural_network/optimizers/adagrad.py, neural_network/optimizers/momentum_sgd.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"01f16d21fb0fdf0d9132e93d33b2e1fe5228422453eb434bf5fb272b45d2c9dc"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 4 significant file(s) lose their only recent owner: geometry/graham_scan.py, geometry/ramer_douglas_peucker.py, dynamic_programming/narcissistic_number.py, geometry/segment_intersection.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"69a1ffb902c6ea8d8c1f3f5b99183d241a5daad431d54aee2e232f23e5bd9c56"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 3 significant file(s) lose their only recent owner: graphs/bidirectional_a_star.py, data_structures/binary_tree/maximum_fenwick_tree.py, strings/jaro_winkler.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1bf31a2d1161df4f295632c690796e9daa82b81e44740b21613e1e6e2f42a372"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 96 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 (141 single-owned of 627 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; 627 of the 1542 production source files in this repository met that bar). They are anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (2 file(s)), anonymized user #10 (2 file(s)), anonymized user #11 (2 file(s)), anonymized user #12 (2 file(s)) (\u002B90 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: machine_learning/mean_shift.py, machine_learning/dbscan.py, financial/kelly_criterion.py, financial/sharpe_ratio.py, fractals/mandelbrot.py, cellular_automata/conways_game_of_life.py, maths/zellers_congruence.py, strings/z_function.py (\u002B96 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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 (122643 LoC, 1609 module-visible types across 210 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":"9603565aa6069e0abcf535dcde33980e7f55a15fa6af1c7abedeeffe7f52bf08"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56554494bbae9d349154991f488216bd57870a43fff9921199ba6dd6feab040e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3df25c9782664fe959b16dcea5f7c46b3f8710a48d8b82f1b2c2296ad0735cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cc79557567667c02baee1e68d6316f32cf8c4c99bb07183d9e1efd260bce579"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6ef659cbb905d3134c883976504e2f22010ed22742757b79b93cdba59bab970"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c45215ba53f22c5622b4124637a542bc56c87a7871f6c45384efb391d6300a42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e90ae6a3bb1f90621097a367783dafc0f419b76f6b0951cb160365ca76da2b00"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec1752549e631f933f70088aedb03870d9c60a21e39c7b26bfb152906d2cb5c0"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"da9beb68668f7919722392e81121755366a2c1b1d5c496d7604487e8459aa7c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1cde7fd51da7798c74d44d3088d7e383411d387d496e17218cfcfa2647e4e8df"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1bb057801f190e6f9edf28a161eb3a7f78f4267a49f3dafc5a31810c07fd50d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2aa87b2a4f17b7ee9c81457aefcd126599e5bbcd1c977ac3a008381808a5b919"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49d5e6570c9d344f79c68e7a1fb66a05580409efeb68a90784c4e2f433f18eeb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05f84cd586e960a07bd017ddcfe9190682651691c8bf8732fec12d0614b1e232"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cbff04c560a3d0e1674e5d8a2a9df60be0e1aebb57fdc0baba152bf3ea812f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7c280d4328e35a1b1dac9f98b1782ac0ed6d65c9004cf47537b3a2eb733b5fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f313e10d2e0d1154f0cd76e7af254042a71518641dbd7642e7c32ec1fc73707"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed1e33254055488bf49a28986d743ff33faff5199de2a3dc44ee31b33729c222"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c5acbaaf6d94414e54c087563bd8ce5ba74f9fd32ecfbd85844425fef88c192"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d02f4324ec22be36f7593d7b1ce8cb2bb34d5152623fd379962e2bf3e9c9073a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de16ed50a3bde0497dac24909edda5f302a882d29bfaf3e0f301bbc2f4595d69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62ce5b6045cc58d8ff15fe3ee759db647ede1a317fe4e9c851da97ade3b8ae72"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b2ed6ce5df979ab9e18f3b591a696291b2cce82ac577334e11931889b4241a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6957136f6c722dded91b63316a5e49f839f13de5d35b3772d205824050fe6e0f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c165abb5735e27de5bb605c2904a26975a5d2215337b18b4b21927de240384b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5a7b7c5421bc8f1d890a02c04d3f9dd5ff0d03279f0a4837f4658426bcfaa80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"36fb30869a56a7a669703b439a87447586fb58d319f7c8162fc8f01a038d7274"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27ea191dd34ebf39723fab212fef4edc4c7eb0f032ccfffdd599e557c690eebb"},"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":"afcf65750254bd9f4496c1a3f94f6f9d9f571b7ba898ae85903749c2c8ceee70"},"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":"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":"4edb803858b88fe1291d1038a4ff2a735e7ce3afb9c8798bb615cda20b56b968"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46eb56ca90f14ff58240ac181de64c98cab210a78b41d8e834bd882a2763a646"},"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":"D32","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":"2fdec7da4dbc838ea2db0e10e9716d97b4580bfd0cbfb49edb9e1c33f7ab853a"}},{"ruleId":"D32","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":"798982cb14ac5118be5b416aece70fa46f9de58ebec4aec80054ebb9da9569ae"}},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 317 of 627 significant files have no living knowledge, while the repository is still being changed at a low rate (567 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 317 separate risks. Counted over 627 of the 1542 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data_structures/binary_tree/red_black_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0390e17f1e1f3cfc13cae5b5d5bf7df3a0cd32d65f19e669eb564aaeb1c68d"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/graph_adjacency_matrix.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7722f8731fa8cc1c6870892ef99c5cf722a40c633f3172ba7fca2d7b9fbcdd94"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphs/graph_adjacency_list.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc0557944e0cf332ffdcfd8d26fa977b6af2a784524d7623f047e9c89d40467"}},{"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":"cellular_automata/wa_tor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c395bda32a4648a27ae7d9c027ee5bc153de4c34fa48cc9ad6cb07d482e39c"}},{"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":"digital_image_processing/index_calculation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98aed99863d8ce0b8eb6e285d1463ebe1ad35b05110d656f0decf9aacee0f0c"}},{"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":"data_structures/binary_tree/binary_search_tree_recursive.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dd6b08685c0aee26301b929a52c6478092233f8a6008559714bc63dab5ced7"}},{"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":"other/word_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92535aff7f2818c90be554b52a8bf1f6f865655394e640bb4aba3b3222c59b5"}},{"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":"machine_learning/mfcc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd45c0055f066fc3a46a8617088ffb7bf553b88db14e5d6b30678103f863bdc6"}},{"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":"data_structures/queues/double_ended_queue.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f031a08b1a9a016a57f72a6d2f77f966c2a87dcfcb12e0be1b9c6679059d4cf2"}},{"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":"dynamic_programming/viterbi.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11dfdd23ea6b0cb1fe7d0b9dec5d8045a1482a71d0b4c27e62eabfd973e8d5a"}},{"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":"physics/n_body_simulation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ddcf2cbe9982efc16a2c9940ebb3ec90649595d0e87c88c7681bfd1fd53996"}},{"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":"other/davis_putnam_logemann_loveland.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bbc5989b8aef4d715645ea398cce01d0aeb9e42c752e76aa1293016ac815e6"}},{"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":"neural_network/two_hidden_layers_neural_network.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e136c171bd2915606d32ce58b7a11f364c1e653d43d46fce0906a255728b2e"}},{"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":"conversions/temperature_conversions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd5b091eafc0b7c938a78b93f4f9d7ed8cda7e4b4ad3e02fdd9cfea80c384f7"}},{"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":"hashes/md5.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9202b3fe3f834929fc3076a10930915fe32c75c76c61038360dbc6826f2f7141"}},{"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":"searches/tabu_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5587d0c7df7442a60cfd45fdf5bebda0c6737812e165b2e40f16faf49764f44e"}},{"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":"conversions/weight_conversion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a077501f9416f6acc6f94c60a52f5cc6cd8d3aa2e950b43ee8b2a0ec762b0ddb"}},{"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":"other/lru_cache.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a9e81ec26ff022ae1643dcca0e89c3fed19dc7c51522928dfdf0dc8c946a26"}},{"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":"other/lfu_cache.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28d5f6a64b68eb46efe18f76f97fc70ab1ad0e669e02c7bd9d82e3feb5bf92a"}},{"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":"data_structures/binary_tree/avl_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3daccab948371842e1f7762db27835b821fc88c5b41cae83dce5360cd30f576"}},{"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":"ciphers/decrypt_caesar_with_chi_squared.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c9c3795e713894087da90ac314410e1c24023033aa847e61aa6b5562602411"}},{"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":"graphs/minimum_spanning_tree_prims2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96a7c148039a0407762ce2b2ecc87d1d8e97ca28a1bdc2bdb22837510c83f8e"}},{"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":"ciphers/enigma_machine2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"806185d8da131eb882ea150fbd8bbdc223c3361dc00b00d79c1b3ea346d00225"}},{"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":"data_structures/hashing/hash_map.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdede77c2a9711b9c54e0cc3947bddf79d7d02ee1599a989e0cdbd224b107c0"}},{"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":"matrix/matrix_based_game.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81efbefcbf6c3abcd40a4659c14f20b1eaa38098a9bd1149fdf3a0ba77f56963"}},{"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":"matrix/sherman_morrison.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2511d97318fb67e763c377ac968df4636fbefd1518a8f7d0c507378f06a7a5"}},{"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":"genetic_algorithm/basic_string.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bac2832c9c286d4a4ac6380adc2530bed919601aa10983f6a9ace9f79034e1"}},{"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":"data_compression/lz77.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"280cf02b3b31a3eb7d24375d92d7a5115bd08176238b996675f2334c3d6a8296"}},{"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":"ciphers/caesar_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7818f0f6470a663cc848d9c3d37823879c7e6a54996c7eaef2111dcdb1c6ac35"}},{"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":"machine_learning/polynomial_regression.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd76b4dfefe8e23c723cc5b00ce4cddf6947cacca8cfc2fcc57a34edfa220a"}},{"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":"data_structures/binary_tree/segment_tree_other.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd32d8338c5ccbdf9e895f4720b4ff8c1275875cc3dd8280f45a2809f04b9d0"}},{"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":"computer_vision/mosaic_augmentation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b642be4103c63d1606567bd1f5212463349f649c418274b4fcc01b717dd1aeb2"}},{"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":"maths/numerical_analysis/adams_bashforth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad099ee0678f27e18b9ed7bec6f335e29d9c19b06390b228cda832f712042b88"}},{"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":"ciphers/trifid_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff50b12942b444c103eb80c824aacadbca77e0da315bde6f30d77b0f6fb329b5"}},{"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":"physics/grahams_law.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e5ebb6da4c812c2da6396197a1db44d60fb0d291d19183ef910321a42abb4f"}},{"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":"data_compression/burrows_wheeler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e6e8d7f6dbda4e8f27aa53ba7ff4dc6a6d2dd09bc0a76bccb8f1a5060873b0"}},{"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":"data_structures/linked_list/circular_linked_list.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2d46ea6f1a7ab771267e6f35014e8690b79a38266953e73e9a2be350b3529c"}},{"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":"ciphers/shuffled_shift_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c971fc53f0d905fafb759d262b239671779e5f844e9b99d30854ca52c8b5d6e9"}},{"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":"graphs/edmonds_karp_multiple_source_and_sink.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89418388c217a3e58f49b80abb9f871804bf8b2baaa0b31e7644f88692757d5"}},{"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":"backtracking/rat_in_maze.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17a5b80c23c9e027195cca66fec6abe3b07dd4fdd8a2363fd69633e649a8f25"}},{"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":"fractals/julia_sets.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ddf12adf603e367d9e9e62281e4e493ed62b25fc1ff3570c5751340eb81aaa"}},{"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":"linear_algebra/jacobi_iteration_method.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2455e0d89553c5c0eadcb1aaf4a6dca8f225a3162fd3ba7010c3f0c7015d5da"}},{"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":"project_euler/problem_101/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a69d4665a825d82c17e960d22f232937f61d4133a2ff43bae9dbc8a1311f80d"}},{"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":"physics/lorentz_transformation_four_vector.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5651665239b7d27e1e873a0722d2737b5faeaac65406c90ff2fd4fcc22bb95"}},{"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":"graphs/boruvka.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"914f2c49795ab81f358f0094ba3de14c3357161a7f420e73fa0ae6a0b38d2e63"}},{"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":"dynamic_programming/smith_waterman.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dc5ae01b5975c45b6c666355d23d5c1d1fcbe4a0ce94d533a7da8d66d2ae3a"}},{"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":"data_structures/binary_tree/fenwick_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39db03d7eb5d8de9d1a42272936f7473c6239325d286ce486b653d513b7a3b2"}},{"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":"other/number_container_system.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53c8c1f532db61c189ad09160f3e22154bd2058b571feaad9544521d13c2b84"}},{"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":"maths/radix2_fft.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46241bc272ba01a4d8b7b0437288c2d5365e1d1ab6c8c6ff08acd3eff3a44f14"}},{"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":"matrix/pascal_triangle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"856b2b68de465bd43ac32f59fbaf516466871df5bbac9c45bbdc3b60411a7ce1"}},{"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":"neural_network/back_propagation_neural_network.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2560e21ab7be31e97b2666bfcf39a45588dd4c385ade85ee040bfb1cd5e73e"}},{"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":"machine_learning/support_vector_machines.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bc54e2ccf7d4258403bbe63a5d072086896f3cc1ed425420d7768c7c7e2bd4"}},{"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":"graphs/bidirectional_breadth_first_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2299cdb858d055a6a395fa60c4832772d65b59b3ade8cf9f638d28e29695a3a"}},{"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":"data_structures/binary_tree/wavelet_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"604ba3b232b1196311ee230f8c7e7bf1fce4f223d4a9ddbb7e5dd830743348a6"}},{"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":"data_structures/stacks/postfix_evaluation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b62f6512de34cbd2365ec1c64a90c8f252e8847a50fe818f6535c6a99080f56"}},{"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":"web_programming/fetch_anime_and_play.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1df5d8eee20ff15e072e81e84f7c4a359fc9cdb0cd7604d35ef78d058be3fa"}},{"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":"sorts/odd_even_transposition_parallel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5ef572b39e0a5f89927b8f6fa1e57c0ffcaa28120124d0fc20295807c049ec"}},{"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":"geometry/jarvis_march.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3888706d2b896e66a8adc8bd2d4681c23e36f8929ed0e8856c2b34c32dc7d068"}},{"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":"backtracking/hamiltonian_cycle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"668ee2ea02364f40b996419e2d10df84cc01b0ddc987c8a2ffa61fccd6d9e7a4"}},{"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":"data_structures/stacks/infix_to_prefix_conversion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68a726ca45bc5f69f1f0a896b0a0c3f0f6c984ffb34851d84daca6c05ef24bf"}},{"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":"data_structures/heap/heap_generic.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4328732dcd237bccbd11a4b7ec96f984b4e6f6ac75d4c5cf96e360ba5f9be3c"}},{"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":"conversions/rgb_hsv_conversion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"712f97e79d398fc0808b11add0675a0110b434ca173052e5c28e549bc0d88485"}},{"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":"project_euler/problem_180/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0787298ae7858ef61eca8242b013615fa7a6f9f2efcc399baa7d1e4359ae38ca"}},{"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":"data_structures/binary_tree/binary_tree_traversals.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a1de8ef6a3e716128487eeb3b8a259ae53519150d4cead3d391a9deaf63a70"}},{"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":"conversions/convert_number_to_words.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa10b92fcebc39503ec0a595cbc6d65651f79514b9abe168c03a9290151c476c"}},{"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":"graphs/bidirectional_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a6f12c45c4a11ccc95a0dbdaa16ee48391af03f8a00f6093ecbe56b5014bf5"}},{"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":"data_structures/heap/skew_heap.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b35638743b32cd803d6fbc15eee5752919dfefc4036e77c9d432b49167c63b"}},{"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":"matrix/largest_square_area_in_matrix.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e59fda063f7c0497e9003b2fc58131fd3b3e58b502bd6169262b93e697a6dab"}},{"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":"maths/pollard_rho.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b9d85ba001703b67d7d2aa3c71c4c42a54e73892b8d7260eb9e8192d9153ac"}},{"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":"physics/basic_orbital_capture.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd65f7c05c93cfd66c0566cc310f3282c39f474a93ab01795d9fe6d05324c89"}},{"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":"machine_learning/similarity_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79112172cf94cb626efc96d0009940f1614cf2b9ae51d621dc5a088484affe62"}},{"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":"other/graham_scan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9aeff5158e929745e52880feed43afb9fb31ce83e0ded16fff8c23676ae5d6"}},{"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":"digital_image_processing/edge_detection/canny.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5592b0cd418eb2e7f86cc35ffd4d4f9f3d5351cfe0f7cde3de4389637bd2f864"}},{"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":"graphs/greedy_best_first.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3212cdf51120dc3369786382d86cdf5c966a929903654b78e53b403d19a52e"}},{"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":"fractals/mandelbrot.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc30c91853181b30c71d505e2a07b5ae481a4caab7575403feddf22dc38c147"}},{"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":"data_structures/heap/randomized_heap.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c41f0caa29c3e6a2daf87b7e44401e36c2c88e66ea232ed611443368667d2a2"}},{"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":"maths/simultaneous_linear_equation_solver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"641ff930a6f10c1076ca9144fb094cf8785e93c03000930162185ef51e10b42c"}},{"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":"searches/simulated_annealing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e709b769e806525f60fd4c1f9bc40b2a96b2b724584cd999b30aa637ce128d66"}},{"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":"project_euler/problem_686/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff72585aa33d7de58fe24e2835bd0d4247c7d36cff71d935128d74d9285f992"}},{"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":"machine_learning/t_stochastic_neighbour_embedding.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71440a0d111c718b1437a94086fc798c4197bc4cfb8e0caf413f40495b53d32"}},{"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":"dynamic_programming/knapsack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb6f63589c30a5a900f64c650f5feec32df0f81278c72744115e140135c32b8"}},{"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":"cellular_automata/nagel_schrekenberg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db91efd5a41d9dd6946965eb6cb6bfc6d2556a44851f4f3484962ae77b2e714"}},{"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":"maths/binary_exponentiation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e5bd5f8e1643900fd8d23fea5c2a03b3ffb511493338cf8933a216829d7b26"}},{"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":"project_euler/problem_551/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c9300e74b9a846ad1a848749e1d257504202f07dd5e46e9d348fdd1f2aca50"}},{"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":"matrix/matrix_multiplication_recursion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a72fe1da7174a47f2c2057ced2126f420f29b47a8de88849165239f388af71e"}},{"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":"linear_algebra/src/conjugate_gradient.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce744b3a63bd0ac12c5af736dac4693c9e0b2c009177ee9d99d515f72a9b3091"}},{"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":"machine_learning/word_frequency_functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"709058cec9a6325f60fe0be49bba6b8b6cefe075654fc0b9c0267ae4afc98b03"}},{"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":"machine_learning/logistic_regression.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c90254816408be9da823cca66018b064c416d2cde02ae9b516033f4c2ac368f"}},{"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":"ciphers/base64_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95464c251067fc62a303f195549603f355d0c64be427823be17f9bf577d5804c"}},{"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":"data_structures/binary_tree/lowest_common_ancestor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"785ada60bedf307739402c619d4bb8edf35c4ad430ba7351fabded4771274c6b"}},{"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":"physics/mirror_formulae.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99775c900f15f491c93ede9e7fb14e30e322c63f5090d359076d84ac938f1a8"}},{"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":"ciphers/rsa_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"273962c1d449fc8ecc3f3543d44c5b9202f4b89ab980a90462bf90877ce1867e"}},{"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":"backtracking/n_queens_math.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eeb5a8d065f13149bf1cd2f1bec7757e6b625aa9028ff427061a56e4629b25"}},{"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":"graphs/minimum_spanning_tree_prims.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7da2ee2eeb61f2de3071be4e0386714802cdf1304ef9fa7d2a3668e5c205d"}},{"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":"project_euler/problem_059/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadfce2208a24b888c55ba6a5379fd1a1ee053689313b7eefba344c6602aaeaa"}},{"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":"maths/entropy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c8d6f414dcb1056985eae6db7cd2ed3f20a2cf023d368e9e25bbc75195d512"}},{"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":"data_structures/binary_tree/lazy_segment_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19461040beecb9fd2079e3b037e1f543babf869d49a9193254d6df8d8108f9b6"}},{"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":"data_structures/binary_tree/diff_views_of_binary_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c02e48998157c730a50ee5a79102d914073fc7676873fa1d6c07062ee9f8fa5"}},{"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":"ciphers/autokey.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d9fdcab8ba0529661968294d7346063104a72b6fa3347837592c1ab959d74"}},{"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":"project_euler/problem_074/sol2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8f5ec89ce390432f63c30206ee81de21ff0f2362e6db9408db313f9bf2165e"}},{"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":"data_structures/stacks/stack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4047c46e821836b9425c51703853b3ad5cb2db22a94ec597c2129dd0cce6e40c"}},{"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":"scheduling/shortest_job_first.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a635e284236b4bc79a45fc1b8d79c224e601144e6f2f7389c3d6da241f829227"}},{"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":"sorts/msd_radix_sort.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddccc1b9d5a7854de73b3447fb030d7ad28b7734c390db797dbccc95822a39b"}},{"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":"graphs/breadth_first_search_zero_one_shortest_path.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4a3b069c8602a057876a88a55c0a728cb6a43ca6b5d5f0e46126c5eb161275"}},{"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":"data_structures/linked_list/is_palindrome.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69d4c88906d4ea5c0cdbe448bc9c85e812380ecbf061ab83b95f15195fec3d9"}},{"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":"physics/casimir_effect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39f5fe971bcda8b278dfae03db50b50d4e94dea0f164582791c7518bde48582"}},{"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":"maths/points_are_collinear_3d.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e7ac6bc2233c4c667506661a8604939d0c3dac1f93c7584cdfca94090a4dec"}},{"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":"physics/lens_formulae.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d00c4f70d986d12a20df6bf442d1ddf181c79c791e2d9e47b0b3c36ef0f9a11"}},{"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":"maths/monte_carlo.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c97a1cafbad8987199bd7007d8a704ac7fac21a06be04f6314f1157d9342f0"}},{"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":"linear_algebra/src/power_iteration.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bbbf51e9f9034958ce5aaf324122d3afd24b52c15a1ca74ef430b272ebe698"}},{"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":"maths/dual_number_automatic_differentiation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ca482cb02001f90d220f3cf0667fb462eb5c2376edb4da283ba1a39d5b1f83"}},{"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":"project_euler/problem_187/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07158c5615e7eb042ed9ccdee33192df6dac47dd4a9db1d8318c91a2734f7be8"}},{"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":"ciphers/playfair_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f17ddd767eb8e5ac0c34000dc852f13152dba4ce77cd49e7709175dec4aed2"}},{"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":"maths/special_numbers/harshad_numbers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b296c9f93142ddc7aa0e2d7385e66b2b34eaa940d12158d2c8d81a8a2331b"}},{"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":"physics/doppler_frequency.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdcd4fde887645108cb0fd27bb6b03c540ec2ea1cb16105046ca91e15f7f6a1"}},{"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":"graphs/a_star.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada102d16a4eecfac8e0095ef81e43d61f4503af80e9efb2372d19db1e8b3847"}},{"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":"web_programming/currency_converter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfcd91e659e4c4154220c29261850eb9aef95f48c742239c430034cbea2cc62"}},{"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":"physics/horizontal_projectile_motion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e70a3279564e464bec0e405d284cf1130d5365997071ae198bf65db482bfe6"}},{"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":"strings/is_valid_email_address.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52a3c0a36c93354d37e56e6980cf08dd8ccaeeb634c957a278a57421e2501ae"}},{"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":"computer_vision/flip_augmentation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1c1cebb27b78c91d81f5481704a07b463ce17e757349daa5d8ff39d32f227d"}},{"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":"fractals/koch_snowflake.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56759aef22a5cf0914181e259311fc1ad5febdd944de07d5301022091f2e8b4"}},{"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":"computer_vision/pooling_functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a96cf1e2519cb2e5d55f8024c9529dd6b7ee17f0852ae59b65c8cf24fc2d503"}},{"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":"other/guess_the_number_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e8a47732399af464197647d84a6976087874e118f95f21c704c357cdcbb7ef"}},{"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":"data_structures/linked_list/swap_nodes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a9e0d0328e7cc91ec1b1817e7b0c30d637d9ddb4bb04e3923a4b5c9e96877a"}},{"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":"computer_vision/horn_schunck.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4444d7d1827034b6b1a9b005fc95b89c8e0ffa46fc55df68b8efd2587b388dfc"}},{"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":"conversions/energy_conversions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f86ef26754f922bf07e31f7262c0fdfc9bc71370e58bd7c883a0b3b9a821f"}},{"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":"strings/levenshtein_distance.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ecf0e83e8ae43e5e9ec00bc4b8ca8126a09173ef88aa72bc56d54b9afb2d31"}},{"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":"boolean_algebra/quine_mc_cluskey.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c315e455c7076a24e7808d4cf1f2afbe345be2330a08b0d2339db47cc6c77f6"}},{"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":"machine_learning/gradient_boosting_classifier.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de7e803aa3e9bd34a48326af52931bd1907651af15c4c30c88952124a8af100"}},{"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":"divide_and_conquer/closest_pair_of_points.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ce718f144dbe5404ed427aafcc8f345258b85ab5febc593dffab829bbd2b3c"}},{"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":"project_euler/problem_085/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b69cb92ce730f535034bd0af348baaf2e67fbebe4d19bdc8f8c54df006d18e"}},{"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":"matrix/count_negative_numbers_in_sorted_matrix.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bca8d591190b395b90401f06226980fb5b0317d9a4ce89aa51828c57aa0a572"}},{"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":"data_structures/queues/circular_queue_linked_list.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1655de9f2a456aed12c9dcd8a154b58928be6efd7ca14def911e50629a1cab14"}},{"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":"project_euler/problem_086/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e7bc1f76aed53db14dd74cb4126064a0ea709d0a09d7d9d918f3d5dd2a10c2"}},{"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":"project_euler/problem_107/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6589bf90b717b094f6ddca287891584c8a1a42afd9866a439209186a86ed71"}},{"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":"data_structures/linked_list/floyds_cycle_detection.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d50d084453d3709df9d6be14633f820487d975f71a310d404d64dc646fb4c"}},{"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":"ciphers/deterministic_miller_rabin.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f27533bc1c0010acd531726d9e0746300976e4de9bccfffea911f2bceca46b"}},{"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":"data_structures/binary_tree/is_sum_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f20e5ea1c3424a86dd3277ccf16569c683eeff6c5f6196e244405fbf78a6bf8"}},{"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":"maths/manhattan_distance.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a6be5c3b2dea693528bf8cc7137d791ca3e8ac0fbfa84c13d090e11f2a8b13"}},{"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":"physics/speeds_of_gas_molecules.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ebd7320eb8784a3b1fe391b7ee3f9538753b4357d54c4db9b14a4ef1644949"}},{"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":"data_structures/linked_list/rotate_to_the_right.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03d4236b5d602b583bf90b62b6b5393b337cb664c5623ae0bb8548d564c6571"}},{"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":"graphs/minimum_spanning_tree_kruskal2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4e4dd45c10e1b33a5ccf4899d05d8ecfabfab4bde4ddc83a9471579ac3d5d6"}},{"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":"ciphers/permutation_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0fb2efde40d3770dc582a713569565905b2adc73b0140c17f1db51e9d0fb40"}},{"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":"physics/rainfall_intensity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b187bb46a0be3a828ce790c81b02312b1f62ba81575c1b65a013ff7da9af242"}},{"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":"project_euler/problem_049/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d1d204e169063526d86b088f41d3e40c2dfcd04c9fe8137f8c12a30dfc31dd"}},{"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":"project_euler/problem_068/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b2c9fe6fa13253f4144ad71d0de586fa0765aac72f789aac8c36a5221eada4"}},{"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":"maths/josephus_problem.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c909662047884a25514c22b710eb8d402892e8a45361d4f85d3a5bde2114a9"}},{"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":"ciphers/fractionated_morse_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1488d5bd3d3a443329940a3351e06c483f3eeb0b194c8a5c7141c155d1fe6508"}},{"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":"maths/joint_probability_distribution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9b1fe98f29fe10fcbdec4bca3a54884ce8666bbc00219f4a1bd4b458de3d3"}},{"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":"scheduling/highest_response_ratio_next.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad56730491d7fdba3c661baa0331eed344be2ebc69f9b87ce32c764710c4bbb6"}},{"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":"backtracking/sudoku.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"111af27be22060b2e480656c27d793ba438a85e1068eec24516483d4f0988fe4"}},{"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":"strings/can_string_be_rearranged_as_palindrome.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc010cf1548c646018620f531e7b5117aeaab0c7b56bd7c862670e23aab54cb7"}},{"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":"linear_algebra/lu_decomposition.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86000256740039a6b0aed1bb9ab6d38978e6fd3d668bf36a43d3352a37832892"}},{"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":"maths/numerical_analysis/integration_by_simpson_approx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a5a3d8f50045d9364784e2c248d919355325c3899f086c45e6916a41f744d0"}},{"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":"maths/maclaurin_series.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d25a48738e6d399bdf7fa7b7451a4c142ecfa511c18ad14271257106cbbe27"}},{"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":"data_structures/stacks/stack_with_singly_linked_list.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3dd76787003537a7e4d3bae4a37bc42af87ea36ef1a184144e5202cda1b17c"}},{"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":"project_euler/problem_144/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8b89a44adfbacbe2800c9e48a82b4514bb551db3755285d555c3bb17a41cfe"}},{"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":"project_euler/problem_203/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dceb821a732a2add44dd7092e5cc7a37493698dfc1bf52fddb1a5233e3dd6a"}},{"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":"scheduling/first_come_first_served.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"007b910a31aa138633d2e4ce2146bfd00586a99775f220e452ee019fb77ec0eb"}},{"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":"data_structures/linked_list/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a46d8ff26d71f6d77f232c4e686b7ac27ef43650405b90f53b122c5f84048d"}},{"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":"maths/numerical_analysis/newton_raphson.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f92306e2751a4d9d1db12f6abe041207385131491baa3f9c724d7e202ad3ec7"}},{"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":"other/scoring_algorithm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0f7a9b525acd4b15d13e67dc41f5eed39737acd3d4acf3b91d7e63f53e2acd"}},{"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":"web_programming/get_amazon_product_data.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b69de7ab3689d36dda4e67524fc650146da553e07ef6cb5f8bf5983ebf84ee"}},{"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":"knapsack/greedy_knapsack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"835e22d75a71a069b5b12cffaa86170f7fcc809d04c85dd30b331cb039e426a3"}},{"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":"data_structures/queues/linked_queue.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63628a0e88e1e04d292ec6ca73f03a6a7fa39f6d45082937c7e7056a02f047b"}},{"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":"dynamic_programming/minimum_tickets_cost.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec94f70c718ffe284c9a2500631ff38e83cc38187c7632a5d45b73fd9c7cd71"}},{"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":"data_structures/arrays/kth_largest_element.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd0e34c81e78d2d4c1a2c8f5cb4d29becb76ce4f130b35764d6ba4ec3bcd776"}},{"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":"financial/interest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8556f2f10a5d34210645d9b5dec26c3a995820d0f236210f54439c7d4018462"}},{"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":"sorts/dutch_national_flag_sort.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"399d5580b763f325592a413ca4763d95d116a97e4d566c107bfa07cbe9086074"}},{"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":"maths/modular_division.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7cea04bfb3e40755d50cdb259630d1ca7cd27ccf3dc77db5c46cdc3f7b54c4"}},{"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":"digital_image_processing/dithering/burkes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b597207a7682bd11c960e94bb8b46e2635d91a5bd50dfd75ee210d88f1de10f9"}},{"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":"data_structures/trie/trie.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1452e2510e08e85c393e4215c5d6914c4d2c63d4c5b3ada16ee521f4085191"}},{"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":"maths/bailey_borwein_plouffe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05b13c42322b1c79b70722b1ef60e71cf7fdcb42f490916e53319ddd5dcd0f9"}},{"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":"graphs/breadth_first_search_shortest_path_2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eacc91811a41445744927b14a5c53d9d0017ced0ee53e22ad249d5213f98334"}},{"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":"data_compression/lempel_ziv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82a0cd200c82d4cdc910d417cb19aef675d90c56c9c9b3d2d47927edc6ffc10"}},{"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":"strings/aho_corasick.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d01def4c9a9ea08e870061ec9fb52ff4767d8a2e7b07dcf531bbcc93cd85b1b"}},{"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":"ciphers/bifid.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbcb1e6c630fa6894fe58c92f56f40637c80947b5e3b74b9705fe7bdbbd2db2"}},{"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":"graphs/tarjans_scc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ad176cf76c4824cf4e571041114d6552554f9824006075d7aaec33f05e82a7"}},{"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":"matrix/spiral_print.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c16d12b3f6c3d10740243dd4cb41f79b82029b8795a94602fec1e6a79a37cc"}},{"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":"data_structures/binary_tree/serialize_deserialize_binary_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"573531cd3767ee35a4de0ba8592aa549bdfa19a3a33a47c7b6f4914242fc2072"}},{"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":"project_euler/problem_089/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70c6886e3995471ae633fdb59bab4f9d154949e48f484bec93c92a9f4358e21"}},{"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":"strings/text_justification.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"359f53f968d9260a497c2efb5085ff0b839bf5dbb9cf452e9e3d3593525fce2c"}},{"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":"physics/newtons_law_of_gravitation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb5414eea315294bce9c71a28d01b04177526cfa88f992724b13981395bce36"}},{"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":"maths/gamma.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae9310cb92ab815fd5ec9fda6104bbd29b3af3c54d77eb30ada9a765b220050"}},{"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":"electronics/charging_inductor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"510c5e4ca2ef58b1bb5cbfc5e3f58e56163b1dbab510ae5ca7d708eabd9e6318"}},{"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":"strings/credit_card_validator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a68edeaf536cbc6c5b72736aff979129e12feb303b020c22b403bbcd2762e31"}},{"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":"project_euler/problem_008/sol3.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42916cfa1477855d01a48fcc7ac3577551c07c10c927794c80366aa025ab41bf"}},{"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":"data_structures/binary_tree/mirror_binary_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4fdf47da0032b9544e1348300b0dbc5a6342093c0ea5b66ae700303531a7b2"}},{"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":"scheduling/non_preemptive_shortest_job_first.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d0eebf8c7a071e898e6bd66f74b00049f163532847a4be32153a81c2c2d38"}},{"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":"divide_and_conquer/max_subarray.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9068d170814ac039139d634e9b3f405c09dde0b03e02f4d4d1724e80900812"}},{"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":"backtracking/all_combinations.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25e7544a248a4612a3f13bcb9ca539049a210d5c0d6735bc98fc87cfa1d5735"}},{"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":"ciphers/affine_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3309a6f4e2e742ae4ef7a985c89c1e2424fe98071df4c5b4f6d2e45970e327"}},{"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":"electronics/circular_convolution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395662cb3c70c9288e469b34dad29153bac912a052b5238c2638a86c62a67f51"}},{"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":"physics/center_of_mass.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09c595250bb7d25548fa5348fd9ceabd822ed4c921c0023283993001ec6969a"}},{"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":"dynamic_programming/edit_distance.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fb8fec73da18e02c130bee790bd894c661e43620b34c9d305fdcad95f9d08d"}},{"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":"cellular_automata/langtons_ant.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0255f6999d34197bd964ca47b6262eb6d8841f716c674371b857a2bc843050e"}},{"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":"web_programming/emails_from_url.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d29c1b684b8f5683a1f73bd0b1066673abf42ed7565a6f1332a4325692fb3a"}},{"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":"physics/malus_law.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8f75d94e4c0795b8b725cb0c941ea56991abf04d1e97b23db7d524ae15b96f"}},{"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":"maths/gcd_of_n_numbers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d680fa295bdf8daa4dfd1f7083615c1f4976f3cbd5b2abbbc444457cd5228a4"}},{"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":"matrix/max_area_of_island.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf574a0f250ab59aa1a12368f85690954085d4a8e812a40f49e84aa6bf55cc"}},{"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":"data_structures/binary_tree/flatten_binarytree_to_linkedlist.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de9c6e5e888deb44a79bf5ad13ce68c90a7c03002a124f9df6a4959b794105d"}},{"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":"bit_manipulation/binary_shifts.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a93ea5eeaa1fcd0fb6a8b06b40959c43aebaea188b386c98f0cb57be0003977"}},{"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":"strings/wildcard_pattern_matching.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad36d7781a8cfdcef88baccebabd2b54276418f3a72f4dc31c79a7806af7746"}},{"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":"conversions/decimal_to_binary.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b287800104ea4bbfe5cef5417eeec4fc778545b74155f91736fbee99dcf891c9"}},{"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":"graphs/depth_first_search_2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5360b59ea0b940aad4cad068a567668f254e6842005c87cefa14794aef4f5c52"}},{"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":"maths/jaccard_similarity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2abf1b48bc2e2961d16694a9fa801cef13cda8cee0972984821425723f3af0"}},{"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":"data_structures/arrays/sparse_table.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a80d7c414a486c1d4ba3943e3335cd5ac1d4082daed671c844b9a4fd2787213"}},{"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":"graphics/vector3_for_2d_rendering.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"419e366bf7e2e9ff12f10ee6c52eac755b2c813d860cc705e3aa343ae9e9df58"}},{"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":"ciphers/rabin_miller.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7912a122e8f75a65432bc15d2432da5a30d7e8ef0947fb211cabcf6f39e1e9a4"}},{"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":"physics/hubble_parameter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5df182bfd18f057343bafd5bf671be585817cc64bc49f70d11ff72ff7de87be"}},{"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":"project_euler/problem_234/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f415a428763337497b41f7ef725aa4d6970c34ed11e3d00878b57b25ef2c17d0"}},{"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":"data_structures/binary_tree/distribute_coins.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feb2b6e7204c82b54d706c1143116bad2748752c69c55a7243670ff9121aaa9"}},{"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":"project_euler/problem_008/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820624e5d6a982e63f008b4aadc9f5703c262ad2af42cf372218aa7e1f267cb8"}},{"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":"project_euler/problem_191/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf6339d294b95b559fd447602404a8e54bbe82f7ccda0691d31a76150fe6678"}},{"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":"maths/numerical_analysis/runge_kutta_fehlberg_45.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c1304a888c7549563752f10526b614a7e35ed39a2d5d2f1d6f699aa177ef3c"}},{"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":"conversions/decimal_to_any.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"019b66c2597fd8c7a5e3cd308f6949e46d07985dc289d8ab486ec5716de4b5f6"}},{"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":"project_euler/problem_037/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32752da4be0e67e65dfec9f5da013f1846ae95fafe051cfe71c543b6c2adeb7"}},{"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":"project_euler/problem_008/sol2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9f5753c5f4fbc8255596036e1a8cfea2080a2efbf0026c17d79b80227e2fca"}},{"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":"graphs/dijkstra_alternate.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb509cbb0535023d62170eb936cf2220ccba2852dc610d8d14702215d417648"}},{"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":"ciphers/rail_fence_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8241f84e370b7b956526ad8581ef72aff02b57945c0a7f392ac603f7cc50ac15"}},{"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":"ciphers/porta_cipher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39384dce57d17553f5588f9f1e14285ac84f7848bfc05956e5f5e63b9f99d50f"}},{"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":"data_structures/arrays/index_2d_array_in_1d.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008c743de6e64fd17d755143061b941dfa294c672960ca8796a9f54f7de7e4a3"}},{"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":"data_compression/lempel_ziv_decompress.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d38c51c0f9d8e4cee88f1245847ad27c1f7a7e01e91b8934fe619621d0731c9"}},{"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":"maths/basic_maths.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"084bda6ddb482a6c298ec176d0cf7cf325f5e54492416b26733a95b1e1f50e54"}},{"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":"other/password.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e14a6026dad4d6be4f8ff3715ea6bc024f53449d8df1eff2c303088b6f80a9"}},{"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":"web_programming/get_top_billionaires.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ad02d91733644e41c86ff5a67ba57d2eb74cd1f18efcca8f97c275144dda0"}},{"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":"ciphers/polybius.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e44a2b53c0145b44280eb3b03743a3b9a8690d9e996b130d054f3e9d313c8b"}},{"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":"data_structures/linked_list/reverse_k_group.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"399007d249b41ff55de1f9df3385cc78a623f032be042bfd0e4ca5a2807ad65a"}},{"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":"data_structures/stacks/infix_to_postfix_conversion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd2724a0d7b907a1c9620ce7bbf974bbfd5acd713d8eaf64cd1d61e6b0904c4"}},{"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":"graphs/dinic.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8594de05eae50bdc9782d323f2747b2bc27366398d7aab28159e83162ee3dd7"}},{"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":"project_euler/problem_109/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b6380f19db84b34ac60081b5dcdb42bf7eb82830483676fc47cec2b252b372"}},{"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":"project_euler/problem_011/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9225b912f8e42cc672658685d9e3f33a047084e3e3818489c821bbf20d3ca0e9"}},{"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":"greedy_methods/minimum_coin_change.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"591e0cbfa85b5cd4417b2a11b007ae07477c533d14313cd6c2b11b2a861092a6"}},{"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":"physics/ideal_gas_law.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf53e1a915316ed9f04059d1bf8cf407c9b499278e5ac8531bd132e77fb2b47e"}},{"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":"conversions/astronomical_length_scale_conversion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d7e50bfc95c96d032892a389241a2a9de60e683221a664910a2fa822504451"}},{"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":"data_structures/queues/queue_by_list.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72d70178bb9fb5df9ef9fb760552c00b17e3be28df3bd85420aa86a87ab73c7"}},{"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":"project_euler/problem_051/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d6dd2cfaf0a79cc10f5188db4586fb5c3c0361b6acb453613db59953739040"}},{"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":"searches/fibonacci_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa187e1ba92e8975ef162758c113f5c7c907acb7d58ffff1c2761c9a1c90773"}},{"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":"graphs/breadth_first_search_shortest_path.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1843c58d1f27053ad100d3e8f4c1cda10b690b504ad5811f0fd31c7de41866d3"}},{"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":"divide_and_conquer/mergesort.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81af4986aab6a9487762e350b973398329dc153cf5035f646424e2f8ebd9bfa5"}},{"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":"matrix/cramers_rule_2x2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"259e79a0c39ac202062db848ba8c4403c3465c2e0cbd67443cac5c58e7a7c89a"}},{"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":"conversions/pressure_conversions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0792ea55106b9e3b6633aaff87d3ca35ed59cd47ea312c62070ded37f74397b5"}},{"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":"project_euler/problem_104/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a0b33d35908e4247f7a9d16ff0fe6f21a29713eb8a0bd9b5a0cc5e67562902"}},{"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":"greedy_methods/gas_station.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfddf09106ac421ddf96ef9854cf8d2e759cd2f1f826de0c03a85c0d0a18d05"}},{"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":"digital_image_processing/filters/local_binary_pattern.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf89448e962163fe314e8d7e794984be06effbf612a3d268ade1777aa23aa48"}},{"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":"maths/special_numbers/armstrong_numbers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"443c6d54e5b000c5539c821b2c90b944497531830508134c7c812b81601a30a1"}},{"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":"data_structures/binary_tree/number_of_possible_binary_trees.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13601d6f3188903d78580f6be3c6aab4cb54b9b86c4e1dae78a262f5857656c"}},{"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":"dynamic_programming/word_break.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f378a131b9e4fa94c3388550127d7aa4bbe3b35f9de77b9e04ad7ac5c78f42f"}},{"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":"digital_image_processing/filters/bilateral_filter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4720bb8bee5dbf5769dbf53387066f0201e118c0657f2e18ba98a489f2fc7a"}},{"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":"graphs/dijkstra_binary_grid.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"318835d1b409b221e8a19002a40e487251a56b2ee36dca0d49c8e736cf534603"}},{"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":"machine_learning/data_transformations.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42d63b2d0bd8ea7221750adef60c5909f8056a14f7d13d52dbdb72f01bf6d1a"}},{"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":"ciphers/simple_keyword_cypher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b2edfc53deb04aa8b4a5f1df3e5218b6cbbb72d82d57cb74e7b1d65ad6d6af"}},{"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":"project_euler/problem_011/sol2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc88620a69d21a3c03c349a5a61320fae10d480410697f2c338f0ea480d7d5b"}},{"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":"linear_algebra/src/schur_complement.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d03d0bae6b77cbfca3bc1e90cb8878fbbbdd0bc78a635672516d7ed411cf1eb"}},{"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":"project_euler/problem_207/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c799c1402cfcf25c0cc2c4c5c43ed7dd043a3b2c8c807581cd3e4d9f4bb9b8"}},{"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":"dynamic_programming/combination_sum_iv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f8dda7abba5d46ecc4f6a884aec3858d0384205961865d5ffb0acec195488c"}},{"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":"physics/newtons_second_law_of_motion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e002949a92fae03f29d7936f91dcc854a4a04d45861622c9d512592a86606273"}},{"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":"project_euler/problem_046/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8326e3072ec94a5c98779c25a293176a9a86db6a7fecfc167e20e73e8ca81549"}},{"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":"conversions/volume_conversions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02219040792cae73bddeae7bebca0623058867b45798aee0160c922e66a49092"}},{"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":"matrix/nth_fibonacci_using_matrix_exponentiation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5180a4ac8eaaa406ec03ce9be3f30096ad6b4a4459dc9aa052fe5716b4071e"}},{"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":"project_euler/problem_058/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"101ca7009231898221c0e4dd9df9bf309d02c94175c1949d27311f8c8f5164ea"}},{"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":"project_euler/problem_112/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f88aeacdb9c09156a60a83ae53de2f2fdccf7502b73c3a5dcd36e8bde433c9"}},{"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":"graphs/finding_bridges.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"078aee108ba7c8e5220112a35c4458067049f516e64f1cf5fec0394d59731556"}},{"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":"web_programming/search_books_by_isbn.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea9a6566730079cd6234fd873255b611268c5b88678b294eb7fb7f42797859f"}},{"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":"project_euler/problem_074/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59655b795918699c663f38f57006e91af751373e4bd4a661f6de0bc700b1c43"}},{"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":"data_structures/kd_tree/nearest_neighbour_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44524fda862c68b36ad5de0e54da933effe8ad1595fbdb1d28cfb49929d4ef02"}},{"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":"electronics/carrier_concentration.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"613695521795791b96012f2a0990186ba8fe2e930e614dd2e8394e5f6d7824ac"}},{"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":"fractals/sierpinski_triangle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38cd524ace4b4c9f9962e62dd214350d19585db50883018e9e216bed6ae5d9c"}},{"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":"maths/series/harmonic.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db217d58a52e62321e0b6709cd52a251001df90bdf1a4008dbe3c1ac7fef5ce2"}},{"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":"strings/is_pangram.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96b360ed7c89a5c7df44f735994e82ce7c2a6ac045bea7e9a9ca66fd0bcb3d0"}},{"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":"data_structures/hashing/double_hash.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"727f34580c3e08a98365b95867560c86a320d1e0a322e816892e9e20afeeb4c2"}},{"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":"dynamic_programming/longest_common_subsequence.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79de5183dbb73287f29c30aad68ba47234cfc20e2f2d257b19618c09324394f5"}},{"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":"electronics/coulombs_law.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccceb02958cc81af135b221cea3f6ce13faae76a69b58ca1d43070f5eef248f"}},{"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":"other/sdes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2c03dc08f1d3343e1a033d2d1281000e107449ac66d80fd09b87f6779b4990"}},{"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":"dynamic_programming/catalan_numbers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16294a138dc57c5c7fa1ecffc8f5cffdc2fe616b1f55494d36b14a6b98c5cb63"}},{"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":"linear_algebra/src/gaussian_elimination_pivoting.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6eea1c12d02000ce6d6f20fb4817dea10238bc33262e089304b58ca0a7238b"}},{"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":"project_euler/problem_070/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8641ac6601ffbf6765412bbaac3c79f84cfdbc05e9a4366df105e1ba39384f8c"}},{"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":"digital_image_processing/morphological_operations/erosion_operation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3edbbfcd71b6fb2b49764c108b7a1adc56fb4b4d0dbbba30d50df4bfdb33c79"}},{"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":"data_structures/binary_tree/basic_binary_tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fd8e703fd5911b48ebf7f01195d2e9164458a4fc6dceccfc7f4698e3f113ae"}},{"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":"project_euler/problem_587/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a3abc96dca202d473699c06771b14e2bf0238a225deb4a3dcd5f54ccc7091e"}},{"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":"dynamic_programming/range_sum_query.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5068ae9fb13c98bd969ffd3eec6e68447e9ca1be1636a11bd232607744f1debc"}},{"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":"project_euler/problem_003/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b53bfa2bc18cfcfa7cd5401b9e5377c727bb437045a5fc8b28ce0e180852eb"}},{"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":"project_euler/problem_027/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"566a9eb74ab74c3325f7e487af0fb6221fa53209251f786fd1792c0e70eebc60"}},{"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":"data_structures/stacks/dijkstras_two_stack_algorithm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1668c3e6bb384fbe20a8a6bc748e0a2f821a5bc591f81cd7c10e1a6d7756f0a0"}},{"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":"linear_algebra/gaussian_elimination.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37da19e029c6e38c2525ea84d8755e5beb549983e1cf0984e2423ed824ce192e"}},{"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":"electronics/ic_555_timer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"264c843bdaebf94a319e114396e850cf4b6d764d57912cd933e9d3b729c6e4ce"}},{"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":"strings/knuth_morris_pratt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ac63321ab9c4f62af6b9d9384e7a9351557284c653dcf74d0014a3dfa7435c"}},{"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":"maths/find_min.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5bf904708c93c2d9a77eafecadbec93ed535d96796fb030e8602aa75721d12"}},{"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":"digital_image_processing/morphological_operations/dilation_operation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9945815a5568fcdbd6c4b080dfbf7cde7104f826f96f04360cea72721dda291"}},{"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":"backtracking/power_sum.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca25cad4e74230418a7609c6456e57870b72376e6ba192d029c6608e3188308"}},{"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":"digital_image_processing/filters/gabor_filter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e37be78f049de39b0092a1ff7b7e440c7d8af299c94b216315c81e4878fec38"}},{"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":"data_structures/queues/queue_by_two_stacks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba92a4e880bbafeccbefd7993293d2c7e732309bb94318fad5968eebde5dae89"}},{"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":"strings/rabin_karp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f89d5b65ac3930e2f07da740c1fb42f5b78d38e5852ff96e892477e0c73163e"}},{"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":"physics/orbital_transfer_work.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e410a4e778b2a05aebbdcf09bfe9890edb19be59db9875efe46f34c146e2c095"}},{"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":"electronics/charging_capacitor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c55dd5782a34937f0e25c4040c29b31475fbb7b3fae2d755f85a8cb3b240fda"}},{"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":"strings/is_polish_national_id.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b887256547215e2e9296728755a32e0e5804ed4ff05540ae0dfc1861688980a"}},{"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":"project_euler/problem_007/sol2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17ee878830f7b154b8684c69f7d13257df7641f2694ef2d202eeb1b431b38d8"}},{"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":"project_euler/problem_065/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ebd9c1ff797e87480b74a602c80aa37638256574586cae40b205dc8b07018b"}},{"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":"data_structures/arrays/prefix_sum.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4923abb07bac5c70b6d46ce71096060c378cc4aa9316cb43ca11b0f43a37a4cf"}},{"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":"electronics/electric_conductivity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd3b78e4e8a2b19d4c974cac7acea809d8f40cf864d2fca0ef136b5c5cdd52"}},{"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":"project_euler/problem_047/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f615f7b2f25315dfe2d0ed9a84d87133af566f1e5f37a0152c1ed48d28f2d4fe"}},{"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":"ciphers/mixed_keyword_cypher.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fe1b41794fbe52eed57275953d6ddea1ffa410b4d2de63e4d3de54a0bac2c7"}},{"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":"dynamic_programming/regex_match.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b511025dfa13cafda5d787eceeda76fb4c1f3eeaba3f9eb31e0ffa00760433ae"}},{"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":"greedy_methods/fractional_cover_problem.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fe47e4802ed0d427d0098e70097c7275fd06c240c5923edb8660c4b9493041"}},{"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":"maths/trapezoidal_rule.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cbc6146dd489d4f42cffee9ea8761081a2357c624f68f59128d52b3ec41d3f"}},{"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":"graphs/strongly_connected_components.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b546c6f54371f784bba94cd08db60b73f122e420d6fe5cb26323248c9d8ac9"}},{"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":"maths/numerical_analysis/runge_kutta_gills.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74d94909267a60311b09147baba61e599540f1b550ee8b2158b0fd44bb56244"}},{"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":"conversions/prefix_conversions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28a5666d8f32af89afbe73dd9e6d1eac4f6ca5e749aaf25f778d6518883c50a"}},{"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":"data_structures/binary_tree/binary_tree_path_sum.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5985e0e33f2e562c52f2e0b992a9edc1052ca18a5b2961921d1ac575ec07f7f0"}},{"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":"boolean_algebra/imply_gate.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccd85589778a8e78f2d0f49105de94d7cb4ccd78ec591f37ca2395ee7f1ee0a"}},{"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":"maths/triplet_sum.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac4e2787955465259376e1ca1144199956f397a039fae3bd244508aff3cefab"}},{"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":"backtracking/knight_tour.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a607ab2e9cc6cf7218c0e4cdcde9ff4173eca361b2cf38f03d556c5e30cb40ca"}},{"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":"backtracking/generate_parentheses.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"444e3f69f2e21b5570a2f7fb4720576c739a9b9f5766b856c218dfc39d9d0f47"}},{"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":"physics/photoelectric_effect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96294e05832921fe3e662d72201718c1c90f6e31319602d002ce713b1a25db27"}},{"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":"project_euler/problem_055/sol1.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa5e7e48cf0610f58e3b16c641da4f3672983b8ff5799df8ea1e8c608f208a"}},{"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":"conversions/octal_to_decimal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eada288ff657a2fb0d2cef273d4000736b8119ac240ee07b6720cf2ed8ce52"}},{"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":"maths/pi_generator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e259a5adebf60d0814ac00f20f3ee37383c8e6f4f0684faa93b52981cad8f9"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d9450c1e9a738f2d810b3eef41d9babb54722911a7ca830a4cd182d6263d27e"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a14b5c011320bbee4cea3c8d7d90072d3aa4e72323b988d4bca64e0588b7a2fd"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46c010f94ba9c10de3150163903ad39675fd3dfab0b3d840ef21489d739b1492"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdb45611d627da79cacc4d72b59b6f057917eaa5ec352294bbeca50d3d03146"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a62b914046eb9d958ec6c81a8f6edb5316f7f10f00b649f0c23be074c11f3f7"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"123b409dba0835c17735224d953bdf2938aa0f681759455b82cadb4f282304de"},"taxa":[{"id":"CICD-SEC-5","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":"5e4607103018ccbf4772504c4475df05c43062f243e17471503584c98dc62fdc"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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 omits the full directory list (evidence shows projects) \u2014 reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: linear_algebra/README.md names \u0060src/tests.py\u0060, but no file or folder \u0060src/tests.py\u0060 exists. 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":"linear_algebra/README.md"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d358ad25e3cc911b2bd911a5db66880ce2fce1227696047db5e81873c7b78065"}},{"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 14816 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: \u00600 \u003C= pos_x \u003C= len(grid[0]) - 1 and 0 \u003C= pos_y \u003C= len(grid) - 1\u0060 appears character-identically in 2 files \u2014 graphs/bidirectional_a_star.py, graphs/bidirectional_breadth_first_search.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":"graphs/bidirectional_a_star.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0e7285c7c630e7f3820a2166051afc90d6af92037520c885f02b86b9486039"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u00600 \u003C= source \u003C self.size and 0 \u003C= destination \u003C self.size\u0060 appears character-identically in 2 files \u2014 networking_flow/dinic.py, networking_flow/push_relabel.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":"networking_flow/dinic.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c82413e26d6bda58409a25abd941b346088bff486a940e8bd8298ba51f9433"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u00600 \u003C= source \u003C self.size and 0 \u003C= sink \u003C self.size\u0060 appears character-identically in 2 files \u2014 networking_flow/dinic.py, networking_flow/push_relabel.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":"networking_flow/dinic.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee093c5f35d8efc8d8edb8e45f0e35fa0f63ca88fb91cfd58e426ba2ca1cfe98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bound \u003C len(sorted_collection) and sorted_collection[bound] \u003C item\u0060 appears character-identically in 2 files \u2014 searches/binary_search.py, searches/exponential_search.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":"searches/binary_search.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e71821c9154f88f1cd500a459d381114bf1f0ef20e5a4b8abd609c998e9ad9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edge not in more_random_edges and edge not in random_edges\u0060 appears character-identically in 2 files \u2014 graphs/graph_adjacency_list.py, graphs/graph_adjacency_matrix.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":"graphs/graph_adjacency_list.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6257ca5f446a5813830b6c2ba691fe5b78a0bc394008339c0b2cb222afcadc9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(number, int) and (number \u003E= 0)\u0060 appears character-identically in 2 files \u2014 data_structures/hashing/number_theory/prime_numbers.py, maths/primelib.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":"data_structures/hashing/number_theory/prime_numbers.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e90cca569a5145fdfc9322b6ad5f339fda30b4182d3add342ca4fa30d578409"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left \u003E= len(nums) or left \u003C -len(nums) or right \u003E= len(nums) or right \u003C -len(nums)\u0060 appears character-identically in 2 files \u2014 maths/find_max.py, maths/find_min.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":"maths/find_max.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb2fb007b1a874afb7c31b980a10fe97f6665ccb9f347967d401d09e4336c42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(encoded_data) % 4 == 0 and padding \u003C 3\u0060 appears character-identically in 2 files \u2014 ciphers/base58.py, ciphers/base64_cipher.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":"ciphers/base58.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"808efa2302000803c670cc23fe732cb31de04687c47045000a3c6de2fd907c4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(a, int) or not isinstance(b, int)\u0060 appears character-identically in 3 files \u2014 bit_manipulation/binary_and_operator.py, bit_manipulation/binary_or_operator.py, bit_manipulation/binary_xor_operator.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":"bit_manipulation/binary_and_operator.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"878f9d67ed3c5912953ac03e0b7e3a133286156bf214bdbbaf0c97932380388a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(encoded_data, bytes) and not isinstance(encoded_data, str)\u0060 appears character-identically in 2 files \u2014 ciphers/base58.py, ciphers/base64_cipher.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":"ciphers/base58.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7f1c710bafab4ded37e03b84282aa1d5c92f35d8505c99dd4255723ff9ec8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(number, int) or isinstance(number, bool)\u0060 appears character-identically in 2 files \u2014 bit_manipulation/is_even.py, maths/keith_number.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":"bit_manipulation/is_even.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1853c84b62ec172fc961cae36978f2f666fae3d2a8f73e7ecbd82aed73c644d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(number, int) or number \u003C 0\u0060 appears character-identically in 3 files \u2014 bit_manipulation/count_1s_brian_kernighan_method.py, bit_manipulation/find_previous_power_of_two.py, bit_manipulation/index_of_rightmost_set_bit.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":"bit_manipulation/count_1s_brian_kernighan_method.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6203eb3a56e0949a5a22be6480ba83a82972fc64d9cf2f7186853d8ee9b7f74c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(number, int) or number \u003C= 0\u0060 appears character-identically in 2 files \u2014 maths/perfect_number.py, maths/special_numbers/happy_number.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":"maths/perfect_number.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27651f3d650a04a356fe7ca54a471e3696c89088356ae5af5d8c1a36c1dcc3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060number % i == 0 or number % (i \u002B 2) == 0\u0060 appears character-identically in 13 files \u2014 maths/prime_check.py, project_euler/problem_003/sol1.py, project_euler/problem_007/sol1.py, project_euler/problem_007/sol2.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":"maths/prime_check.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65c8589dcb08ce5bc21cd8b773cf085e2475666738095573a90a5a50b52fe57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060number \u003C 2 or number % 2 == 0 or number % 3 == 0\u0060 appears character-identically in 13 files \u2014 maths/prime_check.py, project_euler/problem_003/sol1.py, project_euler/problem_007/sol1.py, project_euler/problem_007/sol2.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":"maths/prime_check.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24e47871ea30fa46e5adee11878e20b0fed3eec887ce5af3cd12364edc163ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.path.exists(f\u0022{name}_pubkey.txt\u0022) or os.path.exists(f\u0022{name}_privkey.txt\u0022)\u0060 appears character-identically in 2 files \u2014 ciphers/elgamal_key_generator.py, ciphers/rsa_key_generator.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":"ciphers/elgamal_key_generator.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59e123546122e8efdb5b4e6e29b41007fa0c601911880a67d794bd11da87dc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.contains_vertex(source_vertex) and self.contains_vertex(destination_vertex)\u0060 appears character-identically in 2 files \u2014 graphs/graph_adjacency_list.py, graphs/graph_adjacency_matrix.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":"graphs/graph_adjacency_list.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baa364d3426919f5edb12599f4b429b0e6870908b97a7b21ae48c0ddd3d07d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.left is None and self.right is None\u0060 appears character-identically in 3 files \u2014 data_structures/binary_tree/binary_search_tree.py, data_structures/binary_tree/red_black_tree.py, data_structures/binary_tree/treap.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":"data_structures/binary_tree/binary_search_tree.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"019c5986c9cb215e3698d6427b57eb1dc1a0b27235bcceef914f902397609dee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.values[new_key] is not None and self.values[new_key] != key\u0060 appears character-identically in 3 files \u2014 data_structures/hashing/double_hash.py, data_structures/hashing/hash_table.py, data_structures/hashing/quadratic_probing.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":"data_structures/hashing/double_hash.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"608cdd51768dfab8d1c26c145f27ab0fe6f9de1f45c98deef47ef55ff8c54266"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060mine_tree\u0060 is public and takes \u0060header_table: dict\u0060 from its caller, and it calls itself at line 327 (\u0060mine_tree\u0060) with a piece of \u0060header_table\u0060 \u2014 and nowhere in \u0060mine_tree\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 \u0060mine_tree\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/frequent_pattern_growth.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a774279b7a988596b6a78c7dddfa46836c194a47588287aef42127f23a99ed56"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060test_demonstration\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 \u0060sys.stdout\u0060 (replaced at line 508, put back at line 523) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception raised in between: the process then keeps the overwritten value for the rest of its life, and every later relative path, \u0060subprocess\u0060 launch, \u0060os.environ\u0060 read or \u0060print\u0060 in ANY module sees it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory, the environment, the umask and \u0060sys.stdout\u0060 are per-process, not per-thread, so a concurrent thread sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd=\u0060 and \u0060env=\u0060 arguments of \u0060subprocess.run\u0060/\u0060Popen\u0060 scope both to the CHILD, absolute paths built with \u0060os.path.join\u0060 or \u0060pathlib\u0060 need no working directory, and a stream handed to the code that writes needs no \u0060sys.stdout\u0060. Where the global genuinely must move, \u0060contextlib.chdir\u0060 (3.11\u002B), \u0060contextlib.redirect_stdout\u0060 or a \u0060try\u0060/\u0060finally\u0060 makes the restore run on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/sequential_minimum_optimization.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fe363bdf585db32c46b22fe264bd3c395f349943b764c877b20ec384fe388f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"physics/newtons_second_law_of_motion.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa8160917f62bad78f97ce09f95d3c289834b80b3f1099fee7e2d0e03ed2f6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 103 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ec0f93555d83dfc0f54cd159b0d42ce2296cebdc1e80058b00940dde448d9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 104 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"df66bd2ff9ddffb93efbbd3d430aae2114a28613217c80d12ef6da087fd67e42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 105 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a92e38e8460ecbca1f10ed3ef84f6ff26eac35bcb8b071b616138aa402946c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 106 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"499b4b9cfd3eb2dbdeca53b32bd96a126a6b1c3fbea6d16f34934ac10dea3aaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 111 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bb5554f60af78b1df1361ddfe8e6693d28d54cfd7b1318b9e7522c406f1381"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 112 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc70ce3c8b92fdd3f99173a226d4f00444d517c7b0cf58ba374242d529f492bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 119 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d132bee7563ace19881c6547ba3dc38095c834cd9625e3ca3bb067f10689ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 120 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e222e5cfa0682609eb594d58d115b27477ec1c3e92b47121a99fa165e0baa9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 127 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0075a1eba4779a17c03effdff7d445f984da4e38cdfa838b578b0189c87e7c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 128 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43635cf88d9574bc5f906013a5646db21789f084e75c7ece2331ed57bce1bef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 131 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a035fac05e26d3b4708c78356bf94c60a7cef75c2472bfc35a1208e62b7c66"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 132 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e684b6dd4996d14372bde8d162764c9d95bbc5b6a61c1e5417b56e97578a4a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 135 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"914c95fc3bca50c3ac38838832ae5e7192ada989556d45d44e279b9ab4330ae5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 136 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f681b0c13fdca4d994c8bc66e4394195f68689e8d5e77ec1d0ad94c202f513"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 139 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d13f5ef7d6189f94e5cac3543335d187b6a1f528c7308a6b7234a997655638"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 143 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5b528d5664372a7bfdfe8cf1ee2be2b1ca0855271810f412b726a91c889ff4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 148 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c448e9e16936da17c25bcb9dbba9ded57a8af02d1f971b3a88f3d94ff4744e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 331 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c257db7c67ea41e974dff69bbe8f16abcb5a74622e4deb30ae01cc6e5697f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 332 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10897fad8b5bdef854103b415be64ee71d2bd7c507faa7acc7af1135392c409"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 415 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58b296c1264bee7870e6cb8c703d762b76f28b6b0edeba8aaa3c0e64e58cd75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 416 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"machine_learning/mfcc.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef5307a19ceb76299ce93b8a258ba49f80008f1705274bf751b9946a4caa3af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 49 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web_programming/covid_stats_via_xpath.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d21b93f21b6dbe894badbe83f0afc2fe92f727cfeea142983abf687ecb44bab"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060newtons_second_law_of_motion\u0060 swallows every exception into \u0060return -0.0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"physics/newtons_second_law_of_motion.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79b18bc286dd26059d73af9b652beb128d5d65effc270049d397cc42b280781"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.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-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.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-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-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-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":45,"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."]}]}