{"$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":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"FDBDatacube.nearest_lat_lon_search (cyclomatic 21): FDBDatacube.nearest_lat_lon_search 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 3 of the 7 methods over the threshold \u2014 including the worst \u2014 and 14 of the 23 points over it (61%), 4.7\u00D7 the next-largest file (polytope_feature/datacube/backends/datacube.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc20bff199d9f2ce309824d0ed9b3925ed3013545b7e699327da9cf08a2d68e"}},{"ruleId":"D1","level":"warning","message":{"text":"FDBDatacube.get_fdb_requests (cyclomatic 20): FDBDatacube.get_fdb_requests 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 3 of the 7 methods over the threshold \u2014 including the worst \u2014 and 14 of the 23 points over it (61%), 4.7\u00D7 the next-largest file (polytope_feature/datacube/backends/datacube.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b745ec1b465944893d59d6428bae39b7026823907d1e565ae1350fb273113c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"Datacube._create_axes (cyclomatic 18): Datacube._create_axes 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":"polytope_feature/datacube/backends/datacube.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e93a297b01e6f687ece9f8e056a6352be4d6903a6a6550debe5465607f402b"}},{"ruleId":"D1","level":"warning","message":{"text":"FDBDatacube.__init__ (cyclomatic 18): FDBDatacube.__init__ 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 3 of the 7 methods over the threshold \u2014 including the worst \u2014 and 14 of the 23 points over it (61%), 4.7\u00D7 the next-largest file (polytope_feature/datacube/backends/datacube.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baf0e89904be224f1b82d12024355c32be3660af6878fc635acbb37152d7dbd"}},{"ruleId":"D1","level":"warning","message":{"text":"XArrayDatacube.get (cyclomatic 18): XArrayDatacube.get 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":"polytope_feature/datacube/backends/xarray.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd64aa76c7c16cdf676ec01495c0d5a27070d66fda5040636e62dd5d9af01bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChangeSubHourlyTimeSteps.make_str (cyclomatic 17): TypeChangeSubHourlyTimeSteps.make_str 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":"polytope_feature/datacube/transformations/datacube_type_change/datacube_type_change.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cabe9393576d00c220872e198c10c018b5bdd955ca3292a64f6ec1bb77f086"}},{"ruleId":"D1","level":"warning","message":{"text":"HullSlicer._build_branch (cyclomatic 16): HullSlicer._build_branch 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":"polytope_feature/engine/hullslicer.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbfb29710c7463e085c0969f3eccff3804fb92284558666d0e82f6542e4389a"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.nearest_lat_lon_search (cognitive 58): FDBDatacube.nearest_lat_lon_search has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 8 (23 pts), ternaries 1 (2 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"827b157cb5c55dfa5530b4ddbc2236552c1d96805a05ea0fe76ed1eaf762b81e"}},{"ruleId":"D2","level":"warning","message":{"text":"XArrayDatacube.get (cognitive 53): XArrayDatacube.get has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 6 (19 pts) (nesting depth added 33). 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":"polytope_feature/datacube/backends/xarray.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b289ddfff1b3352e139027a94aac558e1d78244985c7b2a919063fa3ba6c31d6"}},{"ruleId":"D2","level":"warning","message":{"text":"HullSlicer._build_branch (cognitive 47): HullSlicer._build_branch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/engine/hullslicer.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"745d21334fa091f641f118547c8e1cd65fdbc2b5ed5c32a25b50bc3cfd62db7e"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.get_fdb_requests (cognitive 44): FDBDatacube.get_fdb_requests has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (20 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccc2dedb728706c67a9018625314ce2497ad5f619f7d76743cb95aed7fd7121"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.__init__ (cognitive 35): FDBDatacube.__init__ has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cf7459191dd144ddea510f4fbaadfa47308590c9ceece1ebf6545cd81acc52"}},{"ruleId":"D2","level":"warning","message":{"text":"XArrayDatacube.__init__ (cognitive 29): XArrayDatacube.__init__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 6 (11 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":"polytope_feature/datacube/backends/xarray.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d07440e42b411518f9804afc92e8c386dad412846165608a9559544fee5d174"}},{"ruleId":"D2","level":"warning","message":{"text":"Datacube._create_axes (cognitive 28): Datacube._create_axes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (8 pts), boolean chains 3 (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":"polytope_feature/datacube/backends/datacube.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"51579b2f08699cf24e0e84918006b6a1b02fe833c2182e722d9c5b8b33268570"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.remove_duplicates_in_request_ranges (cognitive 27): FDBDatacube.remove_duplicates_in_request_ranges has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 5 (13 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6315058413329e8118303c81680bc2efa71e3fede343e83ce1a4d76549cc6ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"geometry.slice_in_two (cognitive 27): geometry.slice_in_two has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 2 (4 pts), ternaries 2 (4 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":"polytope_feature/utility/geometry.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"642c552c39ee3ad13cb92778c29925ef61d8d7576bffd4b7d92224768bc4fd22"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.check_branching_axes (cognitive 25): FDBDatacube.check_branching_axes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d895689b8348779a19325eda8b7eb3ec32abe7bb3493ce09c4608b12689e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.sort_fdb_request_ranges (cognitive 24): FDBDatacube.sort_fdb_request_ranges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (10 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6489850419ba78fedf07e3190f8ea5dd331ce01f52e5588c37819bef69554782"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChangeSubHourlyTimeSteps.make_str (cognitive 23): TypeChangeSubHourlyTimeSteps.make_str has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, 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":"polytope_feature/datacube/transformations/datacube_type_change/datacube_type_change.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6d6d6bcc4c50946601b4593720d7a7c7260a829c387560b9ef5f08056d9517"}},{"ruleId":"D2","level":"warning","message":{"text":"Polytope.switch_polytope_dim (cognitive 23): Polytope.switch_polytope_dim has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/polytope.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee63ece04fcf3b7125819ff4aa769c73e36f61eeedd82a37e5634cd547bc9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"polytope_python::slicing_tools::_find_intersects (cognitive 23): polytope_python::slicing_tools::_find_intersects has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, 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":"rust/src/slicing_tools.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78034bbaadbf0e37ed4d3db69bf29a35f14acf3e171e3039b5f5581c7d348ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.nearest_lat_lon_search_merged (cognitive 22): FDBDatacube.nearest_lat_lon_search_merged has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 5 (10 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"573e40a4d955abc2088ed9cdac8c4c46ae2b44d2a0f6bb682c84bb54e3229cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.assign_fdb_output_to_nodes (cognitive 22): FDBDatacube.assign_fdb_output_to_nodes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa6c75b495117721f7a40669f33091e78aec9ac25250447580b6293ee27b174"}},{"ruleId":"D2","level":"warning","message":{"text":"Polytope.slice (cognitive 22): Polytope.slice has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 4 (7 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/polytope.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"85928f20d35935f7ad399af0df2820387c32dddd05853fda383a9e863a06dc24"}},{"ruleId":"D2","level":"warning","message":{"text":"OctahedralGridMapper.first_axis_vals (cognitive 19): OctahedralGridMapper.first_axis_vals has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (12 pts), if/else 5 (7 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":7805}}}],"partialFingerprints":{"codehealthFindingId/v1":"265e9ba96a146b45490252794c2273dfe3e317deb970cf753b4ea2cd7a593146"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimisedQuadTreeSlicer._build_sliceable_child (cognitive 19): OptimisedQuadTreeSlicer._build_sliceable_child has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/engine/optimised_quadtree_slicer.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"875edb5715f20cf0100d08c260894fd9c84b12c94893938e6f72edb491491527"}},{"ruleId":"D2","level":"warning","message":{"text":"LambertConformalGridMapper.get_latlons_oblate_py (cognitive 18): LambertConformalGridMapper.get_latlons_oblate_py has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/irregular_mapper_types/lambert_conformal.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe376b3e47456b89df390d7379f9fa6e4ade10b995acbef6d9d6c20719d6ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"HullSlicer._build_unsliceable_child (cognitive 18): HullSlicer._build_unsliceable_child has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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":"polytope_feature/engine/hullslicer.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9198f5b72a7ba563a5cd5eac2dfab619c090b292f85aee057d57b5c3ccb647f9"}},{"ruleId":"D2","level":"warning","message":{"text":"polytope_python::lambert_conformal::get_latlons_oblate (cognitive 18): polytope_python::lambert_conformal::get_latlons_oblate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/lambert_conformal.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d7bc43b56165a759ccc71dd1560a50404a8afdbeafe8e15dc224e179a307b4"}},{"ruleId":"D2","level":"warning","message":{"text":"FDBDatacube.get (cognitive 17): FDBDatacube.get has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: polytope_feature/datacube/backends/fdb.py holds 9 of the 23 methods over the threshold \u2014 including the worst \u2014 and 139 of the 296 points over it (47%), 2.7\u00D7 the next-largest file (polytope_feature/datacube/backends/xarray.py at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"df860293a145bfa422c05c74b46ff6d904f838fa8009c175601b52ad43fd2259"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/fdb.py: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178d8aa1d4117f444af2079a16a1e826421b2640e79f9730ae7b47f8ed05dcfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): examples/3D_shipping_route_wave_model.py:52-135 | performance/fdb_performance.py:35-51 | performance/fdb_performance_3D.py:37-53 | performance_unstructured/octahedral_vs_unstructured_slicing.py:239-253 \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":"examples/3D_shipping_route_wave_model.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dd2e307f30400416c71c09de857610e36f488559d09c430aaf198fce0a3a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:7806-7837 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:750-776 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":7806}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a109eb583a4e0bf408dd0236888bb14a300a9a32d228b2621bd99a76126b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): rust/src/quadtree_mod.rs:213-258 | rust/src/quadtree_mod.rs:267-301 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce153532764847886ac6a34eb7d5966ff6db6278409c4b8784824bffe11dcc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): polytope_feature/engine/optimised_quadtree_slicer.py:73-109 | polytope_feature/engine/point_in_polygon_slicer.py:130-157 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/engine/optimised_quadtree_slicer.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cfb740a5a3dec5d0166f4d7082d895282c5755ad178df33883041f285425cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:39-54 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py:56-74 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"845707721f06efc9db6d86662836993d32f728643637bfa931b54974d19d9f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:31-50 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:20-38 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"757d567eb35726013b633b4a52aeec0a6018733beea0f452ed53339f3f2f729e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): polytope_feature/shapes.py:282-298 | polytope_feature/shapes.py:322-338 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/shapes.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce8923632a982e44cff0588c58ec7c17139ffcb8755fa90d57c3a7f28e05d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): polytope_feature/datacube/transformations/datacube_type_change/datacube_type_change.py:151-167 | polytope_feature/datacube/transformations/datacube_type_change/datacube_type_change.py:185-206 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_type_change/datacube_type_change.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08dda15b0c0c31dcb826867693e063c96dc996e19478423bd86359f0287380b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:102-120 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:129-147 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ca4572536770583e435d330fe2445532680eeef05aebb7109a25526ee55bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:19-36 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_ll.py:18-35 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/regular.py:19-41 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"330fdca048de1058457d8281637af2fba095671880e8ce8e4fce88e1b949a312"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:150-159 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:1449-1458 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_ll.py:5131-5140 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a78d3edbdf02cccdfa620b02c5687edf628ae8a6f4150cc615c0e265d3aed6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): polytope_feature/polytope.py:114-123 | polytope_feature/utility/engine_tools.py:12-19 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/polytope.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d104e61120b14a505579195c88e30ae8edcaf6726c00edee89b6b5f5a5c1720"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:7847-7856 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:7859-7868 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":7847}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2e408206bda8cd92baa3118988cb43dba87d661c60b7180fbdd16bf4a231c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): examples/3D_shipping_route_wave_model.py:16-36 | performance/fdb_performance.py:14-30 | performance/fdb_performance_3D.py:14-32 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/3D_shipping_route_wave_model.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"941fdfdc7d52e42ff2f24e8030b3dbb17d04761015eec714a29631724feca005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/irregular_mapper_types/icon.py:17-28 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/irregular_mapper_types/unstructured.py:15-26 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/irregular_mapper_types/icon.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9c8ed4a66e483d2d2b6186dda774ee245de74b025d0f81d3f367eb1ee6c87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:53-114 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:41-102 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0784075d134dd191523c317032b842d8c2a9e28d0d0b025eca5516ee7c363d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): polytope_feature/datacube/quadtree/quad_tree.py:23-30 | polytope_feature/datacube/quadtree/quadtree_additional_operations.py:9-16 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/quadtree/quad_tree.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf7d08db835b97e6d205c29cbaf55b5c1aafb14a5c3e604e611cf7df9104a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/local_regular.py:105-108 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/regular.py:75-78 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/local_regular.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5606983776dc9044a710f9b62f12e7bc8a83608f04dd7084af7a41e7e0e36644"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): polytope_feature/engine/optimised_point_in_polygon_slicer.py:86-95 | polytope_feature/engine/optimised_quadtree_slicer.py:67-70 | polytope_feature/engine/point_in_polygon_slicer.py:118-127 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/engine/optimised_point_in_polygon_slicer.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"115c51cdee9e48532670f730812832fd805a5dfb42d790c39a0a51119bd5fd66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:1439-1446 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_ll.py:5115-5122 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1bab4f609839ff81429b0266517a789c3ebd39a3f3d1a8cdf15d0556600d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:7813-7837 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:752-776 \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 \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:7813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":7813}}}],"partialFingerprints":{"codehealthFindingId/v1":"678611f8d8b6c1395bd7d7485b7d5a0fe33732605ec01cbd005f48d3d968ebfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): polytope_feature/engine/optimised_point_in_polygon_slicer.py:33-52 | polytope_feature/engine/point_in_polygon_slicer.py:83-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/engine/optimised_point_in_polygon_slicer.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"276afd97b08b24b00ea10c4665d415bc4393e3f773fafc98a8a63d5d410d12a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): polytope_feature/datacube/backends/xarray.py:94-107 | polytope_feature/datacube/backends/xarray.py:130-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/xarray.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bb2902dcc174377177062bec24e4dbdce28e268471e332d680f6b8e25d1719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:37-50 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:25-38 \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f826c045fe8b2bad34436cc4e5ac6aa3f62ec96ff65f737937b0225cf3c4fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): performance/fdb_performance.py:41-51 | performance/fdb_performance_3D.py:43-53 \u2014 before extracting anything, compare \u0060performance/fdb_performance.py\u0060 and \u0060performance/fdb_performance_3D.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060performance/fdb_performance.py:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"performance/fdb_performance.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db6797bdc7950e90ede8d59eeb1271407406a8d2e1f6c0a1d3e317d4a2611ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:26-36 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py:43-53 \u2014 before extracting anything, compare \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py\u0060 and \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"513b054dbd2b89916770d4af75dcf75b597cf080abad328f4f998040d036554f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:74-83 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py:94-103 \u2014 before extracting anything, compare \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py\u0060 and \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py:107\u0060 calls \u0060healpix_longitudes\u0060 and \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:86\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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8034151e4b252e235766785b8b125d01f08d73b818aa66e05f976a11819f4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:105-114 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:93-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48a02b9cecd7950672184f9dd3259495953e837fe9c32c34f40f79cd069a533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): polytope_feature/utility/geometry.py:94-102 | polytope_feature/utility/geometry.py:107-115 \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":"polytope_feature/utility/geometry.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ef64c6e0032c64b75b753dbe579e201d9319c58df80d58aaff2477c33a55a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): polytope_feature/datacube/backends/fdb.py:100-108 | polytope_feature/datacube/backends/xarray.py:55-62 \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 after the matched lines, \u0060polytope_feature/datacube/backends/fdb.py:110\u0060 calls \u0060info\u0060, \u0060str\u0060, \u0060keys\u0060 and \u0060polytope_feature/datacube/backends/xarray.py:64\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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ad3458836e4095cd820558a643f47de44503aad8cfd714aae368788ce80098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): polytope_feature/datacube/tensor_index_tree.py:92-99 | polytope_feature/datacube/tensor_index_tree.py:440-447 \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":"polytope_feature/datacube/tensor_index_tree.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1690dee59a0af9d66c5ba94923f9e038bfdef4e1aa62147b357b9199ad37c4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:24-31 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_ll.py:23-30 \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"acac2cfe46abaee963f3ce838b073c948e716a48b47d69e90da78aaf5f688932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): polytope_feature/engine/hullslicer.py:19-26 | polytope_feature/engine/hullslicer.py:69-76 \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":"polytope_feature/engine/hullslicer.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6760a5891d5767d3c640ca4c8444f2bc6965709b878a1175d9bb95cbcff3bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:150-156 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:1449-1455 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_ll.py:5131-5137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"393aa949cc0b2b188f2e680c17ab469711a2799d1c149766e59f669b8d779a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): performance/fdb_performance.py:35-41 | performance_unstructured/octahedral_vs_unstructured_slicing.py:239-245 \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 \u0060performance/fdb_performance.py:35\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":"performance/fdb_performance.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2c6aa4bba087e0661a175d424dcf959a9a00206295f4cc92f2ff699403bf5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): examples/3D_shipping_route_wave_model.py:84-89 | performance/fdb_performance.py:38-43 | performance/fdb_performance_3D.py:40-45 | performance_unstructured/octahedral_vs_unstructured_slicing.py:242-247 \u2014 before extracting anything, compare \u0060performance/fdb_performance.py\u0060 and \u0060performance/fdb_performance_3D.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/3D_shipping_route_wave_model.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c202e935847c699360395f88860e87941d1a7926bba36b8aff49c13414846f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:39-54 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py:59-74 \u2014 before extracting anything, compare \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py\u0060 and \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py:57\u0060 calls \u0060first_axis_vals_healpix_nested\u0060 and \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:38\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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c431cc49b2bcb408f5f9a04ab5fa78ac5f0fb5de0d9a39d09259b2d876428d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py:62-67 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py:82-87 \u2014 before extracting anything, compare \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py\u0060 and \u0060polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"37159cc8a242a5404d4a72324744606bfeacf9713f2108553d0cc31ab780e050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py:7840-7844 | polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py:779-783 \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9ca3c8755f4a524be7c58d2f14f35445f261b9b3ec11c45ea4e6b7492bb9f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust/src/quadtree_mod.rs:241-252 | rust/src/quadtree_mod.rs:285-295 \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 \u0060rust/src/quadtree_mod.rs:241\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":"rust/src/quadtree_mod.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9b2fa80a4757d48dd1837084e8d1c8951ca5c0640eec2cfef249efa1373460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/src/point_in_polygon.rs:10-18 | rust/src/point_in_polygon.rs:70-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust/src/point_in_polygon.rs:69\u0060 calls \u0060find_bounds\u0060 and \u0060rust/src/point_in_polygon.rs:9\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":"rust/src/point_in_polygon.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9d1416fc4c7380dc599d9c16e96e7763d901d8cc5e109029ddafe1613a0ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/src/healpix_nested.rs:249-254 | rust/src/healpix_nested.rs:259-264 \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":"rust/src/healpix_nested.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d19b83dc9499739821433823525ad8e900807ebfc92c6cc9645613146da7731"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): examples/country_slicing.py:28-99 | examples/wind_farms.py:27-94 \u2014 These two members are variants of one another: 42 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":"examples/country_slicing.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c534575b08ecc5b81d1f18c17ba6adb2bc1c6ac8e13c87dc8abcc0c7653d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): examples/3D_shipping_route.py:27-99 | examples/wind_farms.py:27-94 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/3D_shipping_route.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee7df1fcce83296d7c7efcf268f47f224b14f94fb731c6f71c059ef878bf96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): examples/cyclic_route_around_earth.py:23-58 | examples/healpix_grid_box_example.py:53-91 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cyclic_route_around_earth.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bfebafc0e41afc0d9d9788bafb9fd9828f4f352f5322b03c825d1819b72f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): examples/4D_flight_path.py:15-24 | examples/timeseries_example.py:14-22 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/4D_flight_path.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"324984ceb45c8a2f439ac54510dd70ac1eff3aabc6ab8d9f942dc34b7b115702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): examples/country_slicing.py:53-81 | examples/cyclic_route_around_earth.py:26-54 \u2014 before extracting anything, compare \u0060examples/country_slicing.py\u0060 and \u0060examples/cyclic_route_around_earth.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/country_slicing.py:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/country_slicing.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"628934dcbe014f4b7ef6960b6bc48182919976a8c554eeeca80ce29faf3b507b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 5): examples/country_slicing.py:35-53 | examples/slicing_all_ecmwf_countries.py:51-72 | examples/slicing_all_ecmwf_countries.py:103-125 | examples/timeseries_example.py:32-54 | examples/wind_farms.py:40-58 \u2014 before extracting anything, compare \u0060examples/country_slicing.py\u0060 and \u0060examples/slicing_all_ecmwf_countries.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/country_slicing.py:35\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/timeseries_example.py:55\u0060 calls \u0060Select\u0060, \u0060datetime64\u0060 and \u0060examples/country_slicing.py:54\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":"examples/country_slicing.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"822aac48fca1e5cdecb9e84d8c0b5172b05cdaa481c44869f6a05397b815da96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): examples/healpix_grid_box_example.py:31-50 | examples/octahedral_grid_box_example.py:17-36 | examples/octahedral_grid_country_example.py:18-37 \u2014 before extracting anything, compare \u0060examples/octahedral_grid_box_example.py\u0060 and \u0060examples/octahedral_grid_country_example.py\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"examples/healpix_grid_box_example.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"652fb55fe9b9745f856b83f52e6549b3e454d0c8cd444c865c4088314638c626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): examples/country_slicing.py:56-69 | examples/cyclic_route_around_earth.py:29-42 | examples/wind_farms.py:60-73 \u2014 before extracting anything, compare \u0060examples/country_slicing.py\u0060 and \u0060examples/cyclic_route_around_earth.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/country_slicing.py:56\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":"examples/country_slicing.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"12074add974cd9db69bae503687603a57f92565e7ccc301f1b3c51309cc6d10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/3D_shipping_route.py:27-39 | examples/3D_shipping_route_wave_model.py:52-64 \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":"examples/3D_shipping_route.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf86d3a12736336d1275db28b274b366a7ee93ef14c2d60cbfcd3f4d6920bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): examples/3D_shipping_route.py:73-99 | examples/wind_farms.py:68-94 \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":"examples/3D_shipping_route.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"57216cf2865725cac915c9db8b387d93562591c8e73a3762f203bfec037b288f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 4): examples/4D_flight_path.py:96-105 | examples/country_slicing.py:59-70 | examples/cyclic_route_around_earth.py:32-43 | examples/wind_farms.py:63-74 \u2014 before extracting anything, compare \u0060examples/country_slicing.py\u0060 and \u0060examples/cyclic_route_around_earth.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/country_slicing.py:59\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":"examples/4D_flight_path.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac27b6762e58d18e5c0c9524a83101c6abe9ca9fb147aeaacfec8079f043299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): examples/country_slicing.py:52-62 | examples/cyclic_route_around_earth.py:25-35 | examples/slicing_all_ecmwf_countries.py:71-81 | examples/slicing_all_ecmwf_countries.py:124-134 \u2014 before extracting anything, compare \u0060examples/country_slicing.py\u0060 and \u0060examples/cyclic_route_around_earth.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/country_slicing.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c6a66ef2b729a7a9e97234fbe467c17dbc72b44b809ae732750c3c818de66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): examples/country_slicing.py:75-82 | examples/cyclic_route_around_earth.py:48-55 | examples/wind_farms.py:79-86 \u2014 before extracting anything, compare \u0060examples/country_slicing.py\u0060 and \u0060examples/cyclic_route_around_earth.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/country_slicing.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ab487e3ff7bdf52df3213709f2b555ca684a2c962cb85429e3279cf4fe41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/4D_flight_path.py:18-24 | performance/scalability_test_2.py:15-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/4D_flight_path.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b97842530783a11a6bd98cf5fba99922335cf0614fd09ab5c3b0577352c7104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): examples/country_slicing.py:15-21 | examples/cyclic_route_around_earth.py:14-20 | examples/slicing_all_ecmwf_countries.py:15-21 \u2014 before extracting anything, compare \u0060examples/country_slicing.py\u0060 and \u0060examples/cyclic_route_around_earth.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/country_slicing.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef104677ff2757498fd8ed373d614c41099214543184b2cde487ed769a651225"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FDBDatacube (LCOM4 4): FDBDatacube\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4459e3533cbf41b3f6bfd82fb252e458d7d54bd8e3123b1a9543d70bb198d558"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: polytope_feature/datacube/backends/fdb.py: polytope_feature/datacube/backends/fdb.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in FDBDatacube.nearest_lat_lon_search at line 430. 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-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 13:49:00 \u002B01:00\u0027 --until=\u00272026-11-06 13:49:00 \u002B01:00\u0027 --full-history --no-merges -- polytope_feature/datacube/backends/fdb.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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f20699a26f80a52883bddc55e1cc2b80051275958ac1ab31a38107b746857d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: polytope_feature/datacube/backends/xarray.py: polytope_feature/datacube/backends/xarray.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in XArrayDatacube.get at line 69. 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-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 13:49:00 \u002B01:00\u0027 --until=\u00272026-11-06 13:49:00 \u002B01:00\u0027 --full-history --no-merges -- polytope_feature/datacube/backends/xarray.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":"polytope_feature/datacube/backends/xarray.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c449c0dfb81b50135117cdf373df4a1778d2c86edd98e1863e94a4da92a7f50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: change to right md5hash \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_lambert_lam_grid_unstructured_fdb.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bc4849f70e78a4389c5c26d20c1478f8447318998f6225e01016cda821a0e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: change to right md5hash \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_lambert_lam_grid_unstructured_fdb_optimised_quadtree.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"543791be34aa3ffaa653785da7debc2598fb6db71ccf6542e5646e56d006ffd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This uses the wrong fdb/schema/data so the hash for the grid is wrong \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_regular_reduced_grid.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f9fc75b153150d23db4841c7c77f3fa71ff13890ab4ea6fb05ddbed335b390"}},{"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":"tests/test_slicing_xarray_3D.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"597dea058b61e6c2de0282999df717a179906cc0da43981e0586306bd6c4478c"}},{"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":"tests/test_slicing_xarray_3D.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ea98e38e1775f1493924177c4feee80e2ea39ea71c78e85a5a4acf3628980"}},{"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":"polytope_feature/shapes.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c51a2dc25798e4b9846ffd79b0f4ac5fc1a64b3bcdc2d916974a7f9380ae00c"}},{"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":"polytope_feature/shapes.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3865d75e1a9bc194457e99a212b18bdc10056a176111f09605a0a5e6d0b050e"}},{"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":"polytope_feature/datacube/tensor_index_tree.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af1b314ab2b5fa200bec9d8c8e0fc9c2bc2e2849702ecfbfc2798a071e740eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: fix the overlapping branches? \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_slicing_xarray_3D.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3d3f472830901c462aa8745a53c244d256bde66c25ab73b6264f1452f92c96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test the timestamp and timedelta axes too \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_tree_protobuf_encoding.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be9531ef695ff9ee16aca710f1fbf9f5f1988a70bd384d42c4ae81867ca76f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: look at rust built in arena \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":"rust/src/quadtree_mod.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780154931c2b4fc07791a145d8e5aafea700f06287c14db7f9e8484ea5f6359"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: here, can remove the points attribute of the node with node_idx \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":"rust/src/quadtree_mod.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69ce609fb277cba8998c7d7d9207012e06a6d77eafe217b7a8873e88f0f957e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimisation: if polygon is entirely within one of the child quadrants, don\u0027t need to do slice_in_two really \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":"rust/src/quadtree_mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0950c8f961011068a465790c3e7df9ddc8ab4b8be89840762985204bc451f748"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need to get the corresponding point cloud from the datacube \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":"polytope_feature/polytope.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2908b7404159186dcf250de40c1b9c410a4b88df147040f15b55c731b9842a5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: need to get the corresponding point cloud from the datacube \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":"polytope_feature/polytope.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f1cfd13752ae9455d2bb8769c1a3d20eca5e0d53da0d469ddc6fc38c9f98d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: change this to use the Product instead and return a Product here of the two 1D selects \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":"polytope_feature/shapes.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"282b15928a5c78da6645100e04e7f34ac11a99f48d99bdfa88cb37ad9cab440e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should this be in utility folder since it doesn\u0027t really depend on engine...? \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":"polytope_feature/utility/engine_tools.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35d8a1057a94063df38c1119b9e781677f7fe7cd79d28309aa562af92cb0adc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Restructure this to add all compressed values at once in the tree \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":"polytope_feature/engine/hullslicer.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef391e8e2e9d6fb05126668a1f1473527ae9f251b7a43179ad5a1d4642a2cd4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Restructure this to add all compressed values at once in the tree \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":"polytope_feature/engine/hullslicer.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ca28c9b6753d70a2a98a1e8e98c2e11acee09cce85523bb60cb9f605727e88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make finding the axes objects nicer? \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":"polytope_feature/engine/optimised_point_in_polygon_slicer.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd13b3803c4f22271f80c1a8094e5168af355bad402cbe8e271bec9bef5fea9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make finding the axes objects nicer? \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":"polytope_feature/engine/point_in_polygon_slicer.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"600c76b7bc9de20d00e80d5dacdf9adeb8347e713feab91e66e90c749a363350"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: what does this function actually return and what should it return? \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":"polytope_feature/engine/optimised_point_in_polygon_slicer.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c468b32d186f35d57ec741bc83c3476d1c8209e29ac6d2f1c9afc23cfe8438"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: what does this function actually return and what should it return? \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":"polytope_feature/engine/point_in_polygon_slicer.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"de56ca53d4ad81bfad1683d24bdc8a5ebdbfa6f7bde8fd448eacef1d97818c4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add the sliced points as node to the tree and update the next_nodes \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":"polytope_feature/engine/optimised_point_in_polygon_slicer.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d6f68765e9523f028224502dcfec0d2f55feac33819bb633452118ec2b8886"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: but now what happens to the second axis in the point cloud?? Do we create a second node for it?? \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":"polytope_feature/engine/optimised_point_in_polygon_slicer.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"666cd8be82d40c245f7fc9bca4f7c4099afa1f47f6584a92124be0c7beb81f15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do the quadtree slicer, but only build quadtree for bbox of polygon \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":"polytope_feature/engine/optimised_quadtree_slicer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef58379681af23b89505abcdb1fb92e180f2b9d26135f2b16cdda412fa74d5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe we create the quadtree as soon as we have an unstructured slicer type and return it \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":"polytope_feature/engine/optimised_quadtree_slicer.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40014696ea121de8bca6333b51edfe25cc34096f2dbe49964d0b756f3fe2825"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe we create the quadtree as soon as we have an unstructured slicer type and return it \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":"polytope_feature/engine/quadtree_slicer.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dcf8275115528e28d8663c510acb04bf83d8b5389def31667166dc1474163b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe these functions should go in the slicing tools? \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":"polytope_feature/engine/slicing_tools.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b79d539a80d61acb3840e06693f8ef5e4e1568785d0a6e42b9dbc84406882f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Maybe here, store transformations as a dico instead \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":"polytope_feature/datacube/datacube_axis.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bada28e867f397c7b8f13d3fdfdc8885fc6df34072efe9cc7cb6e9998eb169"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: what if we remove the next nodes here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/tensor_index_tree.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b330ad8d55f531627bb32340765796909a1609fb549cde925761e6f2427cf99d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we really need to find the child now in the compressed tree since we will have duplicates anyway? \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":"polytope_feature/datacube/tensor_index_tree.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f839cedfd4ae7ee7c41aea207b3d5d4977cc21b922fc30fe79828708604da87b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: write a decoder that decodes the bytearray (ie results) from gribjump directly into the tree instance \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":"polytope_feature/datacube/tree_encoding.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"75383621b7114f0ed8a775f1f87c549d28cd3277e1782249635c1aabead1ce03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if it\u0027s hidden, use the sizes to attribute to the hidden lat/lon nodes... \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":"polytope_feature/datacube/tree_encoding.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2abfd9767c29f549f0bd61332e30ed275906095c70a92a09255a20f27289a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: maybe replacing like this is too specific to time/dates? \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":"polytope_feature/datacube/transformations/datacube_merger/datacube_merger.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa2231a1b51832cb1e053e2d5cd8bbcef5c7a4436a480a5510a2a9212e562f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if local area is not empty list, raise NotImplemented \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c511828d1fa4651e352bda2759eeb27117ae1a365f5647dcada113af018904"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if local area is not empty list, raise NotImplemented \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/healpix_nested.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aec9aff0d9bc3be2320fac3db2cd67534a556a95c1c8d04e2fcd237b990a52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if local area is not empty list, raise NotImplemented \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/local_regular.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e54cbd8478769bf908479d0cbda6d516304812a38cb8ad579908abbdfa4072"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if local area is not empty list, raise NotImplemented \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/octahedral.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"218c2f5eb24321f94bfb55eb6560a9a76242da24670399dfe9692a31befbdf91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if local area is not empty list, raise NotImplemented \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_gaussian.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c92e8e527641d84289bd166d2162a299d087b0796afc0d5c9bbeb45b5f8669a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if local area is not empty list, raise NotImplemented \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":"polytope_feature/datacube/transformations/datacube_mappers/mapper_types/reduced_ll.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b207c14f0826b4c18332ef76e1d71cd8ab17c459d5b10b16ef611cb3b97874a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could consider doing this through a point in polygon check? \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":"polytope_feature/datacube/quadtree/quad_tree.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9e14383d95b3d24fc205049f4de69780062d027dc451541f7c22a06ad4d288"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we need the max_depth? \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":"polytope_feature/datacube/quadtree/quad_tree.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbe5bb42c9b264b4353db87248dcea3d242488fbf9b49941cbf7f6c25500b85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: SLOW, scales linearly with number of points \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":"polytope_feature/datacube/quadtree/quad_tree.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"69decb06c7c821af71a23433150e909eb1a489e4fc0343f422ffe85fe67199cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: would be like uniform rust \u002B python API with \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":"polytope_feature/datacube/quadtree/quad_tree.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a6421698c089192725481af46555c787337ab707a4cafb1b474cf430a4e7ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: find the nodes that are in this subtree \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":"polytope_feature/datacube/quadtree/quad_tree.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c163cd10e1e991655a1c773637added57ddbbe9d7409eda35a5128dd6f389b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make this as methods of the python quadtree? \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":"polytope_feature/datacube/quadtree/quadtree_additional_operations.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f232d27a53f2e7b02d249c5c6f871f1e0db36e1c10ba5eca33a1d852c3bbcc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: try optimisation: take bbox of polygon and quickly remove the results that are not in bbox already \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":"polytope_feature/datacube/quadtree/quadtree_additional_operations.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5536823295156dfbecde42b1a8ed281771c1aff303f87169ffd50938d9367c37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: do we use this?? This shouldn\u0027t work for a disk in lat/lon on a octahedral or other grid?? \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":"polytope_feature/datacube/backends/datacube.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b32f6c24d398fd799c021ba852a6e7d3cddec8ec610fb6aa91e4080df930f24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: get the configs as None for pre-determined value and change them to empty dictionary inside the function \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":"polytope_feature/datacube/backends/datacube.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"288e43e307983bd06080d8d3a9b36164ff3ba0ef124f974aa730d2066f18bfcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: change this to accommodate non consecutive indexes being compressed too \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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"383429c3e0426b194689db25275a84f53274edef03fdbf2ff26263f5f574a95a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: modify the start indexes to have as many arrays as the request ranges \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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcaba49636cca8dd8e765d892be2e591a8c06d05b353a0f3a091457c2bcdd8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: if we sorted the cyclic values in increasing order on the tree too, \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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"986c4de9b625dae6887dfa23f10b8f90e35bd943159886a6e7de5140c0df184e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: prepare the tree for protobuf encoding \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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95d49634d5ba3bd4dc44f93e7281719868e2fb4e43c86788d4fb1de9cdda222"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: transform the tree after decoding from protobuf \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":"polytope_feature/datacube/backends/fdb.py"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29770eca422b99dee40b18c19c54d9177f8918bff98c4bc1a2a5137d72c7851"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (22311 LoC, 112 module-visible types across 17 directories) overshoots its size bounds. 1 of 2 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4842ad367a78941ccec73d857627e21e838b932492f4ae73cdd87ada79a9f00"}},{"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":"968b02744155f8a7b7aee7f7d200ece1a14d142463da4f0ef20a175410415b5e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"739c40cb4745841ba2a75d32315bc25c6affab52676932b9e58dcfaa8fb9d62e"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8798f88288557b0597993d998f218f9e22709c7263404b8264ccd863a9fce74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"735f3c9d3ef6e14871342c689b75afa919b5e25045e58c3545882e2313f5d117"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"613343d1b752f35745826fe8d15b453cf20383607c0f92f58d6658c1e8f77558"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"491309492755e678b03fb48f8d71cffa348f6001d9dc090ab40127b3c3da0a84"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5135cc00a241f4f1618c03d714e5c40443bf2cedc5402938619fc5cb2a2e093c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e56610aa1d0c3d47e0e323aa2373bb09532d078d525cf8b7bc262ec17e08dfe3"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2aa9e403a78aeaedaaeb6216d76bb1a1620618377c04abd6ad760d16ee6b453"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"208a7392aa1eb566fa2e1c3f9615d0b4eaec7f9f4b14ad296b0bd9adabe3725a"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11d0893ff04140aa73f7ef5ec41ca46fe0bcb84c99a5b3ec7c2ed6064dbb3539"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"85fd951e314a11cc1b4b4ec8ed5ee0fa3adea0399143ed91574d52eb3b15299b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"07dfd20074ba4ec8a2557884c0dd31fa057b0fd53513d965f264c3991390e5a3"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cc3bb615bc0a862b32574529334f43c1a1e28c4c520565cff90d5e9f04a91c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"46d85b4b67a44d100d84ab9917ee73d09ad5c89b43cb0c44bda01cacebbfee7a"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7573696c7617026fe16fde62b4c3d666f9846a9cbab5bbbc29621c3cbeb85deb"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mock.py \u2194 xarray.py: \u0060polytope_feature/datacube/backends/mock.py\u0060 and \u0060polytope_feature/datacube/backends/xarray.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 \u00601d40665f\u0060 add context information all the way through gj (at that commit the files were still \u0060polytope/datacube/backends/mock.py\u0060 and \u0060polytope/datacube/backends/xarray.py\u0060); \u0060163b2c73\u0060 remove unused options and start to create unified options class (at that commit the files were still \u0060polytope/datacube/backends/mock.py\u0060 and \u0060polytope/datacube/backends/xarray.py\u0060); \u006069250dba\u0060 add a global datacube init (at that commit the files were still \u0060polytope/datacube/backends/mock.py\u0060 and \u0060polytope/datacube/backends/xarray.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/mock.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf19d1f0d7a96d6217435d1e478828794d9fb42722f95b442e4c468fb9c2861"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"6f492b91f01c3ec0119584862767a7519413c0159e5eb8bb5e8bf28ee1defda6"}},{"ruleId":"D36","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":"3cd197fc759121a9617e78e5ac89f535b8008770dbdbc10f1dffdf185bbd6cfd"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"326f840ac2cecb379739890f4e6bc581362cb614e57f6b254a0bdf63755bbc59"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90ef8645d5d250a2cdd6c4ddecf434c2439a3eaf0b71b0b76b3e93b4d1bb9e49"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2f2e6d772606440fd7feb051879d64d59a2ebc3e6940e2603748dba5ff96b2"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 5 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060rust/Cargo.toml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/Cargo.toml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8002d2d9afe528a8d7594a6df61b91b2029df1741bb69de7b0a4c114f49c0b7a"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 40 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_merger/datacube_merger.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b380b5560b75649e18176c7fae41d1c04cc53c70c331a208301b261aae3b21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 65 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/transformations/datacube_merger/datacube_merger.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"44504aea09586dc88ad3b1322412175dc08f8892a6c26a027c03f3bfb9844fb9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 144 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"polytope_feature/datacube/backends/datacube.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d84e9a9a312d8dc6f94073285282970b5a9f25784eb82dda711d697a357baf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060first_axis_vals.iter().enumerate().find(|(_,\u0026v)|(first_val-tol\u003C=v)\u0026\u0026(v\u003C=first_val\u002Btol)).map(|(idx,_)|idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060unmap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/healpix_nested.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"99503f51d93f623a9be524634e9206f0c984cdfa1b2b6e8df67a52af28bc0619"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060second_axis_vals.iter().enumerate().find(|(_,\u0026v)|(second_val-tol\u003C=v)\u0026\u0026(v\u003C=second_val\u002Btol)).map(|(idx,_)|idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060unmap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/healpix_nested.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac24730df8c03cc50a1568e699beeee22a2e6587a35abcf39c1f05364d07f00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060heap.peek()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060knn_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84304649621ed813cebc9558045395774a58ffbe70e018d65052b90a704fd73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060heap.peek()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060knn_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b671622fa181c407089075aa8423c28d70434c79fd5fe11e1621513bac92ebc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nodes.get(index).map(|n|n.depth)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_depth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bfcd0c6fda5cabd0578c0fc37dd264189559aef943e58b118fb8e0d86f1209"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts_ref.get(pt_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060insert_into_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a39ac76b15888a1d29568b3d39006ed955fe547a3f95e6031dad4d877577b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get_center(node_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060insert_into_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6646c630ffe84e780c1fb8b6e489f0bd9a4a68673de14ecaee4ecc2b7ce1e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get_size(node_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e02402d09b9710d05e678c8f6f8502500fd615d56ee924758693a0a9387e938"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get_center(node_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c46669cd505b1c701cfa8d1f66d9c408dc703ddf179df7cf53901bd7c5325b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(\u0026b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060_query_polygon\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/quadtree_mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f236ccf5b583f574e45cdb1436d545824bdbb188758e464a27c25529aaf8808"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":27,"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."]}]}