{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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":"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"]}],"properties":{"cwe":["CWE-1059"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"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":"up2k.up2k_init (cyclomatic 678): up2k.up2k_init has cyclomatic complexity 678 (threshold 15). Of this number, 447 points are the body\u0027s own statements and 231 belong to 36 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c98887843d941134e3c3ce49bff289d6e47fff2497d88665b4436027432a007"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv._reload (cyclomatic 511): AuthSrv._reload has cyclomatic complexity 511 (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":"copyparty/authsrv.py"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"0092db1fc988f5d5635c010ac53e761cd76f8cf5f00ad3bab5d048ec9019e3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_browser (cyclomatic 314): HttpCli.tx_browser has cyclomatic complexity 314 (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":"copyparty/httpcli.py"},"region":{"startLine":7043}}}],"partialFingerprints":{"codehealthFindingId/v1":"2515998cc8acf8e606b8880ac795f426d384b7ee69e98494be28a7dd634d70eb"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.run (cyclomatic 207): HttpCli.run has cyclomatic complexity 207 (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":"copyparty/httpcli.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"69edef0cde05ba4bfbf435df51b82683071246c67e4698d8dd185c9a88d50691"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.ahotkeys (cyclomatic 136): browser.ahotkeys has cyclomatic complexity 136 (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":"copyparty/web/browser.js"},"region":{"startLine":6248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da9ca1a1cf1c3a479ccbba96762aba8c4684d109a0c8fa13b6b42e2a00986a7"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._handle_json (cyclomatic 124): Up2k._handle_json has cyclomatic complexity 124 (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":"copyparty/up2k.py"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b758f0066ebd03bbd86d3c674519add147abcd1015e7e77dd289762370145007"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub.__init__ (cyclomatic 115): SvcHub.__init__ has cyclomatic complexity 115 (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":"copyparty/svchub.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bdffaae19170447fb9cc25f51847884a3b19097580146b5a8219a2c616115c"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.dump_to_file (cyclomatic 101): HttpCli.dump_to_file has cyclomatic complexity 101 (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":"copyparty/httpcli.py"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae3fd6d77e8e16caf92667f204b9653d7c92f3ec77d2d3d814ad51cdf916952"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._build_dir (cyclomatic 95): Up2k._build_dir has cyclomatic complexity 95 (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":"copyparty/up2k.py"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51fd1e29119ef064dbf3263375498c1a881ea36a58d784f29b626f15f807066"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k.U2pvis (cyclomatic 94): up2k.U2pvis has cyclomatic complexity 94 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 71 belong to 18 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a626fc5ba4846cf9b56841757d210baf5dcd72d188d24f9e04b5a2b8ff980d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_plain_upload (cyclomatic 87): HttpCli.handle_plain_upload has cyclomatic complexity 87 (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":"copyparty/httpcli.py"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8f513e77be82e33301d39f9df61775a9806adb2b2a123550f026faa06d05e7"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub._process_config (cyclomatic 74): SvcHub._process_config has cyclomatic complexity 74 (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":"copyparty/svchub.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a992daf80d37a943e631809095712a5833b9e1727b9f86633e9cbacac3bd39f"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::(anonymous)::taskerd (cyclomatic 74): up2k_init::(anonymous)::taskerd has cyclomatic complexity 74 (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":"copyparty/web/up2k.js"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"104aa5c329bf11f41f591e205dc0b001d922067f7b33e085f29b3d50b94d90c0"}},{"ruleId":"D1","level":"warning","message":{"text":"__main__.main (cyclomatic 71): __main__.main has cyclomatic complexity 71 (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":"copyparty/__main__.py"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e4dab5f3de3e494b2fd3999330c921a99e1f50fe91b2d1de7cc1054ba0a096"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_propfind (cyclomatic 68): HttpCli.handle_propfind has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e163a651f01db0efab6bf34a4d5931c196a5c78cf39abcf939d52d21d2a318"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::exec_handshake::orz (cyclomatic 68): up2k_init::exec_handshake::orz has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"4593c11ed3bce5482daffa13efe4fa966cc063e2a0b409ab395f1ddc4fcde660"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k.init_indexes (cyclomatic 66): Up2k.init_indexes has cyclomatic complexity 66 (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":"copyparty/up2k.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"476e7ebd5737890bfe75ed30445c61657d75c517cb0ff7a3d4e04a0b7914fc15"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k.register_vpath (cyclomatic 66): Up2k.register_vpath has cyclomatic complexity 66 (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":"copyparty/up2k.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8eee0982635aa5684da35944aac7797c29d2394bdc8fa2cfd1356b6c7fd02f"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpSrv.__init__ (cyclomatic 65): TcpSrv.__init__ has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c59c008cc57702a69c8a7bffa0de24e12b252d46ab17ebb33eb2162dd29204"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_file (cyclomatic 63): HttpCli.tx_file has cyclomatic complexity 63 (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":"copyparty/httpcli.py"},"region":{"startLine":4854}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9518abae895e8b5373c03174950ef3a1937205c83164001703b09e2953a0d2"}},{"ruleId":"D1","level":"warning","message":{"text":"MCast.create_servers (cyclomatic 63): MCast.create_servers has cyclomatic complexity 63 (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":"copyparty/multicast.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"501fa8892778289949294ce518fde3eea28f57aa3c346706b2c90e83a32fbade"}},{"ruleId":"D1","level":"warning","message":{"text":"MDNS.eat (cyclomatic 62): MDNS.eat has cyclomatic complexity 62 (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":"copyparty/mdns.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7441fd12cd9818cda5bb093d1180ba2360647e1e821e13cf1c5f840c80c480f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ThumbCli.get (cyclomatic 62): ThumbCli.get has cyclomatic complexity 62 (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":"copyparty/th_cli.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a145e2fe7a3391d05b7f52d218d9fee24980ee2fab0c7222f1a9f1f9a82a14d5"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_get (cyclomatic 60): HttpCli.handle_get has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e44bcb82742b4a6f1da54e8af02fd7d55de8a002fcb12ec2271b5c37fcdcea"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv.cgen (cyclomatic 59): AuthSrv.cgen has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":3834}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d5f5197f48e686e991c0d6ce028dadcbe5d609eec24348fc0223fb1769d144"}},{"ruleId":"D1","level":"warning","message":{"text":"ThumbSrv.worker (cyclomatic 58): ThumbSrv.worker has cyclomatic complexity 58 (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":"copyparty/th_srv.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"945a5d801f7d8ea6d5227b14d06e7d66b8962900fa2f82f9424867f3ea175ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_mounts (cyclomatic 56): HttpCli.tx_mounts has cyclomatic complexity 56 (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":"copyparty/httpcli.py"},"region":{"startLine":5780}}}],"partialFingerprints":{"codehealthFindingId/v1":"160a0a05444bbc84a47f34844f6df6ee262fc43db8c4f5e59b06360a68d54cef"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_rups (cyclomatic 51): HttpCli.tx_rups has cyclomatic complexity 51 (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":"copyparty/httpcli.py"},"region":{"startLine":6422}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eebb3fa857a2866dd080f378546eb0c6236e455264b0fdb20112513b741df0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::recvls (cyclomatic 51): (anonymous)::recvls has cyclomatic complexity 51 (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":"copyparty/web/browser.js"},"region":{"startLine":7501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121649716008af0e414335652ecab18db763f8b7c6986a627faf5a49a1140a7"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv._parse_config_file_2 (cyclomatic 50): AuthSrv._parse_config_file_2 has cyclomatic complexity 50 (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":"copyparty/authsrv.py"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"143fbcd1bb042a9f386ab02168dff327129b6df58fb48aac92e160afe47b9d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_ups (cyclomatic 50): HttpCli.tx_ups has cyclomatic complexity 50 (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":"copyparty/httpcli.py"},"region":{"startLine":6255}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb24e77ca912e99b91ada708205a77c44185a561114a9f0b62c3b6fc757231e9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::keyDownHandler (cyclomatic 50): (anonymous)::keyDownHandler has cyclomatic complexity 50 (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":"copyparty/web/baguettebox.js"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c847b7ca433dda49dc17a0e45fc36efaee911c10a0759ac8348796fa1b7252"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._handle_rm (cyclomatic 49): Up2k._handle_rm has cyclomatic complexity 49 (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":"copyparty/up2k.py"},"region":{"startLine":4329}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb32e4bd485626fd9bb7d295f31fda9c06dd53da0e33e78e9668f1f061e544c3"}},{"ruleId":"D1","level":"warning","message":{"text":"u2c.main (cyclomatic 46): u2c.main has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6072d1668ff1f214b8ed622433c3926f5d86633beeb86fe4d5a6d4d5e6ba29e"}},{"ruleId":"D1","level":"warning","message":{"text":"u2c.main (cyclomatic 46): u2c.main has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c88c74ae7db21990016e93b723a39ebf1e8c71664a76bc07d2fabfb6b4c2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k-hook-ytid.a_up2k_namefilter (cyclomatic 46): up2k-hook-ytid.a_up2k_namefilter has cyclomatic complexity 46 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/up2k-hook-ytid.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d699a857e8b3918a80dbe02bfd90d46dfb3ba63a3615aefa656fdc5c4f7506"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_post_binary (cyclomatic 45): HttpCli.handle_post_binary has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"052e39f5a92e44dff2bd5dd48cede769995c5763fe962e303a5da9301657b092"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_zip (cyclomatic 45): HttpCli.tx_zip has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5407}}}],"partialFingerprints":{"codehealthFindingId/v1":"126f993a98476713af45a3792f63bbb380f8085f2c08e985da1e9157fe96c1c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._redup (cyclomatic 44): Up2k._redup has cyclomatic complexity 44 (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":"copyparty/up2k.py"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"371f3436096dd2fdf5b8cd760cc826060d6450049af38058c35f344a2511762d"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._mv_file (cyclomatic 44): Up2k._mv_file has cyclomatic complexity 44 (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":"copyparty/up2k.py"},"region":{"startLine":4846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b795c2ba8145bace6ebe3f0fac4bbda41e6b7469abdb18f6125b9b0bbeb31e1f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::gentab (cyclomatic 44): (anonymous)::gentab has cyclomatic complexity 44 (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":"copyparty/web/browser.js"},"region":{"startLine":7654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e044b2df421cba5f619b41ea0b2d0257f8f4bf1d1b6e6ef42ac517ea77e675f4"}},{"ruleId":"D1","level":"warning","message":{"text":"mtag.parse_ffprobe (cyclomatic 43): mtag.parse_ffprobe has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"148394ed6155b847100d03c44515bd8d6bfd3985aa6560856cf38076abbc8c94"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._symlink (cyclomatic 42): Up2k._symlink has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":3748}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedd39786be72df7b96275fffa4088403c1938c6a1e43d98748bb33053538b5b"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_text_upload (cyclomatic 41): HttpCli.handle_text_upload has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fdd963f4a167d41c2e6adecbaf9ffbe1855cc0374837feb896813eadb1df97"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::drawbuf (cyclomatic 41): (anonymous)::drawbuf has cyclomatic complexity 41 (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":"copyparty/web/browser.js"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6ca080ff9587cf53656a9e87a7849b1dde2384905775e9f6dcd3366d66debf"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 41): (anonymous) has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 11 function items inside it that branch (sel_move, sel_start, sel_end, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":10056}}}],"partialFingerprints":{"codehealthFindingId/v1":"de189c185b81e6d3ffdeab09fb800c800915ba70fcc2b2910058f8775fa112c7"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.MPlayer (cyclomatic 40): browser.MPlayer has cyclomatic complexity 40 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 19 belong to 9 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d1f2705c3cf5cb2939b28a61b2bd4df7a33d998d9c9aa8e67598a117401903"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::loadgrid (cyclomatic 40): (anonymous)::loadgrid has cyclomatic complexity 40 (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":"copyparty/web/browser.js"},"region":{"startLine":5840}}}],"partialFingerprints":{"codehealthFindingId/v1":"b079c1a65efa6d58c16722c7e51e4bf37486e2624ac12070b0d8b2883a7b178d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 40): (anonymous) has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 6 of the 40 points are its own statements and the rest belongs to 14 function items inside it that branch (set_style, add_btns, reset, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56f9ef53f78a220085df5aaa5849018f69375176dcc9a5629491a384dcfec7d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 40): (anonymous) has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 11 function items inside it that branch (load::unpost_load_cb, unpost_delete_cb, onclick, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9440}}}],"partialFingerprints":{"codehealthFindingId/v1":"239ebdc41c07e52715228671d2f4b8dd71e51e0efa63806687128517bc666e34"}},{"ruleId":"D1","level":"warning","message":{"text":"Metrics.tx (cyclomatic 39): Metrics.tx has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/metrics.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5f7802901822a0e05608be4a2fd83a60cbe53913440b4f5448a4aa2d268aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"U2idx.search (cyclomatic 39): U2idx.search has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/u2idx.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfac048ef05f9d9ecf63e7bd478c63f2e64fc2add31c56007474468461769a9"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_share (cyclomatic 38): HttpCli.handle_share has cyclomatic complexity 38 (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":"copyparty/httpcli.py"},"region":{"startLine":6686}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea70e42c2ba3f8edaa3fb4abee0703dc5190edb92e092906a60685ff2946561a"}},{"ruleId":"D1","level":"warning","message":{"text":"U2idx.run_query (cyclomatic 38): U2idx.run_query has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/u2idx.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"69464dd29fe26ba21c942bd328ffa413ba4a0a6809604f230b8076f67923d3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"md.convert_markdown (cyclomatic 38): md.convert_markdown has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"693dfccad79d73c0278136fcf961079452005b2b9357286f0f8bfafa5eb78628"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctl.hasher (cyclomatic 37): Ctl.hasher has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad31e257bd4ad2924b278834d36b85e350d601b84a530c981de8499d6a2377ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctl.hasher (cyclomatic 37): Ctl.hasher has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee050c92b4c3643f155ea3ccb98a1ebc5c3044b161a5b61d8cf607c2da4b38f"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::etafun (cyclomatic 37): up2k_init::etafun has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8a2126a6093f054f0f73815bbde75a6ba3abc74db1714c883c46369a6e488f"}},{"ruleId":"D1","level":"warning","message":{"text":"Donut (cyclomatic 36): Donut has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 2 of the 36 points are its own statements and the rest belongs to 6 function items inside it that branch ((anonymous), svg, enstrobe, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec740d45990a70d6ae4634087cfc8f0310fba3c7906fdc0d7dcd34e3e0cafa12"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpSrv._listen (cyclomatic 35): TcpSrv._listen has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d87a7ba87ccb71904220ee3954fa07345c7b57367b7882810a6253906fc452"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpSrv._qr (cyclomatic 35): TcpSrv._qr has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1ea058f7e4501ea3cadf777580bb1c45f5e2568a555e0be9c09937ecb38265"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._verify_integrity (cyclomatic 35): Up2k._verify_integrity has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"b549e1f1d9a64127a63c159e86110a6cd2a5956a407f016bdf944b76edbe68cd"}},{"ruleId":"D1","level":"warning","message":{"text":"help2html.cnv (cyclomatic 35): help2html.cnv has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/help2html.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f045c5910939fe944f3239f05b60666bc9a651e8ba80999f8764b05a657959cd"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.apply_perms (cyclomatic 35): browser.apply_perms has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8064}}}],"partialFingerprints":{"codehealthFindingId/v1":"05382e5f36b25275677284bfeadfb28f1ccd6465460c78d1903ff4c27f4d0370"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::updater_impl (cyclomatic 35): (anonymous)::updater_impl has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f05daeb458169c48de2143ef68350be41dd51aa6837a8dac2dd1ca4cd15e91d"}},{"ruleId":"D1","level":"warning","message":{"text":"CPPF.get_cached_file (cyclomatic 34): CPPF.get_cached_file has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"39738b315c21f5fbf72bfa4c0519c7db9ff0c5f0d3cd9e034a003e36463bd418"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctl._fancy (cyclomatic 34): Ctl._fancy has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c499743782068862839318adce9b31616c55360bca54729ab35e8456f7396b"}},{"ruleId":"D1","level":"warning","message":{"text":"authsrv.upgrade_cfg_fmt (cyclomatic 34): authsrv.upgrade_cfg_fmt has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd95dfa09a9a031725c49834b23f1f20ad122028e6e6d854046712963685891e"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_rss (cyclomatic 34): HttpCli.tx_rss has cyclomatic complexity 34 (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":"copyparty/httpcli.py"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d867cfe52c3c1c426091d624dc52365b2d31d0be6f2446821159d3851e3fd0"}},{"ruleId":"D1","level":"warning","message":{"text":"CPPF.get_cached_file (cyclomatic 34): CPPF.get_cached_file has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"828af4892f89f5372b1b7a94d1c8d7b5144e9dc43176cc0680353eb11a9cb38b"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctl._fancy (cyclomatic 34): Ctl._fancy has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e84d996810d954050bb751bdc5978939808b4af5cd71ebed43cea1a5550e70"}},{"ruleId":"D1","level":"warning","message":{"text":"md2.keydown (cyclomatic 34): md2.keydown has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94a76eaf346437e6969ea2c490b33c66fdafc0f8a1424052bf0d137554782d7"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 34): (anonymous) has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 2 of the 34 points are its own statements and the rest belongs to 11 function items inside it that branch (show, getmsg, hide, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f749e3d6e5187087fe5f568b27deed3c416ba920032cd4545f380aadfd7f67b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::keydown (cyclomatic 34): (anonymous)::keydown has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"517d401afcfa765057ce5884c552e5758371769d8a0d82a7a9bde0270b824b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"util._runhook (cyclomatic 33): util._runhook has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b3b4014004fe1482fc2295923477eccb91594f5085f1a5da2ba21f5e5864e8"}},{"ruleId":"D1","level":"warning","message":{"text":"CPPF.get_cached_file (cyclomatic 32): CPPF.get_cached_file has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse-streaming.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d7f74dc86b4d79a8c80a8c550118d77285f13f7a00e0831ee0bde74ecb0d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv._map_volume_idp (cyclomatic 32): AuthSrv._map_volume_idp has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c347c132c02ae694caa05b81cad01500a7123e6b6d5301b4210fda84342e2682"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_post (cyclomatic 32): HttpCli.handle_post has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"29349ca68fea4887b60aa735805065098274f62ef919ae94e8aa3bd4c3901075"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_post_json (cyclomatic 32): HttpCli.handle_post_json has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6434a60a7a5c7a26948d324dba857a936c8da5d3821daa429e2b5be7c14dd3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._cp_file (cyclomatic 32): Up2k._cp_file has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4586}}}],"partialFingerprints":{"codehealthFindingId/v1":"39208c0d24e80d4016574633289588d30497f0addb86abe40a67e01db5ab6ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._relink (cyclomatic 32): Up2k._relink has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":5181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fa5dcec36dca73a6fb0b1a60608b63785a281310a8660fed7bfc0b54eb989a"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.play (cyclomatic 32): browser.play has cyclomatic complexity 32 (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":"copyparty/web/browser.js"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a635250f19fe71a5f3c06b183eab068f0ed282a260c26b48f6bec6d0a64e6"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_md (cyclomatic 31): HttpCli.tx_md has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"211756b6b60fc6d01f48cc6c704eeba93916e71b3a625e63f4373d37c964a603"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpSrv.thr_listen (cyclomatic 31): HttpSrv.thr_listen has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpsrv.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"55073d2b0ea931b971a03674df1818d6b62415eb957a21e63465729a05bb5393"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctl.handshaker (cyclomatic 30): Ctl.handshaker has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a59be15f177a5e9fe3ca59cc3f66045681f0333a370cee96ba524e1665ae41"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_pipe (cyclomatic 30): HttpCli.tx_pipe has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7040eef8c9fc3ed059c43f9cb14c9a6f39ad674ee00b9fd17b83b62bd8f515a"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.gen_tree (cyclomatic 30): HttpCli.gen_tree has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e925fe9103de867180367f5df08cb2c3168d66621ce3133d900675540f605691"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._new_upload (cyclomatic 30): Up2k._new_upload has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":5382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e792698381b4a6a6dc54f9af1ef3202cdb6b07f375f168301f4530f99c323bdf"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctl.handshaker (cyclomatic 30): Ctl.handshaker has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6911b4671c9dc1bb78ed3ee82360d015b275fc397a2c32c9276afa9049802f15"}},{"ruleId":"D1","level":"warning","message":{"text":"util.vis_exh (cyclomatic 30): util.vis_exh has cyclomatic complexity 30 (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":"copyparty/web/util.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe05ae6ecb0fa8fb3f8ca96b808490e2668c7210fc2c5bac77e5759a71e2cd3"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::up_them (cyclomatic 30): up2k_init::up_them has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f36570fc8b335bb9649e48e4661324f01226c140bba47001fc49ac69b65c578"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.sortfiles (cyclomatic 29): browser.sortfiles has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7487e25f0e50fb05fcbf261d9c60387dad855c164ec2d964a918d55f22c4ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_res (cyclomatic 28): HttpCli.tx_res has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4718}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9660edeb7da533f7d0a60b539fe99982520e7f7a9d37501624b461a9a4f09e"}},{"ruleId":"D1","level":"warning","message":{"text":"SFTP_Srv._open (cyclomatic 28): SFTP_Srv._open has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/sftpd.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"103ab85a061884cbc7bda97f5a490a3cd2dfbccbbb8a92886539f0e29f22039a"}},{"ruleId":"D1","level":"warning","message":{"text":"util.ren_open (cyclomatic 28): util.ren_open has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"564b821bc62226eb130386f3964b4866fe54b8f9bc00e8d06ac3a516f884ab7d"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.evau_error (cyclomatic 28): browser.evau_error has cyclomatic complexity 28 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8f6adbcf3721d55f4e651781fd46d9ed1b114d6a44e2d652b837ed4180663e"}},{"ruleId":"D1","level":"warning","message":{"text":"md2.fmt_table2 (cyclomatic 28): md2.fmt_table2 has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f91a74ffafe3a27a69208c83af19ece4cdac1ed682d1bd6c9d68ef11cb5cb8f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 28): (anonymous) has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 7 function items inside it that branch (draw, mousemove, mousemove::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4860ca17ac86d59ba3d0514abfba1a437c22895d6b3f07f54da3e73246062411"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::apply (cyclomatic 28): (anonymous)::apply has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ba67a9d21be66dccdb44c9b5657f2028a1d364e38119af172e86c7df8ab371"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv.dbg_ls (cyclomatic 27): AuthSrv.dbg_ls has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"975749878033e2a3c1f9dfc8b0510791db8f776f0fbb1a7e40be55194f02fb3b"}},{"ruleId":"D1","level":"warning","message":{"text":"ThumbSrv.__init__ (cyclomatic 27): ThumbSrv.__init__ has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8584cc49e9a543fc2b567ab2fedd91fdba1d8b8d16db179dfdcfccb3f6b06315"}},{"ruleId":"D1","level":"warning","message":{"text":"util._zmq_hook (cyclomatic 27): util._zmq_hook has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":4095}}}],"partialFingerprints":{"codehealthFindingId/v1":"295c050150f8e21b91efe5e1b6f8eec80a9bf7f45901d44ae3fddc9eb7f9a9e1"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.fmt_ren (cyclomatic 27): browser.fmt_ren has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3826}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f343e1f203a69a6f867adb298f88145701cbc582a2022ee11d0c7f3db499e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._run_one_mtp (cyclomatic 26): Up2k._run_one_mtp has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"114310095af541fdac2eee5b1d8f287bb7e4f8b14be770867018cac90b094294"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k.db_add (cyclomatic 26): Up2k.db_add has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"785376881f7cc937e9505c9107be3ff4ad34473368914a94619f7546b9338aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k.handle_mv (cyclomatic 26): Up2k.handle_mv has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04780900a102e28dc055868217d7439a52f2bad987fb277e752507c743991e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._snap_reg (cyclomatic 26): Up2k._snap_reg has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":5553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ba3d9396bc6ea8c1a7cdc24a97d0e6040efc6863e3c1c6b800e2800b9a6d7"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::gotfile (cyclomatic 26): up2k_init::gotfile has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacf27a731a8034a5e5b4bac28d13c410362a41a0e8c45ea366daac608225aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"fmt_ren::dive (cyclomatic 26): fmt_ren::dive has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"04960985400ff6f687442481bd1c02a1a7022524cfbd6334cc00fb2b33c2a608"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::gclick (cyclomatic 26): (anonymous)::gclick has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad853fafa0579a347b3897169bd4c440df4981b3cc0238220875f62cb1b62a1"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::onscroll2 (cyclomatic 26): (anonymous)::onscroll2 has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c334090aa9f70aa36052573abb41599964288d26063f5b1b97d4d74da445435"}},{"ruleId":"D1","level":"warning","message":{"text":"CPPF.get_cached_file (cyclomatic 25): CPPF.get_cached_file has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse2.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bffc35821cc7c5cb31caa71561cc59d008d2ac8ad756fda76980a94962645d1"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._sched_rescan (cyclomatic 25): Up2k._sched_rescan has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"490b33ea54916134699a70816f4e8e16cc1dde63ea9c15e662c09f1bb08cab37"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._build_file_index (cyclomatic 25): Up2k._build_file_index has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa94ceb572d88df2c55c82b89219a1ec037a62ba5d212ccb8ca5c54e4a88e74"}},{"ruleId":"D1","level":"warning","message":{"text":"util.sortTable (cyclomatic 25): util.sortTable has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1347e41ca96d5555901c9db2f621bebf9342e423218398368f300e2a485616"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::announce (cyclomatic 25): (anonymous)::announce has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab81377552d5860bcb8a40ff05be598dd619b92557510c879bcc371daff94fc3"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 25): (anonymous) has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 13 function items inside it that branch (onclick, onclick, set, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ee609a9348fe646144130848e42d7fea9646ab49f01cf45c32afeef6584edd"}},{"ruleId":"D1","level":"warning","message":{"text":"dbtool.compare (cyclomatic 24): dbtool.compare has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/dbtool.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1fa1e6f98e6b7e2684b6bdf3e01ccb5d957b9a673520ce10086bab120c1e15"}},{"ruleId":"D1","level":"warning","message":{"text":"authsrv.expand_config_file (cyclomatic 24): authsrv.expand_config_file has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d50cb307c6f037892e360900d62ddbc65a007118edc05062ca3f528efc3ab45"}},{"ruleId":"D1","level":"warning","message":{"text":"mtag.au_unpk (cyclomatic 24): mtag.au_unpk has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6c447b34109ffe1ee051d2ce6a3a715f2386a06eacfb8a60b196ed216f9328"}},{"ruleId":"D1","level":"warning","message":{"text":"util.runcmd (cyclomatic 24): util.runcmd has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3807}}}],"partialFingerprints":{"codehealthFindingId/v1":"569f16180d82aa9e878d97aa538140d88835c990ab55e2f3424d2e31a1b537c8"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::set_fsearch (cyclomatic 24): up2k_init::set_fsearch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"22391ef90369411ca31d8db0fde12cc209a93c4310c6f597bf049f20005b7829"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::init_ac2 (cyclomatic 24): (anonymous)::init_ac2 has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a002428ea8f244ec4b5b45877cde82ab4deb5ba5d050a57d140114584667a30"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::loadImage (cyclomatic 24): (anonymous)::loadImage has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e3b6abdc078dc99bde62103ce2424868e7022546ce778c662ce9456b08307e"}},{"ruleId":"D1","level":"warning","message":{"text":"u2c.handshake (cyclomatic 23): u2c.handshake has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e189274a208c30022c3e4d92b6d32e33b901eaadf7578c84383377d259de7c4"}},{"ruleId":"D1","level":"warning","message":{"text":"VFS.walk (cyclomatic 23): VFS.walk has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bd3d18aad91a9b9e9c28d3aaf3f77e73c9865180d4642bc69ad2c56f170000"}},{"ruleId":"D1","level":"warning","message":{"text":"Ftpd.__init__ (cyclomatic 23): Ftpd.__init__ has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"5923eac00093772cc903239413abcc1f015cd7e0105273209589e8324a5cb4bf"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpConn.run (cyclomatic 23): HttpConn.run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpconn.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4e6b799db71337e7b314aef2a1bdfe98d07c98e18684afc444e18ac6704390"}},{"ruleId":"D1","level":"warning","message":{"text":"SSH_Srv._check_auth_password (cyclomatic 23): SSH_Srv._check_auth_password has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/sftpd.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b7a7d411c5819fbd4a01ce0d524e7bedf9b0bec0ac2c310f3fcbdf97b9617"}},{"ruleId":"D1","level":"warning","message":{"text":"Tftpd.__init__ (cyclomatic 23): Tftpd.__init__ has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tftpd.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3badb70e287c01f28b856c46a7c4749e6d0968655a14a6b96c1833417d9d7492"}},{"ruleId":"D1","level":"warning","message":{"text":"u2c.handshake (cyclomatic 23): u2c.handshake has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3617c8844a3f495bc7ce134a11de2708a62d9b0272004bd51d33410c627c088"}},{"ruleId":"D1","level":"warning","message":{"text":"md.init_toc (cyclomatic 23): md.init_toc has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f050b3609b43264842d0e2b7a4c6c7db2082f9518989c609694ad310c0ecabf"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::uptoast (cyclomatic 23): up2k_init::uptoast has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"67390dd3876dd67e26f2edd2aaa403f46d4f09d7804177ad11e047a0dc619bc2"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::ansify (cyclomatic 23): (anonymous)::ansify has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5371}}}],"partialFingerprints":{"codehealthFindingId/v1":"549f65e6303cf60cd762deb9fc03f26337f0cf523e70d54672230ebfcab9390d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::encode_query (cyclomatic 23): (anonymous)::encode_query has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6624}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d1427737868c4288837b491dedfec919854033c71ef0cf7ee7efb3a3bfa983"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv._read_vol_str_idp (cyclomatic 22): AuthSrv._read_vol_str_idp has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e9ec3b908d458b89cea7452aa5482b44c286bb6fde1b3d9cdadfc654deeb94"}},{"ruleId":"D1","level":"warning","message":{"text":"cert._gen_srv (cyclomatic 22): cert._gen_srv has cyclomatic complexity 22 (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":"copyparty/cert.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3e5ea076c516367742eba13dcf3467cc3d5490438434259e996ed7d929e4a0"}},{"ruleId":"D1","level":"warning","message":{"text":"fsutil.ramdisk_chk (cyclomatic 22): fsutil.ramdisk_chk has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/fsutil.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aafe0c193edaa0d5bfb36e8bbe16d08ecdaf8ff6b530e425cfff8847bf1d393"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli._add_logues (cyclomatic 22): HttpCli._add_logues has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4624}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d39e12fe07a169dcbd2b24470a8900524e264902cb1c5a817cf816456f94aec"}},{"ruleId":"D1","level":"warning","message":{"text":"MDNS.build_svcs (cyclomatic 22): MDNS.build_svcs has cyclomatic complexity 22 (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":"copyparty/mdns.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a4d918e21b12e0f3b572928524c88af45f4aeb8f1a5f0ab22c4328a1045f81"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub._check_env (cyclomatic 22): SvcHub._check_env has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"123d2fd0316d88472de40437f46304b1adbf237a96b43848c2d23a54d7c90732"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub._log_enabled (cyclomatic 22): SvcHub._log_enabled has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14e4af7cc15ab55ecd880cacd217f526f744135ea2dc02623954796ed9fb1bd"}},{"ruleId":"D1","level":"warning","message":{"text":"ThumbSrv._clean (cyclomatic 22): ThumbSrv._clean has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5189445ba3ca3061730d8f8b2baee8277371f8ac7643f3dde0299fe8abae2b78"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k.handle_chunks (cyclomatic 22): Up2k.handle_chunks has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00cac08e9a0d01d057dbd41af22ca791e07968440ae145883979c60acf85088"}},{"ruleId":"D1","level":"warning","message":{"text":"util.runhook (cyclomatic 22): util.runhook has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":4307}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b37e1de3ed5e86a075a7cefc9ee98a5e166c838febc85a8dea139689be891a"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.eval_hash (cyclomatic 22): browser.eval_hash has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3552}}}],"partialFingerprints":{"codehealthFindingId/v1":"85287092f31f3a6325a9b3c2d89796d1330fe93dde0c21c8be10a39f26ab093e"}},{"ruleId":"D1","level":"warning","message":{"text":"util.xhrchk (cyclomatic 22): util.xhrchk has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"372be7f53398822d13ff6a952d0d351eb3da488bfd75e4e900050fbd21a580fa"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::onkey (cyclomatic 22): (anonymous)::onkey has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b6fc32de616e4ce8146a1d4f35f4952bbbd0f667c3c55d48b36f6653785446"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpSrv._pregen_thumbs (cyclomatic 21): HttpSrv._pregen_thumbs has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpsrv.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0ca10e0d509b99f5d8d99ec01065bad09753157ec5cf92ceb154d736e03730"}},{"ruleId":"D1","level":"warning","message":{"text":"SMB.__init__ (cyclomatic 21): SMB.__init__ has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/smbd.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f7192287f566f0de2cdfb8d8d787a16b4e18c826e33b6a12a936f5ffcae37c"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::gotallfiles (cyclomatic 21): up2k_init::gotallfiles has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f23e8254848f7a9938863c8b9f59273465fdeed62f661217444aa09afee40c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::drawpos (cyclomatic 21): (anonymous)::drawpos has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"88192b7870a21c39406382b4bdb6ac7ac0c940bc7ed11277deb4990df690125c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 21): (anonymous) has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 4 function items inside it that branch (detectSilence, stop, go, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":10210}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f4b1df617144966b6580a0c20be9affbbd6b61e3156d8350e426b9a3d2f67a"}},{"ruleId":"D1","level":"warning","message":{"text":"VFS._ls (cyclomatic 20): VFS._ls 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":"copyparty/authsrv.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"342e7e5be993cc955443b4469d8a824ca4914acbe03cd06c35fdf7aedf99d09f"}},{"ruleId":"D1","level":"warning","message":{"text":"VFS.chk_ap (cyclomatic 20): VFS.chk_ap 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":"copyparty/authsrv.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d76b0c3ef5ba335e1e36ca195e2a317a7bb493152fa6b2e8c246b9c932aa4de"}},{"ruleId":"D1","level":"warning","message":{"text":"FtpFs.open (cyclomatic 20): FtpFs.open 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":"copyparty/ftpd.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e25d20210f96eee384faf7cc0bdc48a3d8b0cc88d200f7475759be2599a8ca7"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_tail (cyclomatic 20): HttpCli.tx_tail 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":"copyparty/httpcli.py"},"region":{"startLine":5131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d6786af4a53038ef4f091a630c818b994a2a11272d127d78d679c19fc29b11"}},{"ruleId":"D1","level":"warning","message":{"text":"MTag.__init__ (cyclomatic 20): MTag.__init__ 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":"copyparty/mtag.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"968a634e717268d6141c835eb38ac0d8becc95e644d05dfce221901253260880"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub.setup_db (cyclomatic 20): SvcHub.setup_db 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":"copyparty/svchub.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"3425b7cf27b63c9c78ce7ffede53b0252f46007700d4906008cb50ab855617fd"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub.setup_share_db (cyclomatic 20): SvcHub.setup_share_db has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36260786e47e47a994021ce1afeca5a00175bf0b0448ddeacec944758329a35"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub._log_en_f2 (cyclomatic 20): SvcHub._log_en_f2 has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a024421fd1e08a1fffa0e8df81776c073704a768dfa9c27e035f87fe5ef4f6"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub.check_ver (cyclomatic 20): SvcHub.check_ver 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":"copyparty/svchub.py"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"99678960310f3673fbb3e16819e65fdd2b6e060c04e43925db949ee7d695ca5a"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._drop_lost (cyclomatic 20): Up2k._drop_lost 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":"copyparty/up2k.py"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfe31685550f3a6de2f9a5ce4cfb22de2dd09e2ecaae186c322beb6dbcbe241"}},{"ruleId":"D1","level":"warning","message":{"text":"util._fs_mvrm (cyclomatic 20): util._fs_mvrm 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":"copyparty/util.py"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35147c92869e516b6e80d4882261c351953dca00d3deaaae3b2b597af8ff40a"}},{"ruleId":"D1","level":"warning","message":{"text":"util._parsehook (cyclomatic 20): util._parsehook has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c77abad5ca4b968ec8a8aba9c5c9c1a06f38812d18c7765d50bc9b676b2d5f"}},{"ruleId":"D1","level":"warning","message":{"text":"uncomment.uncomment (cyclomatic 20): uncomment.uncomment 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":"scripts/uncomment.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"48518f3ed6e473486520a1c66d36efc9a622df401d82455c62fd7f51a566e5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.show_md (cyclomatic 20): browser.show_md has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9197}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecda1409f350d04e15f928bb0683a4848f67a7c7c8b0e115d92e3d572ea69d1"}},{"ruleId":"D1","level":"warning","message":{"text":"md.copydom (cyclomatic 20): md.copydom 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":"copyparty/web/md.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a806f4d072d44c2688536e97acc3978b3b04baf5323800e4e2043ad37bba43"}},{"ruleId":"D1","level":"warning","message":{"text":"util.humansize_fuzzy (cyclomatic 20): util.humansize_fuzzy has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95da6b6ecf340541b8c6550ffe76c97bc3a48eda2b9c49d8c323f2e4b1be8f6"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::wexec_hash::onmsg (cyclomatic 20): up2k_init::wexec_hash::onmsg 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":"copyparty/web/up2k.js"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d170d45660a375405d7ea0600b2d1edddc1359409c8e3fcffe7b7be91de4a7"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::render (cyclomatic 20): (anonymous)::render has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f90647bca76181d588c15f6dcfd30b24e82513adc0f2208f0d123a7fd1ee464"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 4 function items inside it that branch (render, load_notation, try_render, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfb2287f7eaaf1db632f64e81057301baaeee564da65d7da5e1d196aa8f0e5c"}},{"ruleId":"D1","level":"warning","message":{"text":"dbtool.main (cyclomatic 19): dbtool.main 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":"bin/dbtool.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"927364b6846d7a80d9c103e4b66e00779a6276d6847f8cce33db631ca032164f"}},{"ruleId":"D1","level":"warning","message":{"text":"__main__.showlic (cyclomatic 19): __main__.showlic 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":"copyparty/__main__.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f87e6ee09613f38a847a7ff339cb56a158d926369bb7a658fbe71b8b066e71"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv.setup_chpw (cyclomatic 19): AuthSrv.setup_chpw 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":"copyparty/authsrv.py"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e6104d2b1e1e245061b3f445df78661ad982898df7444ffc3042c8b6b5f324"}},{"ruleId":"D1","level":"warning","message":{"text":"FtpAuth.validate_authentication (cyclomatic 19): FtpAuth.validate_authentication 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":"copyparty/ftpd.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8367101b3df8290af7f08a440504280cc8304d78a0c9a2b44b633ce53f52255"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.send_headers (cyclomatic 19): HttpCli.send_headers 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":"copyparty/httpcli.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd195731a736bb15f37d15130770864053a3178c8df2575c1d0a323ba2781e0"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.reply (cyclomatic 19): HttpCli.reply 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":"copyparty/httpcli.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"705ccb9edfcb276ed82a46cbbeffd3e04e5c27983495660b2b8241e367b7d82f"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_wopi (cyclomatic 19): HttpCli.tx_wopi 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":"copyparty/httpcli.py"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5ab40db21bc14d9c5989bacfd42209553ddf05296b3f13e8384d7684b23ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"MTag.get_mutagen (cyclomatic 19): MTag.get_mutagen 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":"copyparty/mtag.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ec9c0dbc899ee9e2efb4901589e64fb239ac41d792850f3b10bb0f67c10434"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpSrv.detect_interfaces (cyclomatic 19): TcpSrv.detect_interfaces 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":"copyparty/tcpsrv.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a0c23c38298a8891c9a263da26885de8cdbf0f2956b6ecde3da872931fdd4b"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._get_parsers (cyclomatic 19): Up2k._get_parsers 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":"copyparty/up2k.py"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d598379fad1403b882be28193e1ec3e657b6a639aae606777f616cd803e0e6"}},{"ruleId":"D1","level":"warning","message":{"text":"util.statdir (cyclomatic 19): util.statdir 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":"copyparty/util.py"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92be0da38be4f5db52d75a9d60f59f6a54c6263b6fff18279e5b7b25b772aa1"}},{"ruleId":"D1","level":"warning","message":{"text":"rave.raver (cyclomatic 19): rave.raver 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":"contrib/plugins/rave.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27442825c9d5b49bafa3d47d7efe61603c24a72dd0151cf87c4002e079fbe71"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 19): (anonymous) has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 9 function items inside it that branch (show, scrollchk, hide, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"435b454174f62beb1c5407457c2975c1a3020a974f99b98e3eddbad30dd73e9b"}},{"ruleId":"D1","level":"warning","message":{"text":"U2pvis::changecard (cyclomatic 19): U2pvis::changecard 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":"copyparty/web/up2k.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"8684bc81df16da40a80a6c09267c50e7ab386d1861fbeeb60ac83b755a9eafce"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::rename (cyclomatic 19): (anonymous)::rename has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34eea13554bef639c1368cbd578cabdb9d91d8a85056af08667a19af96510d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::render (cyclomatic 19): (anonymous)::render has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4318efd42246deefea2633c150d44dddd80a504dc6fa509d80c4f32ea02d7abd"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::show (cyclomatic 19): (anonymous)::show has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9884}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07f865ebb5f4c5351b2ae351563b94b556d160781e4bb12c20efe2aff902207"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::raver (cyclomatic 19): (anonymous)::raver 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":"contrib/plugins/rave.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f7c00c542129e1919e699bda07836e81606c726720f45bf25d80fe8774fda5"}},{"ruleId":"D1","level":"warning","message":{"text":"FtpFs.v2a (cyclomatic 18): FtpFs.v2a has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc7bc072c744995981c8bd9a92ee0c365edbf0346743e66d5c6f4c839ace09c"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli._cors (cyclomatic 18): HttpCli._cors has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0fb7bc6f7d14b60247e5df2768967139412ab7cd1c9cac7dc8a0ae6e2db7f1"}},{"ruleId":"D1","level":"warning","message":{"text":"MDNS.run2 (cyclomatic 18): MDNS.run2 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":"copyparty/mdns.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"13296bcb3ed668493539d3e7b80c10640d8baab8b5a401c027c9f105b5edf5f6"}},{"ruleId":"D1","level":"warning","message":{"text":"MTag.get_bin (cyclomatic 18): MTag.get_bin 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":"copyparty/mtag.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd5c88a64c61ed0c6fa9d447b4043448e1bba76c2bda2df76e2e925e534267f"}},{"ruleId":"D1","level":"warning","message":{"text":"ThumbSrv._run_ff (cyclomatic 18): ThumbSrv._run_ff has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1a4b46a4474e0de3c7865e9c9300e32916bf6bf62a941245a8d08ff0e7b222"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k._e2ts_q (cyclomatic 18): Up2k._e2ts_q 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":"copyparty/up2k.py"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7083dee78184efdf5386eb8d3c91167f6e7b90c95a08231afadfed08d30b9984"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k.handle_cp (cyclomatic 18): Up2k.handle_cp 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":"copyparty/up2k.py"},"region":{"startLine":4522}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b0f6bbc4ce40b167e0935bd269f0fadc29aeb1f657b7ce25560ce8dcae759e"}},{"ruleId":"D1","level":"warning","message":{"text":"fusefuzz.main (cyclomatic 18): fusefuzz.main has cyclomatic complexity 18 (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":"scripts/fusefuzz.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa3ce45a0a0aaff7a65060c27594a9caaacedb63cdb89a7c289e64a9c3657d1"}},{"ruleId":"D1","level":"warning","message":{"text":"sfx.unpack (cyclomatic 18): sfx.unpack has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sfx.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf66a556dbac127a2888459c5cf37c3ce70d6de2853ee20c77e08c3c032fafb6"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_flagbus (cyclomatic 18): up2k_flagbus has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 7 function items inside it that branch (onmessage, take, tx, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"740eb1a4df0af7e0510a3c3729a8a06e82d2eda147660ee662d0ca514a2e0bd9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::rendertree (cyclomatic 18): (anonymous)::rendertree has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df69caeff51ad21fec582cd7ff50598713ce07c5a1812dbd731063b3aa49f30"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::seltgl (cyclomatic 18): (anonymous)::seltgl has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8850}}}],"partialFingerprints":{"codehealthFindingId/v1":"857969f61d0e2560e349d4e1cbb49a3e4431ef085372f777f2e492f8e64d35d7"}},{"ruleId":"D1","level":"warning","message":{"text":"onclick (cyclomatic 18): onclick has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9710}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9caa7160d9032c6b2f382c8686891943e601256fd687ba252fedc7651bd0fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::rotn (cyclomatic 18): (anonymous)::rotn has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f6f72e7d1e0ad02730f28b9bf9470e6dadc9cdba5fcc60fdeb088eff2f0f8e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 6 function items inside it that branch (our_hotkey_handler, move_selected_files, move_next_file, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/quickmove.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e819a77e7b003b8ee68cf51dce44e28516aaba51c63099135a24f6137c5e8cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"HCli.req (cyclomatic 17): HCli.req 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":"bin/u2c.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c50264f0b3c86b4323f01bea92073e0b28f02166f55c7577a968d68bf8fd9d"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthSrv.setup_pwhash (cyclomatic 17): AuthSrv.setup_pwhash 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":"copyparty/authsrv.py"},"region":{"startLine":3646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7069551b82c546a5ba86f925654dbcdf4a328fedaca22e86ff80ec9d3871c6"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_search (cyclomatic 17): HttpCli.handle_search 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":"copyparty/httpcli.py"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a30d9b09760b7dea3d733edc29f350917db44c42d29b82327654d5cff2e9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.tx_svcs (cyclomatic 17): HttpCli.tx_svcs 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":"copyparty/httpcli.py"},"region":{"startLine":5727}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2a1d7a8aec0492c574bc04a3250fae1fa2fb34a1bef03467d1e0e3d415d3e5"}},{"ruleId":"D1","level":"warning","message":{"text":"MCast.setup_socket (cyclomatic 17): MCast.setup_socket 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":"copyparty/multicast.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5859e748987512a195cd3cebf5da03c002ae6d49f811d7c4202f80e1627225"}},{"ruleId":"D1","level":"warning","message":{"text":"SFTP_Srv.v2a (cyclomatic 17): SFTP_Srv.v2a 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":"copyparty/sftpd.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2ed6d5aa171094ad7b8f4ef20e5b45023421e9ef80ba4bf228a63e943dae59"}},{"ruleId":"D1","level":"warning","message":{"text":"QrCode._get_penalty_score (cyclomatic 17): QrCode._get_penalty_score 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":"copyparty/stolen/qrcodegen.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab213077e1ba1c4b99944b8705e9e373aed11f7ddc078c694f9868d7e3ca7f"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub._log_disabled (cyclomatic 17): SvcHub._log_disabled 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":"copyparty/svchub.py"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"8041db314187db9d52b95fe63967205e8519a40214faa40f98292c2aeedb1592"}},{"ruleId":"D1","level":"warning","message":{"text":"Tftpd._open (cyclomatic 17): Tftpd._open has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tftpd.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44024e0d0dc0f8011be1badc22eb29a4aab9fae610528a81db801365f036acf"}},{"ruleId":"D1","level":"warning","message":{"text":"Up2k.get_unfinished_by_user (cyclomatic 17): Up2k.get_unfinished_by_user 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":"copyparty/up2k.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5088c6a9b0af27f7f4519d2c2866c819d9db89a2b8d4732130193b4094cbb26"}},{"ruleId":"D1","level":"warning","message":{"text":"HCli.req (cyclomatic 17): HCli.req 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":"copyparty/web/a/u2c.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ba831c4b7a409c56581e8627652d9d14cc91299697fa938241625ff898c47b"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::exec_hash::segm_next (cyclomatic 17): up2k_init::exec_hash::segm_next has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e74db3659dc47e8394cf8568a20fbb66b2f29e9681b7ec34495637bb384883"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::show (cyclomatic 17): (anonymous)::show 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":"copyparty/web/baguettebox.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"0742a85ddd7a8d35b7a59450d681e9fbbe4432cf519507e295ce885b39225997"}},{"ruleId":"D1","level":"warning","message":{"text":"a_up2k_namefilter::process_id_list (cyclomatic 17): a_up2k_namefilter::process_id_list 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":"contrib/plugins/up2k-hook-ytid.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bed2d4ad3a23a3fced5ca662d297bd1e1474cbac2eaf35c33d0af0dee041fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"partyfuse.main (cyclomatic 16): partyfuse.main has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d848264a463a0120fdc157a35b598fb540a949c9afd7f3a84b87e3c70bb8c24b"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.get_pwd_cookie (cyclomatic 16): HttpCli.get_pwd_cookie 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":"copyparty/httpcli.py"},"region":{"startLine":3701}}}],"partialFingerprints":{"codehealthFindingId/v1":"a661d17aa7733518c3af00aa008867a3f271cdf5857335e6691eb432e4142cb6"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCli.handle_eshare (cyclomatic 16): HttpCli.handle_eshare has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6635}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0739c7d2959efbd0a639091e74a56cd232cc77e4ebc35530fbd16e4e4f7936"}},{"ruleId":"D1","level":"warning","message":{"text":"MDNS.build_replies (cyclomatic 16): MDNS.build_replies 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":"copyparty/mdns.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"979540a1dba77098b7f3b68cc0275736d5fdbb5f2fef51516ababff8bce65aba"}},{"ruleId":"D1","level":"warning","message":{"text":"SFTP_Srv._list_folder (cyclomatic 16): SFTP_Srv._list_folder 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":"copyparty/sftpd.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b14684a602c374c3ee1e7c9b3119672fb96760377246dd580938869c06f787"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub.run (cyclomatic 16): SvcHub.run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"3615a740dcbfd4b855fea4180a611704aee3feed8871c11b5ee2290913bb24c9"}},{"ruleId":"D1","level":"warning","message":{"text":"SvcHub.shutdown (cyclomatic 16): SvcHub.shutdown 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":"copyparty/svchub.py"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c514ed44946a1e686e2ff009c1a2a8744d260d0b9386a55bba1d1de2b5fafc"}},{"ruleId":"D1","level":"warning","message":{"text":"Tftpd._ls (cyclomatic 16): Tftpd._ls has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tftpd.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8024521ba745286327778e1cbfeb8af904571b0d09d95f41b9e7bfbcc59049b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ThumbSrv.run_extractor (cyclomatic 16): ThumbSrv.run_extractor 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":"copyparty/th_srv.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae234fd5f6648e9b9f9fb03f4da77bdac3a66056d50eef14c405723551428521"}},{"ruleId":"D1","level":"warning","message":{"text":"MultipartParser._read_header (cyclomatic 16): MultipartParser._read_header 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":"copyparty/util.py"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e92c27eee6db73e20f583fb7a52a9c8d365b24cb32d3ce56fce6d0bce1d0010"}},{"ruleId":"D1","level":"warning","message":{"text":"partyfuse.main (cyclomatic 16): partyfuse.main has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18fb57b4220eb8be86f0d8a9155a3688da71dd9741c7f1b018156f94bd8bc48"}},{"ruleId":"D1","level":"warning","message":{"text":"onmessage (cyclomatic 16): onmessage has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (hash_calc, hash_calc::hash_done, onerror, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/w.hash.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82cd3fbcae6019f52c66691c9aea01a3267b5a795c0853455e65fffe673d1e2"}},{"ruleId":"D1","level":"warning","message":{"text":"U2pvis::bzw (cyclomatic 16): U2pvis::bzw 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":"copyparty/web/up2k.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c53bcfba49277721431ee10482ba1b9fe455a6867357b04f3e6057ad5a6259e"}},{"ruleId":"D1","level":"warning","message":{"text":"up2k_init::onovercmn (cyclomatic 16): up2k_init::onovercmn 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":"copyparty/web/up2k.js"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b48ece248bdb6932796f833ac1257bb78f17bc4fe598718635427811a8b55ad"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 7 function items inside it that branch (diff, push, apply, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"153c1df93c7901198fcffdc2eb7d7761f5ba5ddb35d1d5f178655aa286ce0b3d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::render (cyclomatic 16): (anonymous)::render 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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::onclick (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9adae2ae00ff390eb2dbd9e971940298d27810f06fc3a20598e383bc234b0c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/banner.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae5cc9c98369f0879b554adae963da1b0051ffa86e3792f5abb5358ad35eb28"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv._reload (cognitive 1038): AuthSrv._reload has cognitive complexity 1038 (threshold 15). Drivers by points: if/else 272 (627 pts), loops 110 (214 pts), boolean chains 97, ternaries 20 (55 pts), error handling 15 (45 pts) (nesting depth added 524). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54f2786e6a6b1324835ac96888f7656db6a23bc2c7088f0aaf2d2f2ca819baf"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k.up2k_init (cognitive 861): up2k.up2k_init has cognitive complexity 861 (threshold 15). Drivers by points: if/else 332 (519 pts), boolean chains 152, loops 51 (85 pts), ternaries 35 (74 pts), error handling 17 (31 pts) (nesting depth added 274). Of this number, 508 points are the body\u0027s own statements and 353 belong to 36 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b73305a36b9a4298cc6054cda733ac0948ba2f46d926e54bf40a50f6f7aedab"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_browser (cognitive 617): HttpCli.tx_browser has cognitive complexity 617 (threshold 15). Drivers by points: if/else 170 (359 pts), boolean chains 90, error handling 21 (70 pts), loops 23 (59 pts), ternaries 15 (39 pts) (nesting depth added 298). 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":"copyparty/httpcli.py"},"region":{"startLine":7043}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfc342b0ce81758e2afbf509d03a24e6ef0858bc83e40ed4a84df0722428d42"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.run (cognitive 397): HttpCli.run has cognitive complexity 397 (threshold 15). Drivers by points: if/else 121 (257 pts), boolean chains 63, ternaries 14 (38 pts), error handling 11 (22 pts), loops 7 (17 pts) (nesting depth added 181). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37331f6857b6dc15fca0d1df335af986fe66436f51d6aa3632e2ec285751606"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._handle_json (cognitive 359): Up2k._handle_json has cognitive complexity 359 (threshold 15). Drivers by points: if/else 65 (240 pts), loops 11 (36 pts), boolean chains 31, error handling 7 (27 pts), ternaries 8 (25 pts) (nesting depth added 237). 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":"copyparty/up2k.py"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"857b67ab5580cf5d8e27a6a767383a833ca7fee2525edcf1195393189d7e4418"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_plain_upload (cognitive 172): HttpCli.handle_plain_upload has cognitive complexity 172 (threshold 15). Drivers by points: if/else 53 (117 pts), boolean chains 19, ternaries 7 (19 pts), error handling 6 (15 pts), loops 2 (nesting depth added 85). 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":"copyparty/httpcli.py"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa5caa81cf6a7e807779845638ae874e7da897dcbe2f602606d42911d0865be"}},{"ruleId":"D2","level":"warning","message":{"text":"ahotkeys (cognitive 164): ahotkeys has cognitive complexity 164 (threshold 15). Drivers by points: if/else 72 (107 pts), boolean chains 42, ternaries 10 (15 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f401148b289b4377759e8c126920ea257cef61708707987f10d5a4e782704a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._build_dir (cognitive 160): Up2k._build_dir has cognitive complexity 160 (threshold 15). Drivers by points: if/else 49 (99 pts), boolean chains 28, error handling 9 (21 pts), loops 5 (6 pts), ternaries 4 (6 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e708723b6ec2ad97a5edd02bfd07aa743564d74282a2c50ac93e9c065c0e6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.dump_to_file (cognitive 158): HttpCli.dump_to_file has cognitive complexity 158 (threshold 15). Drivers by points: if/else 56 (100 pts), boolean chains 32, ternaries 8 (18 pts), error handling 4 (8 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3071f46676da81c3f37b07db5f6eb13cc0ae7aba1e05352db808ca264be91c23"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::exec_handshake::orz (cognitive 150): up2k_init::exec_handshake::orz has cognitive complexity 150 (threshold 15). Drivers by points: if/else 34 (86 pts), ternaries 9 (28 pts), loops 6 (19 pts), boolean chains 15, error handling 1 (2 pts) (nesting depth added 85). 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":"copyparty/web/up2k.js"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3d6846ab8d846d03a4cf1227bbfd0f5fe7ed8ac77a07445f3ef32f7455d545"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv.cgen (cognitive 140): AuthSrv.cgen has cognitive complexity 140 (threshold 15). Drivers by points: if/else 26 (73 pts), loops 18 (42 pts), error handling 7 (22 pts), boolean chains 3 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":3834}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4dd455f7eb2d035f762642d7d613b4ccc0f4bc5cdf679c27ba2a064a42831b"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub.__init__ (cognitive 140): SvcHub.__init__ has cognitive complexity 140 (threshold 15). Drivers by points: if/else 76 (92 pts), boolean chains 29, loops 8 (10 pts), error handling 3 (6 pts), ternaries 2 (3 pts) (nesting depth added 22). 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":"copyparty/svchub.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4147d43c1d91a1bfb6ade0ae26ba19957db15e1a3e4eba43b2f261eab96bcba4"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSrv.__init__ (cognitive 139): TcpSrv.__init__ has cognitive complexity 139 (threshold 15). Drivers by points: if/else 35 (76 pts), loops 15 (29 pts), error handling 5 (16 pts), boolean chains 12, ternaries 2 (6 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad7a7552f1124397c7ea8e4f1d17472f5743bc5a24528ba1a4c848352ee932"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::(anonymous)::taskerd (cognitive 132): up2k_init::(anonymous)::taskerd has cognitive complexity 132 (threshold 15). Drivers by points: if/else 32 (82 pts), boolean chains 19, loops 6 (15 pts), ternaries 3 (10 pts), error handling 2 (6 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd6681a9ba1df28dd85e29dbc604ad3d7989519b3eb601fc071f24bca0511c1"}},{"ruleId":"D2","level":"warning","message":{"text":"MCast.create_servers (cognitive 127): MCast.create_servers has cognitive complexity 127 (threshold 15). Drivers by points: if/else 34 (75 pts), loops 13 (32 pts), boolean chains 9, error handling 3 (7 pts), ternaries 2 (4 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/multicast.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee6efb74e7483484a923f436564aed341a645b306e3cf0c0a36aa8c75231577"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k-hook-ytid.a_up2k_namefilter (cognitive 121): up2k-hook-ytid.a_up2k_namefilter has cognitive complexity 121 (threshold 15). Drivers by points: if/else 27 (73 pts), loops 13 (31 pts), ternaries 5 (14 pts), boolean chains 3 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/up2k-hook-ytid.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c949113a3993f550c2258d3c0eeeda8d542aef40b2b61ea909da60cf943026f7"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv._parse_config_file_2 (cognitive 120): AuthSrv._parse_config_file_2 has cognitive complexity 120 (threshold 15). Drivers by points: if/else 33 (84 pts), error handling 5 (15 pts), loops 4 (11 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3dcf592b1ffef81f698e801380a635a9370e6f17f27d7e38bcf512ac4ad37a"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_propfind (cognitive 118): HttpCli.handle_propfind has cognitive complexity 118 (threshold 15). Drivers by points: if/else 41 (76 pts), boolean chains 18, error handling 3 (9 pts), loops 5 (8 pts), ternaries 4 (7 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd604d377af56de16c6a1e933e1ae89a69a90960e746e2569759559ac5dde6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.register_vpath (cognitive 118): Up2k.register_vpath has cognitive complexity 118 (threshold 15). Drivers by points: if/else 39 (73 pts), loops 8 (18 pts), error handling 8 (12 pts), boolean chains 10, ternaries 4 (5 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bf8586ff16d9621ebd36db71e349def58f91f6ec0384e0d1add9049cd27c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"MDNS.eat (cognitive 116): MDNS.eat has cognitive complexity 116 (threshold 15). Drivers by points: if/else 35 (73 pts), loops 7 (14 pts), boolean chains 12, ternaries 4 (9 pts), error handling 3 (8 pts) (nesting depth added 55). 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":"copyparty/mdns.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7fe472b32d54cfdd3d452d07ab5caadb8dfb0f2989c98bdb265dea42a7e5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_get (cognitive 110): HttpCli.handle_get has cognitive complexity 110 (threshold 15). Drivers by points: if/else 53 (98 pts), boolean chains 9, error handling 1 (3 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9494b5da184ff7183057fdf7fc039197d64e058743bbc305025f4f34462dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._redup (cognitive 104): Up2k._redup has cognitive complexity 104 (threshold 15). Drivers by points: if/else 21 (66 pts), loops 7 (18 pts), boolean chains 12, error handling 1 (4 pts), ternaries 1 (4 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79cc96faa288163f895d4958c7cef0021df131a4b5c5e90a54812d76336a499"}},{"ruleId":"D2","level":"warning","message":{"text":"ThumbSrv.worker (cognitive 103): ThumbSrv.worker has cognitive complexity 103 (threshold 15). Drivers by points: if/else 15 (41 pts), error handling 7 (25 pts), boolean chains 19, loops 5 (10 pts), ternaries 2 (8 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0554eee5becb6e2e0041e9a7a8aaf47bc7f4aa625375e194fe21bc55d99faa27"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl.hasher (cognitive 100): Ctl.hasher has cognitive complexity 100 (threshold 15). Drivers by points: if/else 18 (60 pts), loops 5 (18 pts), boolean chains 9, error handling 2 (9 pts), ternaries 2 (4 pts) (nesting depth added 64). 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":"bin/u2c.py"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb8ff9c4ae72731bac8f06adaf0d4626fa1c9cd7770c3030d3335e872745a04"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.init_indexes (cognitive 100): Up2k.init_indexes has cognitive complexity 100 (threshold 15). Drivers by points: if/else 39 (67 pts), loops 11 (12 pts), boolean chains 10, error handling 5 (10 pts), ternaries 1 (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":"copyparty/up2k.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"441b2e84d6d42e04ccd456fe7d1bc2320d2255597acb5a7af70c5eba87630fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl.hasher (cognitive 100): Ctl.hasher has cognitive complexity 100 (threshold 15). Drivers by points: if/else 18 (60 pts), loops 5 (18 pts), boolean chains 9, error handling 2 (9 pts), ternaries 2 (4 pts) (nesting depth added 64). 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":"copyparty/web/a/u2c.py"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"49185fd4405e39434339f79d1a3068d771b43ab017289a6769d5feaa946dc68d"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._handle_rm (cognitive 97): Up2k._handle_rm has cognitive complexity 97 (threshold 15). Drivers by points: if/else 30 (69 pts), boolean chains 12, ternaries 3 (6 pts), error handling 2 (5 pts), loops 3 (5 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbb562cbe4e53649334d3c2d64a8202975938e4c7f7b8ec55078fc284b111e7"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._process_config (cognitive 96): SvcHub._process_config has cognitive complexity 96 (threshold 15). Drivers by points: if/else 36 (55 pts), loops 17, boolean chains 16, error handling 3 (4 pts), ternaries 4 (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":"copyparty/svchub.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e511cd6023c58ba6ea3872751185542193bf1daf39c34c4db5b59aa6f32763"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_rups (cognitive 93): HttpCli.tx_rups has cognitive complexity 93 (threshold 15). Drivers by points: if/else 26 (58 pts), boolean chains 12, ternaries 4 (11 pts), loops 6 (10 pts), error handling 1 (2 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6422}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec7d6f0d425b16c9d886c300187c192f67962552044f816b7adba58a6db1791"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_mounts (cognitive 91): HttpCli.tx_mounts has cognitive complexity 91 (threshold 15). Drivers by points: if/else 25 (41 pts), loops 9 (21 pts), boolean chains 16, ternaries 7 (11 pts), error handling 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5780}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e73b90955219e74a40ee4a3f413de05cff1ac388386a36ed42aced33c4cc78"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__.main (cognitive 90): __main__.main has cognitive complexity 90 (threshold 15). Drivers by points: if/else 45 (61 pts), error handling 7 (10 pts), loops 9 (10 pts), boolean chains 9 (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":"copyparty/__main__.py"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41a5351cc8e1553f7fceca8822bc381c287cacaf9d60c2c45665d2f979d1586"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_file (cognitive 89): HttpCli.tx_file has cognitive complexity 89 (threshold 15). Drivers by points: if/else 43 (64 pts), boolean chains 15, error handling 3 (6 pts), ternaries 2 (3 pts), loops 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":"copyparty/httpcli.py"},"region":{"startLine":4854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25e7d05fbea766fb4869b2bcfc6f5260c022310e17a6f173931f060b2e9a46c"}},{"ruleId":"D2","level":"warning","message":{"text":"ThumbCli.get (cognitive 88): ThumbCli.get has cognitive complexity 88 (threshold 15). Drivers by points: if/else 31 (51 pts), boolean chains 19, ternaries 5 (13 pts), error handling 3 (4 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_cli.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"954517abd57e08a9585da618051d1d8b3d7ccc9be1f034f4c45c189645e94eae"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_ups (cognitive 83): HttpCli.tx_ups has cognitive complexity 83 (threshold 15). Drivers by points: if/else 32 (59 pts), boolean chains 11, loops 5 (8 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c276501f35d196ee74521d2f8279234e2a3ed910c9cc40a0eb19b10eb98e013c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::gentab (cognitive 83): (anonymous)::gentab has cognitive complexity 83 (threshold 15). Drivers by points: if/else 24 (41 pts), ternaries 6 (19 pts), loops 7 (14 pts), boolean chains 9 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9f98cffe928fb06e69b8d93a1f0e8f8ca853eb4a62a6390a0d07eaa3a451b4"}},{"ruleId":"D2","level":"warning","message":{"text":"mtag.parse_ffprobe (cognitive 82): mtag.parse_ffprobe has cognitive complexity 82 (threshold 15). Drivers by points: if/else 28 (58 pts), error handling 3 (9 pts), loops 7 (9 pts), boolean chains 6 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6a650c7cf99ef192226d7991ea015220fc83d19d35f02bf9a65c970eef6515"}},{"ruleId":"D2","level":"warning","message":{"text":"U2idx.run_query (cognitive 80): U2idx.run_query has cognitive complexity 80 (threshold 15). Drivers by points: if/else 22 (50 pts), loops 5 (10 pts), boolean chains 8, ternaries 3 (8 pts), error handling 1 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/u2idx.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ea80a82c9259c2983a0ca69d078f8b224f20419b8e7fc26693914d3fc2402"}},{"ruleId":"D2","level":"warning","message":{"text":"U2idx.search (cognitive 78): U2idx.search has cognitive complexity 78 (threshold 15). Drivers by points: if/else 25 (58 pts), loops 4 (9 pts), error handling 3 (8 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/u2idx.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f166ec3d08c779bed56a97bdc5aa35dfd84345d36e67f45201b1483016112e"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpSrv.thr_listen (cognitive 77): HttpSrv.thr_listen has cognitive complexity 77 (threshold 15). Drivers by points: if/else 17 (45 pts), error handling 5 (16 pts), loops 4 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpsrv.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f781b65dbe4231518849a5cbdb3e9508f84da9773820868c0ef584a0f109ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._mv_file (cognitive 75): Up2k._mv_file has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (45 pts), error handling 6 (14 pts), boolean chains 12, loops 1 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4846}}}],"partialFingerprints":{"codehealthFindingId/v1":"2754bd4d5319bb3881c9af20194845ccd2207ebc2491cbaed47c43f199267b37"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::loadgrid (cognitive 75): (anonymous)::loadgrid has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (41 pts), ternaries 7 (18 pts), boolean chains 10, loops 4 (6 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5840}}}],"partialFingerprints":{"codehealthFindingId/v1":"164b4412da66fbe651429c314d5d2b2c0e407aff21d0e3cb5c0553952abc71f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl.handshaker (cognitive 74): Ctl.handshaker has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 7 (18 pts), error handling 2 (5 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"798827d30d0febc79bb3daebe22f340c201e0c1c85b00526554a0d7fcccc8013"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl.handshaker (cognitive 74): Ctl.handshaker has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 7 (18 pts), error handling 2 (5 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"26220db101ba8b434a16be4aaa18ea8249f4be18a6ffbbd4b13af88ad1cb9fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_post_binary (cognitive 73): HttpCli.handle_post_binary has cognitive complexity 73 (threshold 15). Drivers by points: if/else 29 (42 pts), error handling 6 (10 pts), loops 4 (10 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf3f76218661903ce0ce2e08176c478210181b30569c518e17d25fa0e02a132"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_pipe (cognitive 71): HttpCli.tx_pipe has cognitive complexity 71 (threshold 15). Drivers by points: if/else 20 (46 pts), loops 4 (10 pts), error handling 3 (9 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3e53db09225a3167e2e87fb1317a8c7857da2432366be3b7282a67e13e3cda"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::encode_query (cognitive 71): (anonymous)::encode_query has cognitive complexity 71 (threshold 15). Drivers by points: if/else 15 (53 pts), loops 5 (14 pts), boolean chains 4 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6624}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf187682ef37e8d3a4fd7b800ee36b68f5885fbed6a91612258b5a9432dc4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_zip (cognitive 70): HttpCli.tx_zip has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 15, loops 5 (13 pts), error handling 1 (2 pts), ternaries 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5407}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bf9ffb01b25e1d310cefede80371f79ff3ce75cf44126b6e5bcd08157d1685"}},{"ruleId":"D2","level":"warning","message":{"text":"help2html.cnv (cognitive 70): help2html.cnv has cognitive complexity 70 (threshold 15). Drivers by points: if/else 27 (64 pts), boolean chains 4, loops 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/help2html.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed552e8bd6c3c514683accd11da6bee8533c6f03982a8e477a833a65eb3d2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_text_upload (cognitive 69): HttpCli.handle_text_upload has cognitive complexity 69 (threshold 15). Drivers by points: if/else 26 (49 pts), boolean chains 7, error handling 4 (7 pts), loops 1 (4 pts), ternaries 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5d5c4091615c62e2c8d3509ebc968a83fcfd41b6aeb6be1bbad51d03e511d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Metrics.tx (cognitive 68): Metrics.tx has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 6 (13 pts), boolean chains 10, error handling 3 (6 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/metrics.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac36e92a9898e816dc22e655fa596978a3a73bcf44cc0150b5e49dbddd089b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.fmt_ren (cognitive 65): browser.fmt_ren has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (51 pts), loops 3 (9 pts), boolean chains 4, error handling 1 (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":"copyparty/web/browser.js"},"region":{"startLine":3826}}}],"partialFingerprints":{"codehealthFindingId/v1":"09918742b8d7da49fbbfc51757141a946cf505012406c3726ef38c6b5dc29a70"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._symlink (cognitive 64): Up2k._symlink has cognitive complexity 64 (threshold 15). Drivers by points: if/else 27 (44 pts), boolean chains 8, error handling 4 (8 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":3748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f992919ece2187f9aa6f2333cf8bf39c37fcfc28600781cf1da8637adab83808"}},{"ruleId":"D2","level":"warning","message":{"text":"fmt_ren::dive (cognitive 64): fmt_ren::dive has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (51 pts), loops 3 (9 pts), boolean chains 4 (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":"copyparty/web/browser.js"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"5168bd4c540b98270b2e65bdc284c072f7ffe291fdfaa1c7cdd9f51818106238"}},{"ruleId":"D2","level":"warning","message":{"text":"util._runhook (cognitive 63): util._runhook has cognitive complexity 63 (threshold 15). Drivers by points: if/else 24 (43 pts), error handling 3 (8 pts), ternaries 3 (6 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"994ecc082df288ff918bf0d68b8ee8bc257920ca87df6dcb857073969a4032ad"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.main (cognitive 61): u2c.main has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (38 pts), error handling 4 (8 pts), boolean chains 6, loops 5 (6 pts), ternaries 3 (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab95d48234cf296bcd5736e851a8bb2d5f073385bff714fd47465a91dbf8414"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.main (cognitive 61): u2c.main has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (38 pts), error handling 4 (8 pts), boolean chains 6, loops 5 (6 pts), ternaries 3 (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2792cd1c3a44b4f0bbf5fd624f94797113c6024202fbf47d22471a7e59d7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl._fancy (cognitive 60): Ctl._fancy has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 12, loops 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe216681dadd3ae22694a8f03dab4871fc02720aebfd863282d78659c2a9229"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl._fancy (cognitive 60): Ctl._fancy has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 12, loops 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9776d8fbbf95c490037b31bde46fa3bc70e357735d5b53cddf5c1d4a189c4f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"fusefuzz.main (cognitive 60): fusefuzz.main has cognitive complexity 60 (threshold 15). Drivers by points: loops 10 (34 pts), if/else 4 (23 pts), boolean chains 3 (nesting depth added 43). 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":"scripts/fusefuzz.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb843d3d8c334e0093dd2218103b9eb715aa4c07cab7f2ecbd28179d09877c22"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::recvls (cognitive 60): (anonymous)::recvls has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (32 pts), boolean chains 12, ternaries 7 (10 pts), loops 3 (5 pts), error handling 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d36432194bd30b3ff23753d4051453d84c392e11008610c0900f81111de644c"}},{"ruleId":"D2","level":"warning","message":{"text":"CPPF.get_cached_file (cognitive 59): CPPF.get_cached_file has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (50 pts), boolean chains 8, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5af86669c058ff7304d59906a1b054f5287aaa7e1e068b82c8e40f654c77f5"}},{"ruleId":"D2","level":"warning","message":{"text":"CPPF.get_cached_file (cognitive 59): CPPF.get_cached_file has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (50 pts), boolean chains 8, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ead10ebeca066e16a10eb23639922a458701e826bbed80d931670930e24168"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv.dbg_ls (cognitive 58): AuthSrv.dbg_ls has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 6 (9 pts), ternaries 2 (6 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c974a934e1c93f444cbb9b65e97f27f5b9341ad1690b1f99655fc2fc8015459c"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._sched_rescan (cognitive 57): Up2k._sched_rescan has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 4 (10 pts), error handling 2 (5 pts), boolean chains 3 (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":"copyparty/up2k.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6568e9df6ebd8fc6e7225c617ea96c850eb06ff06853e97d1aa48088b5c45d1"}},{"ruleId":"D2","level":"warning","message":{"text":"md.convert_markdown (cognitive 57): md.convert_markdown has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 8 (11 pts), error handling 5 (8 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 21). Of this number, 55 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4417913795b81e427d08ce54dcf5f923d92bdeabb9d59d9e56bbf7bdcc2be0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"dbtool.compare (cognitive 56): dbtool.compare has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (46 pts), error handling 2 (7 pts), loops 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/dbtool.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae2f78b98830ea2f510f3b57de9ade7f903009cfd6d4db1ea322925bec2ee1d"}},{"ruleId":"D2","level":"warning","message":{"text":"util.ren_open (cognitive 56): util.ren_open has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 4 (8 pts), boolean chains 6, error handling 2 (6 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd57dba69a21af246e793492a2e1531c8624d0a3978cd5711a2d2773dea5cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_post (cognitive 55): HttpCli.handle_post has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (42 pts), error handling 2 (6 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"414247c3d346f15cf8fd66904d08a2898830cd054ebb9cc9dd2e063befa4319d"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.gen_tree (cognitive 54): HttpCli.gen_tree has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 7, loops 3 (6 pts), error handling 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0d03268b0c871ffb74b150a2a2ba4f89847f59183311d5afa116254526e32b"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._verify_integrity (cognitive 54): Up2k._verify_integrity has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 11, error handling 3 (7 pts), loops 4, ternaries 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9a96ed5f266f7659169610cfb7cd2952e87524907e0799ef9acafd32b476f2"}},{"ruleId":"D2","level":"warning","message":{"text":"md2.keydown (cognitive 54): md2.keydown has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (46 pts), boolean chains 8 (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":"copyparty/web/md2.js"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"246d2d98d266901b496b4c6a6775f90888fb745ed9a22d51a5e16537e275a664"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::keydown (cognitive 54): (anonymous)::keydown has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (46 pts), boolean chains 8 (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":"copyparty/web/md2.js"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3136e7c2c60939927ecc7f418021d3a51ccdffff21c0c88f4741afba59d820d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::updater_impl (cognitive 54): (anonymous)::updater_impl has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 10, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12e6476c957eac46589e7ea8dd4ad23fb2ee43c4f284c430b781fcb0e72106d"}},{"ruleId":"D2","level":"warning","message":{"text":"sortfiles (cognitive 54): sortfiles has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 7 (14 pts), ternaries 4 (8 pts), boolean chains 2, error handling 1 (nesting depth added 25). Of this number, 41 points are the body\u0027s own statements and 13 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3734}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1930839eb5f43d868080f11e1d302b11f2dc33d0850bc76500c38e88520d334"}},{"ruleId":"D2","level":"warning","message":{"text":"CPPF.get_cached_file (cognitive 53): CPPF.get_cached_file has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 9, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse-streaming.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f4de2907cb987c351237677fe222efc80aabdcf18f27599a49c3b7dc0f7f17"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv._map_volume_idp (cognitive 53): AuthSrv._map_volume_idp has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 13, loops 4 (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":"copyparty/authsrv.py"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca8df413c2a2d1909bf12a8750533613ad65282123cf57ba41006b4b0bf0a85"}},{"ruleId":"D2","level":"warning","message":{"text":"authsrv.upgrade_cfg_fmt (cognitive 53): authsrv.upgrade_cfg_fmt has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a357145763b7e49360803d75a09425c056b5eacb6127c23ff73ea8d040de23"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._run_one_mtp (cognitive 53): Up2k._run_one_mtp has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 8 (13 pts), error handling 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4d4b6a9f7ee7f795537dfc6d99d88dbd49a92cffc2d6e8ba185a8d994f1eb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._relink (cognitive 52): Up2k._relink has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (25 pts), error handling 5 (10 pts), boolean chains 8, loops 5 (7 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":5181}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cd9b9078a1e4aa0d597ba545d4feb265254fbdb8c2029c73b95cacb7681010"}},{"ruleId":"D2","level":"warning","message":{"text":"fmt_table2 (cognitive 52): fmt_table2 has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 9 (13 pts), ternaries 4 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fa550d051149fe9c82ca2f2385377e47e743a0b7f8d39d60fc167131e9e14f"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSrv._listen (cognitive 51): TcpSrv._listen has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (39 pts), error handling 4 (7 pts), boolean chains 4, ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8a3de677e44783b09e4d5067d8deb3c528075a9f86ece7f4594a567aad3e24"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._cp_file (cognitive 51): Up2k._cp_file has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (28 pts), error handling 6 (14 pts), boolean chains 9 (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":"copyparty/up2k.py"},"region":{"startLine":4586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b73a342310041fd70c4c82ef3f870c1c0a8c921558a338041be2a8054ce3827"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub.check_ver (cognitive 50): SvcHub.check_ver has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (31 pts), error handling 5 (13 pts), loops 3 (6 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b3ea09fba0f0ed5a816c27dd671c174b3a525cadb057e0c6d404aed367dfb8"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_share (cognitive 49): HttpCli.handle_share has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 8, loops 4 (6 pts), ternaries 4 (5 pts), error handling 1 (nesting depth added 10). 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":"copyparty/httpcli.py"},"region":{"startLine":6686}}}],"partialFingerprints":{"codehealthFindingId/v1":"e184b978c57e922cd4d261d4f03ec4cf8d5e5b22cee69faa505bf0695a0e2767"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::up_them (cognitive 49): up2k_init::up_them has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 3 (9 pts), boolean chains 7, loops 3 (6 pts), error handling 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"620bee8ce3857852142ae9bd4df629c67c668008e29a85e5ef258eb986de2db4"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_post_json (cognitive 48): HttpCli.handle_post_json has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (32 pts), error handling 7 (10 pts), boolean chains 4, ternaries 1 (2 pts) (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":"copyparty/httpcli.py"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9e4a229539171c251ce1eab2dc4e1943b7756e0eef64daa77c18728ce84541"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli._add_logues (cognitive 48): HttpCli._add_logues has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 4 (6 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4624}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dda34c16631f785e63be25161f4c0c19353340b4ad278c634e23207b3cf7313"}},{"ruleId":"D2","level":"warning","message":{"text":"MPlayer (cognitive 48): MPlayer has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (28 pts), ternaries 7 (9 pts), boolean chains 8, loops 3 (nesting depth added 9). Most of this is not in the body itself: 10 of the 48 points are its own statements and the rest belongs to 17 function items inside it that branch (fader, read_order, preload::(anonymous)::drop, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22133f26877a0746b85b56060b68eda24324e21b3df3e4db2a662307f34406"}},{"ruleId":"D2","level":"warning","message":{"text":"CPPF.get_cached_file (cognitive 47): CPPF.get_cached_file has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (40 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse2.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ccc59322810295154136f7fc3e0f7de0a6c2a608d47e7c4b633d8eaaf346fe"}},{"ruleId":"D2","level":"warning","message":{"text":"VFS.chk_ap (cognitive 47): VFS.chk_ap has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (29 pts), ternaries 2 (7 pts), loops 2 (5 pts), error handling 1 (4 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8d7066136c14404d26dce5beb97a7b511d17fad1b4f7c91358e897aee2d51e"}},{"ruleId":"D2","level":"warning","message":{"text":"Donut (cognitive 47): Donut has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 9 (14 pts), boolean chains 8, loops 1 (nesting depth added 15). Most of this is not in the body itself: 1 of the 47 points is its own statement and the rest belongs to 6 function items inside it that branch ((anonymous), svg, on, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf076d2d2d144c787532ca2d32b9d329333a90a7ea3b19c71c0508457e2766d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::ansify (cognitive 47): (anonymous)::ansify has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (38 pts), boolean chains 5, loops 2 (3 pts), ternaries 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":"copyparty/web/browser.js"},"region":{"startLine":5371}}}],"partialFingerprints":{"codehealthFindingId/v1":"54176981d4a9621d5a853ac6e572b535da80614fe6de50d78c24b96eb28a9c67"}},{"ruleId":"D2","level":"warning","message":{"text":"authsrv.expand_config_file (cognitive 46): authsrv.expand_config_file has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 4 (9 pts), boolean chains 4 (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":"copyparty/authsrv.py"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dae0e82ddc202589ac1a7e1ede2d9062e5ff338711c32d1b1a261ea974480c4"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpSrv._pregen_thumbs (cognitive 46): HttpSrv._pregen_thumbs has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 4 (8 pts), error handling 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpsrv.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"feff129b5061649047e59fa2548862621d6dba842f5dafa82109e52ec02f8469"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._new_upload (cognitive 46): Up2k._new_upload has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (32 pts), error handling 3 (7 pts), boolean chains 5, ternaries 1 (2 pts) (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":"copyparty/up2k.py"},"region":{"startLine":5382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f810de19d6c96f4333d201082c6a94d29ce699547630ed2eb6214712f9c7bf49"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::keyDownHandler (cognitive 46): (anonymous)::keyDownHandler has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26, boolean chains 16, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c55fb342f463132634557926b16fabfa2f3c081eb5518176a748b3f25a7c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_rss (cognitive 45): HttpCli.tx_rss has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 5 (9 pts), boolean chains 8, ternaries 3 (5 pts), error handling 1 (nesting depth added 10). 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":"copyparty/httpcli.py"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b7d60ec75ed5bd57fb024973e00c949151a28b1e7564a268a2bde3f03d5584"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.db_add (cognitive 45): Up2k.db_add has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 4 (9 pts), boolean chains 6, error handling 3 (6 pts), loops 3 (6 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":"copyparty/up2k.py"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c76cb875a505ed53ed072369a9b312888c8ec4d615fdd6a0e75d4b9b2b95b5d"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::etafun (cognitive 45): up2k_init::etafun has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 11, loops 1, ternaries 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":"copyparty/web/up2k.js"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fe662567a203720f1bcee2e98bb735e5308086d3a53e1289eb8c95eb1d003e"}},{"ruleId":"D2","level":"warning","message":{"text":"a_up2k_namefilter::process_id_list (cognitive 44): a_up2k_namefilter::process_id_list has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 6 (12 pts), ternaries 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/up2k-hook-ytid.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"414492e5edc3bee5950102d3a23be2f6c1dfe36377b51d7050060b2752fe0232"}},{"ruleId":"D2","level":"warning","message":{"text":"ThumbSrv._clean (cognitive 43): ThumbSrv._clean has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 6, loops 2 (5 pts), error handling 2 (3 pts), ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f491f7e66b5b10b0e6ba22c7cb62e9e37fa4fb4949423ac34dccbcc27758942"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.handle_mv (cognitive 43): Up2k.handle_mv has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 8 (12 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cba8b7adc2a7e4134aaf72bb58e6276bee86f85cd9277df43800005bde6eff5"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._get_parsers (cognitive 42): Up2k._get_parsers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 25). 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":"copyparty/up2k.py"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72d11a632ea1d9e35b6379b9bcd61b4232149d813151c01ec01c67edd7cc231"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.play (cognitive 42): browser.play has cognitive complexity 42 (threshold 15). Drivers by points: if/else 28 (35 pts), boolean chains 5, error handling 1, loops 1 (nesting depth added 7). 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":"copyparty/web/browser.js"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363b282664b2755378807613af33610db5ce8cf7ca3d7a5b003a3fdaac758a5"}},{"ruleId":"D2","level":"warning","message":{"text":"VFS._ls (cognitive 41): VFS._ls has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 3 (9 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"089dc7330403dd2546519b343b1a29fc1b2a422466ff2b3e436f5e1328439298"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv._read_vol_str_idp (cognitive 41): AuthSrv._read_vol_str_idp has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (9 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"10625a7c6708d61ff6f3ee2c22bbac095ad7cc39bcb4d95ca40771fbb5b2100a"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_md (cognitive 41): HttpCli.tx_md has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (20 pts), ternaries 5 (8 pts), boolean chains 7, loops 3 (5 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fc546fcf8a32d2c1022fa3b40c26ae22e6d42e3a4a2c9acb9cb1d761eb4729"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.eval_hash (cognitive 41): browser.eval_hash has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 3 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 21). Of this number, 32 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. 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":"copyparty/web/browser.js"},"region":{"startLine":3552}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43bfda789b5f4aaa2179a78540e4d9bee9ed6763e245d59c796cebe50d6e3af"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::gotfile (cognitive 41): up2k_init::gotfile has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 7, error handling 2 (5 pts), ternaries 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e88b6f4cd9ac67ed7b584f5729e7d3a2e0f08d3c7c56fbe9b9858ebca73664"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::drawbuf (cognitive 41): (anonymous)::drawbuf has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 24 (29 pts), loops 5, if/else 4, boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf96f8efeecb140e0a41d8feb257aae550a80c6119e6a537b8246165e0e29c7"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpConn.run (cognitive 40): HttpConn.run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (28 pts), error handling 2 (5 pts), loops 2 (4 pts), boolean chains 3 (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":"copyparty/httpconn.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8b85c4335acafaaafd69ff89450d1c2a31d400a8931ccdf832a49e34aa94b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SFTP_Srv._open (cognitive 40): SFTP_Srv._open has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 5, error handling 4 (5 pts), ternaries 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":"copyparty/sftpd.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"818e51572742a4dfd2812391c0bcc356742251770d43874122ceb9afe3ce8cde"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_perms (cognitive 40): apply_perms has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 11, loops 5 (6 pts), ternaries 4 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8064}}}],"partialFingerprints":{"codehealthFindingId/v1":"20534af00ccaeedbec0ec527e81853fc34c447da308a7019e38b7fb2340555d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Ftpd.__init__ (cognitive 39): Ftpd.__init__ has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (27 pts), error handling 2 (5 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfee1462c505f5bcef886f708a94fbba0cda35567b0bc930d4ec4cd6a08acf9b"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_res (cognitive 39): HttpCli.tx_res has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26 (34 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4718}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6dbbe4718402a1ea4cf7861218e08e31889b38c8bc8b3c8df1feda871ad10f"}},{"ruleId":"D2","level":"warning","message":{"text":"MDNS.build_replies (cognitive 39): MDNS.build_replies has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (10 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mdns.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a3703a35a55e186ae78630cff4dfc84ff5dabb6a03a7eef5042ed4b85ff5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._snap_reg (cognitive 39): Up2k._snap_reg has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 7, error handling 2 (6 pts), loops 1 (2 pts), ternaries 2 (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":"copyparty/up2k.py"},"region":{"startLine":5553}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c774b686b53407e1dd5740bf931fdaf2743f79a2ccd23c998825c98f91b7891"}},{"ruleId":"D2","level":"warning","message":{"text":"util._zmq_hook (cognitive 39): util._zmq_hook has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (26 pts), error handling 5 (8 pts), boolean chains 5 (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":"copyparty/util.py"},"region":{"startLine":4095}}}],"partialFingerprints":{"codehealthFindingId/v1":"5518bf07529ac4fa9c6f03495922249b790ca9661eb126b4b393bb206beb0568"}},{"ruleId":"D2","level":"warning","message":{"text":"md.init_toc (cognitive 39): md.init_toc has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 10 (19 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":"copyparty/web/md.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2849338cc56b5102a4256da6a9ee6e09794fe77fbd7efe9a539cb4dabdb3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSrv._qr (cognitive 38): TcpSrv._qr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (19 pts), ternaries 6 (8 pts), boolean chains 7, error handling 1 (2 pts), loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"59422566081da912d22d1a93165c37526633eb1e9ba25cb9b12066f6c6149004"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_tail (cognitive 37): HttpCli.tx_tail has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (28 pts), error handling 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5131}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b53c3b21bbd25bde196e9c382a28996d294e25e48b6af1585bba06fe8dbe59"}},{"ruleId":"D2","level":"warning","message":{"text":"QrCode._get_penalty_score (cognitive 37): QrCode._get_penalty_score has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 6 (9 pts), ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/stolen/qrcodegen.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486122ca8c20859b8f84ca982a7f724ba954594a66f16a309ea5cbaf6b1c96d"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._drop_lost (cognitive 37): Up2k._drop_lost has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 7 (11 pts), error handling 3 (9 pts) (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":"copyparty/up2k.py"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"312de6322e61b83928074349d434cea36e6b99a9b909890bba409bbcfa7954ae"}},{"ruleId":"D2","level":"warning","message":{"text":"util._fs_mvrm (cognitive 37): util._fs_mvrm has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"212a45933f75e18eadf26553a93a40bd1edbe92bba42f23259dfd3b9def77567"}},{"ruleId":"D2","level":"warning","message":{"text":"util.statdir (cognitive 37): util.statdir has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 3 (7 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (2 pts) (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":"copyparty/util.py"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec71659ed090b447b2e15c554967cf952d7f7a5247600a955ee55e9abd3dec1"}},{"ruleId":"D2","level":"warning","message":{"text":"util.runhook (cognitive 37): util.runhook has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 8, ternaries 1 (4 pts), loops 2 (3 pts), error handling 1 (2 pts) (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":"copyparty/util.py"},"region":{"startLine":4307}}}],"partialFingerprints":{"codehealthFindingId/v1":"917a4d87e05482382b6c32cd7345599c77d6b5fd2543323d856bd2cfc4a23c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"MDNS.run2 (cognitive 36): MDNS.run2 has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 3 (6 pts), error handling 2 (4 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mdns.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"142fc6e8d80494eb21c35ad55015636e6984fafa06c4f7e8833fe1eaacf8e1db"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.handle_chunks (cognitive 36): Up2k.handle_chunks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 6 (8 pts), error handling 1 (2 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":"copyparty/up2k.py"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6ae6614c668769258382def90a20c3b0db7779041202eb9bd53a126ef50828"}},{"ruleId":"D2","level":"warning","message":{"text":"Tftpd.__init__ (cognitive 35): Tftpd.__init__ has cognitive complexity 35 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 8 (10 pts), error handling 3 (7 pts), ternaries 2 (3 pts), boolean chains 2 (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":"copyparty/tftpd.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd217c8fcffe3b2d2a85cbd940afa6e46bc119b8d45f34c24f51d4f8635f756c"}},{"ruleId":"D2","level":"warning","message":{"text":"util.runcmd (cognitive 35): util.runcmd has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (22 pts), error handling 3 (7 pts), ternaries 4, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42ee545cba5fa13085390dbedafba86ea7eaccb16505eaeb2c0f1587512a5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"util.sortTable (cognitive 35): util.sortTable has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 5 (7 pts), ternaries 3 (5 pts), boolean chains 4, error handling 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":"copyparty/web/util.js"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"f115b23de54f8d2269bbc8366f07f293ef8db3eed53139d130729a37e25746f0"}},{"ruleId":"D2","level":"warning","message":{"text":"vis_exh (cognitive 35): vis_exh has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (20 pts), loops 5 (7 pts), boolean chains 3, error handling 3, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37c956ea96f6b29388821bb6fd25f693ba6d527b7586babea06930db9debe72"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 34): (anonymous) has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (11 pts), boolean chains 4, error handling 1 (nesting depth added 14). Most of this is not in the body itself: 7 of the 34 points are its own statements and the rest belongs to 4 function items inside it that branch (render, load_notation, try_render, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8425}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf74ebc5e3e0fdab614004d91f2a9ebb7417c3e1dd49c71eeca2e7129e531b3"}},{"ruleId":"D2","level":"warning","message":{"text":"SSH_Srv._check_auth_password (cognitive 33): SSH_Srv._check_auth_password has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, error handling 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/sftpd.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e788a19c77dfa0b73d3ac14a686fbafb52bbff7b6944505f92a86bac144fe9b6"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub.setup_db (cognitive 33): SvcHub.setup_db has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 6 (14 pts), boolean chains 1, loops 1, ternaries 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":"copyparty/svchub.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b9d3ed0750cc068bfc53e9fa41f0d56061ec86a9d6095eeb1c7a0c387608c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ThumbSrv.__init__ (cognitive 33): ThumbSrv.__init__ has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 5 (9 pts), boolean chains 7, error handling 1 (2 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3193ea5d96bdec46a87e5e1bfe16a8e62bf415476b0f5a2bc08f9292fbfcb12"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl._safe (cognitive 32): Ctl._safe has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (12 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf79536475ea834bf8442034a7c83be068c84f1ab270bf00b5e37ac9c3da151"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__.showlic (cognitive 32): __main__.showlic has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), error handling 3 (5 pts), loops 2 (4 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":"copyparty/__main__.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd91d586b45fac90ab3e7ee5d71dd3fbdbf881b78318c6b99c984e3108e04774"}},{"ruleId":"D2","level":"warning","message":{"text":"FtpAuth.validate_authentication (cognitive 32): FtpAuth.validate_authentication has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 4, error handling 1 (4 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edf2de5a44f811b0de2fa0e67dfda979fe54e35277ab66accff47564a892c80"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.send_headers (cognitive 32): HttpCli.send_headers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (8 pts), boolean chains 1, error handling 1, ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dd4fdbc13634053f073892a0762a549fcd05aced4c05b709466cd2023ba015"}},{"ruleId":"D2","level":"warning","message":{"text":"mtag.au_unpk (cognitive 32): mtag.au_unpk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee2d2e99696ebc6a9c4751e2c910a69f8e2878b008936a7fa180e9fcfc0e76f"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._check_env (cognitive 32): SvcHub._check_env has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (25 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":"copyparty/svchub.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9ef8f90aea14b790f816f557ace665730236c36325fff5c70236b775865152"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._e2ts_q (cognitive 32): Up2k._e2ts_q has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7052fc0344fde00ff0565430f17002be3cda9553cbca080677a72ce09bb87595"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl._safe (cognitive 32): Ctl._safe has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (12 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"2462e5a89f000dfb6bf742381f731d93ca5d05136d4bb1f63255c03a287dd4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::set_fsearch (cognitive 32): up2k_init::set_fsearch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 8 (12 pts), boolean chains 4, error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb244ec12507bd39e9168d441f0c4a47837b4065b82d1ef5337df52fd0d5fab"}},{"ruleId":"D2","level":"warning","message":{"text":"evau_error (cognitive 32): evau_error has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (8 pts), boolean chains 5, error handling 1 (3 pts), match/switch 1 (nesting depth added 11). Of this number, 22 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1739734f145ef14ce52fa67a36dbdb3a24c662ef302aa4d0ace271ebdf61b5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::onscroll2 (cognitive 32): (anonymous)::onscroll2 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 6, loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4db649b55cb8ebbdbf0aff3971c510971248a2f66ab0cdc74095602377fb1a"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.handshake (cognitive 31): u2c.handshake has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a6a37e6d558db75bd1ed8703b3a2155bf7210bb50051ac53e2c666a463eb70"}},{"ruleId":"D2","level":"warning","message":{"text":"MTag.get_mutagen (cognitive 31): MTag.get_mutagen has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 4 (7 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"984540f13147dbd26ebf8e5453ce1b2438a3711b36ba48fea478501ddc540143"}},{"ruleId":"D2","level":"warning","message":{"text":"MTag.get_bin (cognitive 31): MTag.get_bin has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (4 pts), error handling 2 (3 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":"copyparty/mtag.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"430526e184a59506ab91d93b694df1b4d194e0867dd1e8e950062402804823d5"}},{"ruleId":"D2","level":"warning","message":{"text":"MCast.setup_socket (cognitive 31): MCast.setup_socket has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 4 (8 pts), ternaries 3 (6 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/multicast.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82b745a60c40c920aff034dca0cacbe2c7278a4b64aa138f5b59b9f5943cb74"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.handshake (cognitive 31): u2c.handshake has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"791fd35d64d1de18994e5e04e76282e7d4ca1f6c1950771e9b4c441645b05eab"}},{"ruleId":"D2","level":"warning","message":{"text":"VFS.walk (cognitive 30): VFS.walk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 5 (8 pts), boolean chains 7 (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":"copyparty/authsrv.py"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2c0059dbae8f684e7b85649ffb366be7711481fadad6bb1cb8f75aae7c011"}},{"ruleId":"D2","level":"warning","message":{"text":"fsutil.ramdisk_chk (cognitive 30): fsutil.ramdisk_chk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, loops 3 (5 pts), ternaries 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/fsutil.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dcc90ca36bc92ddba5c51c021be4c96242f89e7d19add862e4d4dff392c1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"MultipartParser._read_header (cognitive 30): MultipartParser._read_header has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 3 (6 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba6e01ef2cada52e2a6715d8eed6d4eacffd833d985ae79e6b9c92aa5ad39c2"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::apply (cognitive 30): (anonymous)::apply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 10, ternaries 2 (4 pts), loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8c0b57e4d488653ef4df8e4e1b2435b3ba01f0179b3b8add64332027ca068f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::rename (cognitive 30): (anonymous)::rename has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (8 pts), ternaries 2 (4 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":"copyparty/web/browser.js"},"region":{"startLine":4233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf56dd3664019903bcb998595d76264a4b5c26cfb9fd5d138f90007418802e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"FtpFs.open (cognitive 29): FtpFs.open has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 7, error handling 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"641ba7a3f22f62cfccc5adfdb89bd282c936bcedebb151c47ab5fbfbac8150c4"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._log_enabled (cognitive 29): SvcHub._log_enabled has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (22 pts), error handling 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8779b1b777ee8ba240b52f1ae98d868e144f3aa87e4f125764d183b60e15123"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::uptoast (cognitive 29): up2k_init::uptoast has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 6 (11 pts), boolean chains 4, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb9d21e5df4c29a7e0fbbcb24897dc40087c5b1ce928377e68fe2e9b37400f6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::show (cognitive 29): (anonymous)::show has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, ternaries 2 (6 pts) (nesting depth added 11). 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":"copyparty/web/browser.js"},"region":{"startLine":9884}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2965c7ccd91a35c4393e08bc1cbd7165764f2173ca7c683e03dde4bdcb3ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSrv.run (cognitive 28): TcpSrv.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 2 (4 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbec124d3f3ae2d17045736338a0ba934c39ba0b3ce5962c9d9bd7600c4a411"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._check_lifetimes (cognitive 28): Up2k._check_lifetimes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 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":"copyparty/up2k.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f0153b24dd88111fbf5d6a7fec32185a280f4a6436af46058cfd9845748638"}},{"ruleId":"D2","level":"warning","message":{"text":"MultipartParser._read_data (cognitive 28): MultipartParser._read_data has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), error handling 2 (5 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":"copyparty/util.py"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b9d813d5942c6aa147c142a6f942ef2215fb4d00ca9372b5a12eba4cd5b9de"}},{"ruleId":"D2","level":"warning","message":{"text":"md.copydom (cognitive 28): md.copydom has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 4 (5 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f685a0adecef06a8868c6c2fbdf07b268af40108ed958d72651d98b9985cf81"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::announce (cognitive 28): (anonymous)::announce has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (9 pts), ternaries 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18f915d4bd7a2c1bda13f0b5c00a368fb1e919a9b78bb3a72b9b1fd69c94180"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::rendertree (cognitive 28): (anonymous)::rendertree has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7283}}}],"partialFingerprints":{"codehealthFindingId/v1":"997cbd79df06357eafe36f7b7764ee54cd41f6e7f37e0a47876761072ce93a18"}},{"ruleId":"D2","level":"warning","message":{"text":"sutil.gfilter2 (cognitive 27): sutil.gfilter2 has cognitive complexity 27 (threshold 15). Drivers by points: error handling 3 (11 pts), loops 4 (7 pts), if/else 2 (6 pts), ternaries 1 (2 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":"copyparty/sutil.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41da60f5dcef1dd0de7d6659cccf8e9a6fd05d89798b79b66a4aa869820e376"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSrv.detect_interfaces (cognitive 27): TcpSrv.detect_interfaces has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7168b35245006054195f3ab360f8890275e724931d086d63c4f7ebc6d3735ca"}},{"ruleId":"D2","level":"warning","message":{"text":"sfx.encode (cognitive 27): sfx.encode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sfx.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2126cdd7d8fb9e33ef0dd40fb6db91a7518852d69d7590c7adb805c39f09074a"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::gotallfiles (cognitive 27): up2k_init::gotallfiles has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 6 (10 pts), boolean chains 4 (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":"copyparty/web/up2k.js"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e79dadc4efd1f624f3ceb3248293c6ebd21f2f425692f7fe140a55b2e698ee"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::render (cognitive 27): (anonymous)::render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 5 (9 pts), loops 3 (5 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":"copyparty/web/browser.js"},"region":{"startLine":6741}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fbd6dd19edaddfb0543d6876521711eafe97a1c01874c7dcc9e1c52364349c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::seltgl (cognitive 27): (anonymous)::seltgl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (7 pts), boolean chains 3 (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":"copyparty/web/browser.js"},"region":{"startLine":8850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee5038dd6fa830fce93f039308520d81e807f21df0c0f373cd77e69506f8d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.walkdirs (cognitive 26): u2c.walkdirs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"823ea97b3abe7e23a1409ed66f56408075c89cd263d22585f46724dfcd6031f5"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_wopi (cognitive 26): HttpCli.tx_wopi has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 2 (4 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2075b3b2a0d402ffec4371a5db86f68264f3bb7f8d1125fcdac03a81f4b9c616"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub.cb_httpsrv_up (cognitive 26): SvcHub.cb_httpsrv_up has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ecc4277ef0125f5e2464860126b0bdde45d13b70072dd817b96154f88ffcb5"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._build_file_index (cognitive 26): Up2k._build_file_index has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 10, error handling 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"copyparty/up2k.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a185bdfd57a8cf5f0eba37ddaf890d8e92e3945d95cb2ddbdb911c482bdb07e"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.handle_cp (cognitive 26): Up2k.handle_cp has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (8 pts), boolean chains 4, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4522}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba94ed106703e9b4e0e6a2416a957f64e27c7c05587fd1cd62e0425e53a9403"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.walkdirs (cognitive 26): u2c.walkdirs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbe81beb19af970c7555e78aafefcebd7f2db1b18171a5f47fa3923ef0392c3"}},{"ruleId":"D2","level":"warning","message":{"text":"uncomment.uncomment (cognitive 26): uncomment.uncomment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 8, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/uncomment.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9695e07e6c8fd4bf00dccbd12cc3d70e8b75f296becdaf7d106afd61854e9a8"}},{"ruleId":"D2","level":"warning","message":{"text":"U2pvis::changecard (cognitive 26): U2pvis::changecard has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 pts), ternaries 5, 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":"copyparty/web/up2k.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"c894784ed5cc0be4571e2d93852086957b07c568bfe1771dcce822489ae10d50"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::load (cognitive 26): (anonymous)::load has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7935a1c44f77a1506805eb2ec1483173adbec6fa2bf1c591cf5b58fabfca3e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbtool.main (cognitive 25): dbtool.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3, boolean chains 2, 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":"bin/dbtool.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"915f0ce72ef0c84097d1c16de70534fb32eb2f052464bce5ab9d946abfad8519"}},{"ruleId":"D2","level":"warning","message":{"text":"yt-ipr.freg_conv (cognitive 25): yt-ipr.freg_conv has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), error handling 3 (4 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":"bin/mtag/yt-ipr.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb974e97a7c8d9e56c9ad3035c0f775deb6a092a22b04129e03adf1f8e6f18bf"}},{"ruleId":"D2","level":"warning","message":{"text":"cert._gen_srv (cognitive 25): cert._gen_srv has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 3 (5 pts), boolean chains 2, error handling 2, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/cert.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"640ddc68514e04244e2ebe6577676fe2f86595755039ce2461117f8969816085"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli._cors (cognitive 25): HttpCli._cors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, ternaries 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f274ab7a8bfdd7acc38efb64b21fe478f88aad2448ede61b7cacd21a784480"}},{"ruleId":"D2","level":"warning","message":{"text":"MTag.__init__ (cognitive 25): MTag.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (5 pts), boolean chains 4, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f465663fbc9283deb6fe0d87820ad229f2d594ec684eb0be938e2e4eee39a1"}},{"ruleId":"D2","level":"warning","message":{"text":"SFTP_Srv._list_folder (cognitive 25): SFTP_Srv._list_folder has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, error handling 2 (3 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":"copyparty/sftpd.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc4fe4f27fa7fc4e471702b2a8bd38a426f5b9d11f5714aac8e17e7da0710cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SMB.__init__ (cognitive 25): SMB.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (7 pts), error handling 4 (6 pts), if/else 5 (6 pts), loops 5 (6 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/smbd.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae7087e0c08ff26521cada5708be28edbbee4a1b96951024828a0b9297c7109"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub.setup_share_db (cognitive 25): SvcHub.setup_share_db has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 4 (8 pts), error handling 3, boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1888302022421fee972617e36e7c2d761f92c638c444dad3fa3e5720df79a8"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::wexec_hash::onmsg (cognitive 25): up2k_init::wexec_hash::onmsg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac2b214a9a794c494304ec89209fd28fabda5678dcd1bd8d7d596b7a9194883"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::init_ac2 (cognitive 25): (anonymous)::init_ac2 has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9, ternaries 4, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16ed6c2eb82caff9c914d9ff1d539669f6c2fd8cd0e29af82048da5908ba02d"}},{"ruleId":"D2","level":"warning","message":{"text":"dbtool.copy_mtp (cognitive 24): dbtool.copy_mtp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/dbtool.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edccf39c46f6c6d310c946c2014e482a0bb5c557e884b400fdc211832ca415c"}},{"ruleId":"D2","level":"warning","message":{"text":"cksum.main (cognitive 24): cksum.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 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":"bin/mtag/cksum.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de7ff26660062ed55934dfaded4852eb8805ec4af3669c2d9829b5a594a2314"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl.uploader (cognitive 24): Ctl.uploader has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa1e27e38cdf283783e37458811b12327851d0d39f592825f80134728659d34"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_ls (cognitive 24): HttpCli.tx_ls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (9 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6971}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b9f12dae0aacfde6a2189f95be1eca20e8fa52ce8c26b6fda17060a881d61f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tftpd._open (cognitive 24): Tftpd._open has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tftpd.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfe278e917144741a5164a39eea499c429d8f1b142876a0f86568af2dd64975"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.get_unfinished_by_user (cognitive 24): Up2k.get_unfinished_by_user has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c94f944e2eb70c9ae49290b9318f2b67d8185ee4ec17fd6321ad339f3211222"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._forget_file (cognitive 24): Up2k._forget_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":5121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e382fc122f788bd8a63c18b1c58c2acfc9647157f7c52d8fcbc255efd435c"}},{"ruleId":"D2","level":"warning","message":{"text":"util.read_socket_chunked (cognitive 24): util.read_socket_chunked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 2 (5 pts), loops 3 (5 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":"copyparty/util.py"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06ef191bdde9f1617fedae35a1172ad70066aeec157d1e631175733539c0d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctl.uploader (cognitive 24): Ctl.uploader has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f7c21a0fb5b4ae062f9a14587ce12ebfad09b96ce604d05dc5797794888bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"jcp2 (cognitive 24): jcp2 has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (18 pts), loops 2 (4 pts), if/else 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"043be15b5dd0d42c5bdef62f65c57bd4fea508cfa5928a906f2ab71fc648f9c3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::drawpos (cognitive 24): (anonymous)::drawpos has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f3311a87a3a47e18fa9112d84f5f7b2099ff0ba4e31af1b97f0525d2f90da5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::draw (cognitive 24): (anonymous)::draw has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (21 pts), if/else 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"713317e304556610b65f55eaee51f3c49f75b19028d7212cc8040bcf74f8f290"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::gclick (cognitive 24): (anonymous)::gclick has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (12 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5710}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dab22482f6fb255b7218122cc5d2a2cc61207d69e272e714d972ca6508fe342"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 24): (anonymous) has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (9 pts), ternaries 2 (8 pts), if/else 3 (5 pts), error handling 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 9128). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9633d255513214b4c7e434d1e9f19d7a5a4466d2f5cef9460ae82d78db7736"}},{"ruleId":"D2","level":"warning","message":{"text":"show_md (cognitive 24): show_md has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 3 (4 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eb947eab0674f53b20ea3c9c3182110d3e94cf422df18234e5cb79459248cf"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::loadImage (cognitive 24): (anonymous)::loadImage has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, if/else 8, ternaries 5 (6 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97e102a76290978406de6f5cdadd42cface03e621e9ebc31dfda309c1b554be"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.parse_nginx (cognitive 23): Gateway.parse_nginx has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (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. This shape REPEATS in the file: one other method here (Gateway.parse_iis) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7109ec7b725fbdcb269822b88f968c4baa9778828678ea75bfaeecd840e9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.parse_iis (cognitive 23): Gateway.parse_iis has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (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. This shape REPEATS in the file: one other method here (Gateway.parse_nginx) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2ca990d46fe33909238082493c5d62c259b532e2cc1a16a4958f16c2bcb0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"bos.utime_c (cognitive 23): bos.utime_c has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/bos/bos.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00d3bc212845e6e67eef2029f00c7f887f44ee6fd9cd25160c1fd9d37534063"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_search (cognitive 23): HttpCli.handle_search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ac4e0213f7cee6b462f86ee804a27720d7ae8f374d4112de72fc9592db7d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.get_pwd_cookie (cognitive 23): HttpCli.get_pwd_cookie has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":3701}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bef0c31b037cb9bcee796edc61e5dec4aff1b7e81fc67606446dcb79081503"}},{"ruleId":"D2","level":"warning","message":{"text":"Ico.get (cognitive 23): Ico.get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 2 (6 pts), ternaries 3 (5 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ico.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b70c1ba5137ffa8f7b763ca512957a8a8db693734155f0022764f43490ea91c"}},{"ruleId":"D2","level":"warning","message":{"text":"SMB._open (cognitive 23): SMB._open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/smbd.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abe7a7a8e509ab6e0df4246c8dfba8d16a09071916d378259b39bd3d980501b"}},{"ruleId":"D2","level":"warning","message":{"text":"SSDPd.run2 (cognitive 23): SSDPd.run2 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 2 (4 pts), loops 3 (4 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":"copyparty/ssdp.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c543f2b23ab7eeebd3ff4d2e5920821e381e49d76449c1aa6cacbba19c217a2"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._feature_test (cognitive 23): SvcHub._feature_test has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (8 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"4931b93425cc83a70c14503c0c540fd8d1c9a1e41303fdc16d6bbb789682e5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._setup_logfile (cognitive 23): SvcHub._setup_logfile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a631f3045c1309367c795e00225eb8a2bc1b53668c347a2d625e06ace75e5b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._tag_thr (cognitive 23): Up2k._tag_thr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 1 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7f21fd12cc0af5891f742ec5205d22d0b2dca8d9f84a8f61081cb3825683b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.parse_nginx (cognitive 23): Gateway.parse_nginx has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (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. This shape REPEATS in the file: one other method here (Gateway.parse_iis) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4891cb68235f765213ad59feb9a86dfa9eef22444d5270fffc52edc2a0f47529"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.parse_iis (cognitive 23): Gateway.parse_iis has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (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. This shape REPEATS in the file: one other method here (Gateway.parse_nginx) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd0d43e626e5fd2f80f62710280e34e18ae88f36c3bf03c2cb05002784d9db"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k.U2pvis (cognitive 23): up2k.U2pvis has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (7 pts), loops 4 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3c3966ee607cc29cc2cf5e73bb4a428b67861cb00c9ec87e347f587accbbf8"}},{"ruleId":"D2","level":"warning","message":{"text":"util.xhrchk (cognitive 23): util.xhrchk has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (11 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0940982e00527626c0d0c99f83917b343e583fc5520eab3e07b14846528db272"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::render (cognitive 23): (anonymous)::render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8db337e067c30a1ac8f0a55a493612120e778c38740de75e09d98e8873a2c1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parsetree (cognitive 23): (anonymous)::parsetree has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 5 (7 pts), loops 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":"copyparty/web/browser.js"},"region":{"startLine":7923}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2797511de2cf37fae26ff05655e9f80253303a0ff2ed25fba550fe3b25a338"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.upload (cognitive 22): u2c.upload has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b206443178c185adcdf5f81a1b80cdaebce57cb0466b93ce7dc47314c8be154"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__.run_argparse (cognitive 22): __main__.run_argparse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (6 pts), loops 3 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/__main__.py"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5896c4ec121f867a6baaddf4e5a4a796a3f10404bb6584f8deeee5c77a5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"VFS.zipgen (cognitive 22): VFS.zipgen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), ternaries 2 (4 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":"copyparty/authsrv.py"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"541a15687cb77eb49328a9dcc91980e153df8127cfef026f376f92ba8b52bb01"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv.setup_chpw (cognitive 22): AuthSrv.setup_chpw has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 3, ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d8ce7ab75732d8ffae389accbe0d6232d005318af5ba1cd86f86a3a5f45436"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.reply (cognitive 22): HttpCli.reply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196d4b81f06c8a50c20a5ed4d076b0cacf030864833de045dd0690c2fb70e62"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_new_md (cognitive 22): HttpCli.handle_new_md has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":3813}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e972cb2bbcc91c96affb137fe56a318b7dcb21dd2b8a0355d08b2995ea7cc34"}},{"ruleId":"D2","level":"warning","message":{"text":"MParser.__init__ (cognitive 22): MParser.__init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2108729d87f3af3e0a2ab27f220ca7a953d5e52f010a63f231a9568b200b41c"}},{"ruleId":"D2","level":"warning","message":{"text":"qrkode.qr2txt (cognitive 22): qrkode.qr2txt has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (10 pts), ternaries 2 (8 pts), if/else 3, 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":"copyparty/qrkode.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1c67b0f6ccaae51f573d9b18ec459c9997f4aa3bc84ed5feb1537aa0cdecf6"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub.run (cognitive 22): SvcHub.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (6 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf6f79bb323202a2feae86411684e674962394613ba1552f7527b31b37c9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub.shutdown (cognitive 22): SvcHub.shutdown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (3 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"74416b0871b0ef052460cd9f286f5583cb627bc2cb9b499df8338beadccd37a7"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamZip.gen (cognitive 22): StreamZip.gen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts), error handling 2 (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":"copyparty/szip.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba494a7e90a7e08fdb526bae61a7bd04aaa809d46c359a4b5c94ddcbccbb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSrv._set_wintitle (cognitive 22): TcpSrv._set_wintitle has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3f22b118c34b3d0fcb853033f7bf9b8fd371444cf6f5fe2c9926a949ad0499"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._confirm_chunks (cognitive 22): Up2k._confirm_chunks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), error handling 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":3974}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f11c9957410e3255b5ea90d34a3e6ed599019f8b62c9704d869e3be4020751"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.upload (cognitive 22): u2c.upload has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"9058fa513259521e64243cdd7281f8172a1face6b718d788ec80180ba913e673"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.langtest2 (cognitive 22): browser.langtest2 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"51960497115d58365c00dce92c27bd20752359c20d5686085091e3190446fc9c"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_flagbus (cognitive 22): up2k_flagbus has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 5 (nesting depth added 2). Most of this is not in the body itself: 0 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (onmessage, take, tx, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32bfdbaf0b7405b00620a999e33f5c99781f00c17f8ae7db92075bdfa2b46ad"}},{"ruleId":"D2","level":"warning","message":{"text":"goto (cognitive 22): goto has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f5d0fa91b9fc9aede06b2ab79dc4fe51e405e0f31b5953f33982a11e1bd232"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::load::unpost_load_cb (cognitive 22): (anonymous)::load::unpost_load_cb has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fce144f99e01e7b03ab1e41af97d023589733e3b439bd7989ddc9d5c670692"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.parse_cpp (cognitive 21): Gateway.parse_cpp has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4710b7e806fe61f588eafc7e9eef01690fc2496cab34ab0abc8a7feba732e85"}},{"ruleId":"D2","level":"warning","message":{"text":"MDNS.build_svcs (cognitive 21): MDNS.build_svcs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 5, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mdns.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f56fee3800e4f451aecd4379a6c8c2d2efd3d589f69303dbb31da53364b2385"}},{"ruleId":"D2","level":"warning","message":{"text":"Sftpd.__init__ (cognitive 21): Sftpd.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (5 pts), loops 3, 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":"copyparty/sftpd.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f16ddcc018b31073928e6b3dc97af709d9e9f20a51b45c1108076275cb8054"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._log_disabled (cognitive 21): SvcHub._log_disabled has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 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":"copyparty/svchub.py"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fcc203527d2e56c3173743dcd22106112cbc0adab5e31ae8dd2e7e71d38c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._log_en_f2 (cognitive 21): SvcHub._log_en_f2 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 3 (4 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34bfe664148cca2fa6baefbdb612cd2e8f6cca69715f84ded7d1086d45fd9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Tftpd._ls (cognitive 21): Tftpd._ls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"copyparty/tftpd.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0412b30fc14376b13807550c1fc70df16a93b23393f05603f7c76f9e4c9e508"}},{"ruleId":"D2","level":"warning","message":{"text":"util.visual_length (cognitive 21): util.visual_length has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"000a41199bb8bc59df2e28900179f094b454eba4193724121b30c7cd9a99cc78"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.parse_cpp (cognitive 21): Gateway.parse_cpp has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce101036b06978fd7e1f5603a50c11be4b4f3d6e5f7ba467e6d7d9f3682956"}},{"ruleId":"D2","level":"warning","message":{"text":"rave.raver (cognitive 21): rave.raver has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/rave.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed57b63e355ff858459602364a05a359e77018f222e0cfcb9bbe4737a768fccc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::raver (cognitive 21): (anonymous)::raver has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/rave.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b854efc0776bbcb217e16d41572c05040069ce2c6c42665f3270a982236635ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.parse_html (cognitive 20): Gateway.parse_html has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), 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":"bin/partyfuse-streaming.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbdeff77dbbfd4946b61673886bf677bee89f56fc00766be425146cd4af2681"}},{"ruleId":"D2","level":"warning","message":{"text":"HCli.req (cognitive 20): HCli.req has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (7 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"bin/u2c.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1d36cc3b4ea203bccfac63f33ed1ec28395ad89117433a71e53f5f4fd4b5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__.args_from_cfg (cognitive 20): __main__.args_from_cfg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), ternaries 1 (3 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":"copyparty/__main__.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd771c545138110d02b4b7c414adccb3d75b2bd3f16715c4d8d6125070b924f6"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv._read_vol_str (cognitive 20): AuthSrv._read_vol_str has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 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":"copyparty/authsrv.py"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0a126b644d910246e3e40c6c08cedd5cb22ccfb8b3e0e708877c7236e924d9"}},{"ruleId":"D2","level":"warning","message":{"text":"FtpFs.v2a (cognitive 20): FtpFs.v2a has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2009718138bdf8443eef5797d4a375104cfc9f4637588190b165147883ff5afa"}},{"ruleId":"D2","level":"warning","message":{"text":"FtpFs.listdir (cognitive 20): FtpFs.listdir has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb92b79ccd7d6c11fd63f09b37d1ce7491af1576ede2ec529d8c031b0f9f099"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_svcs (cognitive 20): HttpCli.tx_svcs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 4, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":5727}}}],"partialFingerprints":{"codehealthFindingId/v1":"db288c817843bf0547652d612377a520b9c6816fb33e43aa37615b37dd4d32c8"}},{"ruleId":"D2","level":"warning","message":{"text":"MDNS.send_probes (cognitive 20): MDNS.send_probes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), error handling 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mdns.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4174867cb67ab0dbb3943f3e9e010e02fe32f99dacca82b6a248fe0438f5d0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Tftpd._start (cognitive 20): Tftpd._start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 3 (8 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tftpd.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5522d3a65523f271d3ed8d57089171bfd6a98a337c1c25425cde502d3a08a0b5"}},{"ruleId":"D2","level":"warning","message":{"text":"ThumbSrv.run_extractor (cognitive 20): ThumbSrv.run_extractor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, error handling 2, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7f17b0aef389086a09e9841e4c42e6b656278f5c5cf02c9229c9a9770b02ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ThumbSrv.conv_spec (cognitive 20): ThumbSrv.conv_spec has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3, boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7394d7ebb502ee2f53808dac7f5dfe3d6f1a2562498d61f8188adc94e1c93177"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._build_tags_index_2 (cognitive 20): Up2k._build_tags_index_2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac483c34ba60f926f70d50947a198d281fc1762fbe22705c0d3a206199cf437e"}},{"ruleId":"D2","level":"warning","message":{"text":"util.killtree (cognitive 20): util.killtree has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (7 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3734}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf87d6d846b5e9c62b802562f905a7388d7174cadd01aa87435b9bd3726ff43"}},{"ruleId":"D2","level":"warning","message":{"text":"util.runihook (cognitive 20): util.runihook has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"18adf873680874c5e99f9306e5bf1e0c6519e4c5cce602282fc302245ef9be9d"}},{"ruleId":"D2","level":"warning","message":{"text":"HCli.req (cognitive 20): HCli.req has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (7 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"copyparty/web/a/u2c.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2a112db8d7bcdc457925c5293a7047b403828111f379ff278dcdce584d177f"}},{"ruleId":"D2","level":"warning","message":{"text":"sfx.unpack (cognitive 20): sfx.unpack has cognitive complexity 20 (threshold 15). Drivers by points: error handling 7 (8 pts), if/else 7 (8 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sfx.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3fa98d90f60af98c0cc3b4ab6b11795a3b12ac33903744240b1009a01ef449"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::onovercmn (cognitive 20): up2k_init::onovercmn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40e1c5f259a6181bd19ff85bce13c914c1860884a745537024874a7e0e76ebf"}},{"ruleId":"D2","level":"warning","message":{"text":"Gateway.getconn_winfsp (cognitive 19): Gateway.getconn_winfsp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse-streaming.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d5d53296c7a8a4e1ea52264e7fb4d59b1b42d1f4454e2fdc56f3133e5b025a"}},{"ruleId":"D2","level":"warning","message":{"text":"partyjournal.main (cognitive 19): partyjournal.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 1 (3 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyjournal.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1513b4a10f1afe5bacabd8a785f7c39db60d69b7a387c67755d52c9b57889c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.get_hashlist_f (cognitive 19): u2c.get_hashlist_f has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/u2c.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b294984c851d83dd61a9ee3bc89d8fc375d5b4241815590123bf11db5702895"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv.setup_pwhash (cognitive 19): AuthSrv.setup_pwhash has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":3646}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43dcec6b5ca665851d1b252259471a76a84e221d4e0122efeb36ab54bd50fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.handle_eshare (cognitive 19): HttpCli.handle_eshare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6635}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75a25b8c096d848236486b80a3993d22375f0774d99e759c2377b0837d61402"}},{"ruleId":"D2","level":"warning","message":{"text":"MCast.map_client (cognitive 19): MCast.map_client has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, ternaries 2, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/multicast.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"691a98424098ecfda9eedf22a330bde704992f4a9cbf182f76afcc9184489700"}},{"ruleId":"D2","level":"warning","message":{"text":"SFTP_Srv.v2a (cognitive 19): SFTP_Srv.v2a has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/sftpd.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"402eb7bb7f1e73056c97855d7e34689c6cb3607cedf380059700a19d9bf69d24"}},{"ruleId":"D2","level":"warning","message":{"text":"surrogateescape.encodefilename (cognitive 19): surrogateescape.encodefilename has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/stolen/surrogateescape.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bcd7030932bf936d8cb5aa176cfc0c16f387042c5ebce859f55917bd4eb26f"}},{"ruleId":"D2","level":"warning","message":{"text":"NetMap.__init__ (cognitive 19): NetMap.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (5 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":"copyparty/util.py"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6c0108a1570e6da982f154e1f519a8282f3e2ef1e6bc1330a9dc9a688cec7b"}},{"ruleId":"D2","level":"warning","message":{"text":"u2c.get_hashlist_f (cognitive 19): u2c.get_hashlist_f has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/u2c.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"9205066dbe4c9b31af4a9d7fa8b347827eca4ce397604b5fc352b6c1c17d6cee"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.render_m3u (cognitive 19): browser.render_m3u has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6864}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdcedcead1f7c3d8d28739622cb57838b5ca1057a1037470ed4e1a070795b5b"}},{"ruleId":"D2","level":"warning","message":{"text":"util.linksplit (cognitive 19): util.linksplit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62472c753334db5cb2168c0d986bde08c8b7f8d7e589fa7ca1c15407896e22b"}},{"ruleId":"D2","level":"warning","message":{"text":"util.humansize_fuzzy (cognitive 19): util.humansize_fuzzy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5a0137a4715b72f1f67fedd0bbf46e4610b570031b04f60142dc0b082e3cae"}},{"ruleId":"D2","level":"warning","message":{"text":"showsort (cognitive 19): showsort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 5 (7 pts), loops 3, 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":"copyparty/web/util.js"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a114aaae9b815efb5a2b0da9e065ec8696fe83c0cc03d69c11c2485860f04587"}},{"ruleId":"D2","level":"warning","message":{"text":"U2pvis::bzw (cognitive 19): U2pvis::bzw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07ffb2ff881f324c915c891dda2ff9b8ac2399cc3ff35472ce38373a698128c"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::read_dirs (cognitive 19): up2k_init::read_dirs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eaaedb3db6d9c361fdd6c5445f0b442cafa275e2c26d5227d14bfc6abca661"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::onclick (cognitive 19): (anonymous)::onclick has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (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":"copyparty/web/browser.js"},"region":{"startLine":9572}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a464cda616f8caa9e4e3d5e7decd723d4857f3375bc9d42bb8d06d76bfc50"}},{"ruleId":"D2","level":"warning","message":{"text":"unforget.main (cognitive 18): unforget.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/unforget.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91f664d4c179ce695de96c71c8e5a6bd4deae822d6a19d4e31243f6dbfa2cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"VFS.check_landmarks (cognitive 18): VFS.check_landmarks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 1 (2 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":"copyparty/authsrv.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"9609e58324fb61c7cda6551a9b9c6f5e068530d1884128e5f1e694b607f180b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k.get_state (cognitive 18): Up2k.get_state has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), ternaries 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b01b8efbfb62cf32cdd9752b49895082191b9f335535dddd1b46f15a8f3f05"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._finish_upload (cognitive 18): Up2k._finish_upload has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (3 pts), boolean chains 2, error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a710e0a545436109d3a5dca1403f393f36421702e170bf2c95340aa6f044eac"}},{"ruleId":"D2","level":"warning","message":{"text":"util.alltrace (cognitive 18): util.alltrace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), ternaries 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":"copyparty/util.py"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67b195bff30e68db06d71077e8c8e131e78796db0d1898135f0a8be3531cd67"}},{"ruleId":"D2","level":"warning","message":{"text":"util.sendfile_kern (cognitive 18): util.sendfile_kern has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (4 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":"copyparty/util.py"},"region":{"startLine":3484}}}],"partialFingerprints":{"codehealthFindingId/v1":"10db6b94ef5f168189a35129c2cb67eceeff65745f2863498167d7144654acfd"}},{"ruleId":"D2","level":"warning","message":{"text":"a.uh2 (cognitive 18): a.uh2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/strip_hints/a.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3c4fcc399df3a82b012d09f4bd804351e41dc09a2b74ec00518b0d566a0693"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7 (nesting depth added 1). Most of this is not in the body itself: 0 of the 18 points are its own statements and the rest belongs to 9 function items inside it that branch (show, scrollchk, hide, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5dc7c443eba3661a80fd09df841f9a7dcefb127dd6039533d7c124720831c6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::onkey (cognitive 18): (anonymous)::onkey has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (6 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ce7eb3e125c1e0835d8d3d6d678191170a2d7a7b6d9b2264d6073f13eeb68c"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::exec_hash::segm_next (cognitive 18): up2k_init::exec_hash::segm_next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9fb3087363e23dc784583927103397bb8c4e1e51d70ade9e6735a3157bf5a3"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::upload_sub::orz (cognitive 18): up2k_init::upload_sub::orz has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc9fbdf54e40c946b14ccc1b2e1974900cf19e062dec0945f9c69e9c8023f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::render (cognitive 18): (anonymous)::render has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 3 (4 pts), error handling 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3958}}}],"partialFingerprints":{"codehealthFindingId/v1":"093d594c8ca191ee8016c104d2bff26caa10b523a6351c4537c987acbb107c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::paste (cognitive 18): (anonymous)::paste has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 5 (7 pts), ternaries 2 (4 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":"copyparty/web/browser.js"},"region":{"startLine":4823}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9d5c8544d502d1ccdbbe1f7eb9c6193ce4a9eb4eea33e2dc5ec1d6270c851a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::detectSilence (cognitive 18): (anonymous)::detectSilence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":10242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7114a1e2150b3087aac930f2d4cf1d67e1cf9d80fed624839c2cab50651ede88"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::show (cognitive 18): (anonymous)::show has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 4, ternaries 2 (4 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"31828aa600b6474f2cda0c22c64927fc11f75c121f2d5952f19e5cbc1df3a26e"}},{"ruleId":"D2","level":"warning","message":{"text":"CPPF.read (cognitive 17): CPPF.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse-streaming.py"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecab2d2f265d5e3c73dae263080e209299c9f708f29a1f019d97db39b1e2e62"}},{"ruleId":"D2","level":"warning","message":{"text":"CPPF.read (cognitive 17): CPPF.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"58687519ca86b4a9b40717658fe46cde541b624a7df189ad696cc6911c1f9690"}},{"ruleId":"D2","level":"warning","message":{"text":"partyfuse.main (cognitive 17): partyfuse.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdfaf2afde87503d9c73c88ee205237d3bad98763c6f84f5d207e0859291924"}},{"ruleId":"D2","level":"warning","message":{"text":"VFS._canonical_shr (cognitive 17): VFS._canonical_shr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, 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":"copyparty/authsrv.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"982ffcce7d638f26c37e64737cd26cfb996e93bc551ad5a79c3274f99c404223"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpSrv.__init__ (cognitive 17): HttpSrv.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpsrv.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e4b6e23750fba86d333aef422c6106f63ff2e6abe39cfbb3fbad323bcd62e5"}},{"ruleId":"D2","level":"warning","message":{"text":"MTag._get_xattr (cognitive 17): MTag._get_xattr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 2 (5 pts), loops 2 (4 pts), ternaries 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":"copyparty/mtag.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1984b776af05d78fb1e09334f50acde366c506c5b146f251d1f2ac28babd3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"dns._format_ipv6 (cognitive 17): dns._format_ipv6 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/stolen/dnslib/dns.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"c184516367cf6ab94067cd519bcfe2464004ecbe3cef916c375cc692dcddcb84"}},{"ruleId":"D2","level":"warning","message":{"text":"QrCode._draw_codewords (cognitive 17): QrCode._draw_codewords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), ternaries 1 (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":"copyparty/stolen/qrcodegen.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8d53f46073fb52f1e3d32a82f037b8444320052d341da053555af1da280e47"}},{"ruleId":"D2","level":"warning","message":{"text":"SvcHub._sticky_qr (cognitive 17): SvcHub._sticky_qr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1b3bf02392b22df8b495b380eb750e28084f44a342a195ec587ffae1af1c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Up2k._untaken (cognitive 17): Up2k._untaken has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"132e4e70558fe464d2e131c09fc06dbad9f0ef3434dd947cdb61eca6f7713330"}},{"ruleId":"D2","level":"warning","message":{"text":"util.stackmon (cognitive 17): util.stackmon has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2f0ca46c03f3e3aeffff196d97b2172c6d96721adb18aa2ad47dcaed29bebd"}},{"ruleId":"D2","level":"warning","message":{"text":"util.build_netmap (cognitive 17): util.build_netmap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"790d85b76a731aa7689d66e95dac6df6f647cfca4ad2fcbfa419598c3d8f9869"}},{"ruleId":"D2","level":"warning","message":{"text":"CPPF.read (cognitive 17): CPPF.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d138ba6a389486b93e971b811d912e859fef0ea304cbb42753908f428f9ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"partyfuse.main (cognitive 17): partyfuse.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69f0dddba386ec9f7b4356be1caab997cb856e210bacdb89984e4bd2e3ee27"}},{"ruleId":"D2","level":"warning","message":{"text":"md2.genmapq (cognitive 17): md2.genmapq has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (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":"copyparty/web/md2.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8503cf73c8bce2de411c1b650a4134ce9fd355dae06f07b94134ffe4a995f8eb"}},{"ruleId":"D2","level":"warning","message":{"text":"up2k_init::exec_handshake (cognitive 17): up2k_init::exec_handshake has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb3627faf5a1503b2ca9c4cd6c8f5cadd7fd9c84ca98af6f3a9c8ad849152a7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 2 (nesting depth added 2). Most of this is not in the body itself: 0 of the 17 points are its own statements and the rest belongs to 7 function items inside it that branch (diff, push, apply, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5650957e36251b5aa85575e0adafc1c8b9cedf8df1c5f39e84516cef1db3cba"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::share (cognitive 17): (anonymous)::share has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4044}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0622a6b2651cb0ea787d49e656144288d051aec5f22adc2599a32325f64fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::reload_tree (cognitive 17): (anonymous)::reload_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (5 pts), ternaries 3 (5 pts), boolean chains 3, loops 3, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3aa3f29ef3c48e170225759cc0db36bc0e658b53cd658cb9c1875b4a4941e9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::unpost_delete_cb (cognitive 17): (anonymous)::unpost_delete_cb has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), loops 3 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c013936d10bd54248dafe0603d8423c4f75e009151700554201bf9eb81d4c5f3"}},{"ruleId":"D2","level":"warning","message":{"text":"onclick (cognitive 17): onclick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9710}}}],"partialFingerprints":{"codehealthFindingId/v1":"3291f2fc6fe6e5e624a3dd29b0fdc8bd8d80bda7a75302e0cc54e89badefbc07"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 1, ternaries 1. Most of this is not in the body itself: 0 of the 17 points are its own statements and the rest belongs to 6 function items inside it that branch (our_hotkey_handler, move_selected_files, move_next_file, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/quickmove.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ff4013bab5a5afc0ff805b0d07bf1dea60fe4cf8c2d393152b991d57ed5a23"}},{"ruleId":"D2","level":"warning","message":{"text":"partyfuse-streaming.main (cognitive 16): partyfuse-streaming.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 3 (6 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/partyfuse-streaming.py"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce2a57825ba37b59390c1eb5724bba8f1e833fc139d831a276a0e46ebe6643"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__.sfx_tpoke (cognitive 16): __main__.sfx_tpoke has cognitive complexity 16 (threshold 15). Drivers by points: error handling 2 (6 pts), loops 3 (5 pts), if/else 2 (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":"copyparty/__main__.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"342f18ad490d5bce9ac6611c3cbfdfa5dfe6f674cd3ce3f93daaf54eb7dcdfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"Lim.dive (cognitive 16): Lim.dive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"954c34620de1d8e6c11bf5b9f429253cedc51532b58e2824b0ab62b529b99233"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthSrv.chpw (cognitive 16): AuthSrv.chpw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, ternaries 2 (3 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/authsrv.py"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5fecbf6247fe2f7c4ecb2a459825c124b2726cc5dd0a8ed8b916caaed851ff"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli._mkdir (cognitive 16): HttpCli._mkdir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":3774}}}],"partialFingerprints":{"codehealthFindingId/v1":"566282abada0226ab8a309985792f23a351ea6c9d6d32e35ac2235832bc9ddf2"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCli.tx_shares (cognitive 16): HttpCli.tx_shares has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"copyparty/httpcli.py"},"region":{"startLine":6587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef313b51692a5fd5a65a96b585d75cdb72f6d39ca7a6b884b9e32803ec29716"}},{"ruleId":"D2","level":"warning","message":{"text":"MDNS.process (cognitive 16): MDNS.process has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mdns.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddd64e8b5c3a1cea528747a62453ee32620b1c1721ec6c495cb1099c90ce90b"}},{"ruleId":"D2","level":"warning","message":{"text":"MTag.compare (cognitive 16): MTag.compare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 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":"copyparty/mtag.py"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1918667564ca1d3e5e17567cfd02c351cc69f564cda4b058c721fa54dbb06f7"}},{"ruleId":"D2","level":"warning","message":{"text":"_posix.get_adapters (cognitive 16): _posix.get_adapters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/stolen/ifaddr/_posix.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad6015d465cd3c1bad0de0490f7c19a4c205c597d114d26f18fbff46e995d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"sutil.gfilter (cognitive 16): sutil.gfilter has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (9 pts), loops 3 (4 pts), if/else 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":"copyparty/sutil.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2238b7b5614fbba86f546b75d902dfdb084e445aebd09237d69fa139e521d9a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ThumbSrv.get (cognitive 16): ThumbSrv.get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4d26709a829c387b9d09b590a0985369a20d456319a99d44b311f2b134613c"}},{"ruleId":"D2","level":"warning","message":{"text":"util.read_header (cognitive 16): util.read_header has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7701758245c73068836c9d273020b51e130fe3b18ec3062dac6a244b893d34"}},{"ruleId":"D2","level":"warning","message":{"text":"util.pathmod (cognitive 16): util.pathmod has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), 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":"copyparty/util.py"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576aae59321f74fcfa45911061da685ab65c24ad8697ed07f71daf55e4dac76"}},{"ruleId":"D2","level":"warning","message":{"text":"util.list_nics (cognitive 16): util.list_nics has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 4, if/else 2 (4 pts), loops 2 (3 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3253}}}],"partialFingerprints":{"codehealthFindingId/v1":"72164b078188f7d28b7340610216b2528a27c5612464a4d85b56922d1040c114"}},{"ruleId":"D2","level":"warning","message":{"text":"util.unescape_cookie (cognitive 16): util.unescape_cookie has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9069c94ac19f5e112b25395893eafff0aef7caffc6abef1a3f86cf873fd281"}},{"ruleId":"D2","level":"warning","message":{"text":"util.retchk (cognitive 16): util.retchk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3efd0af4a2d7de9b7a1dc38bcf0c124a274ea23aeff694b6779efb6ced1154"}},{"ruleId":"D2","level":"warning","message":{"text":"util.load_resource (cognitive 16): util.load_resource has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":4758}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccda5057495e91705d041841a92a2487c824cf8acd7540342271cc43f7cae8b"}},{"ruleId":"D2","level":"warning","message":{"text":"sfx.testchk (cognitive 16): sfx.testchk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (6 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":"scripts/sfx.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff005439388f6fe0a1ebb12e6083d2dc9ca0cb9872412ca941fb5a1c78abf0"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.sel_move (cognitive 16): browser.sel_move has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":10140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b399eb4b59a2aca793662ce8e4ae83a06a8079dbb17d5d4e38ddfa3b2113ba91"}},{"ruleId":"D2","level":"warning","message":{"text":"md2.md_p_jump (cognitive 16): md2.md_p_jump has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 4, if/else 3 (4 pts) (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":"copyparty/web/md2.js"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f7f8aeb91dd06e0fc869b20b261d138e0dadb8b35896aa5520974d8a3b7ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::show (cognitive 16): (anonymous)::show has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 3 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99e2ea02fd5fb00ea6211d3aa108c90e66f1cddbc42298d69484b1b455460eb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::onclick (cognitive 16): (anonymous)::onclick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f01f91edf5bd686dd3a74751f88360515857e776baefb363ff81f3da2917364"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::cpy (cognitive 16): (anonymous)::cpy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c6bc0c71e47779b81cf18c0a47df1b4fe96bfbc2ccb324feb055bd12ce3509"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::set_style (cognitive 16): (anonymous)::set_style has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 4 (5 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8280}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf1225494b6e967e8f4dda3db69be55f478200d5b364ba02585bef53168c03c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::sel_move (cognitive 16): (anonymous)::sel_move has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":10140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4126341f7cb3b48ad617827e75f4b224696252f7f8e4906a2c4819b3755b70dc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::rotn (cognitive 16): (anonymous)::rotn has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5, loops 2, ternaries 2. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec03b9de1bf3dd99361b9f365639cb05c80019ecdfa98ad6324b5a47673f3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::updateOffset (cognitive 16): (anonymous)::updateOffset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (4 pts), boolean chains 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":"copyparty/web/baguettebox.js"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefbd8b07d2f63c09de6fc70f719cae338cd8d1de060ea96ef4046fadca7a188"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 2 (nesting depth added 4). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 4 function items inside it that branch (graft_thumbs, graft_thumbs::(anonymous), bagit, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/graft-thumbs.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e441ed3174cad032c8128e9289b86b4476ae209f992fd805a4234c09a75ae6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/banner.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e676d0006a201c990f27d37cdd58c0e6c2065f68a6e446ce6aa4c572f34df4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: up2k.up2k_init: FunctionTooLong \u2014 up2k_init runs 1919 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1819 over it, 19.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"76869700dc9f34f080fcd71ab87e0ac15e60810a9053a34c14e1809e724ec3af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/browser.js: FileTooLong \u2014 7573 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 7073 over it, 15.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8141da32129859e4016f33f532641b73a26740ce1286c9bf9e7cbece8951837d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/httpcli.py: FileTooLong \u2014 6276 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5776 over it, 12.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e213514b90901e6362f2bc25b28cab4cdbadaf2da294ae46a6220f5f5fa9b5e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/up2k.py: FileTooLong \u2014 4786 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4286 over it, 9.57\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":"copyparty/up2k.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce37c1a592fd0d24fb358f5696468aac6f45f00f1a4c2ecc9ce449e23b4e510"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/authsrv.py: FileTooLong \u2014 3480 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2980 over it, 6.96\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":"copyparty/authsrv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0a0c723282bdfbf449597bf65ef45d44e91c46227f4ea171ec1251fc2af9c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/util.py: FileTooLong \u2014 3299 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2799 over it, 6.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/util.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"575ac5a5c1c0ccbe0ede28fcda231e18b076cc69a7f9930c5e95eccded9415bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/up2k.js: FileTooLong \u2014 2507 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 77% of them inside a single declaration: up2k_init (806-3537). The bar is 500 significant lines; this is 2007 over it, 5.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"707898f6a04335af2a34e8c345e958051fd029f3aae49485315532857a745246"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Up2k: TooManyMethods \u2014 117 methods. The bar is 30 methods; this is 87 over it, 3.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3aaf5aadf782ebcd0092a6155782da96f4bf4e05e24f2504266de7df96cbec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HttpCli: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0b825691daf3132d342cd377214f89311cae09863309ca66278f7f9826ef4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/svchub.py: FileTooLong \u2014 1742 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1242 over it, 3.48\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":"copyparty/svchub.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e5060c56055efe5049821157a0225d8a84e069429766ba9f89379f80cd1e56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/util.js: FileTooLong \u2014 1649 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1149 over it, 3.30\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":"copyparty/web/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1de39eba2ea4586e50f32278da83eb018ad632b9071160c6d822f6fb29a15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: up2k.U2pvis: FunctionTooLong \u2014 U2pvis runs 328 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7577682e3e39f9f222b38d55d523c6919c5f08db76171fd2585fa8eaaf8f699"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/__main__.py: FileTooLong \u2014 1639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1139 over it, 3.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/__main__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e904fcf818faefd122d534d7c8872dbf90ce7f0c30d6eb7375e2ee3653cc6f1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: meadup.initKeybaord: FunctionTooLong \u2014 initKeybaord runs 323 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 223 over it, 3.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/meadup.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5009a1b0a2c3676fd430e9f37416b125686cde44787051c8ce32c04f5f734cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/th_srv.py: FileTooLong \u2014 1293 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 793 over it, 2.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48d3ec50fcbc761533edce64db37f02f2a009727f12227631b37398b599fd64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: a/u2c.py: FileTooLong \u2014 1214 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 714 over it, 2.43\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":"copyparty/web/a/u2c.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c27392b181b352fe42f0a4e28125d11de10314b73d211a0f63ac496588829a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/md2.js: FileTooLong \u2014 831 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 331 over it, 1.66\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":"copyparty/web/md2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf51da63216bbee358fa3f33390168610a8a183e38a8b59b1a45ba81735d7431"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SvcHub: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b6ca2138f800e17961a6d9e1645106baa548b6cd815a30b1b92574b7ed23aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: a/partyfuse.py: FileTooLong \u2014 811 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 311 over it, 1.62\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":"copyparty/web/a/partyfuse.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83487981fcf40835d7db4c51d16a118e89f54b7e937ecee87d6bfa937925a109"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: up2k-hook-ytid.a_up2k_namefilter: FunctionTooLong \u2014 a_up2k_namefilter runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/up2k-hook-ytid.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d789140b2c24138e2c30fdb823251fdcf8e950ada8247fafd196847e93a20b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/sftpd.py: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 278 over it, 1.56\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":"copyparty/sftpd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf9e323d0636f846356764130c763fdb6e24fb835fdd94cdf704d236e44c5f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: browser.MPlayer: FunctionTooLong \u2014 MPlayer runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"55adb02a05fbb954a806083178f01386e4e757efa94ea3b31d5f8c4c4576686c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ThumbSrv: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"copyparty/th_srv.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4369cc26682b184fc820e8e77c935b3c96a892e5468785aee038ee7abc444"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/mtag.py: FileTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 192 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mtag.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b74b7592bb16cd08ba9b5818d8789c22e9734b9ac0498eec9dce3e1e3606c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dnslib/dns.py: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 99 over it, 1.20\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":"copyparty/stolen/dnslib/dns.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c428ebabcd88befd16e5b13959dfe18f43fc2b2efaaab2d0fdd6780257d5b83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/ftpd.py: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e331d63990b1b2f52bcb6d6a7b42193bd7053e999c447250d33d2d717f8d2b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/httpsrv.py: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpsrv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32624d6ceec148b5188137a78894fd4d9ba9c6e8d3ca0f940eca2f4313e17b92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: copyparty/tcpsrv.py: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tcpsrv.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e2e4710ce2d07440de93bb81708e81dfb444e1326c592ba1a14e139773e068"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: md.convert_markdown: FunctionTooLong \u2014 convert_markdown runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa03b90358d198d4b5d53b40f7a00102ea463d46fa8206800680efea46f786ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: browser.play: FunctionTooLong \u2014 play runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"831be5006fcd8fa667f410a0902506671c391aea8419f2a1fff71dcf3f14a4ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: md2.fmt_table2: FunctionTooLong \u2014 fmt_table2 runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8146b26ded8491edab2039164994ef8b3e23ab34e967ace33c6b7c1d36c93776"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (94 shared lines): copyparty/up2k.py:4589-4752 | copyparty/up2k.py:4849-5078 \u2014 These two members are variants of one another: 94 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc2a04a7ffff07c8065df425f0ddb22eeaa91735998f3b5cce07c3edb3f64c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): copyparty/httpcli.py:6256-6420 | copyparty/httpcli.py:6423-6559 \u2014 These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":6256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b709a8057978b7e7e643fdf83ce1d2d40be3b7f9d1d4a64fb3285ae7324553"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): copyparty/ftpd.py:242-313 | copyparty/sftpd.py:477-593 | copyparty/smbd.py:235-289 | copyparty/tftpd.py:353-404 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"360d9a976d1709f4611f9921bf57341b20d1ae684f998b8ffc1e566907aef707"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): copyparty/httpcli.py:2201-2257 | copyparty/httpcli.py:2260-2326 | copyparty/httpcli.py:2329-2342 | copyparty/httpcli.py:2345-2366 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a1d267f3c2022eccf6ee429ecc048ea2182505d4d2082597a17197aa07e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): copyparty/up2k.py:4698-4731 | copyparty/up2k.py:5022-5055 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060copyparty/up2k.py:5057\u0060 calls \u0060wunlink\u0060 and \u0060copyparty/up2k.py:4733\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":4698}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae4cdde07a1905a304a3196f00ab0077027966a83f049e0525c421e8c71a861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): copyparty/smbd.py:251-274 | copyparty/tftpd.py:369-392 \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":"copyparty/smbd.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d3b23aef55f1dccb5ced8d30552829eb6d6e20ca499ca932ad619dd5a9deae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): copyparty/up2k.py:4658-4681 | copyparty/up2k.py:4982-5005 \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":"copyparty/up2k.py"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb46d9bef37c1e1110ea47f5765c4f50d097c26add825ceb4ad106e3f9dc844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): copyparty/httpcli.py:2743-2765 | copyparty/httpcli.py:2918-2940 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060copyparty/httpcli.py:2941\u0060 calls \u0060wunlink\u0060 and \u0060copyparty/httpcli.py:2766\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"22544a141d8cff009adfbdf6c82bd3a9567cd94a01546093cdfcda7bdd9fe820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): copyparty/httpcli.py:4033-4053 | copyparty/httpcli.py:4146-4166 \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, \u0060copyparty/httpcli.py:4145\u0060 calls \u0060wunlink\u0060 and \u0060copyparty/httpcli.py:4032\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb8c0db3b7c949aa8864d82466594ba8881c87fe8e7b54685db754ca3d7d6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): copyparty/stolen/qrcodegen.py:340-360 | copyparty/stolen/qrcodegen.py:366-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/stolen/qrcodegen.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8042ba2a501d2e4f3cb095fce4ac289968b58a2ffb515f5333870001ab847cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): copyparty/up2k.py:4616-4636 | copyparty/up2k.py:4881-4901 \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 \u0060copyparty/up2k.py:4616\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":"copyparty/up2k.py"},"region":{"startLine":4616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c07a6eb280cbd609c8fe237134015fa3ca4eef2460551ae26e0da50d625a0b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): copyparty/ftpd.py:262-280 | copyparty/sftpd.py:520-538 | copyparty/smbd.py:255-273 | copyparty/tftpd.py:373-391 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060copyparty/ftpd.py:262\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":"copyparty/ftpd.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2bf6f00ddd9f3158a356500e922adc3e6906212efe24f4276fb101e573875c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): copyparty/authsrv.py:3874-3891 | copyparty/authsrv.py:3988-4005 \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":"copyparty/authsrv.py"},"region":{"startLine":3874}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e812ca5577d33c46999a2e9beeb154f4914beff03a66e85151e62e3395894f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): copyparty/httpcli.py:2548-2565 | copyparty/httpcli.py:2598-2615 \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":"copyparty/httpcli.py"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff27ca15c46d28ee81c4a8c5c06293ced1499efb5a1b9a45f495f0c8080fb39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): copyparty/sftpd.py:147-164 | copyparty/sftpd.py:220-237 \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":"copyparty/sftpd.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cbec7254a57fe8a51c946bd4322a211d726b2bfa99112356b444d49adc17e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): copyparty/httpcli.py:2821-2837 | copyparty/httpcli.py:3931-3947 \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":"copyparty/httpcli.py"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc987eeac73a92b4b64d3fc71559281b0a8e992948126c326a527d413f44609f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): copyparty/httpcli.py:6375-6391 | copyparty/httpcli.py:6510-6526 \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":"copyparty/httpcli.py"},"region":{"startLine":6375}}}],"partialFingerprints":{"codehealthFindingId/v1":"918293b9faff59abc33660bdbc000fc94b36ee8150d0a4d2328f2bdae0ba01bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): copyparty/util.py:4544-4560 | copyparty/web/a/u2c.py:512-528 \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":"copyparty/util.py"},"region":{"startLine":4544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9509477e10cb9b6e524c398e4ef31bfadf55cda075eb3df64a18bee19aba4e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): copyparty/authsrv.py:2198-2213 | copyparty/authsrv.py:2233-2248 \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":"copyparty/authsrv.py"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7eee117267cbaa1ffc173ac1a9278621554d2fa0af35b151746310a99bc428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): copyparty/cert.py:131-146 | copyparty/cert.py:225-240 \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":"copyparty/cert.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9965b22538203f990af13838f03eec3b512890a914fa70e33ddc09a4e313bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): copyparty/httpcli.py:2099-2114 | copyparty/httpcli.py:7290-7305 \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":"copyparty/httpcli.py"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ebf0ba612bc73eba113848a47bd85ec981f864e11210f16413251dae0b7111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): copyparty/httpcli.py:2217-2232 | copyparty/httpcli.py:2279-2294 \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 before the matched lines, \u0060copyparty/httpcli.py:2277\u0060 calls \u0060dcanonical\u0060 and \u0060copyparty/httpcli.py:2215\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eedd56c0ea014ef248624b22a49e6e9dec9a4f67371e6519bf66aa6f7be13b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): copyparty/mdns.py:341-356 | copyparty/ssdp.py:143-158 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060copyparty/mdns.py:338\u0060 calls \u0060time\u0060 and \u0060copyparty/ssdp.py:142\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":"copyparty/mdns.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5376d8d6e9a8b8f6fd8e60503d7634ebe7e34817429f073fe61465eeb8c64bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): copyparty/svchub.py:1814-1828 | copyparty/svchub.py:1861-1875 \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":"copyparty/svchub.py"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce3fcbff543e51bb8249418ec76b067aec11dbd37a3011d32a6441c3d03e2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): copyparty/up2k.py:5356-5370 | copyparty/up2k.py:5891-5905 \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":"copyparty/up2k.py"},"region":{"startLine":5356}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d3cf8be2fa9c92d1d6fc3adcbd36b818a7fc2d0cda2e4d4be411f7c278ffb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): copyparty/web/a/partyfuse.py:471-485 | copyparty/web/a/partyfuse.py:519-533 \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":"copyparty/web/a/partyfuse.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"335e9ad42cbc4b8088a57ea45b145297692a5be5f26f1917edc59d11c159ba3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): copyparty/httpcli.py:6866-6879 | copyparty/httpcli.py:6898-6911 \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":"copyparty/httpcli.py"},"region":{"startLine":6866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ecff2ba857a1bcc62b90f274c0e2f555992101e8199513e09e3a23493c0577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): copyparty/httpcli.py:2752-2763 | copyparty/httpcli.py:2927-2938 | copyparty/httpcli.py:4508-4520 \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 \u0060copyparty/httpcli.py:2752\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060copyparty/httpcli.py:2941\u0060 calls \u0060wunlink\u0060 and \u0060copyparty/httpcli.py:2766\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":"copyparty/httpcli.py"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0facdb90eccd3240f7a6f1e4447ee195fa5936e993d512790e1cc3c3ef4c9bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): copyparty/httpcli.py:3844-3855 | copyparty/httpcli.py:4460-4472 \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 \u0060copyparty/httpcli.py:3844\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":"copyparty/httpcli.py"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1098fa5a05152404a2dee9e202aea98cc6faf9d6fb1d8b861e10ed17bdf05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): copyparty/httpcli.py:4450-4462 | copyparty/httpcli.py:4498-4510 \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 \u0060copyparty/httpcli.py:4450\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":"copyparty/httpcli.py"},"region":{"startLine":4450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3734d441eac4025c18c13b8782ccc77404cbe61e77ada2d8bfd83c9a2638cd29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): copyparty/httpcli.py:1046-1057 | copyparty/httpcli.py:2547-2558 | copyparty/httpcli.py:2597-2608 \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 \u0060copyparty/httpcli.py:1046\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":"copyparty/httpcli.py"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab1462676b4c2635cba74010976e694210d2bce29b0cf81973a2d5b55a06213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): copyparty/httpcli.py:1600-1611 | copyparty/httpcli.py:3580-3591 \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":"copyparty/httpcli.py"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"65368b0567ba287f2e0b6d34d90e8a9d3cb1e9871ad6cd805aca44e4e380e701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): copyparty/svchub.py:1892-1903 | copyparty/svchub.py:1957-1967 \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 \u0060copyparty/svchub.py:1892\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":"copyparty/svchub.py"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c830e9095f5e91459d33816ba395791b64d054b2f7e9d4f3711055a905e8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): copyparty/web/a/u2c.py:707-718 | docs/chunksizes.py:10-21 \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":"copyparty/web/a/u2c.py"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47918cc382adaf010ba35861dafeb12855953372ff136408521f4462ccd5189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): contrib/package/nix/copyparty/update.py:43-53 | contrib/package/nix/partftpy/update.py:28-38 \u2014 \u0060contrib/package/nix/copyparty/update.py\u0060 and \u0060contrib/package/nix/partftpy/update.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 16 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"contrib/package/nix/copyparty/update.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"94508f222cf9aaf849bb23f335d924ca9ad1f8bf37b4acfdad97ed7d3f3cad88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): copyparty/httpcli.py:2261-2271 | copyparty/httpcli.py:2330-2339 \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":"copyparty/httpcli.py"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eac9bdb3fbc5cddcd493bce0a75e6d07c93c0a8b59e577ef7ed1d59273f759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): copyparty/util.py:2951-2961 | copyparty/util.py:2969-2979 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060copyparty/util.py:2980\u0060 calls \u0060unlink\u0060 and \u0060copyparty/util.py:2962\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":"copyparty/util.py"},"region":{"startLine":2951}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0147c693b83f4c7bc18148d1a259efb7f49384c7c6045de78468d47c4d8856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): copyparty/web/a/partyfuse.py:553-563 | copyparty/web/a/partyfuse.py:604-614 \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":"copyparty/web/a/partyfuse.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca3aefa3d81cdf7bde3276d8572de15a5067c45158135b5df27a24949589d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): copyparty/httpcli.py:352-359 | copyparty/httpcli.py:5684-5693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440a66dd637f146411ed1ac44f395acba691c7cba1314f67b2f2c84127f9035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): copyparty/httpcli.py:4023-4032 | copyparty/httpcli.py:4135-4144 \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 \u0060copyparty/httpcli.py:4023\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060copyparty/httpcli.py:4145\u0060 calls \u0060wunlink\u0060 and \u0060copyparty/httpcli.py:4033\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4023}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcd0e5f87da54bcc4b566b564e0fa362206faf9a0b67193d9798689741ce871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): copyparty/httpcli.py:6343-6352 | copyparty/httpcli.py:6469-6478 \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":"copyparty/httpcli.py"},"region":{"startLine":6343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2522513d6ceb735a38248d11dfeefffacaf413d3c1aceb3966b134a9a91b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): copyparty/multicast.py:104-113 | copyparty/util.py:990-999 \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":"copyparty/multicast.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa0fdb40efa59f26bb7cf2d92fc6d2ece7155a8fb74b51c44f6c3962b54214a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): copyparty/sftpd.py:449-457 | copyparty/sftpd.py:616-625 \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":"copyparty/sftpd.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ae4cbf8b6afd6e6661177bdf2c2894a31ee0d377ee0fbfc7b6f567133fffdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): copyparty/web/a/partyfuse.py:482-491 | copyparty/web/a/partyfuse.py:582-591 \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":"copyparty/web/a/partyfuse.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0f5d57d3f88d90d10659e9df13bf11c8aacd8bcf086721e8b2ab508f5fbdfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): copyparty/web/a/partyfuse.py:493-501 | copyparty/web/a/partyfuse.py:543-550 | copyparty/web/a/partyfuse.py:594-601 \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":"copyparty/web/a/partyfuse.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b9b9b575b412f4ce3ba31f3a76c01372c3b73e4b202d3750f7641271e71c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): copyparty/httpcli.py:2877-2885 | copyparty/httpcli.py:4484-4492 \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":"copyparty/httpcli.py"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb558f6108b909d46095700a0727dcea44cfc794490744dda4fe17a47d41a54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): copyparty/httpcli.py:4632-4640 | copyparty/httpcli.py:4651-4659 \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":"copyparty/httpcli.py"},"region":{"startLine":4632}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f8ab2474676f3077e05009823cc2b806871309e856bb433866a0c8068a0e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): copyparty/httpcli.py:6256-6264 | copyparty/httpcli.py:6426-6434 \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":"copyparty/httpcli.py"},"region":{"startLine":6256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c21b8cd59e700d17738bea347c7ed3e833d017384774cf30d432307d2e14b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): copyparty/httpcli.py:7857-7865 | copyparty/httpcli.py:7867-7874 \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 \u0060copyparty/httpcli.py:7857\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":"copyparty/httpcli.py"},"region":{"startLine":7857}}}],"partialFingerprints":{"codehealthFindingId/v1":"662cd78ad058a6383cfea5319fa6101adf29f0ada2ea3cf5c494c8ccd68a6722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): copyparty/sftpd.py:674-682 | copyparty/sftpd.py:718-726 \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":"copyparty/sftpd.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9c4c192e0b4f3925030798f845eaf601be4ef089ae83546b9ce8cfe9cfbedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): copyparty/svchub.py:740-748 | copyparty/svchub.py:851-858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060copyparty/svchub.py:751\u0060 calls \u0060execute\u0060 and \u0060copyparty/svchub.py:860\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":"copyparty/svchub.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b182f33574bfefe449dd72dc46c7f62184d32da9b2847680896fc0b28f79cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/authsrv.py:2278-2285 | copyparty/authsrv.py:2292-2299 \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":"copyparty/authsrv.py"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdaf2d18921ebd0ce5dd2f9b2e3a218f21dbd42dd05dafc433c97dfd861d9419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/httpcli.py:2202-2209 | copyparty/httpcli.py:2349-2356 \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":"copyparty/httpcli.py"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c665fb178005f67508da54fb99bda38e48afa631e74c80a8a9444ee0e65eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/httpcli.py:2760-2767 | copyparty/up2k.py:5414-5421 \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 \u0060copyparty/httpcli.py:2760\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":"copyparty/httpcli.py"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c915182647df621e347bb7fb5d61737dc0a01fa18cabd1813c7ff7ec637d7ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/httpcli.py:6359-6366 | copyparty/httpcli.py:6492-6499 \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":"copyparty/httpcli.py"},"region":{"startLine":6359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f915be67401da047af53cf42016f11cba0b9114a410cb9e8fe5f75d0f14c7e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/smbd.py:336-343 | copyparty/smbd.py:375-382 \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":"copyparty/smbd.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdcd53485df307d565bea80fd3ee84da65392559f5c491c8bd93fe3f97970ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/sutil.py:75-82 | copyparty/sutil.py:135-143 \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 \u0060copyparty/sutil.py:135\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":"copyparty/sutil.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a309eee041b988cbaf411ccd7034d20c9f2542acedfb24f5bcd11c95d603948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/up2k.py:4591-4598 | copyparty/up2k.py:4851-4858 \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":"copyparty/up2k.py"},"region":{"startLine":4591}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7060e6155e3e0bbde86e77b4af1a40a63d8b42de828c26cc1986a868778db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): copyparty/util.py:2595-2602 | copyparty/util.py:2606-2613 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060s\u0060 to \u0060str\u0060 in one and \u0060bytes\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":"copyparty/util.py"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab207afc383f2eab35fd7c7fb00b5502102a1d26954cf304b3a3d89a356defc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): copyparty/httpcli.py:2201-2207 | copyparty/httpcli.py:2260-2266 | copyparty/httpcli.py:2329-2335 | copyparty/httpcli.py:2348-2354 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0d52a651c0fc49e22c05a2472ed3cd2e951f2a459b41fb78a4746269169f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/authsrv.py:2643-2649 | copyparty/authsrv.py:2653-2659 \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":"copyparty/authsrv.py"},"region":{"startLine":2643}}}],"partialFingerprints":{"codehealthFindingId/v1":"256505cc1e1ff9f86ff96347e81df1ed3439b9737541a7982463a529c194bfe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/ftpd.py:186-192 | copyparty/sftpd.py:336-342 \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 \u0060copyparty/ftpd.py:186\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":"copyparty/ftpd.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ec00e5a6a113e63f3d4e1a724d35b2c3b6f6d56f6c006d5e2e3d2e95993151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/mtag.py:833-839 | copyparty/util.py:3998-4004 \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":"copyparty/mtag.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5092222858478106edae9b061a05c20f0e988768ce7943910368bfbd6ef4661d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/svchub.py:1852-1858 | copyparty/svchub.py:1916-1922 \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":"copyparty/svchub.py"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"306dd5edecb9365f77e571fe4e7635d64c6ec6889e9cca3756c70619868724b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/up2k.py:3530-3536 | copyparty/up2k.py:5419-5425 \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":"copyparty/up2k.py"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aa122d69dce74c85ac6d703d32770104c26a5c980cef459488e23a92e9f592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): copyparty/up2k.py:3539-3544 | copyparty/up2k.py:5428-5434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24b7862f06e2ab65153a8dcfb9a0ae40a5c5ddcef121286e4201dd1966a43de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/up2k.py:4534-4540 | copyparty/up2k.py:4768-4774 \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":"copyparty/up2k.py"},"region":{"startLine":4534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8477ed795094f9b5c9f242360ceb68c652556b7be116ca481c96712c0f913040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/up2k.py:4687-4693 | copyparty/up2k.py:5007-5014 \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":"copyparty/up2k.py"},"region":{"startLine":4687}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4fcfb0da9dc8e21e8bc74157aec48352e00219b7e1847058cb7e7a8047f7ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): copyparty/ftpd.py:179-184 | copyparty/sftpd.py:329-334 \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 \u0060copyparty/ftpd.py:179\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":"copyparty/ftpd.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec267a28994ab0caf72e3f0ac87c7c8b162929cb4fb78a2ebcaf9457de50a13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): copyparty/httpcli.py:2766-2771 | copyparty/httpcli.py:2942-2947 \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, \u0060copyparty/httpcli.py:2941\u0060 calls \u0060wunlink\u0060 and \u0060copyparty/httpcli.py:2765\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bc07d7acbc3139c01c36071a8506d815ccffd0c8e0fc6cbb3cbe58722c5a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): copyparty/httpcli.py:3822-3827 | copyparty/httpcli.py:4349-4354 \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":"copyparty/httpcli.py"},"region":{"startLine":3822}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e777908c78bf9ea6f6ce88fbab410b362e59b2c519ebe6d62d3cd45759a1f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): copyparty/up2k.py:4567-4572 | copyparty/up2k.py:4807-4812 \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":"copyparty/up2k.py"},"region":{"startLine":4567}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7e9ffdcc68b3821d1e7ec489d0325898908e085c6abd0277f0782f3f1c7542"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): copyparty/authsrv.py:2732-2736 | copyparty/authsrv.py:2740-2744 \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":"copyparty/authsrv.py"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d564731ef37865b1c3372446105810ea6f68c7164eb879d7c17493390054ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): copyparty/httpcli.py:548-552 | copyparty/httpcli.py:665-669 \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":"copyparty/httpcli.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"eced822bc0d3124290b7be22ea3c7273eccee2e3e63a51b0278d10bae3f14806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): copyparty/svchub.py:1847-1851 | copyparty/svchub.py:1911-1915 \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":"copyparty/svchub.py"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcd6d399d64c487637a50f738ce09ffea7921e04ce26817ead1d58037daab07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): contrib/package/nix/copyparty/update.py:25-29 | contrib/package/nix/partftpy/update.py:20-24 \u2014 \u0060contrib/package/nix/copyparty/update.py\u0060 and \u0060contrib/package/nix/partftpy/update.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 16 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"contrib/package/nix/copyparty/update.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"669cf2622a9df386096c33aa0508c330aa1e612f3c14e9022f2451996b741a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): copyparty/up2k.py:5871-5880 | docs/chunksizes.py:25-34 \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 \u0060copyparty/up2k.py:5871\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":"copyparty/up2k.py"},"region":{"startLine":5871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4270500002d4b7a3f38ee74f1d1d3bff6fe8e6a006768e6fdd937616a150ac2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): contrib/zfs-tune.py:41-47 | copyparty/util.py:1855-1861 \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":"contrib/zfs-tune.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd27ac6e3002d672767cc242c6457a32ad5c7180e3c39b12454522b56261452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): copyparty/__main__.py:1503-1507 | copyparty/__main__.py:1754-1758 \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, \u0060copyparty/__main__.py:1500\u0060 calls \u0060add_argument\u0060 and \u0060copyparty/__main__.py:1753\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":"copyparty/__main__.py"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eedb72b1de310a926202d7e0a7cc6fe4943dcac9a7827a8ea7005676c885f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): copyparty/httpcli.py:638-642 | copyparty/httpcli.py:655-659 \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":"copyparty/httpcli.py"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e11c1cb790b970556dd7cd39d33107736edd4a77b7c6ebb90443ad55e27d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): copyparty/httpsrv.py:131-137 | copyparty/svchub.py:228-234 \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":"copyparty/httpsrv.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"907fb9cb5dc641dd3a4998aa9ece91b93432f76d6d5e6b24638521e43ab5c422"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a18e4c1d7781336a014f0fe7582d219545310a36e647b0308169d4f662a44f2e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/authsrv.py: copyparty/authsrv.py changed 26 times in last 90 days, max cyclomatic complexity 511 in AuthSrv._reload at line 1773. 2 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/authsrv.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":"copyparty/authsrv.py"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"1241aa37c0e019a8357c7a51d5ba62e6c436a7afb33a8d90a4b1f0f66d0ab261"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/httpcli.py: copyparty/httpcli.py changed 36 times in last 90 days, max cyclomatic complexity 314 in HttpCli.tx_browser at line 7043. 4 of those changes were fix/bug commits, and the other 32 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/httpcli.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":"copyparty/httpcli.py"},"region":{"startLine":7043}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcec3ee2e75f132118f3e3e300f9351a1cfa25bd34a55808cc73d4ee1381b2ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/web/up2k.js: copyparty/web/up2k.js changed 9 times in last 90 days, max cyclomatic complexity 678 in up2k.up2k_init at line 806. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/web/up2k.js\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":"copyparty/web/up2k.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a54f5c53ec4e4474517b202632206da156a362361c3ee48a1e9231dad5c810"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/web/browser.js: copyparty/web/browser.js changed 22 times in last 90 days, max cyclomatic complexity 136 in browser.ahotkeys at line 6248. 3 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/web/browser.js\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":"copyparty/web/browser.js"},"region":{"startLine":6248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7ea25951fc9e2db72f37e94ec91a8edcb16b2eaf63ffc8a0a31e6222695cbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/__main__.py: copyparty/__main__.py changed 40 times in last 90 days, max cyclomatic complexity 71 in __main__.main at line 2368. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/__main__.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/__main__.py"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8bd1963d4e347c32bbc64f03533892649417a9de4b766cd982e06cebe4fec2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/up2k.py: copyparty/up2k.py changed 19 times in last 90 days, max cyclomatic complexity 124 in Up2k._handle_json at line 3192. 1 of those changes was a fix/bug commit, and the other 18 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/up2k.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":"copyparty/up2k.py"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b239619009494de5423ed959e361f972a28af09e21dc40f0c313644839d04a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/svchub.py: copyparty/svchub.py changed 14 times in last 90 days, max cyclomatic complexity 115 in SvcHub.__init__ at line 159. 1 of those changes was a fix/bug commit, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/svchub.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":"copyparty/svchub.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e825bef6de986b70ac8aac96d03bad6f198b617345f17d5d9b1916d2eb597f13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/util.py: copyparty/util.py changed 20 times in last 90 days, max cyclomatic complexity 33 in util._runhook at line 4196. 4 of those changes were fix/bug commits, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/util.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":"copyparty/util.py"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a6135b3419c6dc8a807a97a76bd31a3737a3f0a14dcb7d566b6b9724841468"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/th_srv.py: copyparty/th_srv.py changed 8 times in last 90 days, max cyclomatic complexity 58 in ThumbSrv.worker at line 534. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/th_srv.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":"copyparty/th_srv.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3010d0ca8c9b373a22798915ca9e186fb5606b55273c58845194f462db6fd105"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/mtag.py: copyparty/mtag.py changed 5 times in last 90 days, max cyclomatic complexity 43 in mtag.parse_ffprobe at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/mtag.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":"copyparty/mtag.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc51f29f504f0d58d0cf4fde0d53dec8530058166f2f485813a2b26565e566ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/tcpsrv.py: copyparty/tcpsrv.py changed 3 times in last 90 days, max cyclomatic complexity 65 in TcpSrv.__init__ at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/tcpsrv.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":"copyparty/tcpsrv.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fa69b6173baebc22b38d1f2857a6e07d81364619a224aa790ea2fc5c7f7dec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/th_cli.py: copyparty/th_cli.py changed 3 times in last 90 days, max cyclomatic complexity 62 in ThumbCli.get at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/th_cli.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":"copyparty/th_cli.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"26216ba40987f7bd45aa95bb99bd01fba52ad80dfcd9f34b4971979d7b9c0381"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bin/u2c.py: bin/u2c.py changed 4 times in last 90 days, max cyclomatic complexity 46 in u2c.main at line 1550. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- bin/u2c.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":"bin/u2c.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0bb7eba51bb4df76ae75deb28a38fb5a28a1997a2b058d4110ea9e2cbb9a27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/httpsrv.py: copyparty/httpsrv.py changed 5 times in last 90 days, max cyclomatic complexity 31 in HttpSrv.thr_listen at line 327. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/httpsrv.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":"copyparty/httpsrv.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3687ebadf6efff8d6ae06dc1f5d86babfc4107fd6123c0f15acd699b64edfde"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/help2html.py: scripts/help2html.py changed 4 times in last 90 days, max cyclomatic complexity 35 in help2html.cnv at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- scripts/help2html.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/help2html.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5b26e11eaa7c40597fba2d4b899e646f6c395187b86b563f3e18978a19e490"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/mdns.py: copyparty/mdns.py changed 2 times in last 90 days, max cyclomatic complexity 62 in MDNS.eat at line 414. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/mdns.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":"copyparty/mdns.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc263f4859ee73b2d50ad0188033837714183cb6d304563b06562f6c5658d19d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/web/util.js: copyparty/web/util.js changed 4 times in last 90 days, max cyclomatic complexity 30 in util.vis_exh at line 178. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/web/util.js\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":"copyparty/web/util.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6ca5e8694601825bf1cc23ebfc712ba1bae514e1d7e80cdafb53ffe743b6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/sftpd.py: copyparty/sftpd.py changed 4 times in last 90 days, max cyclomatic complexity 28 in SFTP_Srv._open at line 476. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/sftpd.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":"copyparty/sftpd.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec5af0dc02401aa7b44bb7a9d3d3124f70e091775ec5d399fcf60c5f48cac40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/ftpd.py: copyparty/ftpd.py changed 4 times in last 90 days, max cyclomatic complexity 23 in Ftpd.__init__ at line 632. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/ftpd.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":"copyparty/ftpd.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b79c9b1a9683b7c22def6252ca422bc950f533e60b17441a72b8f09682f5b13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/u2idx.py: copyparty/u2idx.py changed 2 times in last 90 days, max cyclomatic complexity 39 in U2idx.search at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/u2idx.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":"copyparty/u2idx.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"029333a72950cf79990b881f2d6b28e9737d632d4e8d02c2c46b1271fc06b9db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/sfx.py: scripts/sfx.py changed 4 times in last 90 days, max cyclomatic complexity 18 in sfx.unpack at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- scripts/sfx.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sfx.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b35b6d91119dd9f76492ad513287a1abb5e71c5aacda4ec52e4f9bf4f36f7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/httpconn.py: copyparty/httpconn.py changed 3 times in last 90 days, max cyclomatic complexity 23 in HttpConn.run at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/httpconn.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":"copyparty/httpconn.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"256d00029377648ac4c37074556c6f9dc6f776e66c9674f376f7f4a31f3471b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/web/md2.js: copyparty/web/md2.js changed 2 times in last 90 days, max cyclomatic complexity 34 in md2.keydown at line 982. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/web/md2.js\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":"copyparty/web/md2.js"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a0d4f390a63c1241316510ecc4dcba13d942827a81cf99407fb763c329d717"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/fsutil.py: copyparty/fsutil.py changed 3 times in last 90 days, max cyclomatic complexity 22 in fsutil.ramdisk_chk at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/fsutil.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":"copyparty/fsutil.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fcbeb9a33614ab72165e6d1717f0bd66e6f7b52a9c5ffdaf92410a612fffb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: copyparty/cert.py: copyparty/cert.py changed 2 times in last 90 days, max cyclomatic complexity 22 in cert._gen_srv at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 19:31:21 \u002B00:00\u0027 --until=\u00272026-09-24 19:31:21 \u002B00:00\u0027 --full-history --no-merges -- copyparty/cert.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":"copyparty/cert.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfdee2f59e4f19ef6558e376ee295dc9b8d82a0ef22b1726af16bad0f06d32b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO is undef if vol 404 on startup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/up2k.py"},"region":{"startLine":5676}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6ff90f08e3eb1a0655b75efb9263a9e5a20e05da45d8be6749422ee71769e8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # self.log(\u0022XXX self.ram: %s\u0022 % (self.ram,), 5) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/th_srv.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3db14a3ee1797fe181d651d7ccd5029737b4483f25ac576a1afaebfbcf46361"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # (TODO: move the \u0022listening @ ...\u0022 infolog in partftpy to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/tftpd.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5f96f336b212f3300c90ab6428397ec4a99a4328626e6d3270189d3f7c8cbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ed1ca5781a7651ad21caf0fc3bb2f5d0177e98636595480a569919e780126"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6481a8d50b07a25a2ab92a16e82c32f8663ebd6b8389c37365d2b08583591e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/svchub.py"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44f772e7772a8f0eead17e54616daa17656e8b9b76d8ace13deeed3b9a116b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO reply should parser.drop() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/httpcli.py"},"region":{"startLine":4359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf8e1e4e9f331f74c37a6c6779e16781af6faa8a09aadef001891ad4dcc5912"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # instantiate all services here (TODO: inheritance?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/broker_thr.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e13191d0bcb0cf3b525c9096bbe25c9591044d94a4f3f401e1f02b4e5d6fc20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # instantiate all services here (TODO: inheritance?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/broker_mpw.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be60f4815b79f8d48e19e0f9c374b78e8d098df601cff6979fb5812599ad84f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO will deadlock if dest performs another ipc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/broker_mp.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb16b0082b973ba0b2dfddde3aee23a59d911cae643176e8b8abe1c83dfc8c42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO untested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/a/partyfuse.py"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c43bd89b1d180cdd387203eed2972c81092cbab4cbfeb62b4af2883c1c41232"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # doesn\u0027t really matter but makes the test messy, TODO? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_vfs.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d88ef335f0a8422add94fb71f3d89f61af7e5d7a49b4adc0224709aadcce1e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # tc_e2d = [True, False]  # maybe-TODO only known symlinks are translated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_mv.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e850ee1a581eb3e2d19f60736cddc575d258051d41169fb28e77db13ebc1eb"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62a0131ccd8cd7aa1f5daab82eda8e878645f058c87194cc076dba627ab787a1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1326d96eb90afb289df2c921e91d83b371f38053f05d6ca793821a9e723030b"},"properties":{"commitSha":"9fcd4823b53bf4beacf5f31a4c44ea0d5fc7ba42"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba961691f7456194d177e2ceef6a8264ae3aed7c01ad74dc12e60ca2f46f1152"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"7d8d0e6d7272da859d4d07c2fefea42b7322aec2b70fa975523af4faa24ce8ab"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"880a0e07960ddb2ce3ff8a623d525e26017ca6b9d95a63454d91954cec00d32b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ccc36c566a901115864d4b1cca6abfb7e763474bd607dd74235825679b6d6a75"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"675ae85501455685a8f68aba0c95585ce6bd71a7cbad2506b0e73129904a597c"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3a1490958594ee386abd7eeba954e4fb678e5c82ae955de34b25dfc519754ee1"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"de89fcb91db751026aee13da18cf825bd7fac731ff2e4372c21192dc628de192"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"993e48fe8db646721d47e696b0d8ba9f4aefd57f83deea9ce8e3cb6ca4370c34"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"8b09bbc7f5a4c625614280c1985daf7918ea4d67f1ffce32f397f5fdbb83c514"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4d3d78c02f1254da706b1bc89358f7e2058f2a59906c30dcb36d77b26bc93906"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f10ad1834c84c6c457d4b606db2081b57c9f3dd4d9e45dc841648e0c6a73dd26"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9de57d356e0c6176c28fba54d2038d07764eb8a061323826dc0acbd5ad3db44c"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3279c73375f1f06c75dec179dab52c6b789e5049cf90be2d72728552331b5e84"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"47f8404a268a03f73c96757e17f511e72042254a9fc9013eab5aeee87e1901eb"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"3d7e2d5fde653dd384126e17250e5e71436a260e4408979f39954b7b234a6c1a"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2fcc3cebff8ff2130ace4d65a7f9bb62c2ec08ea35565e54206c76995e75ade4"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b469789a8b900bd499de356cbd585d213dbc1b80cb43506f32d585ecc36756b8"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"923e0aba5198696f5bfaa5315b03eaf22d464db510060f29bf9095e6e4aba781"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"82b22212672c7f18b929a36e921f2be2eb2a350bf24f5e466583357efcb0b4dd"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b8120edf7e8301fb2f4e306876f754bf7d6246aa88be40599ec6c63e21e141cc"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6ab0b384c244d90eb553af964dfa690eac087e848c8624a47f51b73272684c92"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9fdb10815e076106a5cb3108f5b4b4ef9f97a69d20b97f5d45a9379558647f4b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e571f91f6370bfb4ae479f3639a91a0dae80550633387c2aee8f9110f0133b8d"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e9ad1e9083d399e5034137dca7a51f6386cefe57adea40ef6cbe468d042b3799"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"47ca10eb345b00509e4de397e5001d5d17312ed56c80c730b4b564a5e26f8cbb"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"203eb3a50a85683f48f996473080321eb1ea8453bdb95656dcfd4b0677eafb28"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4725ed8e2621879b6196059ff5541d2366a5e8ad9e8a025ffca7c337beecf15a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1745e1a878d31a9a1f1232e169e29307f331f81710689a515dacaec29a5bcdfb"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"bd77f47cdb617dfb3c8fb9e4b60445d970a59e6a87903e3621e2942b7681883b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"03cd530087c68ef3c1192b3affce61ffa4b0f122fc9e9f97cc09af767e188b39"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"643749905a131510967312a604efd7d86ad95dc9bd6f7d9db57724805b660956"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"48d548741f4afa464e2f9f37ddb9885b0af1f367cebba53f7486c3aa67a5e28b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e4aa25c9ccb61a5ae64e776585eb5d4f9851d9012a3e2c1f7e5904e659308642"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"009ace47e9da39b09e6d3ec5e30f7d0e6f219ab4b179a0a361cf60ce6a549bae"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a34178fa13c0168fa7d4d1cfd801e9e23ce47a7a2fa2a9b56b508f6c45d28030"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ae5f5671a502cf5a0bfa9a7acaf1ed9ffa9ad8bb1fdaa60f669303fc9aa2ad6d"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2845b2402dec4e07bf56cb2b031c78086a51444c6521de871d0c32815c7e5a6a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6ac2abf1f619bb751e3363648f51ae1fec8f8e690bdd5945e4c99dadc13669f5"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b4746b2d10e50510ebebe99aaa9d95405ab638a1093a6fb145aa1129db081398"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"559b0c57d3f30253aeee13a80ba3d7617a10795aca0e49589830ea6bba519f6a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d760427d39d175c61e30150c12bca42bc0622dd3c15ccd4241a10928b551b6a2"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9ba36eec8428a69f4ff10a45b912535c27052a8405afbfea56730610301cbb16"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5ea0747fd9c06807630133f6a09e3db31ae71b15e43a162533783cfb77778a8f"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16df27a8f0b49acc5e6936dd70478207e92b0af2eabfbb0d2b3b5f9eaa171f50"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21d556a0ed89e4f5e5f6f263a662bea89d337284533332616a4c49a242373a9a"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76a25e57e1fbf98108dc50610818f33b076c1ac2582e6c4550b2eaf375c6d1b4"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a7890816c2f7cb073c486a584be95e1761bdddb3e1ac9f5aae0ee9c463d8779"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b09033291b219c3ca339924855cbca8ed205c76d49e7a12d7d0c2daa8c57e4b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4ddcbc11d347b663ac348018ed8bac47a98668038c34c5f81a995713847e9c7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5f8c00fa1133892eaa367cc05e27b77f26e9ae303b54f5c34f626cd2987d0d6"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f668f05432673b8c2ef41b31f89c7ad8059520bb46f0e8293e8d1004636a80d3"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9656dc76abba4ba5751a4f6e4154d074def8a6b45abc66b15d46b4c1c7212f5b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8073d2d751cbb34ff8e54d07199068b2910c9155f3e30bf79f1a17be947776f7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b83bf8aeb66e6448b239a7d7ac6b98e15add853ed95d7b43b1e73d2f0e6bca13"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5d41b1f4b87653695762b938c26b690e50fc8b944022f3b97e08d240bcd8e1f"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0260d8df8b89f1a4dd4a058387b6ecee4d4182a8c34a3dbc7e41a8f0b58b8c4"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b08fcd28b167444fa41eab821e4ce5962c56b37adabce2ea50bc13352559509b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef92be231f47442b5eaf87c83a992e1856274376c67f24f24347926f21230f11"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5f209375c2a1d015e30ea1ffc8d1bc6d61c49519c780cf8d8cb2433eae64bc7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df275b0846f5ed7aa2e1da56e7985f38605a1160f2374266c05f1d41e672a524"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6790d6fb56cb0b73f730218657bcb498f1751fc9e97a3236eaa2f491cfc654fe"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf8693e96b86cd9e3618bafdbca382ce15542735855f60bc65339325f20b9489"},"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"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10f5a60100cae681f0733a8f321793c4359331e89e66e4432945e5fa97265abe"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24d8429110de5e9910ff01a858a1557ad9b1a694289b0f1c100a4dbef75cc7aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"738e617d76ed69c3d32ea94146671e1152dc90f0c693df89eaef95bdb81a122f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aed94526dccf46d82e8880be48849f414ba83d5ab83568609a2ec23790f80257"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38f14cd52896f1ce1b036ce6c8e41b2c10b321119c3933f5223eb6344b1e1dc2"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b6ff392c7a614d0b0c8a25200b61a0687ea5a5384b14639463b070c8cf2fb0e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb69d21c372999d5f14dc85be7c1d91787eab1ba10b4feb11f17285a30508d07"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1d3e6ae6e7ca1f0bf034d1d70577c5b4aa9f524b0caabc07e4044213a3ac9d5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce7f3374f30fa2e420c0877828c7ad00e23d3a8407797b693e5ebca5d6a3a5c3"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"564d7148d7097d39e8f9d4c571d9e84c530a9e6e30d4f6cbb65b9b7181e5ccd5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f3eaa83c1b2cc9bf37672646fa93a9271b301b79bd073996aaf9f8c1d13b708"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cc44a0b25de579f36464c7eefc318dae3e17d219c0ab2c723860878bcdfa113"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"873d0105dd081c6e7bfa654152d5fe77ed2001f2544719b338459dab2aeccb43"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7e33f86d350e15d7fa6071ea56753662ae992929eb4fda88d6925de909eb4de"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09c6f3dd70c79a3589d6d51cf0391a1296a9fdb3f717ae69e89f56d3a95413f9"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"610dfb79191965de7297512cadf7be161337e469414cadb8db8d455cc245e95b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c606e821bd56191b0d3f96552d4f34cb2adce807ac4c005769663284cd4e8157"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49d7165b81668f7fb7525758f012a022aee62dfac00c0381758c4e55c043056b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55d843bb4b8a423de96fb11726c99fc0e8b7fac521aed904e37f2b3423de38b5"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76add21cb2cfc110bc77356adfd216c0ff7d26eb679524b2e186c0afe295c20a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38cf334f06de9962ee66b71b45efbc471797cf0a95ae099807a850892fb3972a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd684293889b08844c6aab7cfb4d81d0eab555c621aee4e072132fac9ec9e906"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8b442353b1c9b3021047002a7cd7c1752c92d75c1d081dafe9968810fe8c0d3"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8dcb57f02817eae0687cc7f2255ae31a8d7c9f810b2d146cbed65c78ccad3c6"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78d75b855d9b60e0c03b402b9ca7d8de60805519b871668838a9b9b6076057b1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53fe7f512c388f465652a7e7eb025bc65b2be0b3fd9ba1d8bf29f29013aeed12"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b5724bce0df0e11da12627301905f2437edcd8d124f97cedde6e7a442eb2543"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5b4ed322c79b18e3d2e8353c319c6874a96a32f75ef77bb3db1e87173936a34"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f2e20a2153d97c2f3821183382e36d55d8c1bb97fc3eca175855a0b8b682232"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c162059642ab51a5d26af54de35c268a4b079d50e46565b335691af169e249a9"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26fefa14997ffe0058b96f4f049d55348418f159fe3600948e0087b6205c137f"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a375f1982a046e0457b67be787ab5d03fceab8ffdf9a210204c800984feba5bf"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e1ddde6c68538a0b3fe157ee8308189968e3066f08efb6e58d77ba0f65f22ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dc6f2235c0aa3dec726ec95a20a8f0c7344c46ee5045e3e0fd4bb7c073834f4"}},{"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":"dec54745455623bac931526b0651315859a0086be8bf5d06c0c1561f16f69f98"}},{"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":"e9741b5b981006c17e1aef203555ab1571631136fde2453b6b33b25a74dfefef"}},{"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":"526fb26c747fa01d0d75f2ae281efc7fa1e8b0af77725e920fc503fae5ce938b"}},{"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":"0a769741f12fcefc2136dd5a7adcc55aef9d001769e5e187d923dc46b4271e59"}},{"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":"9bd8d9c1fda53f676740338661305c4049ea14ef8fdeb435ea6bad6061f68ec4"}},{"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":"5d0f3ffa5e1fd7c0abf30c0ec2cc78cf37979ab76cbd5da3b035e1f3d75cdb78"}},{"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":"d97e45fb17c6d83360a9926cb7f8e764265ef75702eb519a3c0b6c8895fcd601"}},{"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":"c3a395939645b1f381ed166f5d3fb48fac51c7c8f889e6b8d8f0cdb15f417465"}},{"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":"53202d35111b52b9da8058c00b7ad3017c551e1525c108306957cf2e04140c34"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: up2k.js \u2194 w.hash.js: \u0060copyparty/web/up2k.js\u0060 and \u0060copyparty/web/w.hash.js\u0060 change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). Neither file is a module \u2014 they declare no import/export and are loaded together into one shared scope by a script tag or a bundle \u2014 so there is no dependency edge that COULD be declared between them, and this pass cannot tell a real relationship from a coincidence of release. Read the pair before acting: if one defines what the other uses through the shared global, that is the coupling, and making it explicit (a module boundary, or one named object they both go through) is what removes it; if they duplicate structure, extract the common part; if neither holds, the co-change is incidental and there is nothing to do. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006049c71247\u0060 fix errorhandling for browser-oom; \u0060499ae1c7\u0060 other minor html-escaping fixes; \u00605ca8f070\u0060 up2k.js: detect broken webworkers; \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c1be3d089194c11b0769939e13493e35fc17b0ab91ae662ce7db555c415507"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: broker_mpw.py \u2194 broker_thr.py: \u0060copyparty/broker_mpw.py\u0060 and \u0060copyparty/broker_thr.py\u0060 change together 76% of the time (13 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00604e75534e\u0060 optimize BrokerThr, 7x faster:; \u0060b5405174\u0060 add login sessions; \u00600006f933\u0060 hmac uploader-ip when avoiding filename collisions \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/broker_mpw.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea90c542dad3d2a5aa08debd64ff2fff0f5bf649a695b61dbd691b426f3b308b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: star.py \u2194 szip.py: \u0060copyparty/star.py\u0060 and \u0060copyparty/szip.py\u0060 change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00605919607a\u0060 sanitize fs-paths in archive error summary; \u00602b24c50e\u0060 add option \u0060--iobuf\u0060 (file r/w buffersize):; \u006076769618\u0060 add ?tar=gz, ?tar=bz2, ?tar=xz with optional level; defaults are ?tar\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/star.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b650def025e7687e3c70f169cb393c4d0734ecf0408ed3a17af011baf81a15e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: broker_mp.py \u2194 broker_thr.py: \u0060copyparty/broker_mp.py\u0060 and \u0060copyparty/broker_thr.py\u0060 change together 71% of the time (12 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00601afe48b8\u0060 thumbs: fix th=x on non-jxl-capable servers;; \u0060c6965f06\u0060 add optional update-checker (#1315); \u00604e75534e\u0060 optimize BrokerThr, 7x faster: \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/broker_mp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dade468184f245231e4282f1f612196d82973f0f6af87284598d3456b28b3f4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: __main__.py \u2194 ssdp.py: \u0060copyparty/__main__.py\u0060 and \u0060copyparty/ssdp.py\u0060 change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00601e7697b5\u0060 misc cleanup;; \u006007b2bf11\u0060 better support for 700\u002B connections; \u006018c763ac\u0060 smb: upgrade to impacket 0.11, full user account support, permissions\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/__main__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1cb840f2d2c4a2e5b17deeccb8c6124f3257aa6cb6ccb953303a9e2868f408"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ftpd.py \u2194 tftpd.py: \u0060copyparty/ftpd.py\u0060 and \u0060copyparty/tftpd.py\u0060 change together 62% of the time (16 of the 26 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u0060beb634dc\u0060 support .hidden file for dotfiles exclusion (#1351); \u0060c17c3be0\u0060 wo_up_readme according to volflags;; \u006087a5c22a\u0060 per-protocol ip binds; closes #1176 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/ftpd.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b98ccd6271ac76c24485547c1bd9aae8509be661794d3a751dbcf85c2936f89"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: __main__.py \u2194 multicast.py: \u0060copyparty/__main__.py\u0060 and \u0060copyparty/multicast.py\u0060 change together 57% of the time (13 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u006054caf63f\u0060 optimize; \u0060b377791b\u0060 support cidr notation for \u0060--xff-src\u0060, \u0060--ipa\u0060, \u0060--*-ipa\u0060; \u0060f8e3e87a\u0060 add event hooks \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/__main__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d55cfdfe7fb54ecebc08f131486c38fd0dbd6c7f3f3e9636195d72b7fb71d7c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: browser.js \u2194 util.js: \u0060copyparty/web/browser.js\u0060 and \u0060copyparty/web/util.js\u0060 change together 53% of the time (147 of the 275 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). Neither file is a module \u2014 they declare no import/export and are loaded together into one shared scope by a script tag or a bundle \u2014 so there is no dependency edge that COULD be declared between them, and this pass cannot tell a real relationship from a coincidence of release. Read the pair before acting: if one defines what the other uses through the shared global, that is the coupling, and making it explicit (a module boundary, or one named object they both go through) is what removes it; if they duplicate structure, extract the common part; if neither holds, the co-change is incidental and there is nothing to do. You can check this without leaving the row: of the 147 shared commits counted here, the most recent 3 are \u0060f19ef033\u0060 up2k: u2sz: allow 1 as max \u002B detect http413; \u0060d33d1132\u0060 fix directory sort-order (closes #1119) (#1528);; \u006043773f2c\u0060 filesize units 6/7; closes #1389 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a93f107e1ce0a6bb2c4ea73ffd7fec79ca23ff6390fb2e40fa29667e471140"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mdns.py \u2194 ssdp.py: \u0060copyparty/mdns.py\u0060 and \u0060copyparty/ssdp.py\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060760ff2db\u0060 other linter nitpicks (not actually bugs); \u006007b2bf11\u0060 better support for 700\u002B connections; \u006060a1ff0f\u0060 macos: mute select() noise on wake from suspend \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/mdns.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"173c9813de03d766b5e8d36a841178611eac0b064f764dad04e78deefa9784ff"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/meadup.js"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"93433d041fa51a392568c437a7d23da189613313dc3703bc2aca4f41d8b193e5"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"af940f120ea8fde9955f0c756cd54951f6dafb4ddd1b49726d2d4b2bcb284079"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"2615fb014dbb0bf8cf6f136a4920652a14c1c797a722d1743d0c822bdb641a76"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b0d760940396b0cf65fd5261b3560951dc083f713446ebd867d4cc59a010fc"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"164f271e8769dfa891b88037edcde27df9d4d0278b1f75f72a827aeb83fb7556"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec951ff274bcb584954b2187c57411221088d7de90ee3d00bc9478dd1c4ac39f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14e73a94fb691a85dea8fd50531789c693898f7c13257829592cd3f43363aa1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fe2b19be49aeee96cbec4bc898c1bafdc0cb630be00db2b3827cc4eb7e9315"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0006fc5046a4ee904c389c5720ee3332afa4e2960d19a3a895997608a4a068"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"2527e1ef2a0943409729745b23bdc8200b0b9f878f4153eaa4baab0f25680eff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc66ad5599f9715ed4f4719643365a3bbc675359c8decf7c11f302976ad8978"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"914eb110a2a397cae13dc46937a5ae356fdc639247ebbd4beee2384f41d69ae5"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a99747866793b646f99ff9b11ffe4c2325f744051079495338bedeee1498858"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"831935f93463c2675faf093e741a0c3215c10692389a703607e910f734cc0c24"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f08ec08a6c1b2154e533a02cf4dea6398c72d4e62833a230d1222a412e97c0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3201fb01f4d90dc706a6e708e098bb3928f8a44f28d0562723df30b9afe03c0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4329}}}],"partialFingerprints":{"codehealthFindingId/v1":"797f81f63e95ed5a614c0fb198a843e3fc3321b83b95dfc73026dad85340ccae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09657e99c1a576723ca79c3527041407af0306bfc7e3c7ebe7cca992a8a7573"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7f95707169e95f1039f99dd75bd3f38dd6a247b91350ffa0267d24868331f5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4941e5971b8444f55cbda5152e0e4148413cff1f1b143fa8c708edae9c3dda"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5519}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d9dff0734eecd0cd3577c3af6eda17fdb8950b9ba2b897cc81df190b7880b8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6544}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35b4556f029c4a4375412047df773919f120385191697ceabb68eb45c2b213c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8933}}}],"partialFingerprints":{"codehealthFindingId/v1":"987e14ba2be1f6432a5b58b1e258f45681123a25c422e6c95bbe1bf4abf69645"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8934}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84f23a206a2940e01670c0f1ab744a730829e70a1aa27c073c7c3946af719b6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9793}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb74826e9a9caf3be90dbcbf0e77810b879f42b131ec81f8ceae42d274b452a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9798}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9705845e4ff0e2bb5032488e15d6f8befeac40ceecfd6c4fa2998943b43a1d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser2.html"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec092d2901b050f719239b202e218937441dad1fe8b3ef695924af000d5620f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.html"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3f9fd6e8eb67e3fbf8fdbaa8c51fa41cf63e3497ddfbdfbb5b63f477a0a37d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.html"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47c876334f91049b5de11fa6876f2063f9ebd7db783979b68bb962b0a2d2a2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/rups.html"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb385f9f7f8abfd70928286b152053312c242a5764745c677ac8c022ae34780"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/splash.html"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a6f45ea4f3de3e0ba07f9dd89b836c19b516761f4414bf5dfc2601e4f92804"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/splash.html"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1a4eaf7ab52e3e84e66c0e78f413ba142063e4fbd14a3b361b8caae7c883a4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/splash.html"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd259c36a8eddd6ee0990b28cc497d93166a7f98c7adb17022af982b5495571d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/splash.html"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1353d45a96e197a489ae7fcbbb3a2c1b92f5cb29f3b36a38d32cc26de56553f0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a43f45109a69e1f5b2d5019f31b3c3707954e61607dd55d92caecda3091f5e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"348a0c3f2d2430a7e40746edaf3bb8f43e875320286ea3336194f85972ab8699"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9a5c022bba63b001568e53157d1e642321389d2e6ac600ccd0045212e5c164"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ceditable.html"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffef69a52f09cf0265d02b71f58b46a37241f850acbe6c7547cab13ee7655ca5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ping.html"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a074d59fc2b05109ac0e45e9947d874dbdb949aab3fe4f8439d8d5007570f7a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ping.html"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fbdcae87f218abe26a760c60339c6682c99f7ffabdc522fa1e18aa9b5d4b68"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"79223fd2c76f67febb49ed023f2e8d00bd549071a7b89bb6712ddeb28da111e8"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3036b11dc1535a27c926a9fd593292f7bf6f5085d5b9e3d953b74648935fb0b2"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c876fc283554c70f27bdc373094b4304d0fa67301eb48713bdf307314601ae"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9333}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38764136b1fa134ebf768ca780563c2165be00ee621b8eba0b7c7652158e15f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9333}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc25ed5e114a7171ffb5f69dd3433d7bf8f7e2c30347fa674e48a74d59142339"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"530a65f185657ace306a47c36310b04f10f9847026584fdcc2f7ab4e39556004"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f82b1d58629bc04767386871067b5912903636a5f5b443f14a08ec609efb74"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1a0479daea6112a7daaa617a8fd3bde11e56e1bd27401d8f8cc3d8329f86c6"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e612fecbafe1eff175ac34b7faee4420e90e358c850fdbac6294c4a6d6f995f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c89fcfb22fb4ce4fb756ed3dc8ab3a4006886436a72db4b25cd214aac352c8"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f09b3441e373398ffd81db017a8c97e709b052ffefd95af5c47e1c22166bd96"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c35ed7dcd68166f9339804e37cc3af7bb7cf8896a8fef0ec8b95ba394c7d4b"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6556}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8dc76aa6c2c07c8628a36ccb5aa1096e4d1e8f2f1c5759ab54b8870c35668a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9485}}}],"partialFingerprints":{"codehealthFindingId/v1":"072c0a0f6b43e9b260dddb3fa9d33a11bce652d9fe90e07d1a7388409d825b62"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser2.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeaaa6da94246f19841bedda4b375fc2cc63ff10af09a8dae2941687e533bb1"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/cf.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cb63732e4d0d6f8fdda6c76d589c85df5cd3b2b0b88ece9ce4667b80506832"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/idp.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"974dbf2a8384f2db0497e46852a06bc6a385a6f0333e1446fcec964603719b1f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba316bfefb00c60b09df7634464ea1e27166debc6818e3f8728a30fd4c94d4d"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/mde.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd581c4531df7a4addc50aac3111e1e33f08c1e31572c21134159e50e028d6bb"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/msg.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cb4a8479e41e3190ef4857533425d59c9519db9d261cd1862e74fef48de307"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/rups.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"443b8af4ff795b03cc47fe042b144f9a8d9c935f206787290f70782162969201"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/shares.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ede55edfe09bb7eb723bc9de7cadcc7e27fb47d6945f8758a32f46c142ba53"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/splash.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e6b5b06b946367940449e5691ffb623c858fc2ef18bbb816e744fc643d7fcd"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/splash.html"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4410f6b2a265d76ed35df41c66e672a2fdd7d29a5b42388bf7aee556be97558e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/svcs.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"85559b88d77d437772aed4b2619d52457737d92481914b504d0b1286a6651276"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04e4f9a2c09daaa97843c1624ee761b8c7dd9f4b2384f7d5791908f76b0207c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/wopi.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b533effe3d5742ebcee61119de6ad774074adeec694963ecac4113f82cf409bc"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Ciframe\u003E without a title: An iframe with no title (or an empty one) is announced only as \u0022frame\u0022. Add a non-empty title describing its content, or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/wopi.html"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d87248d8737e7bb18ce9841850d8f87e4ba0174270bf5fe716612e00b7ad39"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ceditable.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5482aa35eeda8364de22e62295f838ff2d86bb5a667f493765229a5c008184f3"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ceditable.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0ddd5a63e60d400dd0eeac864f66a66f84cb50d121415ef7c69543918b5fe2"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ceditable.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"615eb13cddb863973710e5f6a2ae019299a1d3e7dbf640d2dc0b0f227b483a07"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ping.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e285150a77613429d382009ac494ccea35db2a647de99069b67a4e44745d575c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ping.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58eea3b24aab51021b12d50045077f3fa4e92df99bb693b8b999070a35b60d4"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ping.html"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fc798005cbe2bddb1ea09b5061d70496b23bcbe1d783a84cca104f85b4fe96"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ping.html"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"337ab7d18e62220be97b51845a3dfcf6ffc4e294c1d335a096cb43bd9f89318c"}},{"ruleId":"AC4","level":"warning","message":{"text":"Link used as a button (placeholder href): An \u003Ca href=\u0022#\u0022\u003E (or javascript:) with a click handler is a button dressed as a link \u2014 it announces the wrong role and stops working without JS. Use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/minimal-up2k.html"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee70d8deadde30a54783be4b932be0b2aa9b46bddc0fc6818e5b10c4f403101"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: outline:none/0 with no :focus rule in the same stylesheet removes the focus ring. Provide a visible :focus / :focus-visible style."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"srv/ceditable.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ac3f90f9d3d3f9bfea1108785a26dce0e3298f4f78a5b8c6b6d0dae6c97092"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 28 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it\u0027s spread across several top-level directories, so there\u0027s no one place that says \u0027this is the product\u0027."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"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 \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 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":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 44 plain JS \u2014 the untyped files are contrib/plugins/banner.js, contrib/plugins/graft-thumbs.js, contrib/plugins/meadup.js, contrib/plugins/minimal-up2k.js, contrib/plugins/quickmove.js, contrib/plugins/rave.js (\u002B38 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2 locations): copyparty/web/md2.js:351 \u00B7 copyparty/web/mde.js:112 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b8a658d75d02b73c9ecde0d364ddaf9e987fc62644af487426023a449564ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): copyparty/web/browser.js:4654 \u00B7 copyparty/web/browser.js:4705 \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":"copyparty/web/browser.js"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89b73d36e8f36683aeea47e5cf1e2ddc7f906858335132302bf31f4db89d25b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): copyparty/web/md2.js:423 \u00B7 copyparty/web/mde.js:178 \u2014 the two spans are one implementation copied and then locally edited \u2014 143 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5355a95d2bbeb1817e5941d2999394d73553fd3ef06699f6d6ff664c475c6c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): copyparty/web/browser.js:3094 \u00B7 copyparty/web/browser.js:3119 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb6516e2619d8f7c6f45bd54c89fd2ad1a3763c09aa9675288879e2a3b3fe4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): copyparty/web/browser.js:4682 \u00B7 copyparty/web/browser.js:4742 \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":"copyparty/web/browser.js"},"region":{"startLine":4682}}}],"partialFingerprints":{"codehealthFindingId/v1":"8410ffbe56f635c76d639ed5d4429d4d8cacd986f1c352c208a10f0776feb4e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): copyparty/web/md2.js:549 \u00B7 copyparty/web/md2.js:566 \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":"copyparty/web/md2.js"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"686156690d4c5e712af0a9e64b1bf93e0391633650dacd8c353860248cc38052"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): copyparty/web/md2.js:701 \u00B7 copyparty/web/md2.js:734 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef8bd7a5bf72b4b8568a082ff5ec20a1febe900fac39c94fc261a4da98ed83e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): copyparty/web/util.js:610 \u00B7 copyparty/web/util.js:623 \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":"copyparty/web/util.js"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfbd1ddb122914f0f4550a35d49e3e3a02814db8698dc87415dbb047fc7d897"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): copyparty/web/browser.js:9638 \u00B7 copyparty/web/up2k.js:1633 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9638}}}],"partialFingerprints":{"codehealthFindingId/v1":"637b8510806968fd6f6cff2cadfbfe12a3f0d928fdb2fa27e400a188d31d4ea4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): copyparty/web/up2k.js:397 \u00B7 copyparty/web/up2k.js:2000 \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":"copyparty/web/up2k.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"739f1a62b94d46d5f370e4f34b0e53daf48c945d2d4cca52ad77e022b85c9941"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): copyparty/web/up2k.js:2290 \u00B7 copyparty/web/up2k.js:2467 \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":"copyparty/web/up2k.js"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9da8557895b0dec58de8421fc4f975b5649e39386078ee0eec517376f7cab4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): copyparty/web/browser.js:3879 \u00B7 copyparty/web/browser.js:3894 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d9150776046aaf71daa50e07f75ce33e3eed23b55e9dceffe91b3239245e12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): copyparty/web/browser.js:9225 \u00B7 copyparty/web/md.js:205 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":9225}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d07a60ecff257d34b04a9f265a72cfd9d0591fb06920fe4d61a5eb5e011d37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): copyparty/web/up2k.js:2306 \u00B7 copyparty/web/w.hash.js:103 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c311711ce1ecfa2c3dc1ea8f28748ae32566e1519e978508b5589616401a7781"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): copyparty/web/util.js:1473 \u00B7 copyparty/web/util.js:1533 \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":"copyparty/web/util.js"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a337c1f67b96e747d5494597d62949dc902b03082fa0a5dbdfc773ea0e7a419f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): copyparty/web/baguettebox.js:673 \u00B7 copyparty/web/baguettebox.js:698 \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":"copyparty/web/baguettebox.js"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"8282ada2e80c14d34c5db1253f56487f9c5c878da2e244567b2820bd470d580c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): copyparty/web/browser.js:1333 \u00B7 copyparty/web/browser.js:3702 \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":"copyparty/web/browser.js"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70daf521abde826c38ff00e820a5f309c8193aeaf59d23b0cd9dff2aad8ff84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): copyparty/web/svcs.js:62 \u00B7 copyparty/web/svcs.js:78 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/svcs.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a039283db7b14f269aad71dd6b9d5a3eeb9b5f4441a911b1673664c86b34fb58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): copyparty/web/browser.js:3188 \u00B7 copyparty/web/browser.js:3200 \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":"copyparty/web/browser.js"},"region":{"startLine":3188}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e30dbf4ee7fabbfd56dde66e6a5f33df96e58db8b24063aaff2e3b17e1547d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): copyparty/web/browser.js:4423 \u00B7 copyparty/web/util.js:2115 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c42fda01abd8d0aafdf7f110ac605ddbf9d0f0a40a65434bc704b727e2e7efc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): copyparty/web/browser.js:4609 \u00B7 copyparty/web/browser.js:4892 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":4609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f487c64a429c36837419f8cb2f025163c2788bd0eddc992ca0820ae5fabb0cac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): copyparty/web/browser.js:6025 \u00B7 copyparty/web/browser.js:6035 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6025}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbe2df31531b44cb72fedb6f988a7c8ebdf8ece15aa1420cbe7293282fe6aff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): copyparty/web/md2.js:416 \u00B7 copyparty/web/mde.js:118 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"885e6e5bf7b4b2a90a288f276ffc2c2dbf3835a219ccbf12898a2c054c7eaf3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): copyparty/web/util.js:1047 \u00B7 copyparty/web/util.js:1055 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffddd2371da2d195aa1a042139d56ad4000cf2472d48a7f2984cf1e00b72058"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): copyparty/web/util.js:1081 \u00B7 copyparty/web/util.js:1089 \u00B7 copyparty/web/util.js:1097 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaf5d66c877cce44a8b43cb59fae11a6e466cbb084f533d1bdde8c29dc66610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): copyparty/web/baguettebox.js:408 \u00B7 copyparty/web/browser.js:6258 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea67b79d4285fb26ed23da7cfc16fb7b519e709c5ae232d5d0a79bddcddb998"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): copyparty/web/baguettebox.js:660 \u00B7 copyparty/web/baguettebox.js:667 \u00B7 copyparty/web/baguettebox.js:685 \u00B7 copyparty/web/baguettebox.js:692 \u00B7 \u002B1 more site(s) not listed \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d7e28c381bbf25d455b40ba7b003ac986bae741edaaeba7b130fd5042578b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): copyparty/web/browser.js:2607 \u00B7 copyparty/web/browser.js:2618 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eca0f3a108d65da3cbf9a282003c4e562dd8ee45a141662f8c7d0e26e0abe74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): copyparty/web/browser.js:6262 \u00B7 copyparty/web/md2.js:993 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e437d49a9e65e92ac264d9bc2bf9745d17f21560f186c97bce1296ffd3a206b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): copyparty/web/up2k.js:1374 \u00B7 copyparty/web/up2k.js:1386 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b2f68f14695e547ee7a15d59107f9c04e99de669862757e23dcec41b19b73c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): copyparty/web/up2k.js:2244 \u00B7 copyparty/web/up2k.js:3056 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4a6ffb2ac88ed6afecaec8c8bd7e3a6a86433e4b99aee0227f657a64294e6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): copyparty/web/util.js:1853 \u00B7 copyparty/web/util.js:1860 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5e32cff1cfc3884a149ba4f827b0052592cb2c627d25f01c86b03be5b26cf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): copyparty/web/browser.js:9934 \u00B7 copyparty/web/browser.js:9939 \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":"copyparty/web/browser.js"},"region":{"startLine":9934}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab7c5a527b52de987cb23e017df6b0b994e5a78b2f631089ed25dc19ce27f9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): copyparty/web/md2.js:263 \u00B7 copyparty/web/md2.js:415 \u00B7 copyparty/web/mde.js:170 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"91432885dc7ed0b027c3d15570967c791ca10e1955b2fb4dacbdb53efe91a11d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ahotkeys (cyclomatic 136, cognitive 164): ahotkeys has cyclomatic complexity 136 and cognitive complexity 164; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":6248}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f9d673f2c9e19360cc543b34501dcbb41ceb8f07711d03a29c3f9b4cf91e6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function taskerd (cyclomatic 74, cognitive 132): taskerd has cyclomatic complexity 74 and cognitive complexity 132; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"b037da53ebf2a7705cf4c505953e7192d6e028871b90345b7b2519ef45a36b4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orz (cyclomatic 68, cognitive 150): orz has cyclomatic complexity 68 and cognitive complexity 150; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e80b48fcbddfd3fc5fa6279fae3f9da4d0a8f1a0153a35784ec4a2e81043fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recvls (cyclomatic 51, cognitive 60): recvls has cyclomatic complexity 51 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7501}}}],"partialFingerprints":{"codehealthFindingId/v1":"783a054b082b65888c4471196be6a677f521c260f66b555465670a38f6f1283f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyDownHandler (cyclomatic 50, cognitive 46): keyDownHandler has cyclomatic complexity 50 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ccdabc0e440a98d9c464f042275558494a28668114d68881c54c79492757b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gentab (cyclomatic 44, cognitive 83): gentab has cyclomatic complexity 44 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":7654}}}],"partialFingerprints":{"codehealthFindingId/v1":"194bae9be013a28f9aa4d7446d6253009b4283b31e7f92902caa6302eaea14e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawbuf (cyclomatic 41, cognitive 41): drawbuf has cyclomatic complexity 41 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"313005804561ca89ce6300bd99f7a98071a438e2a8eaf2418a3edb902a5097c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadgrid (cyclomatic 40, cognitive 75): loadgrid has cyclomatic complexity 40 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":5840}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c358df8663ba83ea8f3bdb589ab01925dc37814910224d18249402bd1b379b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convert_markdown (cyclomatic 37, cognitive 53): convert_markdown has cyclomatic complexity 37 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"71019d179c2651a955ae1a2716e545d50cb834d82408991278f2207ce19f56e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function etafun (cyclomatic 37, cognitive 45): etafun has cyclomatic complexity 37 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ca656fa8ec507ba4873aaf9259ab138a1c816d7d3a1b0ef72586857e0d782e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updater_impl (cyclomatic 35, cognitive 54): updater_impl has cyclomatic complexity 35 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c1eb36edd6dd754b98eba8b2403c48ae24fd4d32adc9fa3374805057ec8962"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply_perms (cyclomatic 35, cognitive 40): apply_perms has cyclomatic complexity 35 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":8064}}}],"partialFingerprints":{"codehealthFindingId/v1":"49df67c702ef6be79cd50d4d8503f0453953e3d46620d643186ccf08a181e222"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keydown (cyclomatic 34, cognitive 54): keydown has cyclomatic complexity 34 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab334e5ba86f730013d042d96ce648107ac78bae1f835280dd6aa2da42ad2567"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function play (cyclomatic 32, cognitive 42): play has cyclomatic complexity 32 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa50ddaa9fc198d4ecf5c0ecb74bfdfa55f8c9465c171b35a12c6879cd6d8b97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function up_them (cyclomatic 30, cognitive 49): up_them has cyclomatic complexity 30 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/up2k.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"121353b94e41a1135337a94b63306181767c42d9639f589a7d4a29d3eda0cbc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vis_exh (cyclomatic 30, cognitive 35): vis_exh has cyclomatic complexity 30 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac6996757489b38bd20f52d679bd8e718f594b327925875b6d8ae2637123b50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fmt_table2 (cyclomatic 28, cognitive 52): fmt_table2 has cyclomatic complexity 28 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaa5af808a2660c2dfd01b55e573d6ce11cf884c26abc4ffe44ae1d1bfa2f18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 28, cognitive 30): apply has cyclomatic complexity 28 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae829af67d05ee67e13ab930454cda78de78abf1da260a374967ec8afa4ada21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function a_up2k_namefilter (cyclomatic 26, cognitive 74): a_up2k_namefilter has cyclomatic complexity 26 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/up2k-hook-ytid.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fae215458a2dc9fe8b78bd43c81ee347e4e3e1403c1928374ebbee3d48df52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dive (cyclomatic 26, cognitive 64): dive has cyclomatic complexity 26 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/browser.js"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"987e49c1db1a133db369b0acb47cd611d324dd94a6c36c694d70239545bf6361"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 29 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: copyparty/web/browser.js (8702), copyparty/web/up2k.js (2990), copyparty/web/util.js (1995), copyparty/web/baguettebox.js (1196), copyparty/web/md2.js (1019), copyparty/web/tl/cze.js (670) (\u002B23 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"ruleId":"R4","level":"warning","message":{"text":"Test Coverage: 0% of 44 production file(s) reachable from 0 test file(s) via the import graph \u2014 \u0027production\u0027 here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace\u0027s file count"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"64e0e3511eb969fb4720b196e7d3799e1714077217351c3c56a27b50e3e21220"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2434 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb5a0e46b0bd01df95395fa34e5770f4b04411aed22ec6f42d17d8bb44fe747"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1412 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/baguettebox.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c89640e984d167778b14d97969ac39c656cf095f6a437cfe3fffb7b2a071f7b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1238 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"547f4a4c588e92d3d1e7d818bc326ac05b3c3a81ecd9cf00757c77c669b4a1de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~756 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/vie.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"293e565365c22bb1bccffc936b3fe3d2d813e0e06d38abea977acad24efd1d00"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~734 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/cze.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cef33f2cca1b49f30adfada7727d3354f5f9c25b80fd543a6903f1d5df3433"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~733 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/pol.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9311300d67e09fed8a19cf1ce0ff4f5476b9ec61ea8f834104ac5e2a67a29b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~731 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/chi.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da95151e28d108361ff001d766602e2616a4f846968ae2b7afd2736e16ce25d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~731 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/hun.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca27ffec31aa745b0b7916e616e0e6e59d877d2aad2267caf7c319c8d737ec3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/deu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d7f6bad1ac3df10dd0cb1a71248cb5e71142c2090e5ac73ec7bc9736ca290"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/epo.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aa1e2ad65533d1b39df1f885b9e9d0244e98bb969864d7a46c02568ca1413d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/fin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff7330f59ad249743b6091a4e98b8cc6014d749dde7e42fa1163eddc765d4a2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/fra.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a081953588af363e74a58236e80f74db3d351bcb5cdb146519cee69b8135e6b8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/grc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8563629f5decd1c7176353a763faad05015dd4bb66576a1b71cace4d24b8bda3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/ita.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"030307b682312119cfb76474a4fc93fb947f558d1b795434b511074a37afbdd8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/jpn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5946a72d994cc7dc812c14676da522256e0b52c4621c860e725a4d5cad103eba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/kor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"495cb51813aaf46acc052905c36b18c6b956b2fb6477faaf9dad1cdb32eaefcc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/nld.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd191360cd60106fa6fe4c9f6b972f8950b0c2125d6009cb4258fd203ae260ba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/por.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d89dd97df4f63f08b7d18e667fb22df19447d570585e7b72c5ec9e2e20c590c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/rus.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3d3900fdae6b9d3509aeb70eb7f9d1b06a07d2670f504077406521b18c3eb7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/swe.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e697e2796e5c013ee53fde91f469257a944ad5b051ae3b5f159437d75a60b2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~730 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/ukr.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1fa8723b3f0bda5e0101de54ce8e3db31c940c8a266c89dc2968167e86f042"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~729 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/spa.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1e5651f5cc22e1e64ae89eb71f6c321a0bf83d6b0707631b9d54e1ce7fc642"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~727 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/nno.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7c7aca907e56d06eb4029589447dc11f25562f8d39eccec6d38ca00c36be85"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~725 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/tl/tur.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"253da8c0d02a500fd1cc83c706e2fe1abe8a5823a7f0a7e1c4ae93b9912aeb3a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~529 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/md.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad37a87729e57b4ddaa2e48a624eb593fb0a1abc8b2feef659d104dd1637cb3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~506 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/meadup.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"452ab1aa1ab73fa0f7c5c5386db4dbad9b1077bf0cfb7ccfa598a2362c64afc1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~297 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/up2k-hook-ytid.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56a2a0a1ea06a8d1b5c1870a721fe2b3090b80a54063becf39e235b46c04087"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~208 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/rave.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69c0bd18a1795fa7e1942a67fe62f604d5c9ba04385fd046521a6bf77b9c64"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~204 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/mde.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a1e348f3a2945afa8c60e5e427f51ec6207d515c3ab2c78397f473e9b046a5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~140 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/quickmove.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"057cf11d5df30d9530abcc07d67bda86a975f8f12eae91708c7a5f3b828fe2af"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/graft-thumbs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5cf8fd9779f65c72c611ab032c25afa31296461aeb1f71f8078b1a9466e15e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~112 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/svcs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea990e4a67b6f32fd2fb60c3816656c7a746e6135bbd5000b5fa6d1f7bd5441"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~99 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/shares.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3467434f680d0f7b67df2b71b47ce5da828cc6e6380e91a120d5b46c56ffbae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~93 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/banner.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9ebecc03dd6b99cb41a37fa86f0d15e8da04b616ac2db5c4ee0a284d3e1d4e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~79 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/minimal-up2k.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7e8b1a1474f500a4bbafabc001d3fdf86aa6fece49d9772398917ce1fb9460"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~75 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/rups.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38266fe70eaf241bf56de61590ae42d6a89c9bae3ddcb7e6b0614c2ef0f14e82"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~60 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"copyparty/web/dbg-audio.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"421d809ffaaab0fdb6196fb3655f5ecf3a36df072a9db88b445b1318a035a830"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (6 application, 0 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/plugins/up2k-hooks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc06b379c30ce79efddfa0bb02c16d2542812447e3764185454687cc0f2d76e"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: No Content-Security-Policy / X-Frame-Options / X-Content-Type-Options configuration found \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060copyparty.conf\u0060 is committed to this repository and declares the server that serves it, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contrib/nginx/copyparty.conf"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d9851e80376dd6bc4cdf0cdae780d8d2d1f19560d8a26308beea4c780b0731"}}],"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-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"CWE-116","shortDescription":{"text":"CWE-116"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-295","guid":"a706c4e2-1232-8859-ae2e-17aa2d41f8e2","name":"CWE-295","shortDescription":{"text":"CWE-295"},"helpUri":"https://cwe.mitre.org/data/definitions/295.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"CWE-327","shortDescription":{"text":"CWE-327"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"CWE-345","shortDescription":{"text":"CWE-345"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"CWE-611","shortDescription":{"text":"CWE-611"},"helpUri":"https://cwe.mitre.org/data/definitions/611.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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"CWE-95","shortDescription":{"text":"CWE-95"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]}],"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":109,"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."]}]}