{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"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":"arnis::data_processing::generate_world_with_options (cyclomatic 207): arnis::data_processing::generate_world_with_options has cyclomatic complexity 207 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7157d722d8bd10896076206997d7e73c6ddd6c49047b0d6cfcf35ce7924d43"}},{"ruleId":"D1","level":"warning","message":{"text":"BridgeStructureMap::build (cyclomatic 191): BridgeStructureMap::build has cyclomatic complexity 191 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"85daa37bd99b62a8895684e98394f573a93bef96fcda2aa2b3cc20ade2a110a6"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::ground_generation::generate_ground_region (cyclomatic 172): arnis::ground_generation::generate_ground_region has cyclomatic complexity 172 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_generation.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"41345ad00b30ef8576ee9b5868e0f6a1b5d1fbcc1d03ac3c37aea8c4d0e62513"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::highways::generate_highways_internal (cyclomatic 163): arnis::element_processing::highways::generate_highways_internal has cyclomatic complexity 163 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a2f5498f20e2a9b285563df242e6c322c6d0f5f8656bfd06bd96db94f4b27c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_buildings (cyclomatic 151): arnis::element_processing::buildings::generate_buildings has cyclomatic complexity 151 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":11550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c4465da26715738a8b158f492ca6b754b5fef940c1629cf435127af54d6ea9"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::natural::natural_area (cyclomatic 146): arnis::element_processing::natural::natural_area has cyclomatic complexity 146 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/natural.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c3ffb3a3b5ddda0a29a545b4f491d526c60009c9cc00ce0450c962bf541fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::bedrock_block_map::convert (cyclomatic 130): arnis::bedrock_block_map::convert has cyclomatic complexity 130 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bedrock_block_map.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdb5f4ed23a2cdc646576f51e3511101c24862d89f4ed4d77418ac00303c033"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::decoration::decorate (cyclomatic 122): arnis::caves::decoration::decorate has cyclomatic complexity 122 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81a5d3ce039445efb8bdf98f79f9dcf2952cbae15e39afebc3c3bc265800478"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::landuse::landuse_area (cyclomatic 108): arnis::element_processing::landuse::landuse_area has cyclomatic complexity 108 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e176261f490b227567bfe5b51306b596b3a641ed8ce61a091d5b3ff16c49800"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::args::validate_args (cyclomatic 81): arnis::args::validate_args has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91abc1426d36971ab4f3b30cd4229ce465befe9b74d14a8ecdfcc258f8b0011"}},{"ruleId":"D1","level":"warning","message":{"text":"RoadMarkingIndex::resolve_junction (cyclomatic 79): RoadMarkingIndex::resolve_junction has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bdb0113424efdb4265955f2674941294a6dd0f3592dacf307fefe6db3c62ac"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::building_construction::generate (cyclomatic 74): arnis::element_processing::building_construction::generate has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_construction.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18c1e6e4ea08c9e61acd42623f79c3ff7d5b72c0bdcbe39d602ee2df5097b50"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::rooftops::fit_out_roof (cyclomatic 74): arnis::element_processing::rooftops::fit_out_roof has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d504bed1e65870e8c15febd7e6ea72e1cd34ff32952b325d21184155d2eefb99"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterialRegion::elsewhere (cyclomatic 71): MaterialRegion::elsewhere has cyclomatic complexity 71 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5336e66810f3fead653e327fec44dc9a0713ded7f82afe1c05a0111c9f3af9c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::data_processing::process_element (cyclomatic 69): arnis::data_processing::process_element has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a776e875677f2966cfbce3dcfda8eec65e3ef342bc3db1555a7d2df0f029d7f8"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildingStyle::resolve (cyclomatic 66): BuildingStyle::resolve has cyclomatic complexity 66 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f37861a6beb2d34a3a4a17475c73899e435ce20ef4d9ae18fb744dcd0101f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::run_cli (cyclomatic 66): arnis::run_cli has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd525f6c8243f21b5dda42a6c4c64b2d5a8b51c3cec2f2ab47c8ff86a0aa2bb"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::openings::find_rects (cyclomatic 66): arnis::mapillary::openings::find_rects has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"53033ea9a7abc2901f93bfe4be37e14031ad184063fa150f1af47c04e314fee8"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::gui::gui_start_generation (cyclomatic 65): arnis::gui::gui_start_generation has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1a4de64a2178d2a1ff797f6208ff1e209655021d6ea4e4d052ca48da8a1ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::roof_wings (cyclomatic 62): arnis::element_processing::buildings::roof_wings has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15494}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe12ee397298f20e7285ad0c0f0aa1bab72e67d1d0ca2cffec9b3e16fdf597b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::datapack::discoveries::classify (cyclomatic 60): arnis::datapack::discoveries::classify has cyclomatic complexity 60 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/discoveries.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c7bbac3535fadf05dcb98c13208565c48acec3668c94452cd9d28903b0dea9"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_parser::spatial_relation_part_suppression (cyclomatic 53): arnis::osm_parser::spatial_relation_part_suppression has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd2999d86c1af330acd2900a8d4f629aea4f3467a583b3af6c049ae21936631"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::level_water_surfaces (cyclomatic 52): arnis::elevation::postprocess::level_water_surfaces has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c932948f1e759da8d75f5afaf7defb5192836ffca8adb68f66bfc454578ff0a1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::bands::complete_windows (cyclomatic 52): arnis::mapillary::bands::complete_windows has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"14765bd17ec10ee200ee96052b10142b8384a06b7d8ab634efa860a9f4d79a9e"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::amenities::generate_amenities (cyclomatic 51): arnis::element_processing::amenities::generate_amenities has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/amenities.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"29deb96653e014b1ffa983bc36e10e87496f1cb62053c0325bd8e435b99cf15c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::unzoned_wall_block (cyclomatic 51): arnis::element_processing::buildings::unzoned_wall_block has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":9239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7572c4d3982f2de977b28d142ec3c92ae4c61f8161f794a6f179f35586cc74be"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::bridge_repair::apply_bridge_land_cover_repair (cyclomatic 50): arnis::land_cover::bridge_repair::apply_bridge_land_cover_repair has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/bridge_repair.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a5a1e86413b2413942a3d20b53088b8df94f9bcdd577c326ed020ae15fb50b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::bands::segment_bands (cyclomatic 49): arnis::mapillary::bands::segment_bands has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"299d88eabbaf04ce0c3384744d5e66c89ff40d662c4c082c5218724911c5c431"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::openings::classify (cyclomatic 49): arnis::mapillary::openings::classify has cyclomatic complexity 49 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2372bdd7fc547c1c0105eea15fa67ce940e911feb4be43649bb3dd82f1d1d44"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree::build (cyclomatic 48): Tree::build has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab62585ed998bf6dd2499be8e8810025dc1b31eaeaff6aacb4b8e15b5858439"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::overture::parse_overture_row (cyclomatic 48): arnis::overture::parse_overture_row has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"5395fdda9df3c130b9483b94d3c699212491596769d7a11cacb859b769617b32"}},{"ruleId":"D1","level":"warning","message":{"text":"RoadMarkingIndex::build (cyclomatic 47): RoadMarkingIndex::build has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f035808f19522c1d18dbf2fb405a615713603ea047e12d3af76a2903892df8b8"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::carve_region (cyclomatic 47): arnis::caves::carve_region has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"11487f6cf0516103214bf443e2e8928722e8f7faadd5d0632dc10033010ca671"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_building_roof (cyclomatic 47): arnis::element_processing::buildings::generate_building_roof has cyclomatic complexity 47 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13213}}}],"partialFingerprints":{"codehealthFindingId/v1":"916fbbe1e836b6b1d0dfad908974f4364cbe7b99b87f842c9d21e0af7979d20c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::fuse::inpaint_telea (cyclomatic 47): arnis::mapillary::fuse::inpaint_telea has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"122ac9b758afe604589050f345f83e8c823c30dede12b1898bb77fb6504c2965"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterialRegion::in_europe (cyclomatic 46): MaterialRegion::in_europe has cyclomatic complexity 46 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3a36532fba3cab589cf0e7bace22de01c6cc1fd96e546bdfdedaa3ca213159"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::railways::generate_rail_bridge (cyclomatic 46): arnis::element_processing::railways::generate_rail_bridge has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a15ab12095fd1e53e1fc5b7bd28a3cc8942dd779430d8033bb3118a6688ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::highways::generate_highway_tunnel_shell (cyclomatic 45): arnis::element_processing::highways::generate_highway_tunnel_shell has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a79cc9e46cc73ff6f1e9303ab7fd247c034d27e45b959fd7bed860ad744b2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"CarNetwork::build (cyclomatic 44): CarNetwork::build has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9143c390362cfa40ddf052dd1255fb18f4d7ef2fe97aeb38a31f9871ef8eabee"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::schems::place_schem (cyclomatic 43): arnis::caves::schems::place_schem has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"62156874749fd8a67fa9cf425b7378d9f4440793679bc8c07feb4dc1d32e303e"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::pitched_roof_block (cyclomatic 43): arnis::element_processing::buildings::pitched_roof_block has cyclomatic complexity 43 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":8411}}}],"partialFingerprints":{"codehealthFindingId/v1":"6143359de2b5003beea442bd43a4b1530b07f9c572e040ed315b66ad748216cb"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_window_frames (cyclomatic 42): arnis::element_processing::buildings::generate_window_frames has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10314}}}],"partialFingerprints":{"codehealthFindingId/v1":"735f21324d200703af228e2a9e672420a59fb689058f5308ed1dd4717c98a08a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::register::run_align (cyclomatic 42): arnis::mapillary::register::run_align has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"af34d849dc42854cd9cbf32fd8ceddbada6bd83700094e7b0b54620c94b01503"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_gabled_roof (cyclomatic 41): arnis::element_processing::buildings::generate_gabled_roof has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15755}}}],"partialFingerprints":{"codehealthFindingId/v1":"721bff8ddcf9e23f4774ecd322744744e4e7f3f6b141ee2ac59770b31731138f"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::uses::use_from_tags (cyclomatic 41): arnis::element_processing::subprocessor::interior::uses::use_from_tags has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/uses.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"480a40b0a634749ab8f4a23dd940226416ad4f2c238221cf4ef31b2d9c950832"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::build_wall_ring (cyclomatic 40): arnis::element_processing::buildings::build_wall_ring has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7379}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69154fdd8cd56a7e8ea025ea46349ec7d0cd23ef7a7aa60bfe8fb1139183513"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::pick_window_archetype (cyclomatic 39): arnis::element_processing::buildings::pick_window_archetype has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac0b6aba074d4bc031b3a12eab28aec7ec1a2889b3dfe50937f1c5154e35fe5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_parser::parse_osm_data (cyclomatic 39): arnis::osm_parser::parse_osm_data has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"d660cf2051596dd6c4b68e18c93964f8f4a4869185a2e8cd7e1033d8326303c4"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_parser::compute_outline_suppression (cyclomatic 39): arnis::osm_parser::compute_outline_suppression has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fdddf38437c575f12d7ed9f5c45d57832d15609da055ab7e39d9ca1c12d7f4"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::trains::lay_out (cyclomatic 38): arnis::element_processing::trains::lay_out has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c04a526d27c8b112ff6422c5adb0dd84efa7681c8a63fabd1f779f193a6919"}},{"ruleId":"D1","level":"warning","message":{"text":"SectionToModify::to_section (cyclomatic 37): SectionToModify::to_section has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"42afbaf063a6ee5e1827d115fe26b8204ee765e84e1a9e551f1943c490b040d1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::leisure::leisure_area (cyclomatic 37): arnis::element_processing::leisure::leisure_area has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/leisure.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eff3f42e86fe0b1708b03e583937ae0bd1a0a97a2cdf181627460d68b784080"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::schems::stamp_region (cyclomatic 36): arnis::caves::schems::stamp_region has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5662eaf530d0d93bd6670b0ce3fb93473a97341462e632521a98b059fa496530"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::osm_land_override::apply_osm_land_override (cyclomatic 36): arnis::land_cover::osm_land_override::apply_osm_land_override has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_land_override.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0460c11761db1a2e4e713f6c3987ac5f65426862e321519dd12125a380813d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::facades::project_wall (cyclomatic 36): arnis::mapillary::facades::project_wall has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bbfa93c6301870a1dc1059630742fd9e541adbdd276b34d3a4df82664ce11b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::building_facade::compute_facade_plan (cyclomatic 35): arnis::element_processing::building_facade::compute_facade_plan has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_facade.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"079b2e2b8780151c603e05460f88bb9d007678d21042a53c3373b81c524b2940"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::place_roof_eaves (cyclomatic 35): arnis::element_processing::buildings::place_roof_eaves has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef0acab025a4da4c07a6b26932bf71c6b982e370d8deeb9e87a42a019bf6b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::waterfront::generate_pier (cyclomatic 35): arnis::element_processing::waterfront::generate_pier has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterfront.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0d5f3b92b06cffee71617ee43135e85a5be7726bede4c6eddbd08bbbecb8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::map_renderer::get_fallback_color (cyclomatic 35): arnis::map_renderer::get_fallback_color has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_renderer.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6217c36da6ef6b6d3a70cd2c5183dd63b5333a17e1aec21c4de5626fe8fc6499"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::overture::list_partition_files (cyclomatic 35): arnis::overture::list_partition_files has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f8ae983626b5408b0480d21faddb70820c153f00564e8f4908fbb30272fd78"}},{"ruleId":"D1","level":"warning","message":{"text":"Canvas::split_corridor (cyclomatic 34): Canvas::split_corridor has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35fc8de4fbc26e0c506bc002d45b59b1521322a29d4073949628c851c49d0f1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::highways::collect_tunnel_portals (cyclomatic 34): arnis::element_processing::highways::collect_tunnel_portals has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a059ce824a9c4a83b99782f00702ac115c0de87ce31249e7797c75b93e54eb"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::uses::plan_interior (cyclomatic 34): arnis::element_processing::subprocessor::interior::uses::plan_interior has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/uses.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b5846bc3c124dc2e30dc62cc9bea5fb3e426834601096d7e328e3a7c6c9d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::drop_water_on_steep_terrain (cyclomatic 34): arnis::elevation::postprocess::drop_water_on_steep_terrain has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1050a6aa85728fab00fc8228eef8221b40f8d47bc40b8528b6c46e24cd9fcda"}},{"ruleId":"D1","level":"warning","message":{"text":"BridgeSurfaceMap::build (cyclomatic 33): BridgeSurfaceMap::build has cyclomatic complexity 33 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9f35eadfd6275372e803dfa3cd3b56d3e72a5a7651539ce444e97b7c46af8d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::place_dormer_windows (cyclomatic 33): arnis::element_processing::buildings::place_dormer_windows has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":14295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1099f7bf803eaa907cc38080f359c733cbbe535a71d5f3f8e607d6250aa82d29"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::worship (cyclomatic 33): arnis::element_processing::subprocessor::interior::halls::worship has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f412ef2242a2cdf90b74ac1c6ef7ac079678af6e651afed8601f7116323f562"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_window_life (cyclomatic 32): arnis::element_processing::buildings::generate_window_life has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cba0e8b8ec2674c8d4fa57636e7377aa75e64849b4d8f902766645b215535b5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::cars::link (cyclomatic 32): arnis::element_processing::cars::link has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bcc3a4ab630ef89a79591d02e5215c3b30d229c62ccc717055ab627a1d46de"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::sport_pitches::draw_pitch_markings (cyclomatic 31): arnis::element_processing::sport_pitches::draw_pitch_markings has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/sport_pitches.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bc303758648227e0a47e8aeccdd515b470bdfaf7d301da0f384a713775e9e7"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::overture::building_to_processed_way (cyclomatic 31): arnis::overture::building_to_processed_way has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"df13b07d5ba9eff082d41b83f577a52581fac4fb9e796550583115668028fa3b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::overture::tiles::collect_from_tiles (cyclomatic 31): arnis::overture::tiles::collect_from_tiles has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/tiles.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eccb7271d7631494dbd03dc244a63d4b0222652c111592322c94b734a8aaa6"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::infer_building_height (cyclomatic 30): arnis::element_processing::buildings::infer_building_height has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5889}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57dd441195a8f4037fcd43ef9d5ab12f55346a1e0baeab328b2c0ff7e20370d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_facade_cornices (cyclomatic 30): arnis::element_processing::buildings::generate_facade_cornices has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10798}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffd82eb7cd30229a69cf0554433453f495b36726aa1913d00bc193793bca7ec"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::ground_decoration::grow_patch (cyclomatic 30): arnis::ground_decoration::grow_patch has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_decoration.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3617452c9db44d9ec02e97098e6a0bbb9ddd223f6e4ea6069c00821941a6a28"}},{"ruleId":"D1","level":"warning","message":{"text":"InteriorUseIndex::build (cyclomatic 29): InteriorUseIndex::build has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/index.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9198baf8d2610063e49f6c2665fd81b144f832d15439edc1b96e8f40f9a3ab21"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree::get_tree (cyclomatic 29): Tree::get_tree has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"08334256bc64c5c76cc81ab8a982b396f91a1f50d22b0439b94ee57c2c6d5707"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::decoration::plan_geodes (cyclomatic 29): arnis::caves::decoration::plan_geodes has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe080d8d5a3e2af9ef13ebc2440783ccfffb8c7aa06f318bde1f2693d3875cc"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::get_wall_block_for_category (cyclomatic 29): arnis::element_processing::buildings::get_wall_block_for_category has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a734b61f76108198f8e97fcd513873195ba3c659313d89b0b724d9ced8d5752"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::eatery (cyclomatic 29): arnis::element_processing::subprocessor::interior::commerce::eatery has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"127af73acb6841b5a43d878f157f32684623f818884db66646d141490f7c72b1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::osm_water_override::apply_osm_water_override (cyclomatic 29): arnis::land_cover::osm_water_override::apply_osm_water_override has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"64da1a2dde90d05664a3693d8760b270ac498518a9c30f59509214b695af39a2"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::refine::sky_roofline (cyclomatic 29): arnis::mapillary::refine::sky_roofline has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabe67c2634dd2d56be4c3389e6331c0c83f8b630843d7b876bce1f7c42d4200"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_parser::compute_spatial_part_suppression (cyclomatic 29): arnis::osm_parser::compute_spatial_part_suppression has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bc8baf1e75c94094f98e8a1addd2b84c821c32b3e7dd09447f5d82f354ceab"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::datapack::files (cyclomatic 28): arnis::datapack::files has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4142533ea3043d8aa4887937448d4b32872fb283a100bbdf59c1c12fa969ecf6"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::aerialways::housing (cyclomatic 28): arnis::element_processing::aerialways::housing has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c23802678a6b56a6e4abb424bd27745613b5e5c63d88ec93763aa85d49ed74"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::climate_wall_weight (cyclomatic 28): arnis::element_processing::buildings::climate_wall_weight has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5519}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0e979f5e2e06865fbddce612ba918d7c1c22525e21001e80a4dd14a29a654f"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_balconies (cyclomatic 28): arnis::element_processing::buildings::generate_balconies has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":9869}}}],"partialFingerprints":{"codehealthFindingId/v1":"20218288a6a28420ccc9bfcb1eafd635af43e6af04b22ef181b853337bde25e5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::fuel_stations::draw_canopy (cyclomatic 28): arnis::element_processing::fuel_stations::draw_canopy has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f054b0c04f67572bef98e6461feba46af441c1674d3d59711b7ddfdb6e7067"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::geometry::parse_overpass (cyclomatic 28): arnis::mapillary::geometry::parse_overpass has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/geometry.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e97053f4fd83decd44af8dbfcb91aee1356ee2fd0af0a90509ccbe751eb9dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_tiles::read_tiles (cyclomatic 28): arnis::osm_tiles::read_tiles has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb178282521f23c310998c3213b8f7f39aad95d1007a550e3e009244757cc06d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::trees::schematic::place_schematic_tree (cyclomatic 28): arnis::trees::schematic::place_schematic_tree has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::trees::schematic::map_block (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/schematic.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c386947559e991a802c24ff32144608a12c6b6ba59d34eff072baee50b3a5577"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::water_depth::carve_water_column (cyclomatic 28): arnis::water_depth::carve_water_column has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e3b44b9b92c32ec9d32fd916c0a2be648b3e69cb89d7a90eb54b1a54672ec0"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::building_facades::collect_facing (cyclomatic 27): arnis::building_facades::collect_facing has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/building_facades/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aa26c636429f5528f23e62e2862064236f1f14bd9c5aff2a595b0cd3e75a73"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::water::walk_river (cyclomatic 27): arnis::caves::water::walk_river has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/water.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0325b3e522f4e1f3198f8b9b5d3e6f6a09849d7acdf5a87034e13f639ab29b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::barriers::lay_out (cyclomatic 27): arnis::element_processing::barriers::lay_out has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf79df2aca06fd0cf3ec9c26a5a35b5d7b6711cbca383d5b6fb05fad10ba6c47"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_inset_tiers (cyclomatic 27): arnis::element_processing::buildings::generate_inset_tiers has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13597}}}],"partialFingerprints":{"codehealthFindingId/v1":"342091a74fa49be9fc2e89189235cccfa8f051ba26fbf117359c2c8538023c4a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::shop (cyclomatic 27): arnis::element_processing::subprocessor::interior::commerce::shop has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74e35df211ab781880332b1c40c307b28911f02c988e5ca173d5d52ccd3b30d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::map_transformation::rotate::rotator::rotate_ground_data (cyclomatic 27): arnis::map_transformation::rotate::rotator::rotate_ground_data has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/rotate/rotator.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a52627700d8c6887eaff45f7366559c3d72ed9af69fe6ea07979282cfe8b9a9"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::bands::drop_sky (cyclomatic 27): arnis::mapillary::bands::drop_sky has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"c349ff37f4df542fa3b17c2e7e755301c2d10880e77cc085e46041f64d256934"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::openings::split_blob (cyclomatic 27): arnis::mapillary::openings::split_blob has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d76df49fceeba87f030c96f65eac3126503395508b8aca821fed0c48484ff6"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::openings::apply_rhythm (cyclomatic 27): arnis::mapillary::openings::apply_rhythm has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3f8cf49a8cf7a5f38081fa39f90ee0652f7f92f2763b4e81773b73a06d0afd"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_parser::member_roles (cyclomatic 27): arnis::osm_parser::member_roles has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dae53d7b1a0f434ebe6b7906ca05541ed422d543270279f70f09c03182d815"}},{"ruleId":"D1","level":"warning","message":{"text":"FuelIndex::build (cyclomatic 26): FuelIndex::build has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"833f1f19cf464579aa8974288416958102d32b9736ac873ffc015a30a1395e26"}},{"ruleId":"D1","level":"warning","message":{"text":"Canvas::connect (cyclomatic 26): Canvas::connect has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a13ed042fab1c36a4fee73cac1f2a2f8b56cdb51c6fae682be635e1c7f01230"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::attractions::big_wheel (cyclomatic 26): arnis::element_processing::attractions::big_wheel has cyclomatic complexity 26 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e67bdf983e8cd4336aa4736d13e0efc64dfe7df9c39e44bae566abc4bec742"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_roof_only_structure (cyclomatic 26): arnis::element_processing::buildings::generate_roof_only_structure has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbca364b66279c916d6c813470185d8ebaab878d90a424917f3ffd68496c01d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::highways::generate_aeroway (cyclomatic 26): arnis::element_processing::highways::generate_aeroway has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dd77ca562b87d89033f9a1da418e8e6c9f2e83f21c6840593406b2223125c6"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::repair_terrain_anomalies (cyclomatic 26): arnis::elevation::postprocess::repair_terrain_anomalies has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d616260efde5c1ac13e91f12b98722d081bf3699074b25d8762dd0bac03391"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::split_off_other_levels (cyclomatic 26): arnis::elevation::postprocess::split_off_other_levels has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc8b5b298aa6f7072437da223e5d5a7a48bbcf3acb56f668b455645b387f5ac"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::aerialways::plan_supports (cyclomatic 25): arnis::element_processing::aerialways::plan_supports has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9c9c5c6beac141ff1d1556301ecb9c929a5b8d53a2e0e56a511c682b85e659"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::european_default_roof (cyclomatic 25): arnis::element_processing::buildings::european_default_roof has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe1404dbcb463cae26a6290a0d5735cac0b0d07335bb8e2efc59d7900fc82e8"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::plan_synthetic_entrance (cyclomatic 25): arnis::element_processing::buildings::plan_synthetic_entrance has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6619}}}],"partialFingerprints":{"codehealthFindingId/v1":"32576680339c768988188e8dd24f20f4d33e6b313d64cbc5918d7eaea5eb1dce"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::signage::generate_highway_way_signage (cyclomatic 25): arnis::element_processing::signage::generate_highway_way_signage has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78136a7a3e7166f4e0a38fc631f64a04d83292d41733d9c780ee03939d11499"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::read_esa_tile_into_raster (cyclomatic 25): arnis::land_cover::read_esa_tile_into_raster has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0765234b914a0c5f90f6d797a3f9d4bad4843507ed4ada85b43f29cfdc2a359"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::refine::extent_joint (cyclomatic 25): arnis::mapillary::refine::extent_joint has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"9620d66a4e98150c33e4afabe00e4374e536eb19fb4726516b701be3f5df9da6"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::refine::bimodality (cyclomatic 25): arnis::mapillary::refine::bimodality has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"96baa0201645e82f52de9c75fe540b99c037617cd9dc8c6e77aa6cfeb12b1d90"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::visibility::preview_crop (cyclomatic 25): arnis::mapillary::visibility::preview_crop has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"d815bbf80c4a1940018cf5ddef94a5b4e2a1178336f0eaf12dbf1cc2dfec0283"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::overture::collect_from_parquet (cyclomatic 25): arnis::overture::collect_from_parquet has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::overture::overture_class_to_osm_building (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a51222a40b7a9e813011baa5e61050521d972a1969dc1140ced0884d163dc02"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::retrieve_data::fetch_data_from_overpass (cyclomatic 25): arnis::retrieve_data::fetch_data_from_overpass has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/retrieve_data.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"068545f8a0b1337afdc20dacd9880b6cd3bdea3f4a1749363c4e7070d1cc612f"}},{"ruleId":"D1","level":"warning","message":{"text":"Spec::new (cyclomatic 24): Spec::new has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6731d83646701a192ab777dc8f1223e61018ce3aa1e8a7c9eadd743171a90d8"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::attractions::pirate_ship (cyclomatic 24): arnis::element_processing::attractions::pirate_ship has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc1cd8cb6582acf40790a21942be0a8f3d883d985a9891560d0898fc04f8d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_wall_depth_features (cyclomatic 24): arnis::element_processing::buildings::generate_wall_depth_features has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fa2e388f70faacf9c52adbb482d053a2c54f4305e8163f0b1ec5ddc41b0d21"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_floors_and_ceilings (cyclomatic 24): arnis::element_processing::buildings::generate_floors_and_ceilings has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":11341}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c56bd4a536e35f70960f1bfb819a2b3dbe88fcc5a8b5798b56936fc0160b6a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::footprint_radial_fractions (cyclomatic 24): arnis::element_processing::buildings::footprint_radial_fractions has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5795a30f3b22c4e6e32de4d6f7390d2420862b3cec6f8fc0dffdef7339c2bb87"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::smooth_class_boundaries (cyclomatic 24): arnis::land_cover::smooth_class_boundaries has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2dc5ea896b8440be5880dec8d119cdc43baeba86f091e077e8bb104ef8f29e"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::visibility::geometric_candidates (cyclomatic 24): arnis::mapillary::visibility::geometric_candidates has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f4cb4a2ad8d62be3e9a4f7d1628b0f98a59f77863d950f7c8f611757afd44a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::barriers::generate_barriers (cyclomatic 23): arnis::element_processing::barriers::generate_barriers has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0e8bb01a8daccaaa5e940b21c235c57b1a931d3f77c7e052236c9cfb4685ba"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::bridge_modules::sweep_module (cyclomatic 23): arnis::element_processing::bridge_modules::sweep_module has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_modules.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ea144f3b0eb3bdeb171935c2b1fcda762af974ed5b7e618493292b486aa944"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_roof (cyclomatic 23): arnis::element_processing::buildings::generate_roof has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":17084}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8bf9a5bb3969967679c4cfbd1d47dfa51b7620eb9f068e473a8a2e5f5af3a2"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::power::generate_power_tower_impl (cyclomatic 23): arnis::element_processing::power::generate_power_tower_impl has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/power.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"df29daa9fa16f39725aa3f321f3ee20faa8c2dd48fd5151a9c6f13d40b0fa5ee"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::rooftops::place_water_tank (cyclomatic 23): arnis::element_processing::rooftops::place_water_tank has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b7de61a36ce99e1d0632eccabad1c23304916f548d73e9694eb999d08dc1aa"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::signage::place_wall_panel (cyclomatic 23): arnis::element_processing::signage::place_wall_panel has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4847ee56a69dc911cb4b0b5468d16dfae3fa8685969d7dfa235c955aa870d8"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::office (cyclomatic 23): arnis::element_processing::subprocessor::interior::commerce::office has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e83644b139e675fc9fec30c148b7d4aeb8d73b4d62fdf9ce0d75622880473ad"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::trains::timetable (cyclomatic 23): arnis::element_processing::trains::timetable has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6be2e45aa9156368adf66099acd3e4f7bbf890f4fb9d421026639d628591957"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::gui::add_localized_world_name (cyclomatic 23): arnis::gui::add_localized_world_name has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"17761848e5605d6138ee67312984ae6aa2ae615256af8b1c8ceb6439f275d801"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::models_3d::wikidata::placement::prescan (cyclomatic 23): arnis::models_3d::wikidata::placement::prescan has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::models_3d::wikidata::placement::block_by_const_name (cyclomatic 83) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/wikidata/placement.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"935fa38d2704c879a85d8c31572606f4c4e124b9373daacc58860a0e8eeeb37f"}},{"ruleId":"D1","level":"warning","message":{"text":"SignRegion::detect (cyclomatic 22): SignRegion::detect has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/region.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9632ce5ddf588501b1c68a3f5486b2b3ded722db696adca807e028afbb7f11"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::attractions::drop_tower (cyclomatic 22): arnis::element_processing::attractions::drop_tower has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a033cc0dd150ae70f92fc8ea24198cbd3061ae3df35d6532fd48c85a7262e0b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::calculate_building_height (cyclomatic 22): arnis::element_processing::buildings::calculate_building_height has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6056}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cc248755078fb2b7ca01e91b73c18d1c1bf2d68ffa26d15e8b2d273d41174a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::plan_unit_entrances (cyclomatic 22): arnis::element_processing::buildings::plan_unit_entrances has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9cef6adeb0460b5f6b4e1da1cd4dd7baaec940b738f4512b9c44503c3007fd"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::place_roof_surface (cyclomatic 22): arnis::element_processing::buildings::place_roof_surface has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":14941}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac207d7db28b2ce64229ae7702566f6af8ab3b015fbd1d29fafb45e6988c3cb"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_hipped_roof_inner (cyclomatic 22): arnis::element_processing::buildings::generate_hipped_roof_inner has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16233}}}],"partialFingerprints":{"codehealthFindingId/v1":"78234e303d31f05b659a559c0399ba238deb6f5507a9efc7dfedcc7f21df751d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::supermarket (cyclomatic 22): arnis::element_processing::subprocessor::interior::commerce::supermarket has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"518f51807b36b40c7da85b19d7ddd7eaa8e2f161ddc7273370af6c6679722422"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::ground_decoration::habitat (cyclomatic 22): arnis::ground_decoration::habitat has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_decoration.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8097e677dbf60048774d832af4c38309d38f5f2acab2b105b403ef61bd6991"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::gui::update_player_spawn_y_after_generation (cyclomatic 22): arnis::gui::update_player_spawn_y_after_generation has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0d8af978c05a8107706121021e95175f68cee70440a8fa087da30ad5ae210a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::shoreline::trace_boundaries (cyclomatic 22): arnis::land_cover::shoreline::trace_boundaries has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/shoreline.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dd5ec3b18dc0f366763c89ff7ed22cb561b6a4f7b2fbc7952256d48a660220"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::tile::assign_elements_to_tiles (cyclomatic 22): arnis::tile::assign_elements_to_tiles has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tile.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fa8d60e8af8e226bd191848e5b865de28e2c49be190b96ae190e7db53feee4"}},{"ruleId":"D1","level":"warning","message":{"text":"RailJoins::build (cyclomatic 21): RailJoins::build has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rail_track.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db3d60de2a8591f92f140e8f7bd6de1f657b8279ccfe1962c121623f7c9b6d5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::aerialways::draw_carrier (cyclomatic 21): arnis::element_processing::aerialways::draw_carrier has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8907fd6566c8d7fd3627ef492d3afb1fe10990696f0355c7740b7f255bb3202"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::man_made::generate_chimney (cyclomatic 21): arnis::element_processing::man_made::generate_chimney has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf80055316e24399c7a4454a8439a088af7515df6f1c2b65e76445e8cbe4a7a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::railways::generate_rail_tunnel_shell (cyclomatic 21): arnis::element_processing::railways::generate_rail_tunnel_shell has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e9a76b72480c661ad0ac3e3f8c788ad4f067a268cb72fced0615462da792c2"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::signage::generate_railway_node_signage (cyclomatic 21): arnis::element_processing::signage::generate_railway_node_signage has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1b47a39a041356721800d539a54014b5b9d86aff2b1808f1d992629a21ded1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::generate_building_interior (cyclomatic 21): arnis::element_processing::subprocessor::interior::generate_building_interior has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::subprocessor::interior::furnish (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4633b37dc8436accc3e501ec12a1cb38477369f6c421b58993e755de490c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::train_bodies::parts (cyclomatic 21): arnis::element_processing::train_bodies::parts has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d84d2eac5c4ca9ddb625d267702d9ead2f01f3730a34243e8940d77e078f25"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::trains::stop_features (cyclomatic 21): arnis::element_processing::trains::stop_features has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1717c370f03c970364291bf4d43e80b627494593e00b1e3496a8f011151a6d3"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::drop_islets (cyclomatic 21): arnis::elevation::postprocess::drop_islets has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f25de6077d0a4b9dbcb23d76a83166e17686bd5aef6d62cfec1ee21efc44a4"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::openings::wall_reference (cyclomatic 21): arnis::mapillary::openings::wall_reference has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb8c4b6fa1a5a86297f790790c3fa8d53f716d626e0bc00826fe649c452d77b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::water_steps::levels (cyclomatic 21): arnis::water_steps::levels has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_steps.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a9f031e8f21044270a25820172b0d2476c74319c3234a4cf10cc62c69123be"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::world_editor::java::write_region_to_disk (cyclomatic 21): arnis::world_editor::java::write_region_to_disk has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949fcbc1759ad718380e795466872893e401848e1db4ebe66cbadffdf90357e"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::world_editor::java::compute_lighting (cyclomatic 21): arnis::world_editor::java::compute_lighting has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35fa7ced30e936fe4633255c8834cb5684244de684fea8e434e89f7cabbf138"}},{"ruleId":"D1","level":"warning","message":{"text":"Climate::surface_palette (cyclomatic 20): Climate::surface_palette has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/climate.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e825067e478258fdc66bd641d50b53cb1ca467684e368e7a103fc2365cc8be"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildingCategory::from_element (cyclomatic 20): BuildingCategory::from_element 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 is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e8a7b958990871e38823390dad9872acc93734aa984d81c666dfdc83f550fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Ground::save_land_cover_debug_image (cyclomatic 20): Ground::save_land_cover_debug_image has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eebf87f76b480cc845eb37be21860615a81fc06afc481448b61aa9760efdb36"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::bresenham::bresenham_line (cyclomatic 20): arnis::bresenham::bresenham_line has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bresenham.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cb0e1c55e4d7989ee2b9efff38af46e1c39ed9e3ff29ad8d0117ca928f9928"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::schems::load_cave_schem (cyclomatic 20): arnis::caves::schems::load_cave_schem 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 is NOT this file\u0027s highest cyclomatic complexity: arnis::caves::schems::cave_map (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f92495fb2b6edf78bebd457381a16a017a59d7a3f37b276d02cf2c5edb7831"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::merge_way_segments (cyclomatic 20): arnis::element_processing::merge_way_segments has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c4ffad667fff5031bf8c7bf5aadf4309d78bef8fced27e2b109088e93e1032"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::aerialways::draw_pylon (cyclomatic 20): arnis::element_processing::aerialways::draw_pylon has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"d409224db110317731228c09f432f73a26f4a8ce548843f261a215764bd790ce"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::attractions::ride_kind (cyclomatic 20): arnis::element_processing::attractions::ride_kind has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d4a38d2a64a4eb416d30ad6607c636f7355372a1e5c3c19d992c6406a41d0e"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::attractions::carousel (cyclomatic 20): arnis::element_processing::attractions::carousel has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb38cb8f254fa6a3dcdb6e0d8713998a3dbcd03789e77b594bd6c6b8b1f69749"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::plan_mapped_entrances (cyclomatic 20): arnis::element_processing::buildings::plan_mapped_entrances 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 is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6903}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb37af58fa1e97c608c4402ce4c2f0818d5b3637abe5362f4065ec6cf9215d50"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::apply_condition_variation (cyclomatic 20): arnis::element_processing::buildings::apply_condition_variation has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":8834}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd4104d1bf59f4b9249b7f9d3fde54b4df48dff68b68b6859f9b2a3d66b9aed"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::highways::drop_buildings_on_aircraft_pavement (cyclomatic 20): arnis::element_processing::highways::drop_buildings_on_aircraft_pavement has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"24265822a0b2406749acb69ef61f0a98c1a5c5a93e36259b642c2a3323e3d4b5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::man_made::generate_mast (cyclomatic 20): arnis::element_processing::man_made::generate_mast has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11414bbc8d73c85126fbb14ca6579283ffee13e06535da1f26e1d6153e7948d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::signage::build_intersection_index (cyclomatic 20): arnis::element_processing::signage::build_intersection_index has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3037bca057cb18334d0e8965e6359ed0175345f866f0e04d9a8072ba865663a5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::signage::keys_for_element (cyclomatic 20): arnis::element_processing::signage::keys_for_element has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d933443542c91a83e2b47049a51263170b30daee05c76f190d0d4095dfc040"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::sports_hall (cyclomatic 20): arnis::element_processing::subprocessor::interior::halls::sports_hall has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e3b64aebdfccac53a25b9286434519b0fe9bcc46e67d535741a9f2ec5538d3"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::residential::tile_floor (cyclomatic 20): arnis::element_processing::subprocessor::interior::residential::tile_floor 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 is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::subprocessor::interior::residential::get_interior_block (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/residential.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86337873d2ee3f2d369a5c1596156a3ee1b309850f770a2504de950596632d4"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::trains::keep_right (cyclomatic 20): arnis::element_processing::trains::keep_right has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"62123cd7036e275d3a786519e9c4e5393eaf05cfe676c41c4f040914d1c6be19"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::water_areas::relation_rings (cyclomatic 20): arnis::element_processing::water_areas::relation_rings has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3ce920c6d0d0dbc5351123a3d5dac108f8d437397dd50b849a75c81872c22a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::pull_coastal_land_toward_water (cyclomatic 20): arnis::elevation::postprocess::pull_coastal_land_toward_water has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"c665eed647a89908917ab692eb2e6ae7f510dddf2bcd31659b1968ceec2a8140"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::osm_water_override::build_protected_land_bitset (cyclomatic 20): arnis::land_cover::osm_water_override::build_protected_land_bitset has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"src/land_cover/osm_water_override.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc5507deaa1ea5b0eea5f296c22752af31f5c3bbdd9b8bb38909f1905bb8600"}},{"ruleId":"D1","level":"warning","message":{"text":"FloodFillCache::collect_building_footprints (cyclomatic 19): FloodFillCache::collect_building_footprints has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill_cache.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0ae63f3da712ac8fd426dce5608379b12a74362c5410af6566fa0c3d8bf82d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::biome::biome_for_class (cyclomatic 19): arnis::biome::biome_for_class has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/biome.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f49633d42a327a4edc20058788ed4a5682eb83cb91dcdd05446efc138431d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::water::plan_pool (cyclomatic 19): arnis::caves::water::plan_pool has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/water.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fdd757899d9e0f3ced1705ea1b0015cf804aa6ff7141b395c677f1b501c842"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::celestial::mars_palette (cyclomatic 19): arnis::celestial::mars_palette has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/celestial.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76f4e5ea4fed5c3e7744ccdc60cf74105409a4cfc7a61f9eb58c594e75d4175"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::clipping::clip_polygon_sutherland_hodgman (cyclomatic 19): arnis::clipping::clip_polygon_sutherland_hodgman has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"234421533a57ce365f475b06a17315043379919dfa0736953a4c1f10afbb7cbf"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::cottage (cyclomatic 19): arnis::element_processing::subprocessor::interior::cottage has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::subprocessor::interior::furnish (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a92fa53924a7adcec3da4f754fe6a5af4eaa1fec5ea098a11d85310a20242d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::trains::stops_on (cyclomatic 19): arnis::element_processing::trains::stops_on has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba68790e06230856882014551ccc98174c4bb922a6fab37c8666754d8c1ecde4"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::water_areas::scanline_fill_water (cyclomatic 19): arnis::element_processing::water_areas::scanline_fill_water has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"59404eeb8c16801616fc41a2cfd0ccfcf88893a3c7d1d1cedd9ad017472a609a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::mark_beaches (cyclomatic 19): arnis::land_cover::mark_beaches has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6440bd59002422e2052e1864238549367c90d443887997bc776fe73513086e21"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::osm_land_override::dilate (cyclomatic 19): arnis::land_cover::osm_land_override::dilate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_land_override.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f26bfa59692f41bbf71bc8da2c44ca5b580b23d173b1cb51225398cf7e03d9"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::displays::collect (cyclomatic 19): arnis::mapillary::displays::collect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/displays.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ee9ea1d20c2140251b446566e716816531896331e1071fb52f32a6ff28a54a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::facades::collect_preview_walls (cyclomatic 19): arnis::mapillary::facades::collect_preview_walls has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9873f40230fd0ca58468f97fe604f90d4080eb75f060841c61419650147189"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::pipeline::texture_wall (cyclomatic 19): arnis::mapillary::pipeline::texture_wall has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e2be76f237df78ac10845846ecddf6ada7a548f9dd34df83d35b64489b41f0"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::rectify::vegetation_mask (cyclomatic 19): arnis::mapillary::rectify::vegetation_mask has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e7b0ab36c56bbab798876819520c3d741e145765fdb0a0d38ceaa090fc573f"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::refine::lean_from_gradients (cyclomatic 19): arnis::mapillary::refine::lean_from_gradients has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58a463c59636f3d018e2d53faf1028232e00145080ee411cc6ea356b5389492"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::models_3d::wikidata::placement::structure_type_palette (cyclomatic 19): arnis::models_3d::wikidata::placement::structure_type_palette has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: arnis::models_3d::wikidata::placement::block_by_const_name (cyclomatic 83) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/wikidata/placement.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bf60015d8792b7a483651a9566523dc5f187f9c6c15421daf0d87162db93c8"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::structures::schematic::load_palettized (cyclomatic 19): arnis::structures::schematic::load_palettized has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::structures::schematic::map_structure_block (cyclomatic 267) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/schematic.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da340b0294bd9b06a3022ebec0b76d7663d0a5d1b10979aa9b8893f1ea5108a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::world_editor::style::ruin_building (cyclomatic 19): arnis::world_editor::style::ruin_building has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7c0844dcbad7bcf034be44b27c16b2325811eec051c4ec153a7858268882af"}},{"ruleId":"D1","level":"warning","message":{"text":"Grid::cells (cyclomatic 18): Grid::cells has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/disasters.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"589c1d0a44d2e7569c80f3a82d7121caef074b4ba6cb0a560e16cc09002319f7"}},{"ruleId":"D1","level":"warning","message":{"text":"RoadClearance::build (cyclomatic 18): RoadClearance::build has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::barriers::barrier_style (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c5add762df3b4d83148269744a9430fdf0af31f6aca7131266ca0ce6f24263"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterialRegion::in_north_america (cyclomatic 18): MaterialRegion::in_north_america has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73203bf03dcdec84d1270f4272656289d06d5d355e75a9cd3872bbb3336e674"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterialRegion::canadian (cyclomatic 18): MaterialRegion::canadian has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8293d6963fd6862d396c2f66f2598f53a81d1d00f6d40f51ba9c1234ca5e96da"}},{"ruleId":"D1","level":"warning","message":{"text":"FloodFillCache::collect_sealed_surfaces (cyclomatic 18): FloodFillCache::collect_sealed_surfaces 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":"src/floodfill_cache.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"be66b2a76ab6764e2487ea3b78b25142f24b84a673d3c5a868843298cee544af"}},{"ruleId":"D1","level":"warning","message":{"text":"WorldToModify::merge_section_write_if_air (cyclomatic 18): WorldToModify::merge_section_write_if_air 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":"src/world_editor/common.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"41601ea254252e34a2d1e0b0dbf2142c8825657dbb7ef53aee14ee874d1d7dbf"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::caves::decoration::build_giant_mushroom (cyclomatic 18): arnis::caves::decoration::build_giant_mushroom has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a675ce0b8dcc543e16498727e04c31f93ab671908bd60b0b2236f0c6a6ab682"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::datapack::discoveries::collect (cyclomatic 18): arnis::datapack::discoveries::collect 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":"src/datapack/discoveries.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58874a23231d101631e02ab54b8b4d711d44a63ba1f7261e788b8a742e6592a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::aerialways::generate_aerialway (cyclomatic 18): arnis::element_processing::aerialways::generate_aerialway 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":"src/element_processing/aerialways.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db5c98b0495c63c0014d6472bf37c5d7e77d8a0289156f2303b0dbadc229efe"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::attractions::bumper_cars (cyclomatic 18): arnis::element_processing::attractions::bumper_cars 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":"src/element_processing/attractions.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0fa4c00610da2cc3578cd450f48f35f1bae037b3ddb0caaff3ebb4683d2b62"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::wall_typology (cyclomatic 18): arnis::element_processing::buildings::wall_typology has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0075dd57a9c599f0056a22af7e24a7e03f77cace4a27d6898db598f7cbbcaed"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::lay_out_facade_columns (cyclomatic 18): arnis::element_processing::buildings::lay_out_facade_columns has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7401934614c41a5229899bf2d29c136c0533844f4adf1a1db3fd8e2813ffe35"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_pyramidal_roof (cyclomatic 18): arnis::element_processing::buildings::generate_pyramidal_roof has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16727}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee529f4b694b9786da9bb831cdbfcf7d779c112834c4d784453f3a6031cdf4c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::cars::bend_into (cyclomatic 18): arnis::element_processing::cars::bend_into has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f5a87a96a676d9fa7a003ffd5aa615e9fb44a214918a4272a4f6b89dd82271"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::historic::generate_memorial (cyclomatic 18): arnis::element_processing::historic::generate_memorial has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/historic.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d482c8ef01ff9858d7b05f5bd13e4aa12e823a265cd81acfa78e1b6e8398d98"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::parking_garage::build_level (cyclomatic 18): arnis::element_processing::parking_garage::build_level 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":"src/element_processing/parking_garage.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ee3563a13e4c7e61288c8b830776f4296c8dcccc2461375665107a0658e176"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::rooftops::place_penthouse (cyclomatic 18): arnis::element_processing::rooftops::place_penthouse 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":"src/element_processing/rooftops.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"73740c30d01b7ad00b20ef3caabca07b9725993349ad7c0ba56a6f730c9e3938"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::factory (cyclomatic 18): arnis::element_processing::subprocessor::interior::halls::factory has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc203c98c5b0007129e8a004864d5c4c002790c772185bbf8aaf252955222d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::train_bodies::compose (cyclomatic 18): arnis::element_processing::train_bodies::compose 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":"src/element_processing/train_bodies.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b874cd33e5c3deb03effdef991c60341dd490652d2ccd0c56b5f035bcd9ec308"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::floodfill::seeded_fill (cyclomatic 18): arnis::floodfill::seeded_fill 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":"src/floodfill.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e029d281c4e6885ef30a5999125b315dc6b966e87d23583fa2cc742509f6e11"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::pipeline::building_colour (cyclomatic 18): arnis::mapillary::pipeline::building_colour 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":"src/mapillary/pipeline.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d97ade80184bcef1e4368a69b96ce6fd192fa0ba52c109319f82bc172835bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::models_3d::voxelize::accumulate_glb (cyclomatic 18): arnis::models_3d::voxelize::accumulate_glb 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":"src/models_3d/voxelize.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe997c6902a49cb218c4b12847ffc2eb65e6973db30a07d7535f652cb78c4d05"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_parser::inherit_masonry_facade_tags (cyclomatic 18): arnis::osm_parser::inherit_masonry_facade_tags 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":"src/osm_parser.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ae9a49b9866ac47033e36bdc633d57fdaf81350af9a00792397835be30d43"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::structures::elizabeth_tower::shaft (cyclomatic 18): arnis::structures::elizabeth_tower::shaft 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":"src/structures/elizabeth_tower.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecddc14fd5a4ba0d290ab604fb11db696b84da7d5aec90a7fb04950084f7d75f"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::structures::elizabeth_tower::clock_stage (cyclomatic 18): arnis::structures::elizabeth_tower::clock_stage 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":"src/structures/elizabeth_tower.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b216e3cf06b10b2d1dca333de6e31548a73d2d6f5a4240fcc35e2ec480546a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::water_steps::plan (cyclomatic 18): arnis::water_steps::plan 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":"src/water_steps.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2da28ece5b39936d870451aec562730875d7231e411771abd5cbd042d8df01b"}},{"ruleId":"D1","level":"warning","message":{"text":"PreviewAccumulator::ingest_region (cyclomatic 17): PreviewAccumulator::ingest_region has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_renderer.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5727f7401e74e72f447502c41f33c27afcad58d1b97c77f73718c86bf7d9c17"}},{"ruleId":"D1","level":"warning","message":{"text":"RegionLod::ingest_section (cyclomatic 17): RegionLod::ingest_section has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/voxy/lod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc83216adae31b31483fefb1ddef24afff3611eebf911db9f0d00644c8fc7cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::canopy::read_strip_index (cyclomatic 17): arnis::canopy::read_strip_index has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canopy/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"73996054b00533dbd5e0c74b72762400e47850915886ce70266877394d0a53f5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::rooftops::pick_membrane (cyclomatic 17): arnis::element_processing::rooftops::pick_membrane has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f0af62152a4899e382ee5a7549c468b408d4d6b1c87fe1fa35279572f50e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::train_bodies::coach (cyclomatic 17): arnis::element_processing::train_bodies::coach has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::train_bodies::key (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9d787603f31fa81e64a59590b982578ff9202edb8e6a9c7d0d5e796af1da2a"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::blur_values (cyclomatic 17): arnis::elevation::postprocess::blur_values has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5924fca784889594153516152ef1d833598b8e78936c68a8e46fa84d4482d49c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::providers::mapterhorn::fetch_tile_pyramid (cyclomatic 17): arnis::elevation::providers::mapterhorn::fetch_tile_pyramid has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/providers/mapterhorn.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba66071015e03f275fc491272aebeeb91abefdc38ea71023e3e67cb7a6f74d9"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::floodfill::inside_mask (cyclomatic 17): arnis::floodfill::inside_mask has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14b39d5fec138b3fdc7b505f1effc51f1403e57dfeb3408f8af9ab05833c848"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::gui::set_player_spawn_in_level_dat (cyclomatic 17): arnis::gui::set_player_spawn_in_level_dat has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedea25f71aa2f411670803d27e7b9faf4917aee5b4a500ca78cb577d2441ce7"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::parse_ifd (cyclomatic 17): arnis::land_cover::parse_ifd has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2c058408d75c3386a2ec5d1058b27a611e82c2aab81daadfd616b29161f024"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::shoreline::reconstruct_water_shoreline (cyclomatic 17): arnis::land_cover::shoreline::reconstruct_water_shoreline has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/shoreline.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e34d369e2b0597835bbef0242c6f3a224613c5ab09fec4a7ad5592d1563d3c2"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::land_cover::shoreline::split_point (cyclomatic 17): arnis::land_cover::shoreline::split_point has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/shoreline.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf2ac33f3b63c096131e81757354e3b8635ce75f88ac0b81df0788c0f8c323d"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::landmarks::place_one (cyclomatic 17): arnis::landmarks::place_one has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/landmarks.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d0cb4345d148ad37304cb5ec87537ad591bb5588228dd839bf111879902d28"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::bands::find_lattice (cyclomatic 17): arnis::mapillary::bands::find_lattice has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbffe4963fa43885c1ce1ff5dcf18527e832790638c0bda651187aad471ac4c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::one_world::resolve (cyclomatic 17): arnis::one_world::resolve has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/one_world.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7234c1567de5ffc91a060367d63a9a057e86ec7dbbbfa31de0d63fcfe24099"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_parser::parse_osm_xml::on_open (cyclomatic 17): arnis::osm_parser::parse_osm_xml::on_open has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"636eae8917c8b9132cb8796e243f81ccac7abac6ea1a995656ef2bd4a2a797d1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::osm_tiles::decode (cyclomatic 17): arnis::osm_tiles::decode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3402fbd813c0e7a687c4d2e80726133b006d4b4db1650667a4d52943732d14"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::overture::parse_wkb_polygon (cyclomatic 17): arnis::overture::parse_wkb_polygon has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::overture::overture_class_to_osm_building (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cca42f49a2c1de124af73bb9765e6ac011705196fc9db5c570c42c1f356d5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::water_depth::compute_big_water_field (cyclomatic 17): arnis::water_depth::compute_big_water_field has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1484594e8a76c115fdc7f87e329eebf0d4ecb4e53d6563c3c4dddfc6b83aa930"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::world_editor::style::snow_over (cyclomatic 17): arnis::world_editor::style::snow_over has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb94d328cbfc436c2cfbfffce0adbe6fb736f854ae012a2c69664b835736907"}},{"ruleId":"D1","level":"warning","message":{"text":"Ground::new_enabled (cyclomatic 16): Ground::new_enabled has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"8856ccf2d9f1393ea079880a17a8f6c725005e5e1dfba2a1cdaeed1e8d445e03"}},{"ruleId":"D1","level":"warning","message":{"text":"MipTexture::new (cyclomatic 16): MipTexture::new has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d17c0070558e17ac08dce576c05a234c1f0497f420f373f55eb07937ff612c4"}},{"ruleId":"D1","level":"warning","message":{"text":"RegionLibrary::pick_slot (cyclomatic 16): RegionLibrary::pick_slot has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85693fa8b99f7e0073eae42cb5cf581b13e26354cc1d2e8d2225b6f6a68a2f5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::canopy::fill_from_tile (cyclomatic 16): arnis::canopy::fill_from_tile has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canopy/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d608117ce8ca5e85b060e63720378ef241fc9980a1017e48191036a5e95eee52"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::clipping::clip_polyline_to_bbox (cyclomatic 16): arnis::clipping::clip_polyline_to_bbox has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b24ff2da7820be1b8b1e610f881868946545b505fa23ef5dae3e31b6ea90f77"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::bridge_towers::collect (cyclomatic 16): arnis::element_processing::bridge_towers::collect has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_towers.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c980d4a237cfd19ca9f2fcbb268cccd88dc4efbed1166b4c1bd4365a0aabd3f1"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::pick_ground_floor (cyclomatic 16): arnis::element_processing::buildings::pick_ground_floor has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"079ea755b75d224b1ac2b05198e1d3b1abd9a3e3768df010dbce89fbdf25638c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::buildings::report_wall_segments (cyclomatic 16): arnis::element_processing::buildings::report_wall_segments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::element_processing::buildings::regional_wall_pool (cyclomatic 60) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7736}}}],"partialFingerprints":{"codehealthFindingId/v1":"6084b1a3ac721a8ecd7757b673f5779f4d73f90bd10235a047cb87173e783a84"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::fuel_stations::generate_station (cyclomatic 16): arnis::element_processing::fuel_stations::generate_station has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d32823312609dde80163075479c7d9dce443c6f3f85c0e3659a0b155a855ee"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::railways::generate_at_grade_rail (cyclomatic 16): arnis::element_processing::railways::generate_at_grade_rail has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80783079dd6e752a3d9b8ab9d66bd2905e09544492234a560015fcb47a8bf51"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::civic::library (cyclomatic 16): arnis::element_processing::subprocessor::interior::civic::library has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/civic.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b6a4411e0ac5822aebdf8b2863bf5a62a7433738c2e74e8d93fae7fa4f1b07"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::civic::lobby (cyclomatic 16): arnis::element_processing::subprocessor::interior::civic::lobby has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/civic.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1924b39b6eff2f8f1f1e897510de9857d90959d59ed3b495ec0e476fc156e75b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::element_processing::waterfront::generate_breakwater (cyclomatic 16): arnis::element_processing::waterfront::generate_breakwater has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterfront.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ed7333dac8ab8759a9fe1d2a331454d9745aff48b67d0de89d139bf8572624"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::elevation::postprocess::scale_to_minecraft_reserving (cyclomatic 16): arnis::elevation::postprocess::scale_to_minecraft_reserving has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"94feda2644e5da3ceea1c118105eb26b392b7c9ad708177985d2cfa13d60e15b"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::write_debug_grids (cyclomatic 16): arnis::mapillary::write_debug_grids has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74a750b49cb8117bf8294316857466377e50f66bb49835e3523cd42dc891f1c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::displays::fill_missing (cyclomatic 16): arnis::mapillary::displays::fill_missing has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/displays.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"a241bea7119ded10e6cbb18d742963f7a68d094c605a5d108af12b49748dd2f6"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::rectify::loose_crop (cyclomatic 16): arnis::mapillary::rectify::loose_crop has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"033822a7b23315ad4c5949ef5d21e7fe787345216b26d52a7409ae25906a79c5"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::mapillary::refine::decide_wall (cyclomatic 16): arnis::mapillary::refine::decide_wall has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eae28190d35174c0abbd95b0849fb8be7ae8bf33af97ca4b80360ce364cdc0"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::overture::process_partition_file (cyclomatic 16): arnis::overture::process_partition_file has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::overture::overture_class_to_osm_building (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23fb6abc555e0b93fea05ef773cd9b7a9e99ffbf9c80c7ae5102eb0c6067f80"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::trees::schematic::load_schem (cyclomatic 16): arnis::trees::schematic::load_schem has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: arnis::trees::schematic::map_block (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/schematic.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d00f5c9adf1aa855da48d70c145146d89291f6164664b5495828f61a32914c"}},{"ruleId":"D1","level":"warning","message":{"text":"arnis::world_editor::style::ruin_open_ground (cyclomatic 16): arnis::world_editor::style::ruin_open_ground has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a42ecffb048d280bfbe3b7b50d3aad2943824dcd1fe81a0d4fe0a135facec8b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::generate_highways_internal (cognitive 775): arnis::element_processing::highways::generate_highways_internal has cognitive complexity 775 (threshold 15). Drivers by points: if/else 124 (553 pts), loops 21 (140 pts), match/switch 6 (42 pts), boolean chains 40 (nesting depth added 584). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"36de029b0f39300baf031f1b8b5a424e1acdba80d82a6ee88fcbe646b98d44b9"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::ground_generation::generate_ground_region (cognitive 658): arnis::ground_generation::generate_ground_region has cognitive complexity 658 (threshold 15). Drivers by points: if/else 112 (513 pts), match/switch 8 (51 pts), boolean chains 48, loops 9 (46 pts) (nesting depth added 481). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_generation.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3766fe4be1eaa58d9e8858b47ff3fd348c31bfde50f3e6127b77b0fe5ab29caf"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::natural::natural_area (cognitive 488): arnis::element_processing::natural::natural_area has cognitive complexity 488 (threshold 15). Drivers by points: if/else 89 (370 pts), loops 13 (69 pts), match/switch 8 (38 pts), boolean chains 11 (nesting depth added 367). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/natural.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e988fa2baa8c84990714f8ff0a9b99f8432850df71c8426e81006ab4af62a27e"}},{"ruleId":"D2","level":"warning","message":{"text":"BridgeStructureMap::build (cognitive 486): BridgeStructureMap::build has cognitive complexity 486 (threshold 15). Drivers by points: if/else 101 (294 pts), loops 62 (151 pts), boolean chains 36, match/switch 2 (5 pts) (nesting depth added 285). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7490488deec4a43481d9285b0a443167d2c1daa915d8fdee6fd1187608c509"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::data_processing::generate_world_with_options (cognitive 419): arnis::data_processing::generate_world_with_options has cognitive complexity 419 (threshold 15). Drivers by points: if/else 140 (269 pts), loops 26 (85 pts), boolean chains 39, match/switch 12 (26 pts) (nesting depth added 202). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"2652cc5b0d341e374a594205c08a92532282e85268530b370ed935c5524aea37"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::decoration::decorate (cognitive 277): arnis::caves::decoration::decorate has cognitive complexity 277 (threshold 15). Drivers by points: if/else 97 (233 pts), loops 6 (25 pts), boolean chains 14, match/switch 2 (5 pts) (nesting depth added 158). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d076ffbba57ad5465ac0c404aba5711ca843788007ccf2addcba1113f687471d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_buildings (cognitive 242): arnis::element_processing::buildings::generate_buildings has cognitive complexity 242 (threshold 15). Drivers by points: if/else 86 (143 pts), boolean chains 48, loops 16 (41 pts), match/switch 9 (10 pts) (nesting depth added 83). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":11550}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a0747d092dac4c8124b36821897ba8ccb4cb8be1e41442de503e8307b01e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::building_construction::generate (cognitive 169): arnis::element_processing::building_construction::generate has cognitive complexity 169 (threshold 15). Drivers by points: if/else 41 (95 pts), loops 22 (54 pts), boolean chains 14, match/switch 2 (6 pts) (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_construction.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bb14dbef1129d8473a302e74ac4de806e9dcb4c8f3a9c3f8ba11d65933b70e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::landuse::landuse_area (cognitive 148): arnis::element_processing::landuse::landuse_area has cognitive complexity 148 (threshold 15). Drivers by points: if/else 57 (105 pts), match/switch 10 (30 pts), boolean chains 12, loops 1 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5575a2eefd8a6074ee4b9e2187290aa2b9b2cee1631d070cc0a53439176def"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::amenities::generate_amenities (cognitive 147): arnis::element_processing::amenities::generate_amenities has cognitive complexity 147 (threshold 15). Drivers by points: if/else 33 (106 pts), loops 9 (38 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 103). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/amenities.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e10724a935d6b4ce74208d49c0d9e2f26009c9fab08323094661ac436e50e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::rooftops::fit_out_roof (cognitive 147): arnis::element_processing::rooftops::fit_out_roof has cognitive complexity 147 (threshold 15). Drivers by points: if/else 66 (109 pts), loops 6 (17 pts), boolean chains 12, match/switch 6 (9 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2804c08a0e20a8cdaa07ae8d92ba611dccefec00b5fd2c95539053a1e1bb92"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fuse::inpaint_telea (cognitive 136): arnis::mapillary::fuse::inpaint_telea has cognitive complexity 136 (threshold 15). Drivers by points: if/else 24 (90 pts), loops 18 (38 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a580bd292666fd737333a31d3eb202dbd96c351a8636bcb13e54345aeb92e8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::level_water_surfaces (cognitive 132): arnis::elevation::postprocess::level_water_surfaces has cognitive complexity 132 (threshold 15). Drivers by points: if/else 31 (77 pts), loops 15 (40 pts), boolean chains 12, match/switch 1 (3 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7db714d1967661389ad99ec135cc315b457942e152d3b21e65adcb3facf8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::list_partition_files (cognitive 115): arnis::overture::list_partition_files has cognitive complexity 115 (threshold 15). Drivers by points: if/else 13 (63 pts), loops 6 (26 pts), match/switch 4 (24 pts), boolean chains 2 (nesting depth added 90). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb5552a89bd77f0250053b526dc6e0faca487c8ca48743df39b6c46a14df3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::find_rects (cognitive 110): arnis::mapillary::openings::find_rects has cognitive complexity 110 (threshold 15). Drivers by points: if/else 40 (70 pts), boolean chains 29, loops 4 (11 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ad067d62306b641e3fd89a30b8e030b86bf2c16a4a54eb87bff8ad07a1f655"}},{"ruleId":"D2","level":"warning","message":{"text":"RoadMarkingIndex::resolve_junction (cognitive 109): RoadMarkingIndex::resolve_junction has cognitive complexity 109 (threshold 15). Drivers by points: if/else 37 (61 pts), boolean chains 28, loops 7 (11 pts), match/switch 5 (9 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0874605f4a5b731949964705d687d3a958d97afe584a7bfac7cc416d87d1b52"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::args::validate_args (cognitive 108): arnis::args::validate_args has cognitive complexity 108 (threshold 15). Drivers by points: if/else 54 (81 pts), boolean chains 24, match/switch 2 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cc0098aab22cda84400117cf5285755b3f787f744a6f56b3f243f15d9bbabe"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::roof_wings (cognitive 108): arnis::element_processing::buildings::roof_wings has cognitive complexity 108 (threshold 15). Drivers by points: if/else 31 (60 pts), loops 16 (31 pts), boolean chains 17 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15494}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cc4b2dc68f69e22be4f4cd02b681fc1caccbbd7f4fad027e6b3e39dd0e806b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::gui::gui_start_generation (cognitive 105): arnis::gui::gui_start_generation has cognitive complexity 105 (threshold 15). Drivers by points: if/else 52 (77 pts), match/switch 11 (16 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ee4531450363d623d52860439709eed930dcf7b93502442449d38eb38bdd68"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::classify (cognitive 104): arnis::mapillary::openings::classify has cognitive complexity 104 (threshold 15). Drivers by points: loops 18 (44 pts), if/else 17 (43 pts), boolean chains 15, match/switch 1 (2 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e7e33fc66a4b0a4ae6992e421d5ffe55b0f9facbef4392aa02e42df8010463"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::bridge_repair::apply_bridge_land_cover_repair (cognitive 103): arnis::land_cover::bridge_repair::apply_bridge_land_cover_repair has cognitive complexity 103 (threshold 15). Drivers by points: if/else 27 (72 pts), loops 11 (20 pts), boolean chains 11 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/bridge_repair.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc088bb65d39328b3cd47160ba670fe4b5812b2c0490d19bf010af488ede9a59"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::bands::complete_windows (cognitive 103): arnis::mapillary::bands::complete_windows has cognitive complexity 103 (threshold 15). Drivers by points: if/else 23 (54 pts), loops 11 (24 pts), boolean chains 18, match/switch 3 (7 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a85d6402bcd776f2bb3b2ddc96f1e2441ae1e91560347fa646cbf2e9f5c9c5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::schems::stamp_region (cognitive 101): arnis::caves::schems::stamp_region has cognitive complexity 101 (threshold 15). Drivers by points: if/else 19 (65 pts), loops 7 (23 pts), boolean chains 9, match/switch 1 (4 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8fbbe96337af3813b8b96b93d2b0db47340e233b4ed18440ab36976015d2d1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::run_cli (cognitive 97): arnis::run_cli has cognitive complexity 97 (threshold 15). Drivers by points: if/else 52 (73 pts), match/switch 8 (12 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9238d3e0b9658089775a2efdc395e4193fd5a8c04eff96090f2c0c12473930f1"}},{"ruleId":"D2","level":"warning","message":{"text":"RoadMarkingIndex::build (cognitive 95): RoadMarkingIndex::build has cognitive complexity 95 (threshold 15). Drivers by points: if/else 23 (57 pts), loops 17 (28 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a4d9c49f5f286fb210d7e82539892d8b5ed8ec593ffe0ab9adab1e9b047152"}},{"ruleId":"D2","level":"warning","message":{"text":"SectionToModify::to_section (cognitive 91): SectionToModify::to_section has cognitive complexity 91 (threshold 15). Drivers by points: if/else 21 (48 pts), match/switch 8 (26 pts), loops 7 (17 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d78641e72c8139f53fac039f8dab1b95c6d3c0f2b7334a24df5f907308cc4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::build (cognitive 90): Tree::build has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (44 pts), loops 14 (35 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f672b8a0bb9a3c01e36c7611046f0c1b0d2e84087b644de49fd453bb8696fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::bands::segment_bands (cognitive 90): arnis::mapillary::bands::segment_bands has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (57 pts), loops 15 (23 pts), boolean chains 10 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8499a1f14b8b2aa936d9e98f3911a75ed5963bcc9d672c51e1d05c46221ef8d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::generate_rail_bridge (cognitive 89): arnis::element_processing::railways::generate_rail_bridge has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (63 pts), loops 9 (15 pts), boolean chains 10, match/switch 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d2e3fdaf69672f6d4d53f17aa8b1db956d95b302b650ae10affa652ef259fb"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::spatial_relation_part_suppression (cognitive 89): arnis::osm_parser::spatial_relation_part_suppression has cognitive complexity 89 (threshold 15). Drivers by points: if/else 24 (44 pts), loops 16 (29 pts), boolean chains 13, match/switch 1 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7b1a3f138b98ccab610084af6f86e8ef6451ac845343d1a876cff7f508d857"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::drop_water_on_steep_terrain (cognitive 88): arnis::elevation::postprocess::drop_water_on_steep_terrain has cognitive complexity 88 (threshold 15). Drivers by points: if/else 16 (56 pts), loops 9 (24 pts), boolean chains 8 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8c3e0af38598f3279b7e05eb06f143a8b313c9bea5a66a0c991fd701c7c2de"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_window_frames (cognitive 87): arnis::element_processing::buildings::generate_window_frames has cognitive complexity 87 (threshold 15). Drivers by points: if/else 21 (58 pts), boolean chains 15, loops 6 (14 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c576533f237b8e5627f63a17c53ca037e3c1e4f0a319077434e66958b9ebd859"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::leisure::leisure_area (cognitive 85): arnis::element_processing::leisure::leisure_area has cognitive complexity 85 (threshold 15). Drivers by points: if/else 19 (62 pts), loops 4 (13 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/leisure.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a8481dd49475f9f18990d0b8b37fc5d054759fa5152fffe4731443a6b752bd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::facades::project_wall (cognitive 85): arnis::mapillary::facades::project_wall has cognitive complexity 85 (threshold 15). Drivers by points: if/else 30 (66 pts), loops 6 (9 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd2af09ef41b836d71a6013438c7d2186aaf851df863d7e26c20b2c50268daa"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::carve_region (cognitive 84): arnis::caves::carve_region has cognitive complexity 84 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 17 (26 pts), boolean chains 10 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"db25a350964aed3cbc524fabc706a943f3f8f24a3d02e53515a3ba8543b3fd44"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::collect_tunnel_portals (cognitive 84): arnis::element_processing::highways::collect_tunnel_portals has cognitive complexity 84 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 11 (23 pts), boolean chains 4 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e42fd59e38e376c71137f7fd84f3a0d3f0e1643aed8052fdd2a9fa2e6bf920"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::generate_highway_tunnel_shell (cognitive 83): arnis::element_processing::highways::generate_highway_tunnel_shell has cognitive complexity 83 (threshold 15). Drivers by points: if/else 25 (43 pts), loops 18 (32 pts), boolean chains 7, match/switch 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"156b419ac5c67c816bdbf0e1c3af6db796c62c87691fa9aaedb8f89699a3b034"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::decoration::plan_geodes (cognitive 82): arnis::caves::decoration::plan_geodes has cognitive complexity 82 (threshold 15). Drivers by points: if/else 16 (51 pts), loops 8 (24 pts), boolean chains 5, match/switch 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19505cb3d32010444adc164978b741d8bfb2d63ea3ebad052a4b0d9fe4b6d10"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildingStyle::resolve (cognitive 81): BuildingStyle::resolve has cognitive complexity 81 (threshold 15). Drivers by points: if/else 43 (52 pts), boolean chains 24, match/switch 3 (5 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d554a06ca65af724aa4ed20413dc8fd851b32cfc45960570068b0e387835fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::data_processing::process_element (cognitive 81): arnis::data_processing::process_element has cognitive complexity 81 (threshold 15). Drivers by points: if/else 48 (66 pts), boolean chains 12, match/switch 2 (3 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be161fac5211674e54bc80dc77589c000f46969e4dc433d8cd46000ec27821"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::tile::assign_elements_to_tiles (cognitive 81): arnis::tile::assign_elements_to_tiles has cognitive complexity 81 (threshold 15). Drivers by points: if/else 13 (55 pts), loops 7 (24 pts), match/switch 1 (2 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tile.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0370cc311d254b93dd8bb04eaa0fa5459eef9934a0cadc417e5da303d16e0390"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::building_facade::compute_facade_plan (cognitive 79): arnis::element_processing::building_facade::compute_facade_plan has cognitive complexity 79 (threshold 15). Drivers by points: if/else 23 (53 pts), loops 7 (15 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_facade.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b006640482c0ee635534bdc7f3e6fb742cc29b4e6b561fe78518a51c7d575753"}},{"ruleId":"D2","level":"warning","message":{"text":"BridgeSurfaceMap::build (cognitive 78): BridgeSurfaceMap::build has cognitive complexity 78 (threshold 15). Drivers by points: loops 14 (38 pts), if/else 11 (31 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 47). 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":"src/element_processing/bridges.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44b3f9d09235f4e7ca33b543d9cfc8f3dd7fc0c63b87319ca0c5fd63305e259"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::unzoned_wall_block (cognitive 78): arnis::element_processing::buildings::unzoned_wall_block has cognitive complexity 78 (threshold 15). Drivers by points: if/else 34 (54 pts), boolean chains 24 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":9239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45eee6882591a43cc24f2a27a50247611ad5a350a2bfb5865f4137dffd57bec"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_gabled_roof (cognitive 78): arnis::element_processing::buildings::generate_gabled_roof has cognitive complexity 78 (threshold 15). Drivers by points: if/else 37 (54 pts), match/switch 6 (10 pts), boolean chains 7, loops 4 (7 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b1c20075e92b1e3a9b5f2a7bd09ae820c4bf86ae88b22234cae3a5fc9d418d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::tiles::collect_from_tiles (cognitive 77): arnis::overture::tiles::collect_from_tiles has cognitive complexity 77 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 7 (17 pts), match/switch 3 (10 pts), boolean chains 3 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/tiles.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bcbba41a16ab610739e90fb5a983ee6850a383585ee3903bbfadd76a639f31"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialRegion::elsewhere (cognitive 76): MaterialRegion::elsewhere has cognitive complexity 76 (threshold 15). Drivers by points: boolean chains 41, if/else 34 (35 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba3a7696692b16b40e37427f7c68fdf60afb37fe00006846c68373abce8575d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::schems::place_schem (cognitive 76): arnis::caves::schems::place_schem has cognitive complexity 76 (threshold 15). Drivers by points: if/else 26 (53 pts), loops 8 (14 pts), boolean chains 8, match/switch 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"282d801b7ce7ba27e0218f716f5275107bbf2ecdd9579c7a1a6e7a41d19b3a54"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::parse_overture_row (cognitive 76): arnis::overture::parse_overture_row has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (57 pts), match/switch 3 (13 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25832a654c34163c9eec33459d663f18971906b71a9b89157032d6b993b326a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::build_wall_ring (cognitive 75): arnis::element_processing::buildings::build_wall_ring has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (49 pts), boolean chains 20, loops 3 (6 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7379}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a6641a9100f5b5d13b86d02449149906450db4bcf537db6bd8c69bbc878c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::fuel_stations::draw_canopy (cognitive 74): arnis::element_processing::fuel_stations::draw_canopy has cognitive complexity 74 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 12 (31 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6b2dec0c8d079bd44fd7af51aaca6d12189901a86ef37692a347cb00c07b35"}},{"ruleId":"D2","level":"warning","message":{"text":"CarNetwork::build (cognitive 73): CarNetwork::build has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 11 (15 pts), boolean chains 11, match/switch 3 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ac6973f027f8d40714e6dd3d9f5775dd9ce29e794fb95f7253fae19601a288"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::bedrock_block_map::convert (cognitive 73): arnis::bedrock_block_map::convert has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (38 pts), match/switch 17 (31 pts), boolean chains 4 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bedrock_block_map.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e49974d84327a352f3e8a5573a7c62f4c92fe959a09342532d411fb784d9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::register::run_align (cognitive 73): arnis::mapillary::register::run_align has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (45 pts), loops 16 (22 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed876dde337de32040474ed91fa9a943edd6c8eff669c16776d24df3f12a173e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::compute_outline_suppression (cognitive 73): arnis::osm_parser::compute_outline_suppression has cognitive complexity 73 (threshold 15). Drivers by points: if/else 19 (49 pts), loops 8 (11 pts), boolean chains 7, match/switch 2 (6 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"377ad0ee9138f566b87ddb52fbf0d0445d88d9027edb6850fe431a614fbc9146"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_inset_tiers (cognitive 71): arnis::element_processing::buildings::generate_inset_tiers has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 5 (15 pts), boolean chains 9, match/switch 1 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13597}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8af2ef6b6998e6f13218e5a6c628291bc0b3f0f6c0677cbfbad3992dc966e7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_land_override::apply_osm_land_override (cognitive 70): arnis::land_cover::osm_land_override::apply_osm_land_override has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (58 pts), boolean chains 6, loops 4, match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_land_override.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6422d19f9ff1ab59d52a7a163564325d37f27296f651259a7edb88233c8299b0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::parse_osm_data (cognitive 69): arnis::osm_parser::parse_osm_data has cognitive complexity 69 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 11, loops 4 (6 pts), match/switch 2 (6 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a3a8b4ff151c3939f17c4b10ec0de75c93fda6ec408483e3a376ab7ba031ae"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::worship (cognitive 68): arnis::element_processing::subprocessor::interior::halls::worship has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 8 (20 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3f8bc32ab08e59567ee7e2d1f2e7d2063334ca64b0685073089eef4454b274"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_water_override::apply_osm_water_override (cognitive 68): arnis::land_cover::osm_water_override::apply_osm_water_override has cognitive complexity 68 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 5 (14 pts), match/switch 3 (10 pts), boolean chains 4 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eb330d97d495857688adc90585ac9c978387589e3e911d4458951ac58420a1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::lay_out (cognitive 67): arnis::element_processing::trains::lay_out has cognitive complexity 67 (threshold 15). Drivers by points: if/else 32 (47 pts), loops 7 (12 pts), boolean chains 6, match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0a56dbe04d03f28e51d7c68a920e9c4cba28a2a417d799ff0405f7571e1c67"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::water::walk_river (cognitive 66): arnis::caves::water::walk_river has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 6 (14 pts), boolean chains 6 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/water.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0367750abefae116284a9b8e4b64cebfe3e192b1dfddd8a5aae37fde7d9943ec"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::shoreline::trace_boundaries (cognitive 66): arnis::land_cover::shoreline::trace_boundaries has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (46 pts), loops 5 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/shoreline.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f332b516a94c97219173058967ec90b2a667df8b7625dae7c21800c8f48909f"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::cells (cognitive 65): Grid::cells has cognitive complexity 65 (threshold 15). Drivers by points: loops 8 (31 pts), if/else 6 (20 pts), match/switch 2 (12 pts), boolean chains 2 (nesting depth added 47). 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":"src/datapack/disasters.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2122eac0f7cde7f9d59002665a33944e320ff3543e75be33b46ffc43184be60c"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas::split_corridor (cognitive 63): Canvas::split_corridor has cognitive complexity 63 (threshold 15). Drivers by points: if/else 28 (49 pts), boolean chains 8, loops 5 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d361fc7370b040bce1de468825d6864c56b154dc50180f5fafc0517ca4373ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas::connect (cognitive 61): Canvas::connect has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 10 (24 pts), boolean chains 5 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"0246fcccfd01c7e0194d2f383e9246141a56d429acb97af429d38d9a47225d28"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_window_life (cognitive 61): arnis::element_processing::buildings::generate_window_life has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (43 pts), boolean chains 13, loops 3 (5 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec98cc4b15a7b7f482d68da82efddf54dcd58775ad3348907ad2251850e96b6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::waterfront::generate_pier (cognitive 61): arnis::element_processing::waterfront::generate_pier has cognitive complexity 61 (threshold 15). Drivers by points: if/else 26 (45 pts), loops 6 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterfront.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b056f22bf73b00ad43b2e3e0e21ec9e8f7053bed31c8a90c884ff9cde698831"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bridge_modules::sweep_module (cognitive 60): arnis::element_processing::bridge_modules::sweep_module has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 8 (22 pts), boolean chains 5 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_modules.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eba3cc33f965810c83a61cc8b9ef93afe98265f8a1f5773be4a97cb3d96ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::place_dormer_windows (cognitive 60): arnis::element_processing::buildings::place_dormer_windows has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (42 pts), loops 6 (10 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":14295}}}],"partialFingerprints":{"codehealthFindingId/v1":"02abe769201ed2d6b3bc779a4d79135221d8d2f775d382c6226ce7c41833f0de"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::place_roof_eaves (cognitive 60): arnis::element_processing::buildings::place_roof_eaves has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 9 (13 pts), boolean chains 8, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15124}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d399ce609a930b0be0c562a5235564dc01f0b782d3e5d302778f3e2e269c13"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::gui::add_localized_world_name (cognitive 60): arnis::gui::add_localized_world_name has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (48 pts), match/switch 2 (11 pts), boolean chains 1 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfe1918258a65dd9daec27ec3cd26a7d71ff4bb7bac6ca168e1e5e90ebd6bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::split_blob (cognitive 60): arnis::mapillary::openings::split_blob has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 9 (25 pts), boolean chains 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52b58f7d6fd55e94bc8092fabb3efca19c3c0650ccc577023902c670ac8d9e8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::barriers::lay_out (cognitive 59): arnis::element_processing::barriers::lay_out has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 8 (19 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f18a0d87e5772bfaaf6b5e15f7f82dcb0270eb1573d6511c7777e5f945ff52"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::geometry::parse_overpass (cognitive 58): arnis::mapillary::geometry::parse_overpass has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 5 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/geometry.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2763d69c5a40ee4fd10920ee9e2171567e86cc1f680d77ef146b82e9f105ab"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::voxelize::accumulate_glb (cognitive 57): arnis::models_3d::voxelize::accumulate_glb has cognitive complexity 57 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 3 (14 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"743cd4ad35c3e15493e883a0700e2e566a46ed9c5a0108910e66baa88f9676a0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::compute_spatial_part_suppression (cognitive 57): arnis::osm_parser::compute_spatial_part_suppression has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 9 (15 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbebfda32e684b06befe41a515a5a649555e5e4612dbd4ad50181382b42cd623"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_tiles::read_tiles (cognitive 56): arnis::osm_tiles::read_tiles has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 8 (17 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9a5595ecb0731cea1f2b86b133ae226280ab5c597bc8d317b66c69a85b4b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Font::draw (cognitive 55): Font::draw has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (36 pts), loops 5 (19 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/font.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d892d80ca44e049c9f45c85233a7a5e0d15afdbbc5e32ff0f091a0296b77e632"}},{"ruleId":"D2","level":"warning","message":{"text":"RailJoins::build (cognitive 55): RailJoins::build has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 8 (16 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rail_track.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1d406ef14d895b19fb6232d892de68124cb7bfdc130bc2fdfe5f1479d344b5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_roof_only_structure (cognitive 55): arnis::element_processing::buildings::generate_roof_only_structure has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (33 pts), loops 6 (18 pts), match/switch 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51a4f955db62506041b4a811fb5d5b6978e097e12d175d9df6cf7be9e1fc127"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::water_areas::scanline_fill_water (cognitive 55): arnis::element_processing::water_areas::scanline_fill_water has cognitive complexity 55 (threshold 15). Drivers by points: if/else 8 (34 pts), loops 4 (11 pts), boolean chains 6, match/switch 1 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc44e7b44ecc22292293eb76086c22604d3c5edfb2bbd22c363398ea398a07e7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::bimodality (cognitive 55): arnis::mapillary::refine::bimodality has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 8 (20 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1485b6f45a8eeccc13c687ec2df8f3a5c1659399d2bdc8283063ba414391218"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_balconies (cognitive 54): arnis::element_processing::buildings::generate_balconies has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 6 (14 pts), match/switch 3 (9 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":9869}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4256944e7ff73112eef1f6c8142d38146aadd093db10662b3634eea2f18c8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::split_off_other_levels (cognitive 54): arnis::elevation::postprocess::split_off_other_levels has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 5 (8 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3875e685b1165ddb950da9fa1c585cac1ee76c4df122895421ac5a30907f4b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::trees::schematic::place_schematic_tree (cognitive 54): arnis::trees::schematic::place_schematic_tree has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 7 (10 pts), boolean chains 4 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/schematic.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"79423066144881d625fc47df5a9b015182336eac4217e9c44abf66976944f9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::generate_roller_coaster (cognitive 53): arnis::element_processing::railways::generate_roller_coaster has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (39 pts), loops 3 (13 pts), boolean chains 1 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14025bef93400fcde81ad0bc280b98fd3f790880bf55588932c9d1391f42928"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::sky_roofline (cognitive 53): arnis::mapillary::refine::sky_roofline has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (38 pts), loops 3 (7 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"441576e8596fd867d61535dca8e242e180b6b9305a15ed3cd58638ddd2eef043"}},{"ruleId":"D2","level":"warning","message":{"text":"RoadClearance::build (cognitive 52): RoadClearance::build has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 7 (16 pts), match/switch 2 (6 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"107d9ff06a76d1f240a5ca6af000724a0f6cf7fa6c90e2daa382b3e5ce6f7434"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialRegion::in_europe (cognitive 52): MaterialRegion::in_europe has cognitive complexity 52 (threshold 15). Drivers by points: boolean chains 27, if/else 25. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3092d81551a1c186de4594d981ea31898b8c16614a405e9e7014e9053e954589"}},{"ruleId":"D2","level":"warning","message":{"text":"InteriorUseIndex::build (cognitive 51): InteriorUseIndex::build has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 8 (12 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/index.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd623ad9ae1ed51f7b80c8cd561f7b5707f073d458147e472177f66c19cf861"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::calculate_building_height (cognitive 51): arnis::element_processing::buildings::calculate_building_height has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (46 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6056}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaa18c8b708d338768d4c1fba46b8cb59c62897530e39c9736ae94a9fafc270"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::power::generate_power_tower_impl (cognitive 51): arnis::element_processing::power::generate_power_tower_impl has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 10 (20 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/power.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"885f241e4d397cc72f1c99ebdd68aee0b34fe5eddfa8435fd3cfa2926f0c1970"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::apply_rhythm (cognitive 51): arnis::mapillary::openings::apply_rhythm has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 6 (11 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40ca52a257b3b276aed3ca6d01c7d4673c711e34abfcbac3b951c3af642db0a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::collect_from_parquet (cognitive 51): arnis::overture::collect_from_parquet has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 3 (5 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"766f6c0fb3357cabda0b78034fa01456739fd089a70ec111a8b142062aad01c8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::retrieve_data::fetch_data_from_overpass (cognitive 51): arnis::retrieve_data::fetch_data_from_overpass has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (43 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/retrieve_data.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d860b3f20e2c4712b51e4a9e8ba645e4fa338795e2c37cbd3ad1249d84d1db08"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::java::compute_lighting (cognitive 51): arnis::world_editor::java::compute_lighting has cognitive complexity 51 (threshold 15). Drivers by points: loops 12 (27 pts), if/else 9 (24 pts) (nesting depth added 30). 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":"src/world_editor/java.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fa9c3b57a288147451e4e264ba017bac3ea3858d977afe558c96e8fe99ceb1"}},{"ruleId":"D2","level":"warning","message":{"text":"FloodFillCache::collect_building_footprints (cognitive 50): FloodFillCache::collect_building_footprints has cognitive complexity 50 (threshold 15). Drivers by points: loops 9 (30 pts), if/else 4 (15 pts), boolean chains 4, match/switch 1 (nesting depth added 32). 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":"src/floodfill_cache.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"614998f0ed70fc514ad891b03ddcbf3cab6d630db32318827efdc75528cccb04"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::rooftops::place_water_tank (cognitive 50): arnis::element_processing::rooftops::place_water_tank has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 8 (16 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d07c8dd7f3bca8df873317064b06479148e3b254e338b9baefecb519543e81"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::repair_terrain_anomalies (cognitive 50): arnis::elevation::postprocess::repair_terrain_anomalies has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 9 (22 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca211ce30a5b81002488a6d50d1c3cffe77fd952b9d6b5511476aa745e1ca5da"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::smooth_class_boundaries (cognitive 50): arnis::land_cover::smooth_class_boundaries has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 8 (15 pts), boolean chains 5 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb4600b85d986b27c9be3e7bf413ee854acdce1d70485540196fb3a902fa532"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::wall_reference (cognitive 49): arnis::mapillary::openings::wall_reference has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 8 (16 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2866294908b2c1e822c713f3727f0f1c45ef4b51458cc14f2c39c89cce6a5549"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::extent_joint (cognitive 49): arnis::mapillary::refine::extent_joint has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e941ae829014b965591f1b3c2e58a3112fdcaaee9d5af89c6513d413fb664d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::structures::elizabeth_tower::shaft (cognitive 49): arnis::structures::elizabeth_tower::shaft has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 4 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/elizabeth_tower.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2efb8c22b218077e968698bcb18550874c80c40290b34312e00c1b40952340"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::big_wheel (cognitive 48): arnis::element_processing::attractions::big_wheel has cognitive complexity 48 (threshold 15). Drivers by points: loops 13 (23 pts), if/else 10 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 20). 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":"src/element_processing/attractions.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6ded90488ccd81c5f380a9978e1906ba5e23a05f7ea2e97ca0d185889604f1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::voxelize::glb_model_bbox (cognitive 48): arnis::models_3d::voxelize::glb_model_bbox has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 5 (15 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"81070ccd8931b438657c37b4f1e4e28f5a46ab20bc9694939e8e80dd7d30a240"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::java::write_region_to_disk (cognitive 48): arnis::world_editor::java::write_region_to_disk has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f63c2cdb5b9f7bb449fe3e595f9a31e5888bfdedec51fb3eb719fb0afed325"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_building_roof (cognitive 47): arnis::element_processing::buildings::generate_building_roof has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 25, if/else 13 (17 pts), match/switch 3 (5 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13213}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbb4a29a49a1f50a98726851739d518f1dec0a387ef603c8722c73237dcbbe4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::visibility::preview_crop (cognitive 47): arnis::mapillary::visibility::preview_crop has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 7 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9d270fc93e6f71ade0ee03f779feae47d3cfaf2eb909caee6d92b64fa0723f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::housing (cognitive 46): arnis::element_processing::aerialways::housing has cognitive complexity 46 (threshold 15). Drivers by points: loops 17 (26 pts), if/else 8 (17 pts), boolean chains 3 (nesting depth added 18). 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":"src/element_processing/aerialways.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5e061d0653ec8b8f561b962bab2c70e0c62322f96c3bd8634f3db436a25681"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::parking_garage::build_level (cognitive 46): arnis::element_processing::parking_garage::build_level has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (13 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/parking_garage.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da29ccee08bf8e59d26ab0cdf70c0d7b1833203657820322f235bdec62ebead"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::visibility::geometric_candidates (cognitive 46): arnis::mapillary::visibility::geometric_candidates has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (39 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c51be286cf94c888f27ebd51e3bd899cc1d28343b543f460938cb1c1ade9faf"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::drop_tower (cognitive 45): arnis::element_processing::attractions::drop_tower has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 8 (15 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e74cf1aa5bae8f147e100f7618870f630e1b32b6eeba5230551910bc6854ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::barriers::generate_barriers (cognitive 45): arnis::element_processing::barriers::generate_barriers has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b3784129c219d3cc0d443c7568adf9ccd66f22a8f37a36360a247adce66946"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_facade_cornices (cognitive 45): arnis::element_processing::buildings::generate_facade_cornices has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 13, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10798}}}],"partialFingerprints":{"codehealthFindingId/v1":"adebddf8200b1c553570357ee53240e8f4266fcbbe6f76ec8804634c44875903"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::map_transformation::rotate::rotator::rotate_ground_data (cognitive 45): arnis::map_transformation::rotate::rotator::rotate_ground_data has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/rotate/rotator.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"84702961119980ea92c0c947f2269cae6ce904a85c8d133c48e0be1b451bf5e5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::write_debug_grids (cognitive 45): arnis::mapillary::write_debug_grids has cognitive complexity 45 (threshold 15). Drivers by points: loops 10 (33 pts), if/else 4 (11 pts), boolean chains 1 (nesting depth added 30). 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":"src/mapillary/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd249580818fc411a3e0a296b6453233249e972f0734dc603c39d98d589e7ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::plan_supports (cognitive 44): arnis::element_processing::aerialways::plan_supports has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 6 (7 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b457e3a1e59ab184f41fd9296cbdb2bbd69939b166a2858fcee111bc57c7673b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_floors_and_ceilings (cognitive 44): arnis::element_processing::buildings::generate_floors_and_ceilings has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":11341}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c27d89d79a6ef8f0d2d0e861c6edd3e80e398e0b2d7b4146476c2db8894e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::cars::link (cognitive 44): arnis::element_processing::cars::link has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 10 (12 pts), boolean chains 10, match/switch 2 (5 pts) (nesting depth added 13). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa074eb6a5e17749df2b556206e0e675fe997b7ba40f103491da755e2183c93"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::generate_aeroway (cognitive 44): arnis::element_processing::highways::generate_aeroway has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 8 (15 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"701bf698e502f559c891650ba1c2186cec9e8240ef92cd0c275dd186a08a6c40"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::generate_rail_tunnel_shell (cognitive 44): arnis::element_processing::railways::generate_rail_tunnel_shell has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (16 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b908c2be8b7891615d8edbeb21cdf8041e17dc3b92d5ca43cf3e21314aa69b3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::keep_right (cognitive 44): arnis::element_processing::trains::keep_right has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 8 (16 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7719637a26eef5bd29f41d3996ca82a9a8645d1b1c8cd72f8e76d8e430dede"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::bands::drop_sky (cognitive 44): arnis::mapillary::bands::drop_sky has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 12, 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":"src/mapillary/bands.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35d3440d943b74ca82a529e55ecc2eee8d9893d63efcd02796ffc09ebbd3b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::place_roof_surface (cognitive 43): arnis::element_processing::buildings::place_roof_surface has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":14941}}}],"partialFingerprints":{"codehealthFindingId/v1":"456ff3224387880d5e6fe138584315a59591b487a607ff833a1e4a06231ddd34"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::gui::update_player_spawn_y_after_generation (cognitive 43): arnis::gui::update_player_spawn_y_after_generation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 5 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b51507d9dcdb91c4d5efc233d7caf82dc8e62c1ef57dfc6e939fb525a578a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::ores::place_blob (cognitive 42): arnis::caves::ores::place_blob has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (31 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/ores.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f52b44d9f19cac38aab30f52800c0354677e1d9ca7a3b0ff9345f174155da3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::draw_pylon (cognitive 42): arnis::element_processing::aerialways::draw_pylon has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 10 (17 pts), boolean chains 2 (nesting depth added 20). 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":"src/element_processing/aerialways.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fc7ad3b760ce218f3b1b6387c3513d0aa804ac6c24eb97f517b1db23a69f99"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::carousel (cognitive 42): arnis::element_processing::attractions::carousel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"10feb2fef10345a79687d4f6f9aa95100142718cef0cb66a5d3d29abf1cb8412"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::pirate_ship (cognitive 42): arnis::element_processing::attractions::pirate_ship has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 11 (18 pts), boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcc51fec012410384bf041cbe3e0c8adaaa7825b0f33aac442b2c15b8562776"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::footprint_radial_fractions (cognitive 42): arnis::element_processing::buildings::footprint_radial_fractions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 10 (17 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16581}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cd51807123148b0f2152b43654d9c98186413a748b9d562beeb00df68dd0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::drop_islets (cognitive 42): arnis::elevation::postprocess::drop_islets has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 5 (12 pts), boolean chains 7 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f824a3c04c8b201dd0b2256a1899b2ccbbd479d11154ab139d0e249ddd6da0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::read_esa_tile_into_raster (cognitive 42): arnis::land_cover::read_esa_tile_into_raster has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 6, loops 3 (6 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68c8b1a4797febb4b44dcedf51fb1119b8c1461f36f4d6bbebb4dd8e36be11"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::clear_long_runs (cognitive 42): arnis::mapillary::openings::clear_long_runs has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 6 (16 pts), boolean chains 2 (nesting depth added 26). 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":"src/mapillary/openings.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"309bc38ffcba459b1de2dcaf96a8bfb00ca495defcd4efc73ce14aa2e0ab2172"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::building_to_processed_way (cognitive 42): arnis::overture::building_to_processed_way has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd777cc443b12d39c069e747053c8c71e5665c4083ed21c7eb9fbd58dd75d23"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::bresenham::bresenham_line (cognitive 41): arnis::bresenham::bresenham_line has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (33 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bresenham.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03a05faf89be6da30d1bbbfd473ea307a7023dfce092318c3b0c9741558f918"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::build_intersection_index (cognitive 41): arnis::element_processing::signage::build_intersection_index has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 8 (13 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"790b81bed4379864fa26b4acebc8c08987b4138b6efaf77572f115a0ff660ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::eatery (cognitive 41): arnis::element_processing::subprocessor::interior::commerce::eatery has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 5 (7 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf7e106f3c7362bac3b64cb01e0c2bc5d5b3a220fe21b121170cb3b67710145"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::wikidata::placement::prescan (cognitive 41): arnis::models_3d::wikidata::placement::prescan has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 4 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/wikidata/placement.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda945ce379e14b467a0698199c7965e8e0593b23c56618791bd59fdb3543e39"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::plan_unit_entrances (cognitive 40): arnis::element_processing::buildings::plan_unit_entrances has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6796}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c8829a2feaa4769e3685bbaf834e456a2a2ac1bd49a65e86d3527781909184"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::shop (cognitive 40): arnis::element_processing::subprocessor::interior::commerce::shop has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 7, match/switch 3 (6 pts), loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57785e085e09c3b012860b3bf3828f9cf8cbd1c88bd246fa39312cda4e38d25"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::supermarket (cognitive 40): arnis::element_processing::subprocessor::interior::commerce::supermarket has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"942cfa5d4b2df49f991e1cdde3f7921c21b6322f1f7043c7ea76a05e61e8e5d1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::facades::collect_preview_walls (cognitive 40): arnis::mapillary::facades::collect_preview_walls has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"0489d12bf991cac6e21b3be627e05608a71a27def362fa55c7d2ee6172265215"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_depth::chamfer_3_4_dt (cognitive 40): arnis::water_depth::chamfer_3_4_dt has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 4 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aaac1311f66752dbdfd48d3ffa1e2fca5f385724de06fb114755d4b94c8954"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::datapack::files (cognitive 39): arnis::datapack::files has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (32 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8098e1395882837a67a20341752f795cb58dde6d4a8c4ead09dd17299c4a3735"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::generate_building_interior (cognitive 39): arnis::element_processing::subprocessor::interior::generate_building_interior has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 3 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0adf2e43ee4cad4d45eff37177e75a0cffd3ac415403863845a27f55a69465"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::ground_decoration::grow_patch (cognitive 39): arnis::ground_decoration::grow_patch has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (26 pts), match/switch 5 (9 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_decoration.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee8afff7715410a3231a1a36cfc4e2bdb2b4a769d79416e8b40ff7d234d5adf"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::member_roles (cognitive 39): arnis::osm_parser::member_roles has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 9, loops 6 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ec35c4f7337a1822d4a1a922f0d0eb79f4eae0865428629dd6805133008385"}},{"ruleId":"D2","level":"warning","message":{"text":"FuelIndex::build (cognitive 38): FuelIndex::build has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 9, loops 3, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"947b87e06ee6934ebb6f7cfce4b5a67b74294c29cc0408c434ad95b43df42ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::building_facades::collect_facing (cognitive 38): arnis::building_facades::collect_facing has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 6 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/building_facades/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b4e5a7f1d40ee0b8b63b8333d73550ec83a6881c1b87f0407c053374535927"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::blur_values (cognitive 38): arnis::elevation::postprocess::blur_values has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (13 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a39140f479cfceb3fea9421086e810dfeb5d511797f4cc91fe384e80cc210da"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::landmarks::place_one (cognitive 38): arnis::landmarks::place_one has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 7 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/landmarks.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8f7437c49c3f43e72ade3fddf612e5ca4ad7e24b38308a008527e8f336bb7a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_hipped_roof_inner (cognitive 37): arnis::element_processing::buildings::generate_hipped_roof_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 4, loops 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e08f9af4cd03faec5f9c7c193bcaa549614c97329a3f6169f43608236ff20fe"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::generate_railway_node_signage (cognitive 37): arnis::element_processing::signage::generate_railway_node_signage has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 6 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d93f67c4952a1608581bed8b9492f5dedbea3268563c69e1b3bb822c5d64ac"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::timetable (cognitive 37): arnis::element_processing::trains::timetable has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 7 (12 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"586a319f7651aa6607539748c128fb91e07afc56f6c999b1098a25d1408bf7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_water_override::rasterize_line (cognitive 37): arnis::land_cover::osm_water_override::rasterize_line has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbd5a6fe465a9eba4714f3d5efc8c05989cc23084a784329882bbb003f0e69f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::ores::place_ores (cognitive 36): arnis::caves::ores::place_ores has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 4 (10 pts), match/switch 1 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/ores.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d17ae12e192bf73ff76cc4cb2601dfdc09f396951f12d915248d2b57f6a2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::sport_pitches::draw_pitch_markings (cognitive 36): arnis::element_processing::sport_pitches::draw_pitch_markings has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 11, loops 5 (9 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/sport_pitches.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"383dc1abd303d09cc9e20f93cabb8f661966964f4b227a9ec00dadec929771b5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_depth::carve_water_column (cognitive 36): arnis::water_depth::carve_water_column has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0068b9dde036204a5d307082558778545db3fd89d4941f1f84e4025a338ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::luanti::find_safe_spawn (cognitive 36): arnis::world_editor::luanti::find_safe_spawn has cognitive complexity 36 (threshold 15). Drivers by points: if/else 4 (21 pts), loops 4 (10 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/luanti.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ac73212fde4d360fb8248d2de42b1779bb8a672646724a99a3706aa0216649"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::decoration::build_giant_mushroom (cognitive 35): arnis::caves::decoration::build_giant_mushroom has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 7 (15 pts), boolean chains 3 (nesting depth added 17). 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":"src/caves/decoration.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd68821cfb6f8f53564c3b259b93486b6684825354b32cab84226352fe2c373d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::water::plan_pool (cognitive 35): arnis::caves::water::plan_pool has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 5 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/water.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a58a8458bcc9e2f4d9f30d447181085cc2cfc55cdeafe95b7c8d0864b2f980"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::clipping::clip_polyline_to_bbox (cognitive 35): arnis::clipping::clip_polyline_to_bbox has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"742dfb4d2abe3f69c14678aa39f012fba125aa375e08bc2def662041d1ae88c6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::keys_for_element (cognitive 35): arnis::element_processing::signage::keys_for_element has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 2, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83cdd9db5cdec555cb70fed78fd06a4c221672c8450e4b30bff8a38d57d8483"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::train_bodies::compose (cognitive 35): arnis::element_processing::train_bodies::compose has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c96de01e8109e84e455cb246c87859c01e5c7b86a49c0a72265644f211855"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::water_areas::climbs_to_water (cognitive 35): arnis::element_processing::water_areas::climbs_to_water has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a1219c049469b7fb47246de052e3af255484d369705c2e22517460c5cbb69a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::pull_coastal_land_toward_water (cognitive 35): arnis::elevation::postprocess::pull_coastal_land_toward_water has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 6 (9 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"386353016582f6bcb46e98013d587337010ee51f43e8dbadea43318c2ea8e081"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::naturalize::chessboard_labels (cognitive 35): arnis::land_cover::naturalize::chessboard_labels has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/naturalize.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4883ca26b3887cce6e529f22d32fc49cde85526b231d410cfa379d8ef069dcb8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::facades::load (cognitive 35): arnis::mapillary::facades::load has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (7 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed3363b0ac9c16b9236e6a1f8273641a116f5798daf657d308a5198d16611e8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::register::clip_line (cognitive 35): arnis::mapillary::register::clip_line has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 3 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6697ba1ff7f0da9777653ff42d492ac112f62d279dd3583623d4d0f70ec05e09"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::structures::elizabeth_tower::clock_stage (cognitive 35): arnis::structures::elizabeth_tower::clock_stage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 6 (11 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/elizabeth_tower.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"220852a87df39b572c0c66e2cad973e78f32d1dba582c696d2aa17eae489a33c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::java::compute_heightmaps (cognitive 35): arnis::world_editor::java::compute_heightmaps has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (13 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb9ab2f9f384a250bb1eae3351d3c2ac8b2b3bed68369c5ba14c104c81eaad0"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldToModify::merge_section_write_if_air (cognitive 34): WorldToModify::merge_section_write_if_air has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (10 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"68787a0735324a405e481a75819a05e54b06ad46c3e94895a49ff90d2a349433"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::draw_carrier (cognitive 34): arnis::element_processing::aerialways::draw_carrier has cognitive complexity 34 (threshold 15). Drivers by points: loops 13 (30 pts), if/else 2 (3 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"604307071f41bd394f0ebeb1bc95e1dce5e7de572c07a3f431203d7c0b26235b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::bumper_cars (cognitive 34): arnis::element_processing::attractions::bumper_cars has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcb9718dd72b1853b59d2813bb8635a28476b5febb87cd8e32248b9f73dcda9"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::uses::plan_interior (cognitive 34): arnis::element_processing::subprocessor::interior::uses::plan_interior has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 14, loops 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/uses.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60c87b3f29f59e743a604a2b337e6de8fa639a20501b53aaa5dc3eef54502ec"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::floodfill::seeded_fill (cognitive 34): arnis::floodfill::seeded_fill has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bae1d4d7794551fd033849c21bd9a99b9ed67fe9d8c5b4765249d639f89f23d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_water_override::build_protected_land_bitset (cognitive 34): arnis::land_cover::osm_water_override::build_protected_land_bitset has cognitive complexity 34 (threshold 15). Drivers by points: loops 11 (18 pts), if/else 5 (12 pts), boolean chains 4 (nesting depth added 14). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"src/land_cover/osm_water_override.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"15118cdf120a24e2ad669a7172c2ac41017d517d7a1f7c436452acc975dd4a58"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::map_renderer::get_fallback_color (cognitive 34): arnis::map_renderer::get_fallback_color has cognitive complexity 34 (threshold 15). Drivers by points: if/else 29, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_renderer.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aa211e651eeef53385c7be47742ba2d267da185b1d141e52504741d43f6a04"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldEditor::style_region (cognitive 33): WorldEditor::style_region has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (14 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef56fd03834e0ad7e7bc13b3cc27d2ebcec5fe51d40fa550a49188a01dd11380"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::clipping::clip_polygon_sutherland_hodgman (cognitive 33): arnis::clipping::clip_polygon_sutherland_hodgman has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2243c35c664976563211ee6ffab0e6218b6429a47c9ec6e58a67af09cd5cdd7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::merge_way_segments (cognitive 33): arnis::element_processing::merge_way_segments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd4d1a8278d0829ac16db27a0912473c8d5bcde492f4844b6a227acd7233090"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bridge_styles::decorate_suspension (cognitive 33): arnis::element_processing::bridge_styles::decorate_suspension has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 6 (13 pts), boolean chains 1 (nesting depth added 18). 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":"src/element_processing/bridge_styles.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"c905a14b231caaa3d5e76939b217156b14e72403ea3887af9fe6408b7763575c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::plan_synthetic_entrance (cognitive 33): arnis::element_processing::buildings::plan_synthetic_entrance has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 11 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6619}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497baafcdd14b37edad7a7de4bd7e76f7b500047ae639140e7918c9d27cc813"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::pitched_roof_block (cognitive 33): arnis::element_processing::buildings::pitched_roof_block has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":8411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4389cbc6594c594a27e95fd62f20e1298a31258b076393977dcb783c6d43f80c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::sports_hall (cognitive 33): arnis::element_processing::subprocessor::interior::halls::sports_hall has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9136a435739a763729120dfc1a05937a0f84d7218005c26ed993271e317418b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::fill_nan_values (cognitive 33): arnis::elevation::postprocess::fill_nan_values has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddb217326fceb8fa6bfc436c9fee3eafb5d3cd7cdcb763268cc07574917b3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::fill_gaps (cognitive 33): arnis::land_cover::fill_gaps has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f2989336c9e08c2dd701e2e6d3d29572ccb23d25797013b1d16b737adaaf67"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::lean_from_gradients (cognitive 33): arnis::mapillary::refine::lean_from_gradients has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"050ba7a9820baa77be5828df3b2372918ea2bd3bb2c94d15a500df25b03c3e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::visibility::remap_bilinear (cognitive 33): arnis::mapillary::visibility::remap_bilinear has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 5 (15 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d345fa21001d1a12712b074cab78f4326a54217aa6683c03dc780a745b2fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_utils::write_world_skeleton (cognitive 33): arnis::world_utils::write_world_skeleton has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (33 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_utils.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29abd8d9ac6247c3705af2e3e5b781277eaaa2ec738ca3dbedf2d5532fdb112"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewAccumulator::ingest_region (cognitive 32): PreviewAccumulator::ingest_region has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_renderer.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc169dea4c697e0292e51f00ffbfc115d9d8b2fbf293402c2b7be4b7f5f9fb31"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionLod::ingest_section (cognitive 32): RegionLod::ingest_section has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (8 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/voxy/lod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a12771ee6556e0cbf7858d17e22dd0d40195c9b69af0e5c7d51241fadd817e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::place_wall_panel (cognitive 32): arnis::element_processing::signage::place_wall_panel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7078bcec5fff17f507eade616ec6eedc0a9dd5776920e1e4dbebfdef8cfebaf"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::generate_highway_way_signage (cognitive 32): arnis::element_processing::signage::generate_highway_way_signage has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f94a98f408d71fcf2f31bd7b89c83f768355a229cf8f610b567b94b9371e72"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::residential::tile_floor (cognitive 32): arnis::element_processing::subprocessor::interior::residential::tile_floor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/residential.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ca0260bc19c98a6aedd03f7ccc3db4cfeb56b211602d3ffe81f5312fba2aed"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::imgops::connected_components (cognitive 32): arnis::mapillary::imgops::connected_components has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (7 pts), match/switch 1 (3 pts) (nesting depth added 17). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/imgops.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99cacd458187ba691487ba75d6e04510fcb0f92376469b5cc5fdd642152c5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::pipeline::building_colour (cognitive 32): arnis::mapillary::pipeline::building_colour has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dacd3a4f706c34bda4b67dead1c71e48067e37d1e993d2f5a9467b9f6928e9"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_depth::compute_big_water_field (cognitive 32): arnis::water_depth::compute_big_water_field has cognitive complexity 32 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 4 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac54af0964939f70e89eecda23c009216193a0768c522cd369b1e6f77c74fbba"}},{"ruleId":"D2","level":"warning","message":{"text":"Ground::new_enabled (cognitive 31): Ground::new_enabled has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 2, match/switch 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":"src/ground.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c68123f710a09572db388d67e645ac427e1d976d22c8a167af23eec9bd2184f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::datapack::discoveries::collect (cognitive 31): arnis::datapack::discoveries::collect has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/discoveries.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa0bcd592367a49d528d1791676ef46a55567c6c1aae270a4a2af039e8b236"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::man_made::generate_chimney (cognitive 31): arnis::element_processing::man_made::generate_chimney has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3897a8c9e3ac3f5916d1a8765e2065171f74068214b6f1af00e6451a5d4fa500"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::cottage (cognitive 31): arnis::element_processing::subprocessor::interior::cottage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7cc51c4095dc166634c7664f316d90e698cbc4c59ed970ba0c86264834c8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::stops_on (cognitive 31): arnis::element_processing::trains::stops_on has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (9 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb0475c18db706f8885e76038c8b7939683456ce339cdf5248a622ba6a4d435"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::gui::set_player_spawn_in_level_dat (cognitive 31): arnis::gui::set_player_spawn_in_level_dat has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 4 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"114e4f6f7c5137b51a13ae7cee221734b8642b23d866f58c0d5e20b202791c05"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::displays::fill_missing (cognitive 31): arnis::mapillary::displays::fill_missing has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 6 (11 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/displays.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e392a6b89907555272789609a60bfc377a1886a5df495d184cdeb789820e97a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::rectify::components8 (cognitive 31): arnis::mapillary::rectify::components8 has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"546b9af1f3bd57e9ea80f28ff09460976da4ef341d5875bad00e26bc95fe264f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::rectify::loose_crop (cognitive 31): arnis::mapillary::rectify::loose_crop has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 7 (14 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"082b298755a046f36df827325786c42fcc34df808fe7be2d18664cf9eca4fe43"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::java::drop_misplaced_chunks (cognitive 31): arnis::world_editor::java::drop_misplaced_chunks has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"07378510eac163052baab29d68c892350ba54236f1ceab90412a3c3b9f2ac45e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::luanti::serialize_mapblock (cognitive 31): arnis::world_editor::luanti::serialize_mapblock has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 8 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/luanti.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5427ef4f162620c29bf3e93f8a7d5489e79c0e042c597f59da3a37ad8dcacf"}},{"ruleId":"D2","level":"warning","message":{"text":"RoadMarkingIndex::chain_dash_phases (cognitive 30): RoadMarkingIndex::chain_dash_phases has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (8 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":"src/element_processing/road_markings.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b794f2e741552f1c9be89ff865b469d6dab731c5874f17f08592d3ee0bd5dd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::plan_mapped_entrances (cognitive 30): arnis::element_processing::buildings::plan_mapped_entrances has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6903}}}],"partialFingerprints":{"codehealthFindingId/v1":"6645fb1222a51d3f53b2991b4c48b78b94d7ec4ff9e7e5d2f19bb933e0e0fd6e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_wall_depth_features (cognitive 30): arnis::element_processing::buildings::generate_wall_depth_features has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 9, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbfddacfe6e1e8c2aecb15a1209967f06bc8ba4ce3de07685bd9bfe7f35f4ac"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::mark_beaches (cognitive 30): arnis::land_cover::mark_beaches has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (10 pts), boolean chains 7 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab711e4ee7c554d3b2a519aa387780102307c9028cea99b307221bea75b00e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::displays::collect (cognitive 30): arnis::mapillary::displays::collect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/displays.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4ec6546b72cfbb622b15133e3dfc375f84a85162cc1da59b934f3d14a9c281"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::register::write_products (cognitive 30): arnis::mapillary::register::write_products has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (7 pts), match/switch 2 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b953de46dc5598147f271a23d540a72014eefe0fcbd1c97e3477fe6d73d0ee07"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionLod::fill_level0 (cognitive 29): RegionLod::fill_level0 has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 3 (12 pts), loops 5 (11 pts), if/else 1 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/voxy/lod.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bda4660cae91424659b06d0cf1b5e4fc9f6425327851dea63d2dc8345a70a2"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldToModify::merge (cognitive 29): WorldToModify::merge has cognitive complexity 29 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 5 (11 pts), boolean chains 4 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c5b2b986be6d4c8a15ca621f2fae328e9fb87c8717ba32dbf5f5cf7ccddb72"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bridge_towers::decorate (cognitive 29): arnis::element_processing::bridge_towers::decorate has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (17 pts), match/switch 2 (6 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 18). 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":"src/element_processing/bridge_towers.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"182adee621dac66195c098229a7c38ab5071e9d5419e77a9e78c9cd47594af80"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::carve_highway_tunnel_interior (cognitive 29): arnis::element_processing::highways::carve_highway_tunnel_interior has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 4 (13 pts) (nesting depth added 18). 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":"src/element_processing/highways.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea48bb07ecea1e8f60d686c8c300c9054c2a8b04e7f2ead057afe4f16d7dea88"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::smooth_diagonal_rails (cognitive 29): arnis::element_processing::railways::smooth_diagonal_rails has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c5f6372abf056306111cbf72e82fd806c9bd2a762ab3a0f602c0bd6f9be1d8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::carve_rail_tunnel_interior (cognitive 29): arnis::element_processing::railways::carve_rail_tunnel_interior has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (13 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"79aa2e6c2375e1167bacc26f5f327b64d666ce7287072c03e30389ddb2ecb1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::rooftops::place_penthouse (cognitive 29): arnis::element_processing::rooftops::place_penthouse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca7ee17252095e0246e5cf64a13093b815928505878abf34d05fcea08110e0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_land_override::dilate (cognitive 29): arnis::land_cover::osm_land_override::dilate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_land_override.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e4b9ad9d7910584fc33302075bfd7d2d9111c59443cfb1d44f4dc616d3d0b0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_tiles::assemble (cognitive 29): arnis::osm_tiles::assemble has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"5171f21a6be0b2cf07d3dd0997722fba67cf69fe1da2c757f9c2f247f986a35e"}},{"ruleId":"D2","level":"warning","message":{"text":"Spec::new (cognitive 28): Spec::new has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 6 (11 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f86e1e5d87bf06ce88ec9fbac460a597c2505cd2e1acb1eb314819f6bb94bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bridge_modules::build_module (cognitive 28): arnis::element_processing::bridge_modules::build_module has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (9 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_modules.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1926a2837b19dd93254b805ff638ab9702a1721a053a93942665a26d5e9b822b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bridge_styles::decorate_truss (cognitive 28): arnis::element_processing::bridge_styles::decorate_truss has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (11 pts), boolean chains 4 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_styles.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"453740f2f5a452703509a0208026646f147dfeade78cdba968ecf7ffd3dbc3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bridge_styles::decorate_covered (cognitive 28): arnis::element_processing::bridge_styles::decorate_covered has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (12 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_styles.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30999c789fc6658d4dda5aba6ec990abc24c0271369688cac6bde207bc95742"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::historic::generate_memorial (cognitive 28): arnis::element_processing::historic::generate_memorial has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 6 (10 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/historic.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"734d7c8744bcb1b9987d36d960fb1f59e00ce57b462de5af6ad38f7f74672f10"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::power::generate_power_line (cognitive 28): arnis::element_processing::power::generate_power_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/power.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c00987a27e4d88f17368760cdaa30a9d364e111b928dbeedac8918e89deb28"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::under_level_water (cognitive 28): arnis::elevation::postprocess::under_level_water has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88bf571590b67351e6c521a5822583f89df05490da1a6bb46cbd912d00e9f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::floodfill::inside_mask (cognitive 28): arnis::floodfill::inside_mask has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (10 pts), boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ab72be579f246467aff1bd5425bc3d906211bf539b314ea43f9f056a08e45"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::bands::best_lattice (cognitive 28): arnis::mapillary::bands::best_lattice has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a6c8746f239a7ce6ad238a3a9bee7a4b0a397b75931a7afaa6c77e5016ad0f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::parse_osm_xml::on_open (cognitive 28): arnis::osm_parser::parse_osm_xml::on_open has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (5 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f2b471af9097e665104c285923ab4a31920ab27cf8771cb791bbd68bad8ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_steps::plan (cognitive 28): arnis::water_steps::plan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_steps.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"44036c7f289e082c118218d929e456b03f952690ebb28d87087e3cb95c52cfcc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_steps::levels (cognitive 28): arnis::water_steps::levels has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 7 (9 pts), boolean chains 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_steps.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"774e5628f6169cf160758321f200ee969035e801101e97294746fdae50d58d28"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::schems::load_cave_schem (cognitive 27): arnis::caves::schems::load_cave_schem has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (5 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c96991b191a21d63e8f8b4f83c2d999904ee10f60440b9e8786079e435157"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::datapack::discoveries::classify (cognitive 27): arnis::datapack::discoveries::classify has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, match/switch 6 (8 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/discoveries.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd9676da1c16e99aae4aa49a768ff13665733019f6a21d6414a6e6f9ea0967b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::solve_heights (cognitive 27): arnis::element_processing::aerialways::solve_heights has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), match/switch 1 (3 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":"src/element_processing/aerialways.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce2a0a711cdd7153097e15711d59525764bedf210e2ebb7c362fd57dd64fcc4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::hall (cognitive 27): arnis::element_processing::aerialways::hall has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8e460739d86106c113b220eb3cf213bc4fcdd53fde42cabbadac5a91eee40a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::lay_out_facade_columns (cognitive 27): arnis::element_processing::buildings::lay_out_facade_columns has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (10 pts), boolean chains 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7274}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d39c98f9dd85eeae42b1ffe00770645cc08b2191e920c79f5d028979a9053d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::civic::hotel_room (cognitive 27): arnis::element_processing::subprocessor::interior::civic::hotel_room has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/civic.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6805f2c7d07dee5e39383bf727e721d81a3d65c371f77dd756bbe50214bfb5c9"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::tourisms::generate_tourisms (cognitive 27): arnis::element_processing::tourisms::generate_tourisms has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tourisms.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"161d8b1cd4b112df2da6f7eba13f916b4432dd68bc08a83167c8475ecbca6e14"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::cache::cleanup_dir_recursive (cognitive 27): arnis::elevation::cache::cleanup_dir_recursive has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 5 (12 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/cache.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7730f21cea37a0fba54fad70860dcfeadde40d3b161d76f0a9cbcee4eeabd427"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::compute_water_distance (cognitive 27): arnis::land_cover::compute_water_distance has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"294e04897c61490ac09ddcd94875d2a8e3d575eb11fda7bbd473fce2cd051108"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::pipeline::texture_wall (cognitive 27): arnis::mapillary::pipeline::texture_wall has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 3, boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"92637a4b7adfbc625f067f7940745a5565281b96f06e1b7c6fcc50786260bf1d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::three_dmr::placement::prescan (cognitive 27): arnis::models_3d::three_dmr::placement::prescan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fba962b8f66e972558c4776253f4dbd0cd907402cdddf5836e229492fbd527"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::inherit_masonry_facade_tags (cognitive 27): arnis::osm_parser::inherit_masonry_facade_tags has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31fcf85a01bdeea19cb5d08a353173a2a1efe71243e8b04f6f95ca4dda44898"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::mvt::decode_geometry (cognitive 27): arnis::overture::mvt::decode_geometry has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mvt.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b5816bc6ad6c71785128f64cd646b44b79b8484c5c6a6a0f1e1ef0d954692f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::structures::schematic::load_palettized (cognitive 27): arnis::structures::schematic::load_palettized has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/schematic.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb467b847f8729a49a5595609f8fd18e6f2cffc548e5d81cfc143604142ee8e"}},{"ruleId":"D2","level":"warning","message":{"text":"FloodFillCache::collect_sealed_surfaces (cognitive 26): FloodFillCache::collect_sealed_surfaces has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill_cache.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a865480a7c2753b08bbcbcbc97d8f00a72f8213b6e186d5cda40d584101249d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::biome::chunk_biome_names (cognitive 26): arnis::biome::chunk_biome_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (7 pts), match/switch 1 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/biome.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee470c92b553112c4a9f93fd4a15e108ed6f1df2ec0af735920416cfe09fac4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::water::plan (cognitive 26): arnis::caves::water::plan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (21 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/water.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fe9f89ee5f95b799b25847d06bf36bb4f10b852bc1e8b44547d547fc881d23"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::clipping::clip_polygon_sutherland_hodgman_simple (cognitive 26): arnis::clipping::clip_polygon_sutherland_hodgman_simple has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c049e946d2d2c4756fbdde6e56aaceb7297f5d0691539add82e5ec155e9f583"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::collect_tunnel_internal_endpoints (cognitive 26): arnis::element_processing::highways::collect_tunnel_internal_endpoints has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"58599a90d59044a81927a02a4fadac91915be8af5eadd10630d293b48189096a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::man_made::generate_water_tower (cognitive 26): arnis::element_processing::man_made::generate_water_tower has cognitive complexity 26 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 4 (8 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b085613e117245a0893432eda25dcf601a5acda15d8e51d1a2c979de6cf829"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::rail_track::rail_profile (cognitive 26): arnis::element_processing::rail_track::rail_profile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rail_track.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"942b2a088ec510601212d1df322dbf09b19fca13afee61c63977c403dc58c027"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::nearest_wall_from_inside (cognitive 26): arnis::element_processing::signage::nearest_wall_from_inside has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f29ffa683cd44e449551149075d3ddab284af663f37f3adbd5e701c8d3e9870"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::office (cognitive 26): arnis::element_processing::subprocessor::interior::commerce::office has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, match/switch 2 (4 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8116c6191bca194cad50dc23c9abecc5bcee31e86fdfe7b13f67e05838f951d8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::train_bodies::parts (cognitive 26): arnis::element_processing::train_bodies::parts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fc1dbed3a1ec66dda8a5944d4126d65d43bad8b676e9f21a1b34ebd94c7dca"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::water_areas::relation_rings (cognitive 26): arnis::element_processing::water_areas::relation_rings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b437b4e1602820b02cbe6cb6cf5f40bd141b3a09191b5e430485cf18c63d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::lzw_decompress (cognitive 26): arnis::land_cover::lzw_decompress has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b68ead5bf512c484560b3488bc5c1ae99f4b44de459849cc7d920df396d7d68"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fetch::fetch_metadata (cognitive 26): arnis::mapillary::fetch::fetch_metadata has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6cfe5215e145cba57d131eb5ff21cbdb7319523b5c6875216439d9ce03a61c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::column_lab (cognitive 26): arnis::mapillary::refine::column_lab has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 6 (11 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d492ad90be8368eb233455ae5686d97ef2026c8124d4641031fdd286fadb7b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::stitch_rings (cognitive 26): arnis::osm_parser::stitch_rings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dcc3cfbe8b00e3f6c8e9a96a438b6629bc649d07f3eb9c72f13ae3cf173a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::assemble_area_rings (cognitive 26): arnis::osm_parser::assemble_area_rings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"61162557c0f39a0440b9d9e4d114c07f6b54cfeb2e61de247238b023df32be7f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::deduplicate_against_osm (cognitive 26): arnis::overture::deduplicate_against_osm has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (9 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1e9950124e76fa3518d249c081da337bd76eb8e73dd112924a5eca99faf879"}},{"ruleId":"D2","level":"warning","message":{"text":"MipTexture::new (cognitive 25): MipTexture::new has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (18 pts), boolean chains 3, if/else 3, match/switch 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeaa43ad6974ccd6dae5a276a80e462989df5bcb6a44b4780b27dfc88e95d99"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::biome::biome_for_class (cognitive 25): arnis::biome::biome_for_class has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/biome.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2072a5f88f1272fc5355c0f07c14d1dbc57a042da607b3f9de0b869ac5aa8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::swing_ride (cognitive 25): arnis::element_processing::attractions::swing_ride has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7f9e61146d3e6c8b4579697d5bdf6f4debc0ed10d09a61da78422ce4997941"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::star_flyer (cognitive 25): arnis::element_processing::attractions::star_flyer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"958ca879e9395c6d312dd19b15318ce5877315e0f25007be0629ddc6026f238a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_special_doors (cognitive 25): arnis::element_processing::buildings::generate_special_doors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7825}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e1c178dde1cbfe7339c37c52f9ffd8aca251c7172801aac678f82d9868d796"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::cars::bend_into (cognitive 25): arnis::element_processing::cars::bend_into has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (22 pts), loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"559eb011d2f1f870683c26f798183d33dc56250ad9c12b553f5e3e67c6faa2ce"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::collect_tunnel_footprint (cognitive 25): arnis::element_processing::highways::collect_tunnel_footprint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d129de11b4b2330317e3478d2649d42974a5bca8c4626677763880f63465d691"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::collect_building_passage_coords (cognitive 25): arnis::element_processing::highways::collect_building_passage_coords has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 6 (9 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":3356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0817a0710c0073e83335f7466e504f6fa8d1b907dc6e648ebbaaa97bf2f13192"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::man_made::generate_mast (cognitive 25): arnis::element_processing::man_made::generate_mast has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (6 pts), match/switch 4 (6 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":"src/element_processing/man_made.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"043775bde167d39b3231b345f78f4a998cfc3b4ed06083e60fc6893fe27dbb77"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::stop_features (cognitive 25): arnis::element_processing::trains::stop_features has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, match/switch 2 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec82a8d248fe47f1cebc6c623d980ce044d38a500d3f9938d298380b70cb4bc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::waterfront::line_footprint (cognitive 25): arnis::element_processing::waterfront::line_footprint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterfront.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a57d73fda4b97dbb759bc75d288170cc7a41d6179267196b042f01af9fe7b1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::nearest_land_class (cognitive 25): arnis::land_cover::nearest_land_class has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3082f2c120c268ae9593ff508141c2835b8bb526e51f9f9a290b196bd8d4fcc2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::shoreline::rasterize_rings (cognitive 25): arnis::land_cover::shoreline::rasterize_rings has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (12 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/shoreline.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea9872442571f51dbd9421f35638c435b457e61df681d775424f6f26f27e595"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::facades::project_cells (cognitive 25): arnis::mapillary::facades::project_cells has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (11 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb61ed9d64438d9950a5e1500dd6a68a8e2104a440c091e735c0ed28bb92999f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fuse::envelope (cognitive 25): arnis::mapillary::fuse::envelope has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac65446f3b6e78496b45fa8ac4ce5aef73c374eb2e9c45a3f9e96e2dca46cd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fuse::weighted_median (cognitive 25): arnis::mapillary::fuse::weighted_median has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (12 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44e2f4b5b4816a15114386b5c0b601c344f28a27a1ba71d72d1cf54e14f0d05"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fuse::align_views (cognitive 25): arnis::mapillary::fuse::align_views has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53ff9720385d2e1b424d14255f79c9e753d2eb84544c77faa7d63c1a5b5968d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::custom::stadium::place_stadium_models (cognitive 25): arnis::models_3d::custom::stadium::place_stadium_models has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/custom/stadium.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e0442b3d0328056f48ff2df60cc39b15959e43d9ad77268e32b44816473003"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::process_partition_file (cognitive 25): arnis::overture::process_partition_file has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3d0a9f6db1cfe352e04d9eb58eb0cfb31f51069564e2993b29b55b5ac1dda1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::parse_wkb_polygon (cognitive 25): arnis::overture::parse_wkb_polygon has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf6c8d75be06d2a7d10f7310dd555694d2acd0c65350bc3dc3bb4b524556f78"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::preview_3d::build_preview_payload (cognitive 25): arnis::preview_3d::build_preview_payload has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 5 (9 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preview_3d.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabecbce5abb74e240e2db003ff58b5becf10a2f09bcbd2b1124351277ab6e49"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::sources (cognitive 24): Grid::sources has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/disasters.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"551b8df1f53d009c06993a95978828c6212b0a1101c88203bb3e648b3cf44749"}},{"ruleId":"D2","level":"warning","message":{"text":"Profile::build (cognitive 24): Profile::build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b0878bd738a9a1266a1d6c39e7b3cd72e5491aed3048639d02125123b339ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Http::get_counted (cognitive 24): Http::get_counted has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"26384b058fce6619486a2f82ca860211f449581af8103612cb961a1d3ae391e3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::generate_aerialway (cognitive 24): arnis::element_processing::aerialways::generate_aerialway has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 1 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"1589211c22b077a82ce06d1a76509f0975817a45675c817f9a750434c2f2f332"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::get_wall_block_for_category (cognitive 24): arnis::element_processing::buildings::get_wall_block_for_category has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5657}}}],"partialFingerprints":{"codehealthFindingId/v1":"414e2d10ab838a4c0ac69272e660b153416cb94bc86446535262b2dd36452959"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::render_entrance (cognitive 24): arnis::element_processing::buildings::render_entrance has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7043}}}],"partialFingerprints":{"codehealthFindingId/v1":"6195519a4d82a849b203846a8dbb27ec4a31d87f9e301db8c3308289b4b8f3dd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_pyramidal_roof (cognitive 24): arnis::element_processing::buildings::generate_pyramidal_roof has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16727}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed22aa01602aaf372ca4ed89dcc28b0361d4324c3af9bf856fc3f70fb908d33"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::construction_site::place_box (cognitive 24): arnis::element_processing::construction_site::place_box has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/construction_site.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c9d2b31ef07834ed64f4421b5a9fe762e967a02aa45f23e90b120f71c5f76"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::man_made::generate_water_well (cognitive 24): arnis::element_processing::man_made::generate_water_well has cognitive complexity 24 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39e727483fced7791ff55503696f0bc5664a992c0dd8a6fbd6e851eaef20fb"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::civic::lobby (cognitive 24): arnis::element_processing::subprocessor::interior::civic::lobby has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/civic.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"af41cf2cbc4936543509d37b5ec3f948a1c120e41265792123e9a2199003953a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::scale_to_minecraft_reserving (cognitive 24): arnis::elevation::postprocess::scale_to_minecraft_reserving has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, match/switch 3, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4a92f4c32963ce4c461e6fa79ee2bd2fe1a63b823fa4917c4963085491f31d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::providers::mapterhorn::download_tile (cognitive 24): arnis::elevation::providers::mapterhorn::download_tile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/providers/mapterhorn.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf98cc75a734c26d74f0144a3b6739ada787b7dbee65c11bc67ab2e2a357fae"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::shoreline::simplify_ring (cognitive 24): arnis::land_cover::shoreline::simplify_ring has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/shoreline.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0262855c8ffe4efb64b57a23b79a7748bbf8a3b6ee65c4fe345af59c19d77546"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::shoreline::split_point (cognitive 24): arnis::land_cover::shoreline::split_point has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3, match/switch 2 (3 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":"src/land_cover/shoreline.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2439097b0d811657daf66627a04fb2f01129f3063455477a9d04e72e75d25908"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::wikidata::placement::place_wikidata_models (cognitive 24): arnis::models_3d::wikidata::placement::place_wikidata_models has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), match/switch 2 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/wikidata/placement.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d47c44be9f25534394c5dc3b11bbebef676ad78c29362214def70aa94f9ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"SignRegion::detect (cognitive 23): SignRegion::detect has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (11 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/region.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9522fc124464be0387e6e9af5a88b2509a529d64f39eec3ef3326fc8fdfc11a8"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildingCategory::from_element (cognitive 23): BuildingCategory::from_element has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b0ba496c226c5f00c27007d1c22038f5ea050a0355f3e82ee306568667eb3b"}},{"ruleId":"D2","level":"warning","message":{"text":"RoadMarkingIndex::signal_crossing_stops (cognitive 23): RoadMarkingIndex::signal_crossing_stops has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"1534d94c1d4a8222dc102221beea9e824f5a441f3a448b8c36e5fc00ae9522c2"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionLibrary::attach_ecoregions (cognitive 23): RegionLibrary::attach_ecoregions has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"af59de89639ea35aebe369a4a7768ac1a7dd15e61111272bd07b77523d6d174d"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionLibrary::pick_slot (cognitive 23): RegionLibrary::pick_slot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"41263e3e1fbb76ca42ac84c0564aae9983afe2e5e3cfbf2b1d689a8687585ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldEditor::place_decal_panel (cognitive 23): WorldEditor::place_decal_panel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"3202db79897f04ca68b433bd2b9652e44b3b7b0554220dd8d2354709e7183d32"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::canopy::fill_from_tile (cognitive 23): arnis::canopy::fill_from_tile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canopy/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ecd7cfbf6ba23ceef6be435799669843201bf75130ce654aacca19de37f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::draw_ropes (cognitive 23): arnis::element_processing::aerialways::draw_ropes has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (10 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4e5b33db492347d121fafab3363f9f4623f4fbf235fd5a96a37fca73e89a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::pick_window_archetype (cognitive 23): arnis::element_processing::buildings::pick_window_archetype has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, match/switch 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07aeb438fea5306eac8a8b742303cd0fe032a071b825ff50cb18d526f1149f4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_onion_roof (cognitive 23): arnis::element_processing::buildings::generate_onion_roof has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16990}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6d77282e6301d93c6fe63be2aaf63de5bfbfaad951662362fd73f52f415ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::road_markings::arm_cells (cognitive 23): arnis::element_processing::road_markings::arm_cells has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b097c3fea8648d4575d9a6b1e8b38fe91b80fa7d1bdcb25782bbc599d7c50dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::civic::library (cognitive 23): arnis::element_processing::subprocessor::interior::civic::library has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/civic.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ac3dbffc0b149a2513f85111c5f1e43043c22f4a6c29a82f6ed2c387090f56"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::uses::use_from_tags (cognitive 23): arnis::element_processing::subprocessor::interior::uses::use_from_tags has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 9 (11 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/uses.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee6e0f6a63b5869784f3f4ed3edc51b444b1cda4692479df11175f33ca3981d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::heights (cognitive 23): arnis::element_processing::trains::heights has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d6beeb26d0f6605de56d6d1feac1ca1fc7d73cdee09b43df05693f6075d48d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::service_for (cognitive 23): arnis::element_processing::trains::service_for has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b626ea45fe068a2baccd54f7da0551da9554322cd5bb20b6d409bb3354802ced"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::walk_from_bank (cognitive 23): arnis::elevation::postprocess::walk_from_bank has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdfd79098c7d6df4d0f052865db7538adec8472e2de6ae6d108effea0d59811"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::local_reach_median (cognitive 23): arnis::elevation::postprocess::local_reach_median has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5605ce0e17bd171882b29220fc70ffeb41a0d5b5cfe18bc962b207028790cd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::providers::mapterhorn::fetch_tile_pyramid (cognitive 23): arnis::elevation::providers::mapterhorn::fetch_tile_pyramid has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/providers/mapterhorn.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f3b3f7c65fca3a8d39be5a5d54e20b5e481c842fe46dd6decf0c2b2b191ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::naturalize::reclaim_water (cognitive 23): arnis::land_cover::naturalize::reclaim_water has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/naturalize.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4aef8264df2fe28d27536dc915ceddf05f914ed5b8bcb7996c5d89816bdbff"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::rectify::occlusion_bits (cognitive 23): arnis::mapillary::rectify::occlusion_bits has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b8afc2695847cb9c0ff26c9598809d4e31ab2889cf2bcb4182656ab99a7b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::find_peaks (cognitive 23): arnis::mapillary::refine::find_peaks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"688abb26923fce278314a6f1d684ba5f0df8d8ac95a0942cbb4131fdd7bfb62b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::decide_wall (cognitive 23): arnis::mapillary::refine::decide_wall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c966a2f5f7d979e2df8c6114015da7b54bd1dd384eaf35ffbfa7c9abffffe8e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::register::envelope (cognitive 23): arnis::mapillary::register::envelope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b11ee41f7dd33c55d59fe598508f70c7f3263291bd7bc2d7510554d79de600"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::register::local_minima (cognitive 23): arnis::mapillary::register::local_minima has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (10 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":"src/mapillary/register.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b06bf31457c27cebfe8a73008f61b549f557c193fb42cb2b2eeeb86b2972b1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::register::register_band (cognitive 23): arnis::mapillary::register::register_band has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2120ca510d29de431897861fe8804471d8a81ccf78bf3acb17433f59a9f173"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::visibility::select_views (cognitive 23): arnis::mapillary::visibility::select_views has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc08d0318afbfe62cfbbb1f4f94b870dbf51c475c64407f96a7af62c2ec427"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::custom::stadium::collect_stadium_placements (cognitive 23): arnis::models_3d::custom::stadium::collect_stadium_placements has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/custom/stadium.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2169ccf54be736b5b60dcc4b87a4c009deef77b08e996dc9605191507fcb777b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::one_world::resolve (cognitive 23): arnis::one_world::resolve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/one_world.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c210dd54756b65789506127e5e736a858f2c4c8d85b373ef71cf109a86fc184"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::java::merge_compound_list (cognitive 23): arnis::world_editor::java::merge_compound_list has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (23 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74a4d789b184d0a12395c6811bc992f1f6ab4041bf908a39a892b7d5cc35788"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::style::snow_over (cognitive 23): arnis::world_editor::style::snow_over has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f0e344c16dce3faee750e98e7582257fba4d2051e30087f69fb2d230263f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas::light_up (cognitive 22): Canvas::light_up has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b4d1f8f0d6ccbbbb1ec449cebfc887a64e65db54b29ef4c482696fee9c4ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas::wall_between_zones (cognitive 22): Canvas::wall_between_zones has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c6737ce1beb85683d37e60ab931dbfc1f399e61929e66406f741afe4258104"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::generate_magic_carpet (cognitive 22): arnis::element_processing::aerialways::generate_magic_carpet has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a88324f6a446e51cdb4c881d1df79ef6f9c9b3bf771bc148ea67fb39972a60"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::lane_lines (cognitive 22): arnis::element_processing::highways::lane_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f579cf2a5753a37c6490cfde460becfc1ae5a292473c9bf2b602ecae264aff"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::collect_highway_surface_coords (cognitive 22): arnis::element_processing::highways::collect_highway_surface_coords has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c244ef92eb8e18c17fee791013f13b4c563b9d91111e61ceb36aa139cc81c46"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::ground_decoration::decorate_region (cognitive 22): arnis::ground_decoration::decorate_region has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_decoration.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"970f220ced29ce36ac21a34909c6cf7777c13225f4282902d2b85de591a69640"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::shoreline::reconstruct_water_shoreline (cognitive 22): arnis::land_cover::shoreline::reconstruct_water_shoreline has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/shoreline.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcb69a8bfc8c472ce8a181f93ffdd1af89f571afd5a3fb72908603d89fcf6b7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::bands::find_lattice (cognitive 22): arnis::mapillary::bands::find_lattice has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b3c07db84fef76a41805983b77f525a3e9d1b48cfeaffbe838c295d1a7c96c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fuse::fmm_march (cognitive 22): arnis::mapillary::fuse::fmm_march has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"328721172e61e4cf42c1a45d5afd6241e1b570a0be19ea5ef2456c3d7f8f4506"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::regularise_floors (cognitive 22): arnis::mapillary::openings::regularise_floors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 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":"src/mapillary/openings.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ac26b4ca66fa9fd5374c35da6378389e0a6646cef8c9faf5b4ccbe45c48cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::perspective_transform (cognitive 22): arnis::mapillary::refine::perspective_transform has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (11 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c761f4ee630f486e105a7cb2f0a1441f23e7b6650a3e269f693eabb61116ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::visibility::perspective_fov (cognitive 22): arnis::mapillary::visibility::perspective_fov has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcb8f6a5f8e44fb7d2b01f7cf0fcd1a77ae64b51715413568fe5e30d8121bba"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_tiles::select_for_bbox (cognitive 22): arnis::osm_tiles::select_for_bbox has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"2732a0d206a3ee27219cbf215bd58e8ae730a25a2bf077fc0434c8f843fe6df2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::trees::schematic::load_schem (cognitive 22): arnis::trees::schematic::load_schem has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (5 pts), match/switch 2, 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":"src/trees/schematic.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f354075adc49d2ec3b685caa736f9af4d021bb970df3b58ff3d0086aae939dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_steps::column (cognitive 22): arnis::water_steps::column has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_steps.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c82094f1d95c65ea1eb525272e573e5e4ac738b8ec9dc272a7a89e2011a11b2"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockStorage::try_compact (cognitive 21): BlockStorage::try_compact has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"8936ffa9ef8c19c61096fb8d3c060f63805b6d85cc10b4eae924707e1ab3a544"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::noise_cells (cognitive 21): arnis::caves::noise_cells has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (10 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"593e8ce84380647581f3f2321a4e6865af7ba76c928375a36794edf80ed8b413"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::decals::font::fit_text (cognitive 21): arnis::decals::font::fit_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/font.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5302adb5207b1e9e02e222715a358dee8ee6d996e7f566f96d1b0287f7830fc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::cabin_body (cognitive 21): arnis::element_processing::aerialways::cabin_body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"553b298545dee8cd5122ccf745ba5c072dbf614572f0bfb07f81efe01aa654a2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::report_wall_segments (cognitive 21): arnis::element_processing::buildings::report_wall_segments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb55acd4a6f341e1c46fd5c5190a9e0e85f5177cce610240c8ddcc8e5b04764"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_hospital_green_cross (cognitive 21): arnis::element_processing::buildings::generate_hospital_green_cross has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":11187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2bb1d8b162091012e5600b4ac940af85ab2b3a8b1a6d71d8c0174818ae6687"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::drop_buildings_on_aircraft_pavement (cognitive 21): arnis::element_processing::highways::drop_buildings_on_aircraft_pavement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, match/switch 2 (5 pts), loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9906863a75e10dfd643d8ad26df37e739fee32524e361e69ed270e0bfe26e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::rooftops::pick_membrane (cognitive 21): arnis::element_processing::rooftops::pick_membrane has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d98866013619bd71ee19cba958cbafa5d958b98f96f7093ee6a81261383452"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::cache::clear_recursive (cognitive 21): arnis::elevation::cache::clear_recursive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/cache.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d83aa540733a9187e31b907ec0f5b55f3e4742408182363a22e1f847233fc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::grow_reaches (cognitive 21): arnis::elevation::postprocess::grow_reaches has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"src/elevation/postprocess.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"213ef6c3b0d35f0b191f9ac4a8b69aaf2ada900dce02ba3df148e45e31162606"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::nearest_non_water_class (cognitive 21): arnis::elevation::postprocess::nearest_non_water_class has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 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":"src/elevation/postprocess.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda429200ae1dedaaf43ec2c0c10d7022c82097321954877e0cdfd76fa0d7046"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_land_override::fill_rings (cognitive 21): arnis::land_cover::osm_land_override::fill_rings has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (9 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":"src/land_cover/osm_land_override.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b804185673607505e35ef4709af0fa2d5f410e3f741306064cdd368e4913458"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_water_override::fill_polygon_scanline (cognitive 21): arnis::land_cover::osm_water_override::fill_polygon_scanline has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4a9bb3550f92998ffc99bddce436dd579875a244ebbc5f0ca92b3d4c36f038"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::facade::sample_wall (cognitive 21): arnis::mapillary::facade::sample_wall has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facade.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6249d188e6ece034f9127a99d625cc47976abf1ed6c2a0a0b4e2e25cbba9847"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::imgops::erode (cognitive 21): arnis::mapillary::imgops::erode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (10 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/imgops.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8e1b88fed4292144cdb2195ef6b57982edca8f8fb15d5689c26dc3515b0dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::sub_medians (cognitive 21): arnis::mapillary::openings::sub_medians has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 2 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5a1b20458785107655c2f2c0f2deda46816d36a786b72f5ce3774b79c23225"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::rectify::vegetation_mask (cognitive 21): arnis::mapillary::rectify::vegetation_mask has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, loops 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c5948c0e462a696c8bfe36b753aab8ef0ebb6d57f6d8d2297b587d1cab8a04"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::visibility::line_of_sight (cognitive 21): arnis::mapillary::visibility::line_of_sight has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"44601df2c3201db950424a942b1c1076856ac5e4c094d071fcfe77744c177111"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::collect_by_transport (cognitive 21): arnis::overture::collect_by_transport has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"f677462c66feda8d4ddfe92369cf4b34ff0e2cf420e1fe5170da9c6f113cae3b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_depth::carve_lc_water_region (cognitive 21): arnis::water_depth::carve_lc_water_region has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (3 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":"src/water_depth.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3e2723a6bac7e499226a80a22e7b674a43bf952ca2428f4b778c00581b15d1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_steps::scan (cognitive 21): arnis::water_steps::scan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_steps.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28504c672c36ab86c929d92b4056ee1805bf633cb264e2e035afbbcf2a95987"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::style::ruin_building (cognitive 21): arnis::world_editor::style::ruin_building has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4153e70070d179fa9a7e9c5c596fd2e4bc2ce8bf03624777241fefff6c3ece84"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::spread (cognitive 20): Grid::spread has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/disasters.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"972dc3feb5dfb978d68711da9afb1e5a4dc03985074d691fb15fac88cf8ae565"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialRegion::canadian (cognitive 20): MaterialRegion::canadian has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea47df74256e956538882ae7ddf4945e605d1c9e2af1c406aa87aa47e5ccfd1"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan::node (cognitive 20): Plan::node has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/traffic_lights.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"070ef33a7d8137678f14889085265f7173de1d7c07d7dab1af0ec2743c68b35d"}},{"ruleId":"D2","level":"warning","message":{"text":"CoordinateBitmap::count_in_range (cognitive 20): CoordinateBitmap::count_in_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill_cache.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b791def8c1aa829bb65f4d4c3e5fe86ecd74e5a7d8a0497123522fcf1998fb52"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionLod::flush_level (cognitive 20): RegionLod::flush_level has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/voxy/lod.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"71acdbd69921866645584a716126799c7097d8c1d690975c444be0b489eaffe8"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::zone_map::render (cognitive 20): arnis::caves::zone_map::render has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 2 (6 pts), match/switch 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/zone_map.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82527c1f0339e1a5efd4b9ae3824b91e9c8738a0fbf9db7d0a0c335cc102fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bridge_towers::collect (cognitive 20): arnis::element_processing::bridge_towers::collect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 5 (6 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_towers.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fe27ab686ca76a73dcf51e431cee6f574fa87b33282bf36c6539c409a181b5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::infer_building_height (cognitive 20): arnis::element_processing::buildings::infer_building_height has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5889}}}],"partialFingerprints":{"codehealthFindingId/v1":"247a728d3ccc10d68366ad76224c80ddb7ecc3ea5c6ef5bb91a4909dc90bc3e6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_corner_quoins (cognitive 20): arnis::element_processing::buildings::generate_corner_quoins has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10081}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf93e87eff0a699cb4d920859af4fd74cb0b4bc32e73be8534d051d5bbc9673"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_parapet (cognitive 20): arnis::element_processing::buildings::generate_parapet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13012}}}],"partialFingerprints":{"codehealthFindingId/v1":"518506da2b527bad5a7ec69b784f28a58ae88fdb78122b00fd074543a0a48887"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::cars::tidy (cognitive 20): arnis::element_processing::cars::tidy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6cf57abebca0bea51a178d36793853f11e5945593832943141a9e9dff58b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::fuel_stations::generate_station (cognitive 20): arnis::element_processing::fuel_stations::generate_station has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 2 (3 pts), match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1313105103ce43375e83095a2430102323554f848df4bf1c1b4fc7a4ca1ca092"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::parking_garage::build_core (cognitive 20): arnis::element_processing::parking_garage::build_core has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/parking_garage.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc2b7df991478b9c5a4a8701fc8f79bcf3f99d58106f4393da81617cbc90779"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::bank (cognitive 20): arnis::element_processing::subprocessor::interior::commerce::bank has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"69936e212c3d799c53232ca30c8dfce641f006f8be14b3cd98489d6e58f53238"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::train_bodies::coach (cognitive 20): arnis::element_processing::train_bodies::coach has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 4, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac28764f6cf356e737a5b2533f0f1fdaf554b846fb654cb72c01b4efb78b57c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::waterfront::generate_breakwater (cognitive 20): arnis::element_processing::waterfront::generate_breakwater has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterfront.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9fc3e56967a5851a0925c989bbbf67a3f01bbfba9892bfeed2e4514a33aa4b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::keep_anchored_walls (cognitive 20): arnis::elevation::postprocess::keep_anchored_walls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"6900f17c5f08474a662026003401c29510ae9d9ef9076b24331e49fec27dd9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::floodfill::scanline_fill_area (cognitive 20): arnis::floodfill::scanline_fill_area has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56c6440cf3d476fbfe8faa9ec398de3a46f99e57fad71b798c024707d4325f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::parse_ifd (cognitive 20): arnis::land_cover::parse_ifd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6767bd12100ea8776e758cab16a802eba2b86e999ebe654ce39044042ad5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_water_override::fill_row_spans (cognitive 20): arnis::land_cover::osm_water_override::fill_row_spans has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d114f6799ad0f7c3202937cc79f4e2b52984f97ae460fa338e3441dded21736f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::fit_rhythm (cognitive 20): arnis::mapillary::openings::fit_rhythm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf0c4411c248859808b732dde7c5edb3c638b2688517982c32ced6c6ece613e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::openings::assign_cells (cognitive 20): arnis::mapillary::openings::assign_cells has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5a14b426687da9ae62f15ed22d230a9cd770a34c2899d03f88dfc64fa60245"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::rectify::resample_rect (cognitive 20): arnis::mapillary::rectify::resample_rect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e826a23d27c943f949a4d7216eb6cf7e2f49b81901435389b6bed40bbcbd5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::overture::parse_osm_ref::walk (cognitive 20): arnis::overture::parse_osm_ref::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"03519b8ae9a8afb2249dcb7612b5c1896e2f5212c8d395040cd9e920fa9dcd86"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::trees::region::preload (cognitive 20): arnis::trees::region::preload has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a072c024971d76d013fca76a43e95128ea482da7b13a712354de01ea5fa0cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::water_depth::place_underwater_vegetation (cognitive 20): arnis::water_depth::place_underwater_vegetation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ce0784d193f9a865dd4915da74b4435209af6624637846f5625a2f3e9909b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Canvas::polygon (cognitive 19): Canvas::polygon has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/draw.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac2c78f1e5555b222358c9c4dac1c355c987abb16e9ddd95ede9af9de6415e8"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialRegion::in_north_america (cognitive 19): MaterialRegion::in_north_america has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 9. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7becc0c6ba977f2a4f17545c3921d38fd1f8c2b1a6d76388f12b2eff703979f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::caves::deepslate::apply_region (cognitive 19): arnis::caves::deepslate::apply_region has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/deepslate.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6245e85be3c176532dbc859608876891ad2f66b79c72c693e481e0539cf400d3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::building_facade::detect_street_corner (cognitive 19): arnis::element_processing::building_facade::detect_street_corner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_facade.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"da24ffd56e5e5d4380e975fc69b2d5802a4f6a8bf3fe63bd953a40db71a3859b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::place_way_lamps (cognitive 19): arnis::element_processing::highways::place_way_lamps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"25385a34b4e6a2460ce495fbd668d597d6abd96fd55d1abe7798c38c87232ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::parking_garage::find_core (cognitive 19): arnis::element_processing::parking_garage::find_core has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/parking_garage.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"436276acebf641cbb5931fc704da3a0f908f314c37c567526c45478035a31789"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::place_bridge_catenary (cognitive 19): arnis::element_processing::railways::place_bridge_catenary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 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":"src/element_processing/railways.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7c921761e064ca390c8db6d07014fe3e60d62c399564316ea2011c857a713d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::water_areas::still_surface_level (cognitive 19): arnis::element_processing::water_areas::still_surface_level has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 5 (8 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0e467e896db4e91560d5482bc68964078bcb8dc5b4f9026a8d9c3a82ff116c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::clamp_by_adjacent_land (cognitive 19): arnis::elevation::postprocess::clamp_by_adjacent_land has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f062637a03d292b2b15f3714b34318abfdfd4af3c7d19c3a79c044357af8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::land_cover::osm_land_override::stamp_line (cognitive 19): arnis::land_cover::osm_land_override::stamp_line has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 pts), boolean chains 2 (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":"src/land_cover/osm_land_override.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"838c881afec491377fe755ed8cb7c9cf58a3d88719d1d82f8fcb6eae8c54d593"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::bands::apply_bands (cognitive 19): arnis::mapillary::bands::apply_bands has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb15a7c0c371273d8be37fea73835bcc7dd945ecba56ab44d139acf385c86bd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::rectify::footprint_columns (cognitive 19): arnis::mapillary::rectify::footprint_columns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"673494f00671cbb3f9ff1f6579e1e75d024e63dd62968f2b08f5258a1e8c02d0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::roof_vote (cognitive 19): arnis::mapillary::refine::roof_vote has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"76724a4245620a8d33919f6521a90dac33c14ef8d83a52ade86df1d396e91e97"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::three_dmr::placement::place_three_dmr_models (cognitive 19): arnis::models_3d::three_dmr::placement::place_three_dmr_models has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (6 pts), loops 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"64645a164c9f8e3b5aeb879de2a5ada008f4df1dcec2cdae46140de8c05612df"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::wikidata::stl::bbox (cognitive 19): arnis::models_3d::wikidata::stl::bbox has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/wikidata/stl.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dfb45fb366adaa490ea614a85a8b4065294c2cc8ed91e54ea69605eb9aacae"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::one_world::existing_chunks (cognitive 19): arnis::one_world::existing_chunks has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/one_world.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"939e9def9b96879807a9cf33783635884db0d801233d7aafc0eadd2ed947458a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_tiles::decode (cognitive 19): arnis::osm_tiles::decode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 7 (9 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f3a89fb3c751144922f06eec9f6ddb1c8e6ba5908371e70b3b937782350d46"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::structures::plane::build_placements (cognitive 19): arnis::structures::plane::build_placements has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/plane.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f364e4a55a73a22ae1d11215691fff46e66acb2e7a96154381ee2e8d6f667046"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::trees::schematic::drop_stray_leaves (cognitive 19): arnis::trees::schematic::drop_stray_leaves has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/schematic.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"187e482deb39bdf3d0d33dc8da411f7ff50c4b95f7c80d972bacabfc70417223"}},{"ruleId":"D2","level":"warning","message":{"text":"build_facades.build (cognitive 19): build_facades.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (6 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/building-facades/build_facades.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e0f3e219f75d1843e6fad67487f4b27bceb8948eb4c10d42576155d0c211b8"}},{"ruleId":"D2","level":"warning","message":{"text":"GradeObstacles::build (cognitive 18): GradeObstacles::build has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"098aea59eab683c2e0094f384b37cd99688e496201bf2156010708c356ba6da0"}},{"ruleId":"D2","level":"warning","message":{"text":"CarNetwork::storage_function (cognitive 18): CarNetwork::storage_function has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82f7f1a1aebb5aee87ce0b949d2c19ee613714e3729831564d7a54db18604fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Ground::save_debug_image (cognitive 18): Ground::save_debug_image has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f3d0808c09e14d00d3466d3b021683f8994cb0828599cb89b3d080da7aa677"}},{"ruleId":"D2","level":"warning","message":{"text":"BedrockWriter::build_palette_and_indices (cognitive 18): BedrockWriter::build_palette_and_indices has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/bedrock.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba804d8bb246599321a086f7f1cb708fb69aa3d07d03a63d56fcac4b247a53"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldToModify::merge_section_with_auth_check (cognitive 18): WorldToModify::merge_section_with_auth_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e83b3645959298cffbef3e47dec0900085a9c875f1288dbf45067fd27127a4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::decals::templates::speed_limit (cognitive 18): arnis::decals::templates::speed_limit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/templates.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5711279a0db9c3dd01f4501e422e51fb8d95a618b9519a77ed04d0c0e18b216c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::barriers::trace (cognitive 18): arnis::element_processing::barriers::trace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 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":"src/element_processing/barriers.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1011e0a36b8e6f30b6012a458df9601713d3edee7ff34fb2903472b7541e13"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::european_default_roof (cognitive 18): arnis::element_processing::buildings::european_default_roof has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6afc04e658ac2263304b4066a83ef2c6f21255e5dfd283e7e87e6ba43097c68"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::regional_default_roof (cognitive 18): arnis::element_processing::buildings::regional_default_roof has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd02f140ab6ea498d1c8a678fe2a0814f54fc77fe9f53c997795af47a094c68"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::pick_ground_floor (cognitive 18): arnis::element_processing::buildings::pick_ground_floor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d071b28fb793ee76614fab3a5763e17414cabded668b2b80d1e3f91c5b2959b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::wall_typology (cognitive 18): arnis::element_processing::buildings::wall_typology has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 3). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5133}}}],"partialFingerprints":{"codehealthFindingId/v1":"91096db03c26d85209a2edd01d30f427d48aea2e90925839b32f6b62b2f8cb1f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::apply_condition_variation (cognitive 18): arnis::element_processing::buildings::apply_condition_variation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 4 (6 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":8834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66a7c6375094d3d2de5c03928e3228c04d717ce4d61a0fd479311f9a1b94e36"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::cars::place_cars (cognitive 18): arnis::element_processing::cars::place_cars has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87a33adc117e0d6bdbdedb3a3344ff17e5ea9274a247fa2c88ed861e6a606a0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::fuel_stations::kiosk (cognitive 18): arnis::element_processing::fuel_stations::kiosk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"586dbab0fd05b1876154fd1dc4b3a0feb423c7a33319a13b6bab9dc628ec06b7"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::landuse::military_ground (cognitive 18): arnis::element_processing::landuse::military_ground has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (6 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbec972096c1aa1023d3d0489aa3e47e15d8f5314c4c397a67d1db85f35a6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::parking_garage::park_cars (cognitive 18): arnis::element_processing::parking_garage::park_cars has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (9 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/parking_garage.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"982e567bafacbb32c789d542771409ac6475626d4dbea007b4bb77ba547e5838"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::street_furniture::road_frame (cognitive 18): arnis::element_processing::street_furniture::road_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/street_furniture.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f62d46714a54769ec7cd033f198f355cb34968c54b6dc29ee38c4b2bdc46db"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::buildings_loot::themed_chest_loot (cognitive 18): arnis::element_processing::subprocessor::buildings_loot::themed_chest_loot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/buildings_loot.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a13439f58b5769be7a5c37f41cc46d62291043ca3696932c7f4312d1fb71101"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::civic::classroom (cognitive 18): arnis::element_processing::subprocessor::interior::civic::classroom has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/civic.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf866204ac8dfbfdefde74682ae59afcaf86af9812a0d29e981a044558a5c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::civic::station (cognitive 18): arnis::element_processing::subprocessor::interior::civic::station has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/civic.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34870788164f16bf5370ebc37af1a2deb0eea1c93a5459c4f32ea192c48f7e6"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::auditorium (cognitive 18): arnis::element_processing::subprocessor::interior::halls::auditorium has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 4 (6 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc53462965716cae1c5e3587e707bec324dbc388328296a7869f796bb514472"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::local_water_median (cognitive 18): arnis::elevation::postprocess::local_water_median has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cb88ea6933185f5eb9f092c6376aeb2f3b807231e757dac95128eb7232d752"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::steps_from_other_water (cognitive 18): arnis::elevation::postprocess::steps_from_other_water has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e5ce70a0c8fb540c7bcc169cd89f43ddf23a84c52200a776d41068bff401cc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::geometry::join_ways (cognitive 18): arnis::mapillary::geometry::join_ways has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/geometry.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2bd05561da5cc6fe8d7bb1ee86056fec2b893bafbd113b2edd234e454ae977"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::plane::refine_corners (cognitive 18): arnis::mapillary::plane::refine_corners has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/plane.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a5f5652ed9854ea7fb97a83927638d9194b229a397f9d4f1fb91625f4b6ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::lsd_families (cognitive 18): arnis::mapillary::refine::lsd_families has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e82c8517be0d08124cf8f3c86d75c2d187f12ebcab6fca6ec05532f363fdc2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::irls_line (cognitive 18): arnis::mapillary::refine::irls_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56651e25dbeef0a2de61ab39320eb60e12b9cf97392eaec86c35ca58fb155b2"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::building_arch_era_dated (cognitive 18): arnis::osm_parser::building_arch_era_dated has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"4489fe03b28af03c3fb8695a5d3b772e72df7f6b8447ec69892c13654c8d9463"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_tiles::manifest (cognitive 18): arnis::osm_tiles::manifest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (18 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0610a66b771c1a5928ee37b6fe3c3fdfd64dcd45b4e347591628dd0429a2bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::structures::tombstone::maybe_place (cognitive 18): arnis::structures::tombstone::maybe_place has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/tombstone.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0450fbaf15e234f20a753a8d0d5ae539e11346898197da3ad8d4d3f0cf840daa"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::style::ruin_open_ground (cognitive 18): arnis::world_editor::style::ruin_open_ground has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55cb3ce156784acb501db00e7e22d9385e6791e3f1a558fe5daa7e00cfb0218"}},{"ruleId":"D2","level":"warning","message":{"text":"RawCluster::parse (cognitive 17): RawCluster::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6f4b9a889d6ee1d3597aba0d87c7c06348eb70c971e8cd7863b1d7515e0a86"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionLibrary::pick_in_community (cognitive 17): RegionLibrary::pick_in_community has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"586d10ef954ea35909aa3faa045d514f7911d098e1cd4f3dc1bc6c00834c6318"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldToModify::region_content_hash (cognitive 17): WorldToModify::region_content_hash has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea9ae33facaf36db919c6b7d7bad5f501985612ab49b71a765d2768db8d21d5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::canopy::read_strip_index (cognitive 17): arnis::canopy::read_strip_index has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canopy/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b717606bbef69c58d923b0fb60b936454de96a748a13dd5c2954fb15ee0071b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::decals::pictograms::business_kind (cognitive 17): arnis::decals::pictograms::business_kind has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/pictograms.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d900829028535984a08be98cd72a6b84e9b48e73f1c64c16da6fe3e4f44607e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::attractions::spinner (cognitive 17): arnis::element_processing::attractions::spinner has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 5 (8 pts) (nesting depth added 6). 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":"src/element_processing/attractions.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aede891658b14b3a04af6c9a2a05880d9041a7778601fb68a2acf183e682cc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::photo_shell_columns (cognitive 17): arnis::element_processing::buildings::photo_shell_columns has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7681}}}],"partialFingerprints":{"codehealthFindingId/v1":"25528744012fef2ad40ca99f2a638bcd7cb9c3269dfbdb2e4596395dc5ccf1a5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_corner_downpipes (cognitive 17): arnis::element_processing::buildings::generate_corner_downpipes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10974}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcd3433e502a0c9a1156206da24fed76d602b1704186cdc3ec6f345785bcbc4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_chimney (cognitive 17): arnis::element_processing::buildings::generate_chimney has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13953}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5900ecbc950042de939fa1c2e0b53523f3aae450123c70340265fac2362f22"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_roof (cognitive 17): arnis::element_processing::buildings::generate_roof has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":17084}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2844d694f95d46d4c3774d1189304cff66c721794cccab4d3f29932c8034dd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::paint_helipad (cognitive 17): arnis::element_processing::highways::paint_helipad has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eafd8a5115ea781a39ce8bbc26250c383133362bbe8e6485a148e6cc302ce20"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::historic::generate_pyramid (cognitive 17): arnis::element_processing::historic::generate_pyramid has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/historic.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd937cc30c6ebb5839e241cf8c72439f0978d1017b305dde5d7542374621001"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::determine_rail_direction (cognitive 17): arnis::element_processing::railways::determine_rail_direction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae67ffee09b2d53c3d235e071af916dcd1fa63bd05e31824208ddc51be1e3770"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::generate_building_signage (cognitive 17): arnis::element_processing::signage::generate_building_signage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8c23c1cf3a668dcc7c29fa396b84cb5cdf61d0a738189b84fdf4ea1a2d2131"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::place_street_name_post (cognitive 17): arnis::element_processing::signage::place_street_name_post has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"266c644beac93351c2e74a50e5a05bff8612e1e4b2b69b326948606f932efa63"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::generate_information_board (cognitive 17): arnis::element_processing::signage::generate_information_board has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (7 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7044f9c452fdc5e284ac1d5336e1f6a09520c2afb54ff0afb474990fd9b7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::commerce::showroom (cognitive 17): arnis::element_processing::subprocessor::interior::commerce::showroom has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/commerce.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11fd18f4208918ce2267d87bf040e288f59e4dba4ef63ec98c945a9b148f028"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::gym (cognitive 17): arnis::element_processing::subprocessor::interior::halls::gym has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3140fbfc5afb04c3aa9802ac346efeb75de9e5d69e407b4adbb98e5c79422438"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::traffic_lights::add_arms (cognitive 17): arnis::element_processing::traffic_lights::add_arms has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/traffic_lights.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbe7a02fd95c378de71d3fd8fd822a6811f601fd31ab0623f0db221695f428d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::trains::pieces (cognitive 17): arnis::element_processing::trains::pieces has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ae7361fb1acf551614d68ab0a9ad8a26d6c898f317a8f872a6821e4ef8452b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::waterways::create_water_channel (cognitive 17): arnis::element_processing::waterways::create_water_channel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterways.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d6f5846ff4eedf18edc1fef79480c4aa60c9e38f6722539ac67f3b88531d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::map_item::build_colors (cognitive 17): arnis::map_item::build_colors has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_item.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"46712ae6cf60f1dd41a3d9732edd05664ff5c26262d50ce34bf07b0f97c25c73"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::run_facade_pipeline (cognitive 17): arnis::mapillary::run_facade_pipeline has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/mod.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e5b6c421ae3b56b60713784da239745f724cb246471d89fe5b784d7cf6910b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::bands::doors_and_shopfronts (cognitive 17): arnis::mapillary::bands::doors_and_shopfronts has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fa15d40365de906fa0018f3c6c5f4dc71e52537e2006d0a1dba96e731ac06e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::confidence::reason_codes (cognitive 17): arnis::mapillary::confidence::reason_codes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 5 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/confidence.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"056c5a89c0b1fba314a77452d6f7369207a5e8ea92d3434a3c4e39f56b4269fa"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fetch::search_cell (cognitive 17): arnis::mapillary::fetch::search_cell has cognitive complexity 17 (threshold 15). Drivers by points: loops 2 (6 pts), match/switch 2 (6 pts), if/else 2 (5 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836bcfeaec53f006d922e8188dbdec577b001e64352605997367699a8dd14b4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::pipeline::write_export (cognitive 17): arnis::mapillary::pipeline::write_export has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c42ab507d2a3871660184e02295b0e6d1177be3d5cbc909fa79bdda00465bc"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::models_3d::voxelize::shade_sample (cognitive 17): arnis::models_3d::voxelize::shade_sample has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c98070efa3a75c8d5f5ee3c211d98047f59defb63d1dbc32583cee786d6c86f"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::osm_parser::building_style_hint (cognitive 17): arnis::osm_parser::building_style_hint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4ab9d0ad11e4536e1842c55dd31a209d40927fada33d7812fffdb4b8a0a54a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::structures::elizabeth_tower::roof (cognitive 17): arnis::structures::elizabeth_tower::roof has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 5 (7 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/elizabeth_tower.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e63ac2cc0c65e335b4cfcd0d030524ebb5af3c19e6f9558d91705b0eda9a03"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::java::compute_chunk_lighting (cognitive 17): arnis::world_editor::java::compute_chunk_lighting has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1ed5b778de0ec37a92c0b777bd772aba359d7ea4f0eceb88dd81ba6dc43e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Ellipsoid::cells (cognitive 16): Ellipsoid::cells has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/carver.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d60d58a6a60b5431b714c027ca35161a2653b1ae3357a2f5ce2905967e9e48d"}},{"ruleId":"D2","level":"warning","message":{"text":"BridgeOutlineIndex::build (cognitive 16): BridgeOutlineIndex::build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_styles.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb716c04280ca18163ebb371d75ad580b619b49e7fe375ba8105816f5ee79837"}},{"ruleId":"D2","level":"warning","message":{"text":"RoofWing::slope (cognitive 16): RoofWing::slope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba05429ff0fee3440a2ead729f8c092788598622d6b1e8e900e99547f218a2"}},{"ruleId":"D2","level":"warning","message":{"text":"PalettedBlockStorage::repack_live_palette_inner (cognitive 16): PalettedBlockStorage::repack_live_palette_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd462ff957ed9f9467aafcd559d12a14cc37bb70a583f9e8b2db4ce2dcf374c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::building_facades::place_pending (cognitive 16): arnis::building_facades::place_pending has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/building_facades/mod.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"550761e69dd39e494bd246d3bb9da07a68f660ed2ca6b8ff0b67d5bdc325e881"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::datapack::disasters::column_top (cognitive 16): arnis::datapack::disasters::column_top has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (6 pts), if/else 2 (5 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/disasters.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2de0f3ad5ea84d8a5454649a30a0718148b7289298e2a6beb34b16afe4005e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::decals::templates::text_sign (cognitive 16): arnis::decals::templates::text_sign has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/templates.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"74757863bb0ea351a9dc2d0014320c3501a3cd9415cd6c27349bec88a6ffcc3e"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::aerialways::open_terminal (cognitive 16): arnis::element_processing::aerialways::open_terminal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c293a99660f6eeef9b247fcc39dab4d0e9ca6feda817c144960196f8d4d6efcb"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::roof_edge_distances (cognitive 16): arnis::element_processing::buildings::roof_edge_distances has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2147a3d569ac1aae4e7c8eb60a9210e88fb68d4811d36fd9e433d4c4961ea9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::buildings::generate_crown_screen (cognitive 16): arnis::element_processing::buildings::generate_crown_screen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13827}}}],"partialFingerprints":{"codehealthFindingId/v1":"698b614da83424e2040fe8d5c746f5a077ad528cdb3e94de5ab608da06a7fb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::bush::place_bush (cognitive 16): arnis::element_processing::bush::place_bush has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bush.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff5a19db934f3e5921e12e65dd6be86a2f400ee3e927bf04ae3bf0ec39fd01c"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::highways::generate_siding (cognitive 16): arnis::element_processing::highways::generate_siding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92e85f73a75bf9f975b0e9ca04c56cf55f322da096704698ed4ac5f58be7534"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::railways::add_tunnel_footprint (cognitive 16): arnis::element_processing::railways::add_tunnel_footprint has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (6 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d71ea43e4cb2b7ede9088d3b502d441a3ce59ae983cf7daeb6bb7b506cf95a1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::signage::split_lines (cognitive 16): arnis::element_processing::signage::split_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a5eb080960cabcd5a02788cc8e9580053892e21211bb48d5fd9b4a59bd51e4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::structure_kit::line_cells (cognitive 16): arnis::element_processing::structure_kit::line_cells has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/structure_kit.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e991077feddd904d84dbdade55171a11d96e27ab7fc86187445abe73eb592f5"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::factory (cognitive 16): arnis::element_processing::subprocessor::interior::halls::factory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bf96e1bf6a232e1a755c642d9dd96aa49c4c6b5d4f01bc558b66ddaec477da"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::element_processing::subprocessor::interior::halls::barn (cognitive 16): arnis::element_processing::subprocessor::interior::halls::barn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/halls.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b84d8d189b36046bb1824abecdbb6c36da6231e0456d83b7689c382b90e3b16"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::peaks::raise_peaks (cognitive 16): arnis::elevation::peaks::raise_peaks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/peaks.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c236df04e2f71778c16547da79d69d4e0ec9f6b0a85e68b4ca0972934bb0e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::elevation::postprocess::smooth_sparse_field (cognitive 16): arnis::elevation::postprocess::smooth_sparse_field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5e74d7ccbf835b178a3ffdf3de34801a4b0d8c5f7707dc691ce8c44bd15f14"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::blit_scaled (cognitive 16): arnis::mapillary::blit_scaled has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9718992f8a7118fade02d57fbf4c341487d2bf5666eb1be7173ed097a0c2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fuse::gradient_magnitude (cognitive 16): arnis::mapillary::fuse::gradient_magnitude has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed35bbc87ef107e2f21d462dadc1a30ce6c4f12ece3e6571f294f6a5893b4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::fuse::phase_correlate (cognitive 16): arnis::mapillary::fuse::phase_correlate has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 4). 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":"src/mapillary/fuse.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7df36421eed101c2917ef4281ef85aca005bf71c6cc686923593dfe312d621a"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::imgops::dilate (cognitive 16): arnis::mapillary::imgops::dilate has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/imgops.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5db0d6185f679dbc8c852c122a259b95cf07636ec35548567b7b087f4ca9f1"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::ll_angle (cognitive 16): arnis::mapillary::refine::ll_angle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"555c68d3a888fa4cb2a61bac3ddaf6caceb0eff3294b413cd83c55f2a2dd69b4"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::refine_region (cognitive 16): arnis::mapillary::refine::refine_region has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1168af688b914ab49e4b10cde4d55f1f0575fac3f8aa7b3bd48ed9ffc039165b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::block_column_lab (cognitive 16): arnis::mapillary::refine::block_column_lab has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2696}}}],"partialFingerprints":{"codehealthFindingId/v1":"65931c3c00c395238f2f1c2d62bf21f9ab4d10c88a600a9b744ab958248a3201"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::refine::decide_height (cognitive 16): arnis::mapillary::refine::decide_height has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a6be26918d96d1efdafb398e1a695ca4e09f19001b55286aab01e2176dc07b"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::mapillary::sfm::min_filter_3x3 (cognitive 16): arnis::mapillary::sfm::min_filter_3x3 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/sfm.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bc2686d2a8f1a10f38b921ba78517da5e48ba7f3872701ede8ca8fda48bc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::one_world::prepare (cognitive 16): arnis::one_world::prepare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/one_world.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ca85661a29e51d2675d0475b986ee7397ac533335c691975514d7b48b8beaf"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::structures::boat::scatter_boats (cognitive 16): arnis::structures::boat::scatter_boats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 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":"src/structures/boat.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ea8356611279c25e5dd3049461cfcf2ef7b55da0d43f8e258bd4e84e14fc90"}},{"ruleId":"D2","level":"warning","message":{"text":"arnis::world_editor::java::decode_section_light_props (cognitive 16): arnis::world_editor::java::decode_section_light_props has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8eae8e0b5aab3fb30082c8be9673dd73c55d103da5052981a1e30987ee12ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/buildings.rs: FileTooLong \u2014 11744 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 229 free functions. The bar is 500 significant lines; this is 11244 over it, 23.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09511340178146d378b19f7d91620b23dc39354e27fd58883df8d8887df84aa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::data_processing::generate_world_with_options: FunctionTooLong \u2014 arnis::data_processing::generate_world_with_options runs 1097 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 997 over it, 10.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9baf2f11c54f526cd5e67ee403ae83656b8caac8a892ab8a4890ec544e0bf2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_buildings: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_buildings runs 957 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 857 over it, 9.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":11550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b508310513c47cbfa98c131999df7ff3a11806ff8120d2ad362049f78230f31b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::ground_generation::generate_ground_region: FunctionTooLong \u2014 arnis::ground_generation::generate_ground_region runs 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 708 over it, 8.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_generation.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0a557a5a4d4d3088f2d86c4d04c8ee2f93c943404b012c9568352ba9c8955f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BridgeStructureMap.build: MethodTooLong \u2014 build runs 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 672 over it, 7.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ea0e15152780e5cc89770b16c17bd34da715a2eec1d3699554680559c1b580"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::highways::generate_highways_internal: FunctionTooLong \u2014 arnis::element_processing::highways::generate_highways_internal runs 683 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 583 over it, 6.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc3f513ee12851a260189524955c9be0f1d00de26a8e87287a8e31872959350"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::luanti_block_map::to_mineclonia_node: FunctionTooLong \u2014 arnis::luanti_block_map::to_mineclonia_node runs 494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 394 over it, 4.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/luanti_block_map.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae791ca4c9586abfa865fc89054296abb6528d13f86238d1a545c8c4e822b6e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/refine.rs: FileTooLong \u2014 2303 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 75 free functions. The bar is 500 significant lines; this is 1803 over it, 4.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db510abf4c0f9a52d50c132d9291a6ef2c66a4d08c5e67c215649c321fbce8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::natural::natural_area: FunctionTooLong \u2014 arnis::element_processing::natural::natural_area runs 458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 358 over it, 4.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/natural.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"acba94893bb5cb04475d4810ef50dec799d255524bdecb3d8b739d8031d6f6b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/highways.rs: FileTooLong \u2014 2184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 61 free functions. The bar is 500 significant lines; this is 1684 over it, 4.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4d6c90b5fcc8007443ed0588187593f8ba33894552c65b73471866b665090c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::run_cli: FunctionTooLong \u2014 arnis::run_cli runs 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 328 over it, 4.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94a6f0747432fd7176f14103c45340c0e1caec14b6ea24dbc184feac3deb93b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: elevation/postprocess.rs: FileTooLong \u2014 1963 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 1463 over it, 3.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eaa7e9c460d494e462075cca31b2165aadcb0b72845baff4ef100a1f6c3365"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BedrockLevelDat: TooManyFields \u2014 111 stored fields. The bar is 30 stored fields; this is 81 over it, 3.70\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/bedrock.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"786e794fde2f0530a2ee27f2600c840fa0d80dfc9589cf75b17246b1b04c14d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::bedrock_block_map::convert: FunctionTooLong \u2014 arnis::bedrock_block_map::convert runs 360 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 260 over it, 3.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bedrock_block_map.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e25445aacc10baf75e0e91106cba4566ec23b1ce0fa7b326e4342143a8cb68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/osm_parser.rs: FileTooLong \u2014 1739 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 1239 over it, 3.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8b91f37c7fb9b1346d8faec89ff3d491ce96018ffda4ffcbb3ee2ac13e17c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::register::run_align: FunctionTooLong \u2014 arnis::mapillary::register::run_align runs 347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c719a7981a334b4c4503cea181abe9a73f525177a7049d00dff619bda13503f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::data_processing::process_element: FunctionTooLong \u2014 arnis::data_processing::process_element runs 337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 237 over it, 3.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c74c5bab7df139bc04601a66c3ed09f099424f86576610b1b82819538ffec12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/data_processing.rs: FileTooLong \u2014 1670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1170 over it, 3.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9743db9e61d982a975d31bfd9225acc9661e93e37a8c5a51105022aa31bb0909"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::caves::decoration::decorate: FunctionTooLong \u2014 arnis::caves::decoration::decorate runs 300 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08a5eb7f2876aa9da5077b4ea6eb4efe50167a88ba29a50c2ba385066b1c091"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Block.properties: MethodTooLong \u2014 properties runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14d5cafb92d04b465c93efbdaa7dcdd4770d46a5d3462222f42cce808273b21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuildingStyle.resolve: MethodTooLong \u2014 resolve runs 289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 189 over it, 2.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"607dce6f4294f83ca7f665b5e6ae2027e956297423d7e64190677f1370e10fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::landuse::landuse_area: FunctionTooLong \u2014 arnis::element_processing::landuse::landuse_area runs 288 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 188 over it, 2.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"90763153c837db3c297e82c71651459657f24dff8fc27d0746df55df4365b07d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/bridges.rs: FileTooLong \u2014 1430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 930 over it, 2.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5ae05b1677f7c7d226e110d6f959da25b5b17857678221a6893b68f17e3b34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overture/mod.rs: FileTooLong \u2014 1421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 921 over it, 2.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"943559bd5b5bfb8f19fc42598a08e50f1ad2dd2695a22e8507fa849e0065f859"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Params: TooManyFields \u2014 85 stored fields beside 3 methods. The bar is 30 stored fields; this is 55 over it, 2.83\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/types.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee0dc97681339b38bbb91430a86aea8a54c8445e0d981d9ded4b5df517b66af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/block_definitions.rs: FileTooLong \u2014 1414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 914 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b622507a8f56f56e8dbf7c5de57ba457701677a5ed630dd8017880bf609229d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::amenities::generate_amenities: FunctionTooLong \u2014 arnis::element_processing::amenities::generate_amenities runs 281 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 181 over it, 2.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/amenities.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1c643083b03e214eece7c15f808fe7757ccd8bf0cde51697c2f4e497ef18b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/pipeline.rs: FileTooLong \u2014 1401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 901 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f0b9ff0a0e7f4a4200e0ffdb3d8cbc2f6aed6fbdbee773d4bc4012fe7a1de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: world_editor/common.rs: FileTooLong \u2014 1392 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 892 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"385e4582a798eaf73c25d9b71f8417d8a33dd30f86f21b7b4c6072fd6fb156b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/aerialways.rs: FileTooLong \u2014 1377 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 877 over it, 2.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"144ef77910de1c924ab238f3c7f3a66d3f5c8755592280fc805c75d47e831bae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::structures::schematic::map_structure_block: FunctionTooLong \u2014 arnis::structures::schematic::map_structure_block runs 275 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/schematic.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"52783dc8067bdef836a400ed819736bb7c27650a359f3407a6ff20d423ea203a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_gabled_roof: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_gabled_roof runs 266 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 166 over it, 2.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15755}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd3377a3cac287b32527fbe794b8d02c14c75a8d60d6482b3be7f2171efc9e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/signage.rs: FileTooLong \u2014 1301 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 801 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d4d11a54caecd2d62d4e7f09820154e47d8f8a36fa24f342d53b147b307ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/register.rs: FileTooLong \u2014 1298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 798 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3695bbb0023e49f8e45477eb4f5d12951ac866cd58b92ba87163885f89777a6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gui.rs: FileTooLong \u2014 1253 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 753 over it, 2.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33667843a40b660192dc6239052bc78fc68be4d8f47bf47f17911c46cb40e0c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tree.build: MethodTooLong \u2014 build runs 249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f202506cbd33a3392d2d03d8368ce311ecd00580c9d92d54d8ee6e7d3abe679"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/cars.rs: FileTooLong \u2014 1244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 744 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b674dd226af4b9b7f82fabce6441188e55a455e2aceb78c6ba2b1fafcaa7486"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: world_editor/bedrock.rs: FileTooLong \u2014 1233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 733 over it, 2.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/bedrock.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebfec45b91b522c3e240e5fa83c9f7dab9846ee834819e44c6cd3def909de4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::elevation::postprocess::level_water_surfaces: FunctionTooLong \u2014 arnis::elevation::postprocess::level_water_surfaces runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b84d641b881ccf7cbb69c0daefa9f41a24a92ca9d69bf5e46ac4ef4daabeb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::pipeline::texture_wall: FunctionTooLong \u2014 arnis::mapillary::pipeline::texture_wall runs 237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 137 over it, 2.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a4040276d263fcd7920dec471bbbe5ac81c8641b62c4f3c5988de141b3dbdc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RoadMarkingIndex.resolve_junction: MethodTooLong \u2014 resolve_junction runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4951fc96686afd0adc65d8d87c52ef9b889aea166f937d3a1e47894bd0a72b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RoadMarkingIndex.build: MethodTooLong \u2014 build runs 234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6e02fc60a06157a7f705ee7582721e0d910928a211fb58b03e10730a42f037"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/tree.rs: FileTooLong \u2014 1158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: Tree (2 blocks, 311-1637). The bar is 500 significant lines; this is 658 over it, 2.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff33f778934b44999b260fabc9e54cad0b738bb1f276ee3394e18b52174426a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/trains.rs: FileTooLong \u2014 1130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 630 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51920afacc3398e93d0ff217aef5878939df36e0ede2dc740f4b451f54800f68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::rooftops::fit_out_roof: FunctionTooLong \u2014 arnis::element_processing::rooftops::fit_out_roof runs 222 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 122 over it, 2.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5e27c3de978af3fda863ebd1174dde55483c2f939508cdfd4ec29f30d726da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/railways.rs: FileTooLong \u2014 1109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 609 over it, 2.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1594eb406ef987f54f23c69e3d1063686f8776892e847952c29738411876f12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::osm_parser::parse_osm_data: FunctionTooLong \u2014 arnis::osm_parser::parse_osm_data runs 221 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59a28d135d83e542b65ebdf0de46aa61c025924d7da3caa60b95ec639dd2b25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datapack/disasters.rs: FileTooLong \u2014 1067 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 567 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/disasters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"626f2d9ecd67a269a067f49d4ee7b301940a9db4606cae9578a9fb44a552a2c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CarNetwork.build: MethodTooLong \u2014 build runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"00316768785396075391e843d448ed5e9faa6b1b2857c8bca111b68dcdbf2a80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ground_generation.rs: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 526 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_generation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d53d8860bf741312cb0720d4f86ba1487eb2a2302ae6c61e96d5a1e2879664a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tree: ClassTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 2 blocks, lines 311-1637. The bar is 400 significant lines; this is 418 over it, 2.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a18369aa7c9292cf6b2c1618ac029e16cb9def2ec2d0042dc6afaf684dca9b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/openings.rs: FileTooLong \u2014 1014 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 514 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d622bbd644446e711380f2d4c7764f1afa24e7b0ca8836f262077dfe5fe8743"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: trees/region.rs: FileTooLong \u2014 1006 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: RegionLibrary (2 blocks, 278-1377). The bar is 500 significant lines; this is 506 over it, 2.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a47fd6ee589fea5ab008d541c6d515682600d5c5fded5c493d871c7848bcd7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: world_editor/java.rs: FileTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 480 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dee6837fe9643e57fe82ea2a4437c6ed33c586c7c6630bce27e5ac1a89df9da"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BridgeStructureMap: ClassTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 2 blocks, lines 134-1222. The bar is 400 significant lines; this is 383 over it, 1.96\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b51dd1a56ea1618212389714bc975c54d5bef68d922d7718939a6321bb93e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: land_cover/mod.rs: FileTooLong \u2014 955 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 455 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe6dbc9e443fa1a042142eef208482149f88b241cd1269cba98ea3ed9ea8d9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/attractions.rs: FileTooLong \u2014 954 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 454 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7388577b4a1f2c137a36897ddd191c708f76f1513d38b6fe87546044e06ebbde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/fetch.rs: FileTooLong \u2014 947 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 447 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332a9c2297f51625f2c78ccaa1ea4fcb8bff51664e0bbba382e9b0b656e16d76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::roof_wings: FunctionTooLong \u2014 arnis::element_processing::buildings::roof_wings runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15494}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e91535757c75f3bcabbcbfed15756e9eedcd3dc9f49bfbb59fbdfb969337317"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::openings::find_rects: FunctionTooLong \u2014 arnis::mapillary::openings::find_rects runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0461671314daa3bf80936e1172a49f58e2584cc34de441e8735957d13c1699c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::building_construction::generate: FunctionTooLong \u2014 arnis::element_processing::building_construction::generate runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_construction.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66bc222537ee249377c381553ab4d53faa7fc7428f976250508be58d306296e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_roof_only_structure: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_roof_only_structure runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c439e1e4fc4236b91e7054c1d0bf38faf2d8b3e7f89ad5d7dd7ec0e3dba08c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SectionToModify.to_section: MethodTooLong \u2014 to_section runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"0733b8efbf9221a2b17a5310a123df769816a3aaf56226236076e1134c54ea0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::retrieve_data::fetch_data_from_overpass: FunctionTooLong \u2014 arnis::retrieve_data::fetch_data_from_overpass runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/retrieve_data.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9f5ee56db91318b462758f7d8d49cde399d43725de551afcdf44393e97f17a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/visibility.rs: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f9fa9b4bbd3a2d66c3e0f101f12a4884baeb115ba6440e952e46352f9f370a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::caves::ores::ore_table: FunctionTooLong \u2014 arnis::caves::ores::ore_table runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/ores.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fa8a192ed925abf2ba9b1b6e53cbab10e32e9f858e1ffd23269065bde45b93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::place_dormer_windows: FunctionTooLong \u2014 arnis::element_processing::buildings::place_dormer_windows runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":14295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b65ff65db5a943ce4bf8830f863fd15d0ad238de46afdbe7079c94fce905b5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::train_bodies::parts: FunctionTooLong \u2014 arnis::element_processing::train_bodies::parts runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38581e5914cc8fb1315b1fc0adf35654021e12ec52fda706e26e6b09870cf3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/train_bodies.rs: FileTooLong \u2014 902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 402 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"231f2e9455e53edd493fd2eb465e7755cfba8d0ef31ddbc8ceb129f1941ac916"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/road_markings.rs: FileTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: RoadMarkingIndex (2 blocks, 120-1325). The bar is 500 significant lines; this is 400 over it, 1.80\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9b2394320338558e7db08b9ed8ed6d974d8480de45edb2d78aee5aa09a7f55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/rooftops.rs: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 392 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a43442d1fb2f3a927a77428ff9a10f55f9c57b50dc704b949c5c701aee961c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ground.rs: FileTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: Ground (2 blocks, 41-1366). The bar is 500 significant lines; this is 386 over it, 1.77\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4728863d704664babe26d8a1b0d4669472aedee546fa3e11f6e59b49b782b53f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::osm_parser::spatial_relation_part_suppression: FunctionTooLong \u2014 arnis::osm_parser::spatial_relation_part_suppression runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e014785acb847e6293ec3b855683665e692b2ac1ee28db2a3e5858c38f51a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ground: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f79a6a43365456b80b5af78f4f46f7d737f689c1f970d927c3f5ff56a2bd12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::caves::carve_region: FunctionTooLong \u2014 arnis::caves::carve_region runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a37dd707a6ed3a081daf023e98f32ea6cfc1643375ecf3ae0cc06c8d1e8557b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::bands::segment_bands: FunctionTooLong \u2014 arnis::mapillary::bands::segment_bands runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc055da239a036723bcc31af1873e9ae3b95624ea19fb77409e116de9e6c7c7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/fuse.rs: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 347 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3039830a0745075a7af4cfa4c06d3b46f2428df712661100b8c7aa10b1b7ef81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interior/canvas.rs: FileTooLong \u2014 833 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: Canvas (2 blocks, 158-1124). The bar is 500 significant lines; this is 333 over it, 1.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10db8b5e4083db647069c630445d7ff37ff6e221a5d42925c55ab28d0ce344c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ground: ClassTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 52 methods, 2 blocks, lines 41-1366. The bar is 400 significant lines; this is 264 over it, 1.66\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b85c2304d4ffba0488ec5a447a211b142e4d7dfb2256a47fbc45e6d1b8de9a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Canvas: ClassTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 2 blocks, lines 158-1124. The bar is 400 significant lines; this is 264 over it, 1.66\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a503988a09dc3a1c69df3a29adec6809cf6492551163b8dbcfd28c4099d0ade2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/facades.rs: FileTooLong \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 326 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63255f367847ce60dc1e63b5c797223a600582cd8f2ccb453cef227e0eee2d4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_building_roof: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_building_roof runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69e6ff3a343dc1169dd4d0d50bb5355f74b92d2dd280acf78b84ee7a59e337"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/displays.rs: FileTooLong \u2014 822 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 322 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/displays.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"788cf1eae242199ba3d65d824a55a332829aefa4b05e1e2d9272177f3cf6e64c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::openings::classify: FunctionTooLong \u2014 arnis::mapillary::openings::classify runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"06555cd4fbae45c42e1279104ed73c361d15ac838956a232a6387fa8321cdfcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::railways::generate_rail_bridge: FunctionTooLong \u2014 arnis::element_processing::railways::generate_rail_bridge runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee35deda043877298be9e3f39c10e079fc11adfca7681f10b462101b00b013"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Canvas: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacc7bf7d8c7fce56f927eb701496ee8562193bd83f9210352fc1efad632d74d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BuildingConfig: TooManyFields \u2014 48 stored fields beside 24 methods. The bar is 30 stored fields; this is 18 over it, 1.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce620939d1430842eb411b23e2673705ee88a13de1a24d0bf248dbb7d6f7094"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::args::validate_args: FunctionTooLong \u2014 arnis::args::validate_args runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc3f914bba4165e57f79de784af7f7f5971d28c51f7c817886bfa11d5703e49"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RoadMarkingIndex: ClassTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 120-1325. The bar is 400 significant lines; this is 229 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5851e12ed2eb9e7a1052eeae9d8e8111ff0c14a6f1d74053e7cffabafa1e3480"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::land_cover::bridge_repair::apply_bridge_land_cover_repair: FunctionTooLong \u2014 arnis::land_cover::bridge_repair::apply_bridge_land_cover_repair runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/bridge_repair.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26112fe32806b0fd18175f8183e2264a2a090eb334ee8593ae7404e5c4b7ed3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tree: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c9d1d11798de8fec75819e64d587edf422d6eb274ccd0f8a139d7ed145609d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::build_wall_ring: FunctionTooLong \u2014 arnis::element_processing::buildings::build_wall_ring runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":7379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa3d4938b73813553714565da0cb321e1214ef928728fdcf07f0ee67e0dc9b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::visibility::geometric_candidates: FunctionTooLong \u2014 arnis::mapillary::visibility::geometric_candidates runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/visibility.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"97311bdbda2f8545f51c23c91aa583e6862ab3db41acda9cb07c2784ed3dd7eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::osm_parser::parse_osm_xml: FunctionTooLong \u2014 arnis::osm_parser::parse_osm_xml runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf174b8b006c3defe5fc8833f6e99d7637709df9923f2e2cb8aaeece7e4b6cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::land_cover::osm_water_override::apply_osm_water_override: FunctionTooLong \u2014 arnis::land_cover::osm_water_override::apply_osm_water_override runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b355c35bc2d9bc1ae10d0d16596099874e315492a6081684cba51be86b6a101"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wikidata/placement.rs: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 257 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/wikidata/placement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d0c9c8696cabcadc9a034293cadb1ce0a6e6d9561e33ff3dda08e1d516d93d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RegionLibrary: ClassTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 278-1377. The bar is 400 significant lines; this is 204 over it, 1.51\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a80fd5595150bb9083ca4482bbe1246a42aa96df9cc7a5d840e74778d45595"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/bridge_styles.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_styles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc769dcc77711c31aa2f84f7aa1eb870768aa3fd552f7bdf98fba980f8575b15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::highways::generate_highway_tunnel_shell: FunctionTooLong \u2014 arnis::element_processing::highways::generate_highway_tunnel_shell runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32b0fc85ac01d89058c0d6d28d84017a3a017cc8dfe2b7b1907a55ef4020a39"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BedrockWriter: ClassTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 380-1212. The bar is 400 significant lines; this is 183 over it, 1.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/bedrock.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8353bf0fd7c3df904eb1c37ba7e25ce2b6ca8b75846099c719d868edead8d572"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: caves/decoration.rs: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 225 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee13464b74450485215f7ba15e78ea4fbe2cb3d53c4ae53d7e4fb455221b9397"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::datapack::files: FunctionTooLong \u2014 arnis::datapack::files runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a68b4f8ec01f5d01ce6d4db3f3bd4b0af256a08c5e9f1af0e13b900c700dca5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Spec.new: MethodTooLong \u2014 new runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"df34a58574c5d9d981726de9db7817312d7ea97a111ac8ece6d38529c3b9faf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::one_world::resolve: FunctionTooLong \u2014 arnis::one_world::resolve runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/one_world.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e41172654aef19467b2e34499eeee52bfbee18ac46285fcbfba443fad29289"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BedrockWriter.write_level_dat: MethodTooLong \u2014 write_level_dat runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/bedrock.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2b005c6d9821f8adccc10e3702f3ad94f34319d12683e23499d303dbd65fb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::fuel_stations::draw_canopy: FunctionTooLong \u2014 arnis::element_processing::fuel_stations::draw_canopy runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"51700e56de7e428d9e30c9319b5e17e983139762ca53617391a97cadea3463ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::osm_tiles::read_tiles: FunctionTooLong \u2014 arnis::osm_tiles::read_tiles runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cdefca38581b5dddc3005e5cd288da52581c3514a5bb16df09e641bd3cd815"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/fuel_stations.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b61a2372cbafab041e88d9b71165be01a0b0ea1fa8973bcb51c51eec1a64a87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/bands.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"899c0965516e619dd0abc4d9ff7b6349d7c13e35a29a008297b9d86a758ed4c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/rectify.rs: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 183 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/rectify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9577bcd699df9743dec2d082e527ca9d361891d4d25ff7665d1debcfdb9f5add"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/types.rs: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 183 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98066829731228609dca0db4012171e853e6b17f32055bf28dc21e86cb356084"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/floodfill_cache.rs: FileTooLong \u2014 682 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 182 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd307d8931ea12dc04d177cea1a9a1b0d3d82779baaa377e48fe134294eabb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_roof: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_roof runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":17084}}}],"partialFingerprints":{"codehealthFindingId/v1":"d279abd7841f9011f163c3a0733f9d2c76d4367541ddb69f5ae05407df291edf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::trains::timetable: FunctionTooLong \u2014 arnis::element_processing::trains::timetable runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4273f2992fe1ed34ff5f6539864fe578bb62927eb7e83357ee391d500846af9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::trains::lay_out: FunctionTooLong \u2014 arnis::element_processing::trains::lay_out runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/trains.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff322ce8d7613d74eff008ff3612da2d4727e759849f60a8205649b88efdbc43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/osm_tiles.rs: FileTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 164 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaebd94c018b7bc5c8b9c895981dfbcb206f430d7c613fdcb1c7a8ffd09b183"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models_3d/voxelize.rs: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 162 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dedd73f739e276f3220c52c4fdd62ce08cade05b9fea29aa6a7e17214c7898b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::plan_synthetic_entrance: FunctionTooLong \u2014 arnis::element_processing::buildings::plan_synthetic_entrance runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6619}}}],"partialFingerprints":{"codehealthFindingId/v1":"682a7f993a16583e59589144c1595aa0bceb20ead93ae4408715b84068e30bfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::bands::complete_windows: FunctionTooLong \u2014 arnis::mapillary::bands::complete_windows runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c37aab81eca862b7300c4628757e033530fc6ad645b63a5a6e4416440afc3bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: building_facades/mod.rs: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/building_facades/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"772ca567b092f9339f10ed968b2072d44cc9a8136152a80c6584290a1e37c75a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: climate/build_grids.py: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 155 over it, 1.31\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":"assets/climate/build_grids.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658019ca1c5afbf2f8488f21c358475c533ad44aea195f896e1e116c42c519d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: structures/schematic.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/schematic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0afc75aaa1ff295ad22620b2660369bacc7baf8fd79fde9a94aaf1ce5923bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/luanti_block_map.rs: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/luanti_block_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a6c0ff4ed740cbacf3209101c1c59d9c22ddc74464c0b74a0910fc93e467db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/man_made.rs: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86abff354b3d2f575539d03acb803c550f3f7ade112d4441649de23b4c5d32f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::signage::generate_highway_way_signage: FunctionTooLong \u2014 arnis::element_processing::signage::generate_highway_way_signage runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fc7d82c441a98dc6bd4421e9623895e711821b465079b9a210c3949ff4bfd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_balconies: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_balconies runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":9869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb7a5e0d09f43a14586e0404b7da3ff5b62e88bea3792faf37263f0907b2716"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ground.new_enabled: MethodTooLong \u2014 new_enabled runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"15acfffa880f79ed8a4aadfb8b8812101a0f3fef8a459db8b4407e3d2bcf8294"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/amenities.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"src/element_processing/amenities.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af1c16fc48a185fb1ab8ca69dff44fccd3326fcc9d182d1a694dae3c0a34f8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::caves::schems::place_schem: FunctionTooLong \u2014 arnis::caves::schems::place_schem runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8964cbd75794f3f1207bb805f09b6b740a5eacfe7d72eac34a56850a843ea6cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::place_roof_eaves: FunctionTooLong \u2014 arnis::element_processing::buildings::place_roof_eaves runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d2057f494e0ddf40ac1a2d9f6fe617e15269180f2880768eadd64ca3a69aee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::fuse::inpaint_telea: FunctionTooLong \u2014 arnis::mapillary::fuse::inpaint_telea runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71b39d9557bd35b499745a705d6b9e93a97c10012753cd56dd64cfdd83a5181"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::overture::parse_overture_row: FunctionTooLong \u2014 arnis::overture::parse_overture_row runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c03ec2ac5a450fa2e15917d9c045a527d826273d1a191e5a777bda542a586f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::caves::schems::stamp_region: FunctionTooLong \u2014 arnis::caves::schems::stamp_region runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb398995be4ac94bcbed63bbb3444a99ba58207764fcabe8d16afb15977db26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_window_frames: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_window_frames runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10314}}}],"partialFingerprints":{"codehealthFindingId/v1":"33319918859517497075e1aba848e2e17beb16d1871b9c6d4606b3602e8eba09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::waterfront::generate_pier: FunctionTooLong \u2014 arnis::element_processing::waterfront::generate_pier runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterfront.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c266bd9bc00e5fe2fe9642a31cda14079dbb0108d9dbe78a8e852c8e8127a7a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ground_decoration.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_decoration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e06598bd377a7a2e52c9a2c49a62dd6650ec4c320084f0569e86536edf2a94"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::osm_parser::compute_spatial_part_suppression: FunctionTooLong \u2014 arnis::osm_parser::compute_spatial_part_suppression runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a77970a84e2f38e86d392f66b1d1708353837ccd1073bd4b809de14ecb4b226"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::world_editor::luanti::write_worldmod: FunctionTooLong \u2014 arnis::world_editor::luanti::write_worldmod runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/luanti.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"72379fb6bc81b83f3bb49ea49dcdd686de322d8d7e50d77e92469961345fa86f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::geometry::parse_overpass: FunctionTooLong \u2014 arnis::mapillary::geometry::parse_overpass runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/geometry.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d5bbba3d765681a13e3af370e57f68449b6d1826cfaf207a4999880be9270f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::building_facades::collect_facing: FunctionTooLong \u2014 arnis::building_facades::collect_facing runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/building_facades/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"70340b9a42adf2cdc6ff3beed9ceef227abcf3ffaccccfc077e2b6133a73603c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::facades::project_wall: FunctionTooLong \u2014 arnis::mapillary::facades::project_wall runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3d4a2dc5ee9d456f90fc58165a51da25dd3da66327e538f361fa83fc058696"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::refine::sky_roofline: FunctionTooLong \u2014 arnis::mapillary::refine::sky_roofline runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adea92924a7c341c117c928eb8831fcbae8d87391b21f9c7fccadf80aedc921"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorldToModify: ClassTooLong \u2014 471 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 1504-2260. The bar is 400 significant lines; this is 71 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd3445c94400ee2412d91fb44ae70b97bdc1848238089bcdddb8d10bc528616"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051fac64e936f7c1865babf7d506a8673f918fe3a29b7d5daf1e9c85ef2e6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::aerialways::housing: FunctionTooLong \u2014 arnis::element_processing::aerialways::housing runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/aerialways.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf14b5b5bda302306c3fa63b2f9d6c4d559b055a1a9f193760cbd3c990ae5d7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::get_wall_block_for_category: FunctionTooLong \u2014 arnis::element_processing::buildings::get_wall_block_for_category runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":5657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7588c91f3d8444d3385efdb9071941a6ed84c2b6f1bc2fbd4b4719d5a000bce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::highways::collect_tunnel_portals: FunctionTooLong \u2014 arnis::element_processing::highways::collect_tunnel_portals runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f2acd8bc40b28437001759090392ce175c8153a824e0d15143c2b3c3996ed6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::leisure::leisure_area: FunctionTooLong \u2014 arnis::element_processing::leisure::leisure_area runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/leisure.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaa9c3d5f5213f2ca4dfae15768f702dd424199ecec1be5330b48b8df0843fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::land_cover::read_esa_tile_into_raster: FunctionTooLong \u2014 arnis::land_cover::read_esa_tile_into_raster runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/mod.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a7e2dd1ef0f4f316fea1a59ffcdcecae34d8bbd76e19e7092b5104c791f414"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Canvas.split_corridor: MethodTooLong \u2014 split_corridor runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/canvas.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1381dbf5dd7d79bf61dd5d38e71f48073b38f09bf7fdadf20ad199a5f78277"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: caves/schems.rs: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7105c0f1f0b1cd10ab1c0540c0ac77fd3abde340a4302676d8c7013662398e27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::building_facade::compute_facade_plan: FunctionTooLong \u2014 arnis::element_processing::building_facade::compute_facade_plan runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_facade.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb574a5573187a06852e1706d5e2f3b9270cfab0a29d6af04eadf56c9a077cc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_pyramidal_roof: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_pyramidal_roof runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16727}}}],"partialFingerprints":{"codehealthFindingId/v1":"795e5a46b308d426103d4e812f722de40d5461b5e1cafe3199588246fcd09032"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::osm_parser::compute_outline_suppression: FunctionTooLong \u2014 arnis::osm_parser::compute_outline_suppression runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e992a33ac6705d7895a9a7a0ebf23eef1d1b8977bbdcd5c635b1a8824b02315"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::caves::schems::load_cave_schem: FunctionTooLong \u2014 arnis::caves::schems::load_cave_schem runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb600e5226a4fd9b24ba26e898bf7d29b476772234aa4d169ffd06b0c04d13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::overture::tiles::collect_from_tiles: FunctionTooLong \u2014 arnis::overture::tiles::collect_from_tiles runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/tiles.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"231512cd8e4307db7e45da48047922ded15f75554407ca4e1a2660a9d391b058"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::world_editor::java::write_region_to_disk: FunctionTooLong \u2014 arnis::world_editor::java::write_region_to_disk runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cd04378bc9ad86d18353e83ad7cdb9064cf73b818c675bad9ce5518643c2fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::cars::link: FunctionTooLong \u2014 arnis::element_processing::cars::link runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87a6780f2fb3f39ccb631e142bac1d048286acd1dac0a11c02eae570c49f1db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::elevation::fetch_elevation_data: FunctionTooLong \u2014 arnis::elevation::fetch_elevation_data runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2111e898357887f7de0633967d26791d4d3e4ae772108e86dfb60b52f3b7f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::pipeline::write_export: FunctionTooLong \u2014 arnis::mapillary::pipeline::write_export runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cad0df2280efab438019e9dcb2d8527ea74955900bde98c72fb0f2c141fc09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/natural.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/natural.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdb271d5f0568175a71f95485e66c331b88b46418524c7a687b7d8371ecda63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::elevation::providers::mapterhorn::fetch_tile_pyramid: FunctionTooLong \u2014 arnis::elevation::providers::mapterhorn::fetch_tile_pyramid runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/providers/mapterhorn.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"882694f08d746811b319e1721584c580c5dfc8dc3dd5a72acbfe189f6b1deba1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::refine::decide_wall: FunctionTooLong \u2014 arnis::mapillary::refine::decide_wall runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"77667dc60cdebeb176750654ba49aa7ee0bb02162fc7afc3398b9bb12372cdd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/barriers.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfde95b80a43e707f64507f084506826b5ecbdc0795d243c439906a35aa124b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::cars::bend_into: FunctionTooLong \u2014 arnis::element_processing::cars::bend_into runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05d076b52ec54b320be6e68c53c006f86e77ac6edd62b93b2c53e87698f3919"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/traffic_lights.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/traffic_lights.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd409135881b703a223246055fc4c73582ee664904909d75145e1398bae7a26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: land_cover/osm_water_override.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccc54183aef630ac8b1f91b812821f83447b8c750546bce34a1ef73bcb3c242"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/mod.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6816028f60b2a1acd1303c057530e6953557ca422ef93a6887be968d2d04a3d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_window_life: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_window_life runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":10641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed366e397dbfda6cc6b7b2a027ae5d345866d2cd78556266a35f452d60fa0e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::models_3d::voxelize::accumulate_glb: FunctionTooLong \u2014 arnis::models_3d::voxelize::accumulate_glb runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"369a3f02ebcd90f0692752be7b0f8211a38610d63a0a038f8baaed49d9614574"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::land_cover::osm_land_override::apply_osm_land_override: FunctionTooLong \u2014 arnis::land_cover::osm_land_override::apply_osm_land_override runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_land_override.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3207cae4c34963a9658b1ed112b3f6244d60cbaf98345c09bf919f3a6e6e79a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::refine::extent_joint: FunctionTooLong \u2014 arnis::mapillary::refine::extent_joint runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e06b3062b58ceff7da3ba9ddcc495f87615c010482d8751fa35f1ce12c82092"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::trees::schematic::place_schematic_tree: FunctionTooLong \u2014 arnis::trees::schematic::place_schematic_tree runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/schematic.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2735ce8bf8b755d2ef751a9426e4dc42f5818179d0e909117b6e1d6445ef555f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/water_depth.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1c15df80d859e38763d1d38ff7f5e10511028981f46cd5abed09b799324bb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: element_processing/water_areas.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"540c634f94321be376e9b2ab484ec72ef659465af020bb56223b584514c1790f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapillary/geometry.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/geometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c907bb27ff7568bd813142ddf540bc7d87ebc0dd1bcb51f3d801db42679d1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/mapterhorn.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/providers/mapterhorn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4cdf5237dcb08b7e822d0c7ef7d723d5ae4790239edb6f8687454547f2d501"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::pick_window_archetype: FunctionTooLong \u2014 arnis::element_processing::buildings::pick_window_archetype runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda7e4cc234837daf88a86c81d45bca8668187451f4a64367d7a1fa73c22001f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::generate_inset_tiers: FunctionTooLong \u2014 arnis::element_processing::buildings::generate_inset_tiers runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":13597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8035fd350344a76bd5463b3f2f49c72a1ba7426757a046a5e1edb75ccd9215e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::map_transformation::rotate::rotator::rotate_ground_data: FunctionTooLong \u2014 arnis::map_transformation::rotate::rotator::rotate_ground_data runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/rotate/rotator.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dfc13c9bfdcef928c940e1af0bd15afb6ae6cf3537053b007380c1dbe19c40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::buildings::place_roof_surface: FunctionTooLong \u2014 arnis::element_processing::buildings::place_roof_surface runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":14941}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5697473d252c03e878dfcc3b89ebb652bf330c1dd122ab5b02db8e2ff403508"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InteriorUseIndex.build: MethodTooLong \u2014 build runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/index.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea587c9b60abe3c53ee38c367763eb2140accfdb44527b823636c5500fb365ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: world_editor/style.rs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45b1011a307b0286d892159d2351eb5f7713173d53c469123fed87bc8e68163"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BridgeSurfaceMap.build: MethodTooLong \u2014 build runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdc667edae0d42d3557ae686ff46e8a393ac3c01dd48435f56d9b91a6e1de47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::element_processing::sport_pitches::draw_pitch_markings: FunctionTooLong \u2014 arnis::element_processing::sport_pitches::draw_pitch_markings runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/sport_pitches.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f22abb6c9f66e79089d80177feeb902c69adbe6bac84191ed36d93739aae97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::elevation::postprocess::scale_to_minecraft_reserving: FunctionTooLong \u2014 arnis::elevation::postprocess::scale_to_minecraft_reserving runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"822d9a9ce9a64f2da2c914ef3a1c0141e51779762b4c98ba9383f185383844f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::map_transformation::rotate::rotator::rotate_world: FunctionTooLong \u2014 arnis::map_transformation::rotate::rotator::rotate_world runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/rotate/rotator.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a45d3065349cdd941f2d68bd0f7127b8ab3201066effd53df186901adec0fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arnis::mapillary::openings::apply_rhythm: FunctionTooLong \u2014 arnis::mapillary::openings::apply_rhythm runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"b233d1906530da2557c54e02de54e7cdce59d8e63ed6a147691d0d49a295c598"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CarNetwork: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 2 blocks, lines 320-926. The bar is 400 significant lines; this is 7 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec02d7deb9cbdc45cf05a45da1f46f9311badfd375b16bdf7035063423d35c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bedrock_block_map.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bedrock_block_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc900fff5bafea707bd07c0c2fc0603b83cbb6e79e74a6fd3feacb9b17af8d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/args.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b74984d3aa63891e32164e1dee92529ffae53830d42156bbaac775954c5dd8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): src/gui.rs:510-588 | src/gui.rs:597-712 \u2014 These two members are variants of one another: 48 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":"src/gui.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a12fc5c448860d17b9fdc617c9951323d18536db8b6933ff427afacb2e50e05"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): src/world_utils.rs:811-873 | src/world_utils.rs:1155-1212 \u2014 These two members are variants of one another: 34 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":"src/world_utils.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06cdfce513ee790beeded5eb1a2c32e41d574345681973396e94ae8d5f9ed2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/models_3d/three_dmr/placement.rs:337-364 | src/models_3d/wikidata/placement.rs:981-1008 \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":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a8cfd953e0d1d4637378e352075d85093df35e7cc6f58dbe7d123993289850"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): src/elevation/postprocess.rs:334-709 | src/elevation/postprocess.rs:942-1003 | src/elevation/postprocess.rs:1064-1119 | src/elevation/postprocess.rs:1281-1301 | src/elevation/postprocess.rs:1391-1437 | src/elevation/postprocess.rs:1462-1577 | src/elevation/postprocess.rs:1587-1620 | src/elevation/postprocess.rs:1736-1875 | src/elevation/postprocess.rs:1946-2026 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae0307213e1a8f97f1cdbcaad85055d2512a84f3546f0d3a38c22ebf9ebf093"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/element_processing/advertising.rs:22-48 | src/element_processing/emergency.rs:11-30 | src/element_processing/historic.rs:15-37 | src/element_processing/power.rs:188-228 | src/element_processing/tourisms.rs:10-74 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/advertising.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1360aa7d7623b1fc84138045aa03fbf9b56487f7c0bd87db4bb26eae7944a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/world_editor/mod.rs:1524-1551 | src/world_editor/mod.rs:1556-1591 | src/world_editor/mod.rs:1993-2060 | src/world_editor/mod.rs:2083-2125 | src/world_editor/mod.rs:2159-2198 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f733511630e9e573ed112ccccdb4ce37bfbad740e5de7ef2974d2a539e3f18c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/map_item.rs:237-250 | src/world_editor/mod.rs:876-927 | src/world_editor/mod.rs:1611-1641 | src/world_editor/mod.rs:1657-1688 \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":"src/map_item.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"35720f1248141465536ccad19dae9a46fb2910e59903ea8cc32f5177352114d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/models_3d/three_dmr/placement.rs:368-394 | src/models_3d/wikidata/placement.rs:1011-1037 \u2014 \u0060src/models_3d/three_dmr/placement.rs\u0060 and \u0060src/models_3d/wikidata/placement.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 97 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48d49d73c41d32ec6870100f8617147cb226fd52dff25c1999760a5cc4dd4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/clipping.rs:330-353 | src/clipping.rs:404-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82ed3a97fddcae78223ec80ee9bd6470ef5d6eaea84a6faae663f780f348e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/models_3d/three_dmr/placement.rs:341-364 | src/models_3d/wikidata/placement.rs:985-1008 \u2014 \u0060src/models_3d/three_dmr/placement.rs\u0060 and \u0060src/models_3d/wikidata/placement.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 97 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b088ecba7dfbe5850015faee8f4ce927cf8f15882adb2bef67c6b7cfa0b8875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/world_utils.rs:879-902 | src/world_utils.rs:934-957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_utils.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4509a8d9fabb439f3a34f8bac5c662791d6f6905aad59dda0b6eaad0b0553b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/world_editor/common.rs:953-975 | src/world_editor/common.rs:987-1009 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142021c46f8cb2a444af3521044f567bf15c192088662b01a50677e8b876030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/gui.rs:515-536 | src/gui.rs:599-620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab65e0e58d57d9db4d4f352a4282f228a57aa5f133986c7ac5f3d0ea85d3f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/gui.rs:568-588 | src/gui.rs:692-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab75de6bb1ae4173a63e78a76900b095ddea51eac8b65bc386359f9e35694497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/world_editor/common.rs:956-975 | src/world_editor/common.rs:990-1009 | src/world_editor/common.rs:1028-1047 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04ad8fd45c3588d5aa05118677db36f750b8a319ea6f7ec560e8386aba382b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/element_processing/highways.rs:3332-3351 | src/element_processing/highways.rs:3391-3410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0cf633ebbce2ed39ff3aa4c5ebe0df01b8f9e93235353965a9affab45f64c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/world_editor/mod.rs:2103-2122 | src/world_editor/mod.rs:2176-2195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2406f307a9ee6e15561e389349fa6ecef164bd9e54fdefb4e05aea0755665936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): src/bresenham.rs:31-48 | src/bresenham.rs:50-67 | src/bresenham.rs:69-87 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bresenham.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9604cfcc7f8d2257f2d7fe949a81ea9a738cba3c90e53b36b2364ab8385107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/world_editor/mod.rs:334-352 | src/world_editor/mod.rs:395-413 | src/world_editor/mod.rs:456-474 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5105ce24a5179580c44c5f5696e177b6f6d158ec40b844cf9f1cb0e43e278760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/data_processing.rs:1528-1549 | src/data_processing.rs:1949-1967 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60d2bdd016540877d70730911e5bb91b7df953f957c023981a4e9c4f50a9707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/element_processing/landuse.rs:100-118 | src/element_processing/natural.rs:173-191 \u2014 before extracting anything, compare \u0060src/element_processing/landuse.rs\u0060 and \u0060src/element_processing/natural.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 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":"src/element_processing/landuse.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f804b2ddee45b0a2b51a701eb39b2f16a05b860ec513d3f0d17cce5015cc65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/models_3d/three_dmr/placement.rs:148-165 | src/models_3d/wikidata/placement.rs:212-229 \u2014 \u0060src/models_3d/three_dmr/placement.rs\u0060 and \u0060src/models_3d/wikidata/placement.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 97 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f9ddc78f5bc68c852a58a9ae8e6c09bf403c7f929892086afaad6135195e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/element_processing/amenities.rs:725-741 | src/element_processing/amenities.rs:865-881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/amenities.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81360019ee2387cf99afb3a8431d84b2a7a0bcd3efe2e408328b378397fc6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201316 lines \u00D7 6): src/elevation/postprocess.rs:953-968 | src/elevation/postprocess.rs:1074-1089 | src/elevation/postprocess.rs:1285-1291 | src/elevation/postprocess.rs:1506-1512 | src/elevation/postprocess.rs:1599-1605 | src/elevation/postprocess.rs:1782-1788 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5adaef73d800e3dd2ae2bfbcab1b170e0147b26288c1b682337f7e93cbe2ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/models_3d/custom/client.rs:23-38 | src/models_3d/three_dmr/client.rs:65-80 | src/models_3d/wikidata/client.rs:27-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/custom/client.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b581860290ea436e5119b9d0b10d2a520bd0b903a5018db8aa9a442236c5979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/mapillary/pipeline.rs:1001-1016 | src/mapillary/pipeline.rs:1032-1047 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a9aeccbd9dcf783fe1b9937805c4715816f5db12828a6f6d4fd659e7da54d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/world_editor/common.rs:2212-2227 | src/world_editor/common.rs:2233-2248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b01c73945a2a28ac76a6a2b55c12e3a7843e325fe2d2bcec3cc955ad5f65744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/world_utils.rs:812-824 | src/world_utils.rs:1156-1168 | src/world_utils.rs:1226-1240 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_utils.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"08638a474a747311c64037403bc74e3e3790540f6c776277af47b1bfb0804352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/element_processing/buildings.rs:15254-15265 | src/element_processing/buildings.rs:15267-15281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bc29a41e334f1270c9637024bb9f756fa51b23872aed5b2de15bc26341cdb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/element_processing/landuse.rs:343-356 | src/element_processing/natural.rs:587-601 \u2014 before extracting anything, compare \u0060src/element_processing/landuse.rs\u0060 and \u0060src/element_processing/natural.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 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":"src/element_processing/landuse.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0137004939fb7a88d2f5c22d7f718da1d8e711a0a4ca586f1603b2490d91007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/element_processing/signage.rs:1174-1188 | src/element_processing/signage.rs:1239-1253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"56365731e1e8bcee93447c8ce3f40465c2aeb24d8413437d2c111ae083e6abae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/mapillary/fuse.rs:574-588 | src/mapillary/register.rs:422-436 \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":"src/mapillary/fuse.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1be529caffbf4784e978ee0aa1e16a413a1fdb147c18958d81cfc3f947504e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/models_3d/custom/stadium.rs:389-402 | src/models_3d/three_dmr/placement.rs:268-282 \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":"src/models_3d/custom/stadium.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1038f8226790685056a5ff61203086ac271b3f4bbed8cdb354c25ac867bb921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/osm_parser.rs:1302-1316 | src/osm_parser.rs:1365-1378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53f66820001e56a88035d9fa1b3e22008c408ed11a40d40fd0b48070ad296d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/structures/excavator.rs:43-57 | src/structures/playground.rs:51-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/excavator.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61bf2b076e8fbab9176d8b80e77bb725bb576af1a3d716f857da2c688e42599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/world_editor/luanti.rs:149-163 | src/world_editor/luanti.rs:557-569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/luanti.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eafd03cc985242783d5d489cb946bb9a1d147515d4cdf95a82ff55fb36ae8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/world_editor/mod.rs:2084-2098 | src/world_editor/mod.rs:2160-2172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0674f846333496533f96a538b47995911ce14987c0c713191936e378662eb0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/models_3d/custom/stadium.rs:449-462 | src/models_3d/three_dmr/placement.rs:322-335 | src/models_3d/wikidata/placement.rs:966-979 \u2014 \u0060src/models_3d/three_dmr/placement.rs\u0060 and \u0060src/models_3d/wikidata/placement.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 97 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/custom/stadium.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3a52c49fa8711312104341b15e901f784886378a4935b4f7f3ab2168b0e718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201314 lines \u00D7 4): src/world_editor/common.rs:1102-1115 | src/world_editor/common.rs:1129-1142 | src/world_editor/common.rs:1152-1155 | src/world_editor/common.rs:1160-1173 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"139171c4f99c98e914f1009a6105d0fa18f512f7d20452fbf57f7e2a912e6d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/clipping.rs:351-364 | src/clipping.rs:367-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a7f5f954db3ba16ba450de735461e47cb6edbc7523dea3483da3038dcd5794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/element_processing/man_made.rs:895-908 | src/element_processing/man_made.rs:924-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6378e9e29a2e23635b732d504a09bb4120cb59ea3ce6272208b08073297a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/mapillary/fetch.rs:975-988 | src/mapillary/fetch.rs:1119-1132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"51889d9ac3748d75e52094a2209577d8e92bcc0787a3cc2f086efd3e0aca032d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/mapillary/fuse.rs:821-834 | src/mapillary/fuse.rs:932-945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fuse.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c7002aa0b0f902041c6aacfdde926e360c37b76a688aa76f6faf37fb8e5ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/structures/schematic.rs:469-480 | src/trees/schematic.rs:133-146 \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":"src/structures/schematic.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0593d5d30b9bddd588e4490dd33273e2fa8d8aadf2f0303598ff6af0512274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/world_utils.rs:860-873 | src/world_utils.rs:1199-1212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_utils.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9337adfd49c2a3607b72b09739c44fb75ff0cdcfd9b6201c6ff38ae958ba566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/element_processing/bridges.rs:192-204 | src/element_processing/bridges.rs:300-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"865da1e5ff0f99e05a12a46a69f79fba7cab02d4fbd4d3fe34fed28ae08e323f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/elevation/providers/mapterhorn.rs:307-319 | src/elevation/providers/planetary.rs:251-263 \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":"src/elevation/providers/mapterhorn.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"83df52e404b3552e9d57307394de933d7d0c0b8ee36b3d992d6ecb254c821f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/landmarks.rs:254-266 | src/mapillary/mod.rs:97-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/landmarks.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"da09e23628cead576eee1307e2f4e1c7837aedc2a4e3d8f98579a2d576894c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/element_processing/bridge_styles.rs:202-213 | src/element_processing/bridges.rs:1901-1912 \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":"src/element_processing/bridge_styles.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6c67f8d96d09bf5261392d38afa0159415fc5f322da7ff809c7ac14a355bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/element_processing/historic.rs:112-123 | src/element_processing/historic.rs:172-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/historic.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1975580a66b2d8420c20c02d5cc015ed1c092d6c86f85280f7fda958615bbc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/element_processing/natural.rs:325-335 | src/element_processing/natural.rs:581-592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/natural.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4eb25541e1814b12b613549dea22c228e453e09ef40af5a37c754ac66b07eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/element_processing/structure_kit.rs:255-266 | src/element_processing/traffic_lights.rs:741-752 \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":"src/element_processing/structure_kit.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7526817bd5ca648663a357af863d428474e669e11f54c07a1c95ced9beb763d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/mapillary/bands.rs:663-673 | src/mapillary/bands.rs:685-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d2318de04edac881e625eb54da6d81e32724aa99b1c19b57bd143dacfea122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/voxy/lod.rs:497-507 | src/voxy/lod.rs:641-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/voxy/lod.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"803f8d25c33adce9476cf6395979f72326d74270f4304375a4dd4c296b018fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/world_editor/bedrock.rs:1119-1128 | src/world_editor/mod.rs:2663-2674 \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":"src/world_editor/bedrock.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba8b1fef575a2fb8f1059bdb7e3d2e2d5a3eb4c27a4b0f739dcd2d6389520a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 5): src/block_definitions.rs:627-636 | src/block_definitions.rs:734-743 | src/block_definitions.rs:796-805 | src/block_definitions.rs:934-944 | src/block_definitions.rs:952-961 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1da3f9c548194c735d458ecc16adcbc97bdda6343600a3ceb6452336a14f7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): src/element_processing/advertising.rs:24-34 | src/element_processing/emergency.rs:13-23 | src/element_processing/historic.rs:17-27 | src/element_processing/power.rs:190-200 | src/element_processing/tourisms.rs:12-22 \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 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/advertising.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa15aee58a994a5f4714ef8b4ec06f595659de161d24de40a296b7b62ce91e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/element_processing/amenities.rs:27-37 | src/element_processing/man_made.rs:39-49 | src/element_processing/power.rs:54-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/amenities.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90d534c867c8d59eb3192580c5cf40287f03478e6b8b839ae6faf359c9fed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/element_processing/tree.rs:1129-1139 | src/element_processing/tree.rs:1181-1191 | src/element_processing/tree.rs:1459-1469 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ba8d8ee8e664a5bcfaea03df4de5dae78da580642293530b3a3a5d7ec5eb99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/block_definitions.rs:617-625 | src/block_definitions.rs:826-836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"5541c62e798faadf34f51b8828fa0229712d2c939eab8333903e788ff58bf355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/block_definitions.rs:820-830 | src/block_definitions.rs:865-874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"f869826a63ef540b362983393a13bf246d6d4fa75a06c6d71c047c978bd74d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/building_facades/mod.rs:1151-1161 | src/mapillary/displays.rs:951-961 \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":"src/building_facades/mod.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8acdb88016d9dc5407425fb6001feb0d3a5fec00019bf9948266f067f01d2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/element_processing/buildings.rs:2343-2353 | src/element_processing/buildings.rs:2359-2369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b3255e4b7b75dab7a0905306f9c567d86efa8139cef2c23ad454038577775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/element_processing/buildings.rs:15903-15913 | src/element_processing/buildings.rs:16271-16281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":15903}}}],"partialFingerprints":{"codehealthFindingId/v1":"34064cca43454b3523f8e78bec6eb78e5d4425abf4c14b31d020d470e7bc2065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/world_editor/mod.rs:319-329 | src/world_editor/mod.rs:441-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23d929665dec6dd7d39ad3698a5444e51e63d97fe77f555b21f9837e9a2dcce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/world_editor/mod.rs:891-901 | src/world_editor/mod.rs:1658-1668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c73fde97677f5cff0acc6ed5e1ed70be2061f1ae1f1a65fbe8cf949de3ae94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/element_processing/landuse.rs:548-557 | src/element_processing/leisure.rs:238-247 | src/element_processing/natural.rs:726-735 \u2014 before extracting anything, compare \u0060src/element_processing/landuse.rs\u0060 and \u0060src/element_processing/natural.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 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":"src/element_processing/landuse.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac053d67c56e245076672b9b88b72c4aa33145d705df7565d1e885971eed305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/land_cover/bridge_repair.rs:117-126 | src/land_cover/bridge_repair.rs:147-156 | src/land_cover/bridge_repair.rs:174-183 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/bridge_repair.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ba2f342118b56a0a5edff89f19fbbad5ffa083c9179ec056a6cee40a6700cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/world_editor/mod.rs:317-326 | src/world_editor/mod.rs:378-387 | src/world_editor/mod.rs:439-448 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"29950549a24a945fefa732eca79ac7806c34486d759b80b5450e16010f84238a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/caves/decoration.rs:486-495 | src/caves/decoration.rs:512-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b4768830339996cfbfe66ac760581321bfd458292493f4982fd5b5aa2da830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/clipping.rs:246-254 | src/clipping.rs:272-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6f9e78e22ce54fe2348a3efa7e0050b3a2ffe617783d7707eaaea061022c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/data_processing.rs:392-401 | src/data_processing.rs:538-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ea9734046457a3264b506ddcc6856faed6238fbc372df5b523efa9635b9af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/element_processing/buildings.rs:6211-6219 | src/element_processing/buildings.rs:6240-6249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6211}}}],"partialFingerprints":{"codehealthFindingId/v1":"13163ee76e9c4389bc1c1d2407c150b77a96ee4e23026a50d326f47109b451a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/ground.rs:1264-1273 | src/ground.rs:1298-1307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f1048f4a70097753060cd1bf979ed907070a12ec8da708102e9fab29c26dbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/landmarks.rs:568-577 | src/structures/schematic.rs:794-803 \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":"src/landmarks.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b82af03482e5ba0498ccc2345ad63d1c97de7d3891e05a77a2c6665849e6146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/map_transformation/rotate/rotator.rs:132-141 | src/map_transformation/rotate/rotator.rs:142-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/rotate/rotator.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bff5147bc1c995b1456876c0ae120a7717df264742e3ddfe642f93a1ff90f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mapillary/imgops.rs:292-301 | src/mapillary/refine.rs:458-467 \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":"src/mapillary/imgops.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13c56c2471754e73359050ff100701ec1016dc32df633500d00d33f761ae1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mapillary/refine.rs:576-585 | src/mapillary/refine.rs:587-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee8ee4cf7865eac4dbde54ee4a84f73cc3d1decbd56bd5319854654d17b1306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mapillary/refine.rs:650-659 | src/mapillary/refine.rs:661-670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c85058ea6a66862b9cafa0a61c74df83137e89c50f169d8b59a5ede5c9b8ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/overture/mod.rs:1929-1938 | src/overture/mod.rs:1952-1961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b05507061840a0cba8c8a79b07b59c1676a6fe4f1bd549c5ba58be21141912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/world_utils.rs:349-358 | src/world_utils.rs:1289-1297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_utils.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a83cf8e7bf6bfd75eacfb33072ba0c95bf0426542068851c304d4376a7a1a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/world_editor/mod.rs:1542-1550 | src/world_editor/mod.rs:1582-1590 | src/world_editor/mod.rs:2051-2059 | src/world_editor/mod.rs:2114-2122 | src/world_editor/mod.rs:2187-2195 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"42186d252b82cf2a65357319d640ae492bf6d60c87b9b8a786c74add7b189892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/block_definitions.rs:642-650 | src/block_definitions.rs:657-665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"52861e2d04b721682d02f9fd7e676b3e925ee2516a2f451bca3d6b80e6d2299a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/element_processing/buildings.rs:2373-2381 | src/element_processing/buildings.rs:2390-2398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a60081e7c5aa9d699fd3838bafba013773f1eba36a09ed956d3401be993b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/element_processing/cars.rs:1669-1677 | src/element_processing/cars.rs:1689-1697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f085950b77ca7b99a37dfa5689fdf2770a1d63bfd3f431d36f2118ced73f25d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/element_processing/cars.rs:1679-1687 | src/element_processing/cars.rs:1699-1707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95042bd43f1047f698e4bde8bcf7f42bee3619b603e620bf897394288a85563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/element_processing/highways.rs:1089-1097 | src/element_processing/highways.rs:1112-1119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c81885c7ce48f08747b692eb887cc406e1ca69c451490ff2f68454355cf3f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/element_processing/power.rs:232-240 | src/element_processing/power.rs:369-377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/power.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837fbb50b03cc9be51034b2e18eda70a8607020db28694cfecd13be1f351808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/ground.rs:700-708 | src/ground.rs:778-786 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca237276708e8430a4937bd9fd2e041958ca9fb999e4a22a330cb03229bb9c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/mapillary/cache.rs:232-240 | src/mapillary/pipeline.rs:1107-1115 \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":"src/mapillary/cache.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"db75985e9fbf2ec85f11b403588a7edcf4fb3895bd40ef9ed065986d18aaa8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/mapillary/openings.rs:464-472 | src/mapillary/openings.rs:483-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a057e35fed6663cbfe99495514e81e21dacffbf9007237fd0ba7743b33deba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/mapillary/openings.rs:861-869 | src/mapillary/openings.rs:1129-1137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/openings.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1b9bddd70bd0d34cb7b81cd3c21b76f71047891a7da83097fdf3377491d0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/models_3d/wikidata/placement.rs:248-256 | src/structures/plane.rs:193-201 \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":"src/models_3d/wikidata/placement.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbadbec8b5a9e17ade4d7c6993dabec6f93b5c33d4d54affa425de188fac342c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/overture/mod.rs:1951-1959 | src/overture/mod.rs:1962-1970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd98078707e6c47fd4a789e9b79bda20a05fd28ece1e9714c2b541c4cfa907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/water_depth.rs:212-220 | src/water_depth.rs:233-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c1ad689a1a72d5d82c7c6c73b525695c2a907934ddca763672e3faebcf5925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/world_editor/bedrock.rs:1515-1522 | src/world_editor/java.rs:1372-1380 \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":"src/world_editor/bedrock.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"262751833202335d9b900d75d6ac94659c3891b24158be94ab5d68f95848c15a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/world_editor/mod.rs:2355-2362 | src/world_editor/mod.rs:2379-2387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b63a357c8f105cf1780e0efa345be1463ee89311371405203c38fee24bfb114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/world_utils.rs:830-838 | src/world_utils.rs:1172-1178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_utils.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79fee1692a95e3458100239dafa8b3bd3cf88a21a1792ecf4f47e06ca4af3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/block_definitions.rs:624-632 | src/block_definitions.rs:732-739 | src/block_definitions.rs:880-889 | src/block_definitions.rs:931-940 | src/block_definitions.rs:949-957 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"2974629b4188abc1b2ab33a10daff18ba27ae73335c5ff6e7ecf10157bcec33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/elevation/postprocess.rs:479-486 | src/elevation/postprocess.rs:1401-1408 | src/elevation/postprocess.rs:1980-1987 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d902ebf5f55da1192ec4569414d9705d198d5e74b513a6c43c216e441695f792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/world_utils.rs:860-867 | src/world_utils.rs:1001-1008 | src/world_utils.rs:1199-1206 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_utils.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"433427604db7ded10919ce31ee04eed883bb8f24ba4d559fc9a6c7a666cb5a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/args.rs:1012-1019 | src/args.rs:1022-1029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85c62f317cacd516335a7d3643e005a7cc4315a7b3abe113464cd6614d9b133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/caves/decoration.rs:454-461 | src/caves/decoration.rs:468-475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfe8564738ad3f054f68d65494f52120480a3bcf26c5b8346628e3b40d7a716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/element_processing/amenities.rs:469-476 | src/structures/crane.rs:61-68 \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":"src/element_processing/amenities.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a45b8bc4254065965d0111c01c4af3171aff6cfe92d99bd5599ecbbcb1c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/element_processing/buildings.rs:17536-17542 | src/element_processing/natural.rs:120-127 \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":"src/element_processing/buildings.rs"},"region":{"startLine":17536}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b68bcd10444b993848b84ae9f99d1d0d532a0f18a7c55d5a72a4b0eac4a2ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/element_processing/fuel_stations.rs:455-462 | src/osm_parser.rs:1786-1793 \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":"src/element_processing/fuel_stations.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"0816a3adf724f85d7ed71d25b7a3d890fb02bcabcc9d6176917f754af3c0d297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/element_processing/mod.rs:183-189 | src/element_processing/mod.rs:198-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/mod.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6377f2627380971ecaaf5d7c9e4deec9f6ab6620aa56f9d12d76af1647265ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/elevation/postprocess.rs:477-484 | src/elevation/postprocess.rs:1504-1511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ae5803425988936c963a6e46ca30f035b0d544a7e5a56644a6750885ea8a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/land_cover/bridge_repair.rs:36-43 | src/land_cover/osm_water_override.rs:35-42 \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":"src/land_cover/bridge_repair.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d3c5004badd30759f331eb63a061f643fe63d3ea576d77f47ca01381949538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mapillary/pipeline.rs:951-958 | src/mapillary/pipeline.rs:1001-1008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b709173e65727c88a417c25264612881e793b46bc2c8db813b5d4a1e3ec23a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mapillary/pipeline.rs:2068-2075 | src/mapillary/pipeline.rs:2243-2250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/pipeline.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e255680c0d0bedfe560463a0693632181c1d4c1178cee4bd01b09ccbcf7e4414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/overture/mvt.rs:411-418 | src/overture/mvt.rs:426-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mvt.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ad99c552796552239bf43c85baf5bb2fdcf335fb8b5233760734461d7e1d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/world_editor/common.rs:307-314 | src/world_editor/common.rs:945-952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8285565623a7769214066e80ccb0f87bddf972a9daf0d2f39e6c61bbc07ef895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/element_processing/landuse.rs:113-119 | src/element_processing/landuse.rs:124-130 | src/element_processing/natural.rs:186-192 \u2014 before extracting anything, compare \u0060src/element_processing/landuse.rs\u0060 and \u0060src/element_processing/natural.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 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":"src/element_processing/landuse.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2bde9d0a770f7e9623722551f9caac0f5cca72d5f33f029586dc9089d40f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/block_definitions.rs:622-628 | src/block_definitions.rs:855-861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a8577167f7529018fde60db1670ea7913ad55e05da006e8d1a3e2915d249c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/block_definitions.rs:2059-2065 | src/block_definitions.rs:2156-2162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ea3fe5bca2b37a2caace6d27c173682df460165b21283ae5ec0ed72f0f4c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/caves/carver.rs:141-146 | src/caves/mod.rs:457-463 \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":"src/caves/carver.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e106e260fd15a9a64a7c5f860cc87cecd6316b65687377b01a3364236033443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/colors.rs:22-28 | src/colors.rs:35-41 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/colors.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b44a6ee0bc61f7ecc8e198c8dd62138dfc0872a1a0a05a0757abd6e466066f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/datapack/disasters.rs:1033-1039 | src/water_steps.rs:391-397 \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":"src/datapack/disasters.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"8104a24227caef94af27f60f64db1e75c2d28c49d159f4d5b28f82ab785ff701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/element_processing/buildings.rs:6279-6286 | src/element_processing/buildings.rs:11639-11645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6279}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb15e2f0c08c3f9cb1b1992fe1c19af97bd2da5c06ed1e77c66374d7a3b898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/element_processing/cars.rs:412-418 | src/element_processing/road_markings.rs:574-580 \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":"src/element_processing/cars.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b540792026340ef667442f2cf73b44546fe31c91f6f3c161afd830d679fd174e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/elevation/providers/aws_terrain.rs:180-186 | src/elevation/providers/aws_terrain.rs:187-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/providers/aws_terrain.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"de82d18cad78264705177a42c54d02e37826337795c1bd68946da29959868a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/elevation/providers/mapterhorn.rs:761-767 | src/elevation/providers/mapterhorn.rs:768-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/providers/mapterhorn.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd01f43c87735151130e1090054304a427f1efe76ffa49e94ae4a4b921512df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mapillary/bands.rs:192-198 | src/mapillary/openings.rs:270-276 \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":"src/mapillary/bands.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f7d3e66f50753cf7dfd77c770dc831cf8821444dfe736998b89764cbce7adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mapillary/bands.rs:700-706 | src/mapillary/bands.rs:710-716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b551a2c81e1a26ba7c505ba3906e45d5e6f5d3ec6b3c72022dc24b64ad9167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mapillary/facade.rs:82-88 | src/mapillary/facades.rs:1261-1267 \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":"src/mapillary/facade.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a674fa01c9ace333fab945feaf96f7226576861a57385e0069d07b3f232c0fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mapillary/refine.rs:3191-3197 | src/mapillary/refine.rs:3198-3204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4733170910f01473ef4621022fe8e767c453ef8b8ba0498fc93454e0eafef0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/models_3d/three_dmr/client.rs:83-89 | src/models_3d/wikidata/client.rs:45-51 \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":"src/models_3d/three_dmr/client.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"278a1fbbc4f8e3dd71f175d6918e73320640c27c3e37aa6342fb2504e753de13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/models_3d/three_dmr/placement.rs:313-319 | src/models_3d/wikidata/placement.rs:957-963 \u2014 \u0060src/models_3d/three_dmr/placement.rs\u0060 and \u0060src/models_3d/wikidata/placement.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 97 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2515e895f6e0acb3fc92c1d332dd68cd1e40eb1b68b5e32f0cbb4c114a69565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/models_3d/voxelize.rs:392-397 | src/models_3d/voxelize.rs:463-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6c2194fc227a0596a89c0775c13878560f1ea5e1a71f3ae6f59f0bb8a59db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/structures/helicopter.rs:38-44 | src/structures/tractor.rs:45-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/helicopter.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ec6ddbf367279e027ff6ea2f8e771241191e23a31d4cd269ea75c55c293620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/world_editor/common.rs:1714-1720 | src/world_editor/common.rs:1758-1764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb788504e29e85270d6610f10dbb025a1ec8aa6dc736dd140b84b5817715dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/world_editor/mod.rs:1043-1049 | src/world_editor/mod.rs:1062-1068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fa0fd89f1c0f9e25fb9af447676e0ecba4837912079e7d3c7e05b001424884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/block_definitions.rs:627-632 | src/block_definitions.rs:734-739 | src/block_definitions.rs:795-801 | src/block_definitions.rs:884-889 | src/block_definitions.rs:934-940 | src/block_definitions.rs:952-957 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c662c8af5bbaad440131e9d035c3d8d3d4ea6594bc52bc25002aa2eeab46ff99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/map_item.rs:242-248 | src/world_editor/mod.rs:894-899 | src/world_editor/mod.rs:1634-1639 | src/world_editor/mod.rs:1661-1666 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_item.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a4ed2541a5ef1f044c56394526c955dc4cb07a686ad08e29e7ab90e830653a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/element_processing/mod.rs:184-189 | src/element_processing/mod.rs:192-197 | src/element_processing/mod.rs:200-205 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"864ce9689321894fa678d3c593c02e199b737573a29017b886d52b270f42376c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 3): src/mapillary/facade.rs:82-87 | src/mapillary/facades.rs:1261-1266 | src/overture/tiles.rs:191-195 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facade.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eba97d7316b17451e61dd05f3c7ab560bada83206438178ceedbaa104fbdba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/caves/carver.rs:308-313 | src/caves/carver.rs:442-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/carver.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed18358e923354060ba3d939480d26f66dde68150d53c9f3e60a149b3455bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/caves/decoration.rs:497-502 | src/caves/decoration.rs:523-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/decoration.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"416cda0aba914ccbfc1647cfe8f5ce477966324b947358fc1c1e29b73f4c5365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/clipping.rs:427-432 | src/clipping.rs:437-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbfd30fe82a1a43c1d514c12eb3ca1f2548836949040c13db5115458ae913ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/colors.rs:53-59 | src/element_processing/buildings.rs:8604-8609 \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":"src/colors.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8072ec567e645de4f22522e346a1a24d560d2320b8b2cdbd1ff0390b6b35ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/buildings.rs:16894-16899 | src/element_processing/buildings.rs:16966-16971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":16894}}}],"partialFingerprints":{"codehealthFindingId/v1":"2453225001564c70e7405a1f8c276ce3652267e1fe5120377a1b58c46503a873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/cars.rs:1370-1375 | src/element_processing/cars.rs:1577-1582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e21c2b64f5316236a89ef7c48a3cef4d717f5d6e5add5aec2646304c55a4993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/construction_site.rs:192-197 | src/element_processing/parking_garage.rs:281-286 \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":"src/element_processing/construction_site.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb554ef3e98fa1c4ff9ca3dae1e937d5393f14f7217d57f3178d1397359a86a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/highways.rs:2190-2195 | src/element_processing/railways.rs:1103-1108 \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":"src/element_processing/highways.rs"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f746f7f0c35b3e138d1cf013ff169e2205467e377d6e8ec461004b2e890b9a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/railways.rs:320-326 | src/element_processing/railways.rs:987-992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1799454a7db24e053cccd72ff467f664a3ab0cde1448d888ce144c375dd4d88d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/land_cover/bridge_repair.rs:53-59 | src/land_cover/osm_water_override.rs:41-46 \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":"src/land_cover/bridge_repair.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2726c6bbf5d317351b4b35a5a6b3a32a4bdf2eed73230055b813eac7d046427e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/mapillary/facades.rs:861-866 | src/mapillary/facades.rs:1615-1620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91dd3a409404513027c14115cd598635cc221a22ee3f7bcb80bcebabbe10d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/models_3d/three_dmr/client.rs:90-95 | src/models_3d/wikidata/client.rs:52-57 \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":"src/models_3d/three_dmr/client.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"750202add3bdad2759646154b9fb284bc240909f484eb869b4b3ef6e6cc1eb37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/osm_parser.rs:1960-1965 | src/osm_parser.rs:2275-2280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"42931d51e878c9a105f94fa7bc3a64b36caca7f50fd097ff295012b8094db141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): src/caves/schems.rs:270-272 | src/structures/schematic.rs:486-491 | src/trees/schematic.rs:156-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/schems.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"373f3967bfec5edad0f4f886a5f3bca6be97fa34becef18106a6a1ddb41d3833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): src/element_processing/amenities.rs:698-701 | src/world_editor/mod.rs:912-917 | src/world_editor/mod.rs:1675-1684 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/amenities.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d26681feba909fd4a14aacc133efe8c4c9fb9ab783ec6fe923e578dd1d4889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/world_editor/mod.rs:1616-1622 | src/world_editor/mod.rs:1646-1651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"57abe35c0472225fefe9001755d0662922c2e21714a6bc0fcd9059fab2c4a05e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/block_definitions.rs:750-754 | src/block_definitions.rs:757-761 | src/block_definitions.rs:764-768 | src/block_definitions.rs:771-775 | src/block_definitions.rs:778-782 | src/block_definitions.rs:893-897 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"875ca697af500ec53aeb120f2c12f0e4f10c3a3b0eb7005a98bb0b7eca19ec1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/mapillary/refine.rs:575-579 | src/mapillary/refine.rs:586-590 | src/mapillary/refine.rs:649-653 | src/mapillary/refine.rs:660-664 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"215ca71892819040df0ee2ff75274c95b194d9a0acd266b55f8fe8cf3d3ef73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/block_definitions.rs:617-621 | src/block_definitions.rs:830-835 | src/block_definitions.rs:855-860 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"376d33921ca32a575a9c14d69b68ff3344845f5624f300283309650fec55cd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/block_definitions.rs:756-760 | src/block_definitions.rs:770-774 | src/block_definitions.rs:899-903 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f7be0737fcd89e027914433c8b8736a6456cee0443a257668bccde7678d01d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/mapillary/bands.rs:196-200 | src/mapillary/openings.rs:274-278 | src/mapillary/openings.rs:1450-1454 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7712518c53b2509997b41fa9bc988573b189df19cec9b82ad3a279f416f83785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/block_definitions.rs:651-655 | src/block_definitions.rs:886-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"201c6affea9ad4307d113a44d8a140e85a061a6364e7b4f0edd969a62b100d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/block_definitions.rs:656-660 | src/block_definitions.rs:741-747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"57247b7f099eb82d93f230f01feb3028c19e5a9f9250288f40a087bc153b4da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/block_definitions.rs:742-748 | src/block_definitions.rs:751-755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf71188489e51620ecce92a08ed8e26879fc050e3845978994218f480f186e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/block_definitions.rs:887-891 | src/block_definitions.rs:894-898 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eae9c45979e35cd2cc2301a5fb1b30469575b4a4bb14356c86353d8a047ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/element_processing/amenities.rs:912-916 | src/world_editor/mod.rs:2984-2988 \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":"src/element_processing/amenities.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eba244c02e5559ed2ac1ddf26e26748350d7b96ce307a72aa17cb3bc4adb498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/element_processing/buildings.rs:619-623 | src/ground_generation.rs:1611-1615 \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":"src/element_processing/buildings.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"abecb0d5f8f65f21b72a4fc6b6d8041517e791e95e23847763eee7314163f310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/element_processing/highways.rs:830-834 | src/element_processing/highways.rs:880-884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eff568505ee0eb2531a6a3a235365906f4578ccd4601cbe406ce3bb529fd78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/element_processing/landuse.rs:335-339 | src/element_processing/landuse.rs:378-382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1046046be897d67715263335926a758c0292dd9f856a026cb82c0923257137d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/landmarks.rs:413-417 | src/structures/schematic.rs:702-706 \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":"src/landmarks.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0159af019b4971b3491eacf3c543e594b4c7028dd0b50b6a8855fbaf8c82c486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/map_transformation/rotate/rotator.rs:176-180 | src/map_transformation/rotate/rotator.rs:186-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/rotate/rotator.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e605ca90c6c963c6e1a273d90c86c9d6f10674fdcd63dbb3aee103193d169da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/mapillary/bands.rs:545-549 | src/mapillary/bands.rs:553-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/bands.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32e8ed21b9d16e107de976dd8921a30fa5e3177924333abe4f8fae84ca0d926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/osm_parser.rs:1596-1600 | src/osm_parser.rs:1701-1705 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda628d9e1645136fa1233788bf3d5492e3c73bbf6522d1a983d1b930b94cbd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/world_editor/mod.rs:1052-1056 | src/world_editor/mod.rs:1935-1939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35dcd65ab38a2d1df4d542fadd6ec8f3f17ac1f2ea64d6a3755ddb5ed9c9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/canopy/mod.rs:204-208 | src/overture/pmtiles.rs:100-104 \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":"src/canopy/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a197123228f9f73cfe13c523931362684f03dc69e193801ee1e54a341d61e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/caves/carver.rs:192-199 | src/caves/schems.rs:411-417 | src/caves/water.rs:148-154 \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":"src/caves/carver.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a00d741e4dceb7bce3979543878b5e3264afce6a40e85bc0263005fac771d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/cars.rs:347-352 | src/element_processing/trains.rs:247-252 \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":"src/element_processing/cars.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8637b7ae90a1c8ae8977ede3aed0cd37ec622d0938e9295a7ac23186af7666bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/element_processing/signage.rs:751-763 | src/world_editor/mod.rs:1104-1116 \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":"src/element_processing/signage.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95a2300557b91785fd5350290b8533a50ab23051bd349f5dbe8bb7e7d05614d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/mapillary/imgops.rs:367-374 | src/models_3d/voxelize.rs:220-227 \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":"src/mapillary/imgops.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c4c2bbf3365dca4bbaf59978ca6d56e15c8149a6bf97efbb1123f9eb0fdaa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/structures/schematic.rs:439-445 | src/trees/schematic.rs:118-124 \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":"src/structures/schematic.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"062716d7d39a775f97ed80e2da1e720d2eacdf4402e1a8357a3ec7aab3c9bbbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/overture/mvt.rs:157-168 | src/overture/pmtiles.rs:214-220 \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":"src/overture/mvt.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad81d2f38cb0f3750de39758eeb43e8c38c5341d9365bc51f891c07fa625166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/elevation/mod.rs:401-411 | src/elevation/mod.rs:423-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/mod.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a0afe5cdf7c88de68ccd020b99ce1fd9b147cd882a990f1f06ae925a37f4f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/block_definitions.rs:687-697 | src/block_definitions.rs:703-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9554a42e85347722fc4d7e0ebfcfc2ac59659ac65ebfdc20f76720d23d432b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/structures/boat.rs:19-28 | src/structures/lighthouse.rs:12-21 | src/structures/starship.rs:15-25 | src/structures/tractor.rs:17-26 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/boat.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87449c277bf7d67b27fe9d885708a13bdfd6e1ca37e061decc79612449e99dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/block_definitions.rs:671-678 | src/block_definitions.rs:684-693 | src/block_definitions.rs:700-709 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f90c8020510e6b75d1ebf8f1283cd46e55422dcf218a4054c831ba743cd0a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/elevation/cache.rs:97-106 | src/mapillary/cache.rs:628-637 \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":"src/elevation/cache.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5711b4dab5a9e4031fe3f60b964145b286de966ced3b89c4f8c919025a3144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/structures/fountain.rs:21-30 | src/structures/playground.rs:24-33 \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":"src/structures/fountain.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f0d57469831c64df3ad173c00dcaa3ab7e3ae7427b6a9f288823462e25dcbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/overture/mod.rs:1737-1745 | src/overture/mod.rs:1762-1770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"b249ea9c006059671c4a70e61424278a2a7d3c421a4b9e2c78376a4d608751fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/overture/mod.rs:2435-2442 | src/overture/pmtiles.rs:653-660 \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":"src/overture/mod.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12509ad5a2339bc61cc21a36de5d0ad4e4e0e3f580390e2a020801005a7445e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/mapillary/fetch.rs:961-967 | src/mapillary/fetch.rs:1104-1110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc328cead93f419521752e9b519dfdb0b06c8316e2fc89e54080dd9ae374e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/models_3d/three_dmr/client.rs:104-110 | src/models_3d/three_dmr/client.rs:132-138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/client.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a3f6bfbe6bb0f4431ec0883771d2fb138c892089d3829a4adadad23ee5417c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/osm_tiles.rs:970-976 | src/osm_tiles.rs:993-999 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"1357e17d62a60914cdf1e202dbb6e556ae879d8770abc57e2776394766fdca68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/overture/mod.rs:1718-1724 | src/overture/mod.rs:1725-1731 | src/overture/mod.rs:1772-1778 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e847729bda132e93854882f8958404667eca119b36589796bd650b495e5fb45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/gui.rs:544-548 | src/gui.rs:669-675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f319597529b0765abdce89d3c540d35520e919de68819a5551a5e0d7cafe03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/models_3d/three_dmr/placement.rs:100-106 | src/models_3d/wikidata/placement.rs:101-107 \u2014 \u0060src/models_3d/three_dmr/placement.rs\u0060 and \u0060src/models_3d/wikidata/placement.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 97 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec78fae62d445eb5af7536f0f7612af2357a7c332e39e51a068a6cc1dd3889c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/block_definitions.rs:958-963 | src/block_definitions.rs:964-968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6e760b94a8c01c8490ad89840e922bd0e1c5ad73c7824a02300001424ba29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/world_editor/mod.rs:1700-1705 | src/world_editor/mod.rs:2096-2101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"039a10aed1603179a7896b50580b34a675a7a95febb5dcb0f986defa776264af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/world_editor/mod.rs:2760-2765 | src/world_editor/mod.rs:2770-2775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/mod.rs"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fee70ceb26595c0f793d2fafa11f9352b12a53387d5e1984904118aecf42937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/caves/schems.rs:334-338 | src/trees/schematic.rs:182-186 \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":"src/caves/schems.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba7ee2e83997ec50613ebdcdaa7a1fa0b4de4a6db0a08e61a923d3a5ec66461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/element_processing/landuse.rs:324-328 | src/element_processing/landuse.rs:335-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1935fca5c9603337ab338c3fba8cd91a0d28f9528a6dfe7232e5683e111fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/decals/draw.rs:146-150 | src/decals/draw.rs:160-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/decals/draw.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0cb76b04f59b19a034b94acefaedc287da4baed4e1a4fc5ddbd23027feaf02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/bridges.rs:655-660 | src/element_processing/bridges.rs:1145-1150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"038c1aa172b3f87b37ee44585f887201d8cafe44f691c664a3292e4dec275bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/element_processing/buildings.rs:6374-6379 | src/element_processing/buildings.rs:14203-14208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":6374}}}],"partialFingerprints":{"codehealthFindingId/v1":"516b5377909ef40587e926eca66c144fa6ab557ff4c86e328592b866685366f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/element_processing/buildings.rs:9538-9544 | src/element_processing/buildings.rs:9623-9629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":9538}}}],"partialFingerprints":{"codehealthFindingId/v1":"452ba3d41556b8230b28da04779dcc413c6a63b27609eaf40b6065167fe0b6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/element_processing/train_bodies.rs:685-689 | src/element_processing/train_bodies.rs:734-738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/train_bodies.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbb277cf81c1460cc241e380ac29bf801645419a047397d7162f876c83c111a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/land_cover/osm_land_override.rs:290-294 | src/land_cover/shoreline.rs:602-606 \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":"src/land_cover/osm_land_override.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0366c670345ce8cf6dbc5758f95e6566d58e100736f68c03c0804881bb44fcff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/mapillary/pose.rs:64-69 | src/models_3d/voxelize.rs:729-734 \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":"src/mapillary/pose.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8717767f8b5b68747146cb3099244fa41ecd99b21f15b157fdc127b585880e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/mapillary/refine.rs:846-850 | src/mapillary/refine.rs:851-855 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a90a818f6c1a75c85a6ba0875076e6787603ecccaf19c6f87c38a2b6f7662e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/mapillary/refine.rs:1247-1251 | src/mapillary/refine.rs:1273-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"409c1d7e3a6caad8e69bf8a36aedab610f2ad5ef00936902060616e56853e4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/mapillary/refine.rs:1381-1385 | src/mapillary/refine.rs:1398-1402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/refine.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7baf61111a67082dc6a13ef7b5bb1a741d68fbf0bf07c5304fc267a0f425e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/mapillary/register.rs:319-324 | src/mapillary/register.rs:325-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/register.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"43612f76fb931c5cd262183c49045899ae9bdce74c7691926ce6873025096864"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/osm_parser.rs:1554-1558 | src/osm_parser.rs:1874-1878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1635abc3daabd85761dca2d5db44d91f846dc46a28adbac0cf77887c72dfa0ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/overture/mod.rs:1868-1872 | src/overture/mod.rs:1881-1885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6965ae6d231299fb98a3c0f82830ace67e4243e9af7623f35cb24803f38b2092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/trees/region.rs:838-844 | src/trees/region.rs:871-877 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fa77210b7c9b722c03a7c562a672fea466ab890626f5e5f6356583b957207a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/world_editor/bedrock_entities.rs:233-239 | src/world_editor/java.rs:1610-1616 \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":"src/world_editor/bedrock_entities.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b3c85b16148eedc190624c5bdada231faebe5cc83a5b7c20c70b738c54f5f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/data_processing.rs: src/data_processing.rs changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 207 in arnis::data_processing::generate_world_with_options at line 756. 7 of those changes were fix/bug commits, and the other 69 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/data_processing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd456848d5c0688eb898f68a7545281c6c57bcb6f9ec75961b154711ddefc98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/block_definitions.rs: src/block_definitions.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 491 in Block::try_name at line 115. 1 of those changes was a fix/bug commit, and the other 31 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/block_definitions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/block_definitions.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31728b7dcb0c97ab8610bd17eb10455a69d2993f6e569537dea503fc3677144"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/buildings.rs: src/element_processing/buildings.rs changed 81 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 151 in arnis::element_processing::buildings::generate_buildings at line 11550. 7 of those changes were fix/bug commits, and the other 74 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/buildings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":11550}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b43c412adfafe85c442dea9358d16ede8c56d788658b05e7c28d06c6c758b86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/luanti_block_map.rs: src/luanti_block_map.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 489 in arnis::luanti_block_map::to_mineclonia_node at line 302. 2 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/luanti_block_map.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/luanti_block_map.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"9818d856ae8fc949a513825bd1e9c7086a5c9e6a4877ab98e8487c1eadfbe453"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/highways.rs: src/element_processing/highways.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 163 in arnis::element_processing::highways::generate_highways_internal at line 1312. 2 of those changes were fix/bug commits, and the other 29 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/highways.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/highways.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68a1e61d8219801f756bdcf39fac8ea01f43fccde87440cd76a2d3044f97cd4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/gui.rs: src/gui.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in arnis::gui::gui_start_generation at line 1375. 9 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/gui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfca642eecb895e52401d53d177fe8773555113334151e4e050dda19f9b4a58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ground_generation.rs: src/ground_generation.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 172 in arnis::ground_generation::generate_ground_region at line 255. 2 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/ground_generation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground_generation.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe50195185a46ecf5118de80ca19e89565e6e382a384f7ef2129ec1a6e23ed7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main.rs: src/main.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in arnis::run_cli at line 186. 3 of those changes were fix/bug commits, and the other 42 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4bd697ce412d5d6af59543f06e4a0481b7a56e4bd52631de4c8462fa4ed51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/landuse.rs: src/element_processing/landuse.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in arnis::element_processing::landuse::landuse_area at line 41. 4 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/landuse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"922ee60c821d768160927d2239c02ad1557edc829f0e6db10135d46f955561c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/args.rs: src/args.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in arnis::args::validate_args at line 801. 2 of those changes were fix/bug commits, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/args.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b156cd520bd6e2ff3fef8075e650b391f06663e2817149cf9b798ed5208c3a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/natural.rs: src/element_processing/natural.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in arnis::element_processing::natural::natural_area at line 38. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/natural.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/natural.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7aff51a7bb1ce8087ace36ead9f5ac7ccfbf11656ba658db2c3ee01cd4667fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/bridges.rs: src/element_processing/bridges.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 191 in BridgeStructureMap::build at line 154. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/bridges.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b79cb7f1e57c3bc0d04d93f4832e5768f1d030aaa4041b399670e593992fccf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/osm_parser.rs: src/osm_parser.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in arnis::osm_parser::spatial_relation_part_suppression at line 2062. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/osm_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_parser.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae57512c461bb7159944de9d626f3b5a86e3007b09cf66dda0885b98950d896d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/structures/schematic.rs: src/structures/schematic.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 267 in arnis::structures::schematic::map_structure_block at line 62. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/structures/schematic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/schematic.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4668f8995e225974ca0d6804b0277c8a449239c4e2c26afd2f21c540b9d14403"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/overture/mod.rs: src/overture/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in arnis::overture::parse_overture_row at line 1670. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/overture/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/mod.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"57567a6c78f79b7dd4405a691f3f8d2d3662a21b5ed6a6c8643f859bb5c4a1ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/world_editor/common.rs: src/world_editor/common.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in SectionToModify::to_section at line 924. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/world_editor/common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/common.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"107b043ee47476d4eae214c4568aed064f5a5cca0f61704ea29a3049c90c805c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/elevation/postprocess.rs: src/elevation/postprocess.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in arnis::elevation::postprocess::level_water_surfaces at line 330. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/elevation/postprocess.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/postprocess.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"feafc0041ac5b5762b924ebcd608dbec9e0ab0358e0fd362d9d3d7a7bd336d64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/osm_tiles.rs: src/osm_tiles.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in arnis::osm_tiles::read_tiles at line 331. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/osm_tiles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/osm_tiles.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"612126734c7ceed6dc05ccda400c33f79271bd0c8864cbab2ae6c9d2d9b91417"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/retrieve_data.rs: src/retrieve_data.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in arnis::retrieve_data::fetch_data_from_overpass at line 353. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/retrieve_data.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/retrieve_data.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a05163b56ffc68032a99562c5c771fd5b3198a729372a98870b8cf3d5378079"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/floodfill_cache.rs: src/floodfill_cache.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FloodFillCache::collect_building_footprints at line 746. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/floodfill_cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/floodfill_cache.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"501798d88c3441912d0968c8f4a08fd5c2546c11c4feae6719efca2707b033a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/tree.rs: src/element_processing/tree.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in Tree::build at line 643. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/tree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/tree.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1801db240b4cabf0fb302f865525342340f8662c392b6b53ec8aeddcee17a74d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/railways.rs: src/element_processing/railways.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in arnis::element_processing::railways::generate_rail_bridge at line 966. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/railways.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/railways.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c142ed105da5f354acd61b7a7da8a068469aa3f5b64b84bc5082ad3070faed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/leisure.rs: src/element_processing/leisure.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in arnis::element_processing::leisure::leisure_area at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/leisure.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/leisure.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"882d734da873489bc7b6f5279a6f81ff5738cc498600e4b227d335538c5c5e55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/world_editor/java.rs: src/world_editor/java.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in arnis::world_editor::java::write_region_to_disk at line 372. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/world_editor/java.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/world_editor/java.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0d08699f8e2f2e000c45d5f55c771ae987b1de1a40b82c050ba4bc96fe6ec9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ground.rs: src/ground.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Ground::new_enabled at line 424. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/ground.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ground.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b85227f36fa393aa418c320677eb781c99b1c8a0a5fa7d66d04ebb4b14a7f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/building_facade.rs: src/element_processing/building_facade.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in arnis::element_processing::building_facade::compute_facade_plan at line 196. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/building_facade.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/building_facade.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c3fdc27f6e2c0279151f3460cf25d0a0f65ffdbab4f0b5c37ffabe15dac82b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/road_markings.rs: src/element_processing/road_markings.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in RoadMarkingIndex::resolve_junction at line 996. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/road_markings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/road_markings.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"439202ee1e175e590007570d405942eb8bcf599c57714dcea58de39a022897aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/water_depth.rs: src/water_depth.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in arnis::water_depth::carve_water_column at line 383. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/water_depth.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/water_depth.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ea400ec552df355db6c6087b25a776424eace61e89f97897d2c9c4f3efdc1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/amenities.rs: src/element_processing/amenities.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in arnis::element_processing::amenities::generate_amenities at line 19. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/amenities.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/amenities.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4397b67c0e022ff118bf680cc901ed997ba0466a6b1c4918818d6428714035f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/barriers.rs: src/element_processing/barriers.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in arnis::element_processing::barriers::lay_out at line 336. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/barriers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/barriers.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9166cf16f2952808a6805d1d36ea2e08c061301682bb3d6de412001d285035"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/rooftops.rs: src/element_processing/rooftops.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in arnis::element_processing::rooftops::fit_out_roof at line 565. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/rooftops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/rooftops.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea337cd1b6017ab99386577ffde99d9bd0ccac13fcc63783a957362bca4c3591"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/overture/tiles.rs: src/overture/tiles.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in arnis::overture::tiles::collect_from_tiles at line 358. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/overture/tiles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overture/tiles.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"687cae1239e1cfc9e474704cc5402e5e6d807e1e87c36813ccab0fcd9fac9866"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/water_areas.rs: src/element_processing/water_areas.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in arnis::element_processing::water_areas::relation_rings at line 81. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/water_areas.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/water_areas.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bc756721851645ce16912bd1180830da3f1f1249ecfe25e910a6476d082e84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/map_renderer.rs: src/map_renderer.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PreviewAccumulator::ingest_region at line 116. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/map_renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_renderer.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9223fb1f6fac9fe8de698e773f0d4b6f8e61dca1a9c711797ea29d1e973110"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/trees/schematic.rs: src/trees/schematic.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in arnis::trees::schematic::place_schematic_tree at line 353. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/trees/schematic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/schematic.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a07a7080a9d4604c11b7e9451be10c26ceb564c0e483484b40523e4be404707"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mapillary/fetch.rs: src/mapillary/fetch.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in arnis::mapillary::fetch::fetch_metadata at line 649. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/mapillary/fetch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/fetch.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e37564570669e69838a0616dbcee38e87cd9e1d32ddc37a634dd6f997fe46fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/trees/region.rs: src/trees/region.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RegionLibrary::pick_slot at line 1172. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/trees/region.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/trees/region.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"55852fe56e76b79375e3b6e6c690d57502b826a730d251b65cc7074f6dcc4960"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/landmarks.rs: src/landmarks.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in arnis::landmarks::place_one at line 550. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/landmarks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/landmarks.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3e057eb800b09a57720ae34769cf53fa4d322411408b44bfa2d762655aca6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/one_world.rs: src/one_world.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in arnis::one_world::resolve at line 372. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/one_world.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/one_world.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2228aa450f92d5302d64d425661ed913770348e371e42b5e7590c0250d4111e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/land_cover/osm_water_override.rs: src/land_cover/osm_water_override.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in arnis::land_cover::osm_water_override::apply_osm_water_override at line 27. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/land_cover/osm_water_override.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/osm_water_override.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cac9d44026018013979672a477e5862804add550c189d330f22602d32e3f92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/datapack/mod.rs: src/datapack/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in arnis::datapack::files at line 618. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/datapack/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d8840db4f433a6472fe37772c10f55153eecfddeaf36ed6ff9045dbb1da4a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/models_3d/voxelize.rs: src/models_3d/voxelize.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in arnis::models_3d::voxelize::accumulate_glb at line 451. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/models_3d/voxelize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/voxelize.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba53f79c6ae5a5fc4d63b1dd0e88b7838f57687384d47c6d262144c48a06ce4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/map_transformation/rotate/rotator.rs: src/map_transformation/rotate/rotator.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in arnis::map_transformation::rotate::rotator::rotate_ground_data at line 253. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/map_transformation/rotate/rotator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/rotate/rotator.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63d549406f2397c330b3f252a8e27bd500b6d9b0b45cc8a5a06a224df03e71f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/climate.rs: src/climate.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Climate::surface_palette at line 76. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/climate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/climate.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fdce82f461f26bbd09c864e336f469f410ebc23ff62e9420d8c3b8bbdc0bf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/bridge_modules.rs: src/element_processing/bridge_modules.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in arnis::element_processing::bridge_modules::sweep_module at line 202. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/bridge_modules.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridge_modules.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a3e1febeb52effbf510dce6438302c3e944b300772686df6aff48b095f641e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/subprocessor/interior/index.rs: src/element_processing/subprocessor/interior/index.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in InteriorUseIndex::build at line 286. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/subprocessor/interior/index.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/index.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee45375de018d4ff9e3d6d17edf6219fbc23145f5c4b09cf129d6abfbac1d1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/man_made.rs: src/element_processing/man_made.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in arnis::element_processing::man_made::generate_chimney at line 343. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/man_made.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/man_made.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5e8337b1eec3fe24be4ac99514efdfdf8eec6d0fdee1880695b4d634f374bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/subprocessor/interior/mod.rs: src/element_processing/subprocessor/interior/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in arnis::element_processing::subprocessor::interior::generate_building_interior at line 68. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/subprocessor/interior/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/subprocessor/interior/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"157fef24cfe3b97b7dd24dedccc769e04bad578d3aea011f95e4ed88e1a7debb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/fuel_stations.rs: src/element_processing/fuel_stations.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FuelIndex::build at line 465. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/fuel_stations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/fuel_stations.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938995f0b74bf4902e6305f5758d953447b9949e6b045f07fc60ccab63fc34d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/element_processing/waterfront.rs: src/element_processing/waterfront.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in arnis::element_processing::waterfront::generate_breakwater at line 538. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 23:20:18 \u002B01:00\u0027 --until=\u00272026-10-26 23:20:18 \u002B01:00\u0027 --full-history --no-merges -- src/element_processing/waterfront.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/waterfront.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1195238e585ddf761eb7134c632d55baa42903974c63393085a4ba60248765"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // The --gui flag isn\u0027t used here, ugh. TODO clean up main.rs and its argparse usage. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"02879f5c0d68ff5ffefb532de5a88a0489de4631dc593c83ee7c2891693c3059"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ice for Ice Rink, needs building defined \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/leisure.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11fa275e0ebb7d28f306019366f60c494262560df53c03bea9115a7b7e991a1"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (214033 LoC, 604 module-visible types across 36 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ac34e3d8f22e2ec377ca5e1cecc61287d974ee4c381ff3b3545b700a432f2de"},"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":"9c895afe0a6bcc3ffe867905c0a4676f0a424998d95d7b57c2a34ed0e0ffccd5"},"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db37d7e0e1b727fa66ed9ccd3ef147fcf5e15de43dcd0ddb195b18d53c19d8f4"},"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":"26af77b6e8b023c8bd4268acb70a21ff2d59c7c4849b0f6a9defc8c4213fccde"},"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":"13787c03fc363e53341c579cc7333caff4564d9d291d6378248a90a14bf1667b"},"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":"e58cee3fba6c8d9e6615f7d25dbd00e710c9bddafdb19b9780c18a233a6a1cad"},"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":"6921c7c1762459e7c97cfd26746d7afcdb93da689b7fd3136ff3b15d24003914"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"232df22eb57dc1b97e6c5d05046b430a6e5321ef0ed483f5f2f5f2e94283b071"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"fda30dfced85ef978e455b42809b12036e90b9c68eeea6bec072893ecc3d5991"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"ce1dfd3265bdb1bd0d10f348a94b0e843c15f1078a788a6f4293f8949b42e11c"},"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":"27edaa82866d1f27bd06de4b2b88b7b1cf595dea33d5bbccc436aa494cd2e221"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"c3b16cd024a363e3dadfdcab34ecaf26be98576ce7587ec213f4ad4d5805ef0b"},"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":"d169f7cd4e5efc17ee1ad9b17711527e2a4be0e7490e584552bba35dc46fa3ae"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"f0c18c25343ecc5756cbbd33f580cf1e3b084292b7d6f95b00fc4576bc57ab9c"},"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":"a79daa86224e22345cc8a417dc0612109e1cbc5ed61dc16d593f8316461d5a47"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"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":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"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":"04b15c1d822501a1f3b0513e178960337673a790f4f183f2453907ced2d2833f"},"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":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"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":"59bdb5a1e8e9e2536fc49c741fcb4259a61a8678fc811d3adeb596662203897f"},"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":"9e05a9afdb159c3b4e03fba36ee6c997dfff609cf8e7411f86b673ca79d09a53"},"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":"1d11b483dfcf915b1cf80342d758e26c1a3f32b269afb2615b61f8aa4d116443"},"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":"d3863a2595bb228753ae718bfb2db02eb99929aa10f09e1bd606c6259c16041d"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"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":"428265af1f01021cc8b5f639a34cd657843f8d845cc261d9ca94a393d0145e47"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","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":"be9977d5d7ddb867e7f2e9fb5ad301e217dd9c03427d8e948d094761434f4502"},"properties":{"dependency":{"package":"jsonwebtoken","version":"9.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.7","advisory":"RUSTSEC-2026-0383","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"610868c659b2bc4a0ea5bd7cebeddb1d8961b8ebb7c9f31dcc75e07badfe1d8f"},"properties":{"dependency":{"package":"unic-char-range","version":"0.9.0","advisory":"RUSTSEC-2025-0075","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"9a9761ad8cbbcee9fd4b4bb09fc1e6e6977230d7588402bc8497b52c5027e99e"},"properties":{"dependency":{"package":"unic-common","version":"0.9.0","advisory":"RUSTSEC-2025-0080","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d3f6b0dc7d0843f1539cb8274e739376fd4b1be6c39d73c3f6b7e78cb5af4d8b"},"properties":{"dependency":{"package":"unic-char-property","version":"0.9.0","advisory":"RUSTSEC-2025-0081","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"b269e07aa3d9bfb90d59d794c0e6a0b7849b288910031fdd0fe253514c3af463"},"properties":{"dependency":{"package":"unic-ucd-version","version":"0.9.0","advisory":"RUSTSEC-2025-0098","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"355ee9fdba8596d452516a609f795a54a5bca0f7ed0289c67e6ddbc4bddd9ada"},"properties":{"dependency":{"package":"unic-ucd-ident","version":"0.9.0","advisory":"RUSTSEC-2025-0100","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.52.3","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.43","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"02807c2340c313bd085553cef2aa54725b58db377d04241d3195bea3a23b7783"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"f33134b914692cd6c5f119efdf542f3d6c34c918da971c9cc600e5d39c46efde"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"RUSTSEC-2026-0235","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.14","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"2f88d3a70d29acb7742d775c7077dafff055d53d623adea4448751985efe8ee1"},"properties":{"dependency":{"package":"zip","version":"0.6.6","advisory":"RUSTSEC-2026-0367","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0368","RUSTSEC-2026-0369"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 218 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 218 of the 257 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/map_transformation/operator.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_transformation/operator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e4e6c9d47eff6ebd71a7b5df26552861ed9cdf524a5ac37aad8b64aaac388"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: gui.rs \u2194 test_utilities.rs: \u0060src/gui.rs\u0060 and \u0060src/test_utilities.rs\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 8 shared commits counted here, the most recent 3 are \u0060d011e9f2\u0060 Sort landuse last in the CLI too; \u00608da429b5\u0060 Unique color and style across several building parts; \u00606cf8d540\u0060 Spatial tile parallelization \u002B Web Mercator projection \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce31025cfa71a16b8398b8275ae677b088920e5ebd2bb9091374e755685a4760"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: landuse.rs \u2194 natural.rs: \u0060src/element_processing/landuse.rs\u0060 and \u0060src/element_processing/natural.rs\u0060 change together 65% of the time (42 of the 65 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 42 shared commits counted here, the most recent 3 are \u0060ccf65548\u0060 Fix review findings in relation holes and blank roles; \u0060b535cf39\u0060 Cut the inner rings out of landuse, natural and park relations; \u0060eb1fe3d0\u0060 Skip only the landuse and natural cells an editor does not own \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b53740a86af3bcdf0684efdf34c74b309bfbdee91625dded9e88f653a0011c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: data_processing.rs \u2194 schematic.rs: \u0060src/data_processing.rs\u0060 and \u0060src/structures/schematic.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006094143f22\u0060 Keep bridge pillars, count waterlogged neighbours, skip frozen rivers; \u006032f57a65\u0060 Memory and time improvements; \u00600224475f\u0060 Add better plane schems and jetbridge \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"391a1eebf8e6a9c607026c67b8241043c9145726cb34e6550914763f815ae8d3"}},{"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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","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":"7ad4701c91f7eaa24aa7b7536975da3068c18dd1ab098025ae5c285286432c8e"},"taxa":[{"id":"CICD-SEC-6","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":"5337ed8c183624b514a002a662a500a8d4e865f421fbafb951ee22e200b825bf"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":5857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3383ac6b4014c91f4c4bb6b9ad9b69429f6d0b290988849aedb42d6aaf0cc94"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":7011}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac67ce90ee52cddbe0f0dd049bd95ea1c6d0536c7051df900ff66876625b7cc"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":7014}}}],"partialFingerprints":{"codehealthFindingId/v1":"95550e4098c0de92098935359bc001a6f459c2458b43c5a70921d3401532a7c4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37a331c5930fbf7ea6fdf5620fb2968e372910d412b8ca558b513cd035ed7ea"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":4040}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b94ab5d460477338ebc0c5e3c68fe0c039e129ede5780577ce96cb3b904b956"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"e711e581d665ac2671349fc2fd7f8c3876ac06248cf34e8278b76057a3aa365c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":4193}}}],"partialFingerprints":{"codehealthFindingId/v1":"945f121036b628bf7f0cf0c35835febc3f8dc2bbf6d924d95bf401743aa59d37"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":5854}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ed6827510ce1324471c23f30a55b6abb866f8d1a5153491f9c2de38bfd9bde"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":5855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6436e023ddf60c749ec0fc590be152bd1a8409691cd42129e98c70e860dda27"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":5819}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb3737c5547cd6dffe36040241aed7b04172761f0f1ea8000015b770464be4c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":6438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6673c2400bb76143b9cdede5597055842fc69899c3ea28888fd3cc461cf1701c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":7013}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff82baeac3ae63fbae56e6ddfc1987b902d208d05569e883674b5587d6ce763e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":7096}}}],"partialFingerprints":{"codehealthFindingId/v1":"463d25e186aa0d61b45bf77baf7ed4dc100b00cdd7da29c3e335c883d7951970"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":8579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a297c5a2b0be61df68f1221610489667d93d32c5d5892b5a66eb1422726697ff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":8613}}}],"partialFingerprints":{"codehealthFindingId/v1":"7743ddcc624a15579a2aafddeae27f6e7003de2bf46dbd32ef59204cbeef55a8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":9161}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5eef60813839deb93a076ddcc2519cc55c49014200c21d69d06cad5a636ec4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":9238}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdec3b83b15afc1ba2a6691c07e72cd572bd626d1695df9065139a10074df1f"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":10422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e061fe46de83762e09cd7bfdc0248028fa41c66b40fbd12daf93fa5ae72d4fa0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":11034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5dda96a5f0b7276f9ba85fff363d3bb0580fa302674b2d1b41def11ffb0743"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/maps.html"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b885a8083d30a14b1be27ec03ac53d7fbe85c992701a33130942ae15c515ea7d"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c9086e5d70dbf958b7f57f61a5fddf69162ce1f9f37901188ab0184330efb9"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Ciframe\u003E without a title: An iframe with no title (or an empty one) is announced only as \u0022frame\u0022. Add a non-empty title describing its content, or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":7118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0433e1ca5606dd5157cb65889406ad9f3f983f3a8169cd427ca2ea995767b30"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/maps.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e83b0571bd620afa69b45076e41b1036cd720a0781a01a65bcd222cf0ca865"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/maps.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec085d8455c83d9c103cda2bdb3b4488736aa539a369ecda3713e89017e5862"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/maps.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd76093d6f99e076e9a562c095f1bec96dc8ce5a6f439dcd6d6f21edc016e8d2"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/index.html"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb62126b906e5c0bbe3b1d338b1f48147ecf45e56f97c040cf18e78135ad11fe"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .coordinate-context-menu-item with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/bbox.js"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0900748dd01599ba9d9c39b33115c429da4cea0ea01e43bb03122e3e2c696280"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdce0a4662f013619b8ba5493296904f2000346807dbcba97ac3c8caca100b50"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cfdc2976263901d61c6fa532dfa7b0659dd953aad6d66ec7a64887dd00bfe1"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":6327}}}],"partialFingerprints":{"codehealthFindingId/v1":"573e2c7c36def9fa99d3a28efac8c59e0a23a9cfb0feb2da0f7839cc0faba278"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":8429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e323c8b4b621d4d774e7e137b30e61cd297cb6b1093f663a904e38229d0162"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":8431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7834291e96a8e0c2849baa979e5d8d2169d2f1992c0570ef94c49f4a36b62e49"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":8439}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e7fff27953bcdff28a27598eef1cb2178e0e717fbfd9b45ea26d5453d8b582"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":8441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1500d41f16c48e3d1fcea53fedd24ca0d357e4b9af36a93ed3bd7c48ff5c57d0"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":11251}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a0ea4341b45e605c0986f530b45c983951dc6e012ec64bffb0251a3fddce9d"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":11254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2495f1d63da83eccfd7625b4654606e363495b6e0f6d2e37ace549b3c99849"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":12366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2d15d13085acc96b95d189ea3a8601f2bcc693c9eb5eb6f7d1e238e07816fa"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .search-result-item with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/search.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd38359352b54841ed88217cb6546b5e48524f6924bd41134bd5116741cd2a3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (1.7:1): \u0060.leaflet-bar a.leaflet-disabled\u0060 sets color: #bbb on background-color: #f4f4f4 \u2014 1.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/leaflet.css"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"769b01d2ce712b8b507edc1e7da7ce04410eed2a4c6b1578ef44c1ee87c58e0c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.leaflet-draw-actions a\u0060 sets color: #FFF on background-color: #919187 \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/leaflet.draw.css"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"189be558bcc0c8969d32ee553d31ae26751c58f675fbe034830a156158ac2766"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.world-name-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/styles.css"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec7d012d8785bfc4999bac0345a1a7a9c8c7cebc931905a5019d1e33bc48569"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.ui-helper-reset\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/libs/ui-lightness/jquery-ui-1.10.3.custom.css"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47d1e33b2bd0b2c890105d0959e4b7d9de5e967cd0f969d9c401b28569224fc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.ui-dialog\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/libs/ui-lightness/jquery-ui-1.10.3.custom.css"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"34af7572930c89fa7f62eb11bb2ddea6135790b155e908b1d36ffa0c3e080fc3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.ui-menu\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/libs/ui-lightness/jquery-ui-1.10.3.custom.css"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"41701d385ab9df6eb1e121d04c477cedab215289a0fc988b498bb275cdc172c2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.bbox-hint-overlay\u0060 moves (\u0060animation: hintFadeIn 0.5s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/bbox.css"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"59778fed68652d3bfb50aa5defb66dca45e8938588b2b4fbbc7e6f75177279d9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.preview3d-mini-loader-bar::after\u0060 moves (\u0060animation: preview3d-loader-sheen 2s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/preview3d.css"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8966e4cbdad472c3f00758635c0fc224eac98dabe002f9106f0107164b6d3d82"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.github-link\u0060 moves (\u0060transition: transform 0.2s ease, opacity 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/settings.css"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa40f055b871b01024ae1c084cd225d1bc722b72a8443b529d4d82d704c44bd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.progress-bar\u0060 moves (\u0060transition: width 0.4s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/styles.css"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d688a131efd03f0c3e109c3937391b7f117204e43761395661c92f24def34db"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#arnis-logo\u0060 moves (\u0060animation: zoomInLogo 1.2s cubic-bezier(0.34, 1.56, 0.64, 1) forwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/styles.css"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"a130c96471caac0b9900a75d767a9a2cd18c85a0a42fa977477d55104d91e6f2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.leaflet-zoom-anim .leaflet-zoom-animated\u0060 moves (\u0060transition: transform 0.25s cubic-bezier(0,0,0.25,1)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/leaflet.css"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33affb9ac2fe3ef1799cd17b608ea8a0d8db1c70c86e856a6dfcdf60b8bc332"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.leaflet-sidebar.left\u0060 moves (\u0060transition: left 0.5s, width 0.5s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/leaflet.sidebar.css"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2b3243fa1dc5945dffcdbb65bda0d22969b609c341e020e3d6d4a66d28c932"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.leaflet-sidebar.right\u0060 moves (\u0060transition: right 0.5s, width 0.5s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/leaflet.sidebar.css"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c11e294a682a281fe1d0a1d1ceaaa63a8c095e6a8a2840bb4af3ac2d39ee90"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.leaflet-left\u0060 moves (\u0060transition: left 0.5s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/leaflet.sidebar.css"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"526431f764c6ceb933477223623ef03e592312057c7cb3095242f8279b224680"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.leaflet-right\u0060 moves (\u0060transition: right 0.5s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/leaflet.sidebar.css"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e818ad8106f7a84a8b4960295393ff0b98cd5e9c66c584995125b7a485256adc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.maplibregl-ctrl button.maplibregl-ctrl-geolocate.maplibregl-ctrl-geolocate-waiting .maplibregl-ctrl-icon\u0060 moves (\u0060animation: maplibregl-spin 2s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/maplibre-gl.css"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53d42246deb49dcdd40ab22f761ddcc0ec6f17c2d631c004207a18bae81307e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.maplibregl-user-location-dot:before\u0060 moves (\u0060animation: maplibregl-user-location-dot-pulse 2s infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/css/maps/maplibre-gl.css"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cace76f5208ea37483e42aabc44f22aae43de8fa2fcaba188ed4bae7920af9a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060).animate()\u0060 moves (\u0060Web Animations API keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-ui-1.10.3.custom.js"},"region":{"startLine":14333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc3f6df58ba2a7368aa10a2d5277d9a7c9c41e85df99024a686c757ea4a21d5"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 8 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof define === \u0027function\u0027 \u0026\u0026 define.amd\u0060 appears character-identically in 2 files \u2014 src/gui/js/maps/leaflet-maplibre-gl.js, src/gui/js/maps/proj4leaflet.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/maps/leaflet-maplibre-gl.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e79936443a27569cf0cfa1a16a17a1744e3e4b62d933c6e0d053aa64a34d0b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!editor.in_bounds(x, z) \u0026\u0026 !editor.owns(x, z)\u0060 appears character-identically in 2 files \u2014 src/element_processing/landuse.rs, src/element_processing/natural.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/landuse.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cff31c293f4328f996a7a398848a0765ab68dcdaa56b997b8026a5ddf92976"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!tags.contains_key(\u0022building\u0022) \u0026\u0026 !tags.contains_key(\u0022building:part\u0022)\u0060 appears character-identically in 3 files \u2014 src/models_3d/three_dmr/placement.rs, src/models_3d/wikidata/placement.rs, src/overture/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/models_3d/three_dmr/placement.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"21480553ff024f46cb135a12bdcbdf514d3e70cda3d3b2d9f367ab1caaf8f66a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!w.tags.contains_key(\u0022highway\u0022) || w.nodes.len() \u003C 2\u0060 appears character-identically in 2 files \u2014 src/element_processing/bridges.rs, src/element_processing/highways.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/bridges.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ccfbfc007cab51fd71dfca53370737eeab8b6c8a78c7ca0db759d32c7fbc80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.disable_height_limit \u0026\u0026 session.created\u0060 appears character-identically in 2 files \u2014 src/gui.rs, src/main.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b7b5305aad9b8ce25406ffb5410790f3e230a40b6a36684089a45f9837cab2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first.id == last.id || ((first.x - last.x).abs() \u003C= 1 \u0026\u0026 (first.z - last.z).abs() \u003C= 1)\u0060 appears character-identically in 4 files \u2014 src/clipping.rs, src/element_processing/buildings.rs, src/element_processing/water_areas.rs, src/land_cover/osm_land_override.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/clipping.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc090d44715ddf19079ad2b56b473b69e8a8ec4592ae0f4534996d35b6035b05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060indices.is_empty() || !editor.place_schematics()\u0060 appears character-identically in 2 files \u2014 src/landmarks.rs, src/structures/plane.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/landmarks.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bcee3b54d13a4bb28719ca2ed213ff78dc178604c215c6fa38d118562074e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.ends_with(\u0022_block\u0022) || n.ends_with(\u0022_stem\u0022)\u0060 appears character-identically in 2 files \u2014 src/datapack/disasters.rs, src/world_editor/java.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/datapack/disasters.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e8ac5bc0ed9db85c9085b94ef15a44e2a245a38480231ec3dd57a090ee5945"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060placed.len() \u003C target \u0026\u0026 t \u003C max_attempts\u0060 appears character-identically in 2 files \u2014 src/structures/excavator.rs, src/structures/playground.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/excavator.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1249b5f3b1d73a31dfa9aadcb07d7fe99b5134885f46cdedc137cf18edadcd71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tags.contains_key(\u0022building\u0022) || tags.contains_key(\u0022building:part\u0022)\u0060 appears character-identically in 4 files \u2014 src/element_processing/attractions.rs, src/landmarks.rs, src/models_3d/custom/stadium.rs, src/osm_parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/attractions.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d384511cf094dee280c701f3fdb827c6fd894e4dd586c4518f8f9d9918258da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060way.nodes.len() \u003E 2 \u0026\u0026 way.nodes[0].id == way.nodes[way.nodes.len() - 1].id\u0060 appears character-identically in 2 files \u2014 src/element_processing/cars.rs, src/element_processing/road_markings.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/cars.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"224e6b8fbd5dea06ead5045662e00c75b619a0cb577a8f961232627a43b11cce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060way.tags.contains_key(\u0022building\u0022) || way.tags.contains_key(\u0022building:part\u0022)\u0060 appears character-identically in 2 files \u2014 src/data_processing.rs, src/floodfill_cache.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data_processing.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f506efdaabb612759bd9483112ca4c711b2464c549bac4896209ef92f03b6bee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width \u003C 2 || height \u003C 2 || world_width \u003C 2 || world_height \u003C 2\u0060 appears character-identically in 3 files \u2014 src/land_cover/bridge_repair.rs, src/land_cover/osm_land_override.rs, src/land_cover/osm_water_override.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/land_cover/bridge_repair.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18e44c6b033ec1660b46b408aff11820c612d71220e78a8e0ddb8cf7ac612d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width \u003C= 0 || height \u003C= 0 || length \u003C= 0\u0060 appears character-identically in 2 files \u2014 src/structures/schematic.rs, src/trees/schematic.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structures/schematic.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a72391a1ba39aa634b85d9361810dd9e7c1f1899f6e4e069d9754d357602c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003C 0 || y \u003C 0 || x as usize \u003E= self.w || y as usize \u003E= self.h\u0060 appears character-identically in 2 files \u2014 src/mapillary/imgops.rs, src/mapillary/refine.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/imgops.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b16655c1ab8e99819ccb5ed8e483d5c9c5072a14bd5599ff55f7126b76dca6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003E= self.min_x \u0026\u0026 x \u003C= self.max_x \u0026\u0026 z \u003E= self.min_z \u0026\u0026 z \u003C= self.max_z\u0060 appears character-identically in 4 files \u2014 src/caves/shape.rs, src/models_3d/custom/stadium.rs, src/models_3d/three_dmr/placement.rs, src/models_3d/wikidata/placement.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/caves/shape.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf6372980e89f3ff3c39996fa85cd8d4de56d2bb60e1e2fbc3b4d22f79f0f0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060summary\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/signage.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfff3d0c1673e2166b1a4d0a8f7eab9101ce7d24236dbc31e3d02dfcd659a5c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060dir_size_bytes\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/elevation/cache.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b02098a685d8b092a1135b2492a37caaaeae2b1e5966d85243b751c9fd3efe6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060dir_size_bytes\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/cache.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc47b98557aae957e8c6d34fe7c5add71e439b5f8b6e94b0f6844e6ec32d2b38"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060exports_newest_first\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mapillary/facades.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db6d358c19245cc54a2c9f3d02a9f90b4a398070ddd335c4d41f21653722aad"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060assert\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/libs/jquery-1.9.1.js"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b9bfa7822493cf71de27cc0fb4f42539eb75d509c32d6edc91d94a5f327379"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOneWorldRestore\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gui/js/main.js"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"2279b84b10a5a016a5afcbfe3089e8575f983252a9d2441e8b3768e8164a5633"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name.contains(\u0022netherrack\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name.contains(\u0022netherrack\u0022)\u0060 also satisfies \u0060name.contains(\u0022nether\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/map_renderer.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cc9236016d3e18ca85b5ca28b412acaecf6e5258a304b701cf415a25c7f2fc"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name.contains(\u0022potted\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name.contains(\u0022potted\u0022)\u0060 also satisfies \u0060name.contains(\u0022pot\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/element_processing/buildings.rs"},"region":{"startLine":22654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbe4f865ae881cead9237e475547c1eb5ecddde0fac64c6ecf4898a334bd690"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.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-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"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":69,"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."]}]}