{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"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":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"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":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"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":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"PackFileContentsSlots::new (cyclomatic 266): PackFileContentsSlots::new has cyclomatic complexity 266 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bafa29e87fc4b09467af109c5248c2aabbe56eabb055f6b11d180f5fffe5ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUISlots::new (cyclomatic 146): AppUISlots::new 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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"14979633bb9e4f3da4c8ee9acc4ceb5739054e00cab13e1c8668a48ced7ba256"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::generate_automatic_patches (cyclomatic 135): Dependencies::generate_automatic_patches has cyclomatic complexity 135 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b8005c90e6d61b34d22c45d390d0376a42246d7debee0ea93911f17dfc0858"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_server::ceo_builder::build_ceo_entries (cyclomatic 130): rpfm_server::ceo_builder::build_ceo_entries has cyclomatic complexity 130 (threshold 15). To reduce it, separate the cases: extract each independent 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 shape REPEATS in the file: one other method here (rpfm_server::ceo_builder::build_ceo_entries::insert_row) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f339d0518e45b5312a77177861c89b889ce9e9f3afc00af45944b7aca10adbdc"}},{"ruleId":"D1","level":"warning","message":{"text":"DecodedData::convert_between_types (cyclomatic 121): DecodedData::convert_between_types has cyclomatic complexity 121 (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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"444b4ad98a53d41466604bca972a9812bfb99c263798699ab35eef7913fbcd4b"}},{"ruleId":"D1","level":"warning","message":{"text":"SoundBankDatabase::read_sho2 (cyclomatic 112): SoundBankDatabase::read_sho2 has cyclomatic complexity 112 (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. This shape REPEATS in the file: one other method here (SoundBankDatabase::write_sho2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/games/sho2.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e0e118506d77a2b9dd417469b25fe67efa7224abacf9eb09acb6cc8c32a266"}},{"ruleId":"D1","level":"warning","message":{"text":"SoundBankDatabase::write_sho2 (cyclomatic 112): SoundBankDatabase::write_sho2 has cyclomatic complexity 112 (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. This shape REPEATS in the file: one other method here (SoundBankDatabase::read_sho2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/games/sho2.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13afdb9156b36354b7604be6f01dccd1b5c1c9105fd2573311be51ede42930a"}},{"ruleId":"D1","level":"warning","message":{"text":"TableViewSlots::new (cyclomatic 104): TableViewSlots::new has cyclomatic complexity 104 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d0778faddfef37c56f1b695c4f48afbbe14325bc0a3923137bd67d218f2f33"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::open_packedfile (cyclomatic 99): AppUI::open_packedfile has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e2d17928df03f53c383be73e380a9284118020da103e54e2c07b76773fd22a"}},{"ruleId":"D1","level":"warning","message":{"text":"ESFDetailedView::save_from_detailed_view (cyclomatic 99): ESFDetailedView::save_from_detailed_view has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"5508e1880af6eb54ac14b1ff4b6912c68548041089a79cdfb0b088fcae5413b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ESF::read_node (cyclomatic 95): ESF::read_node has cyclomatic complexity 95 (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":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c81913fbb2da94c176a64a04e35b2dc76c1b1085cbb7ac49e43ce443e1c2cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"TableDiagnostic::check_db (cyclomatic 92): TableDiagnostic::check_db has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac899d6e6e84c687aa782891feadea5bb206cc88a199b23333f3d092886ff09"}},{"ruleId":"D1","level":"warning","message":{"text":"PackedFileDecoderView::import_from_assembly_kit (cyclomatic 84): PackedFileDecoderView::import_from_assembly_kit has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0cacf6e9d9d5165e1f15d79366ff0d824e90c3501c719c0a91f08c7fe3ef7e"}},{"ruleId":"D1","level":"warning","message":{"text":"ESF::save_node (cyclomatic 82): ESF::save_node has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c4bef4f433dc3a3a970ee931141e8c74cc526ec737534d31e7c4eaa03ca00a"}},{"ruleId":"D1","level":"warning","message":{"text":"Matches::find_matches (cyclomatic 71): Matches::find_matches has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c77b23a86a68ee23e0077fe366cc47649f307e6bb4052c7d67f9a136e4841e"}},{"ruleId":"D1","level":"warning","message":{"text":"RFile::decode (cyclomatic 71): RFile::decode has cyclomatic complexity 71 (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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed34727f22639de03daa236ef89fa9f60b11e91083ad1a6770cde497e496e7"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalSearch::replace (cyclomatic 66): GlobalSearch::replace 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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"651ec3a98980d2aeede9af8f8de215d7cd6da56faa91965835a6f7e8706021fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::optimize (cyclomatic 65): Pack::optimize 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":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64fdee066eff2ef170e647727a720c8479843fe5db4ebb695a39f36109427e4"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsUI::open_match (cyclomatic 61): DiagnosticsUI::open_match has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8b5ba598e1e2dcbd3eff4f28b91cd4795d578222790adf60ce8928ff01c33c"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalSearchUI::open_match (cyclomatic 58): GlobalSearchUI::open_match has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f3504bbc3d200db402e301d97bd6506afb7356903496fb1301e641716021b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Icons::icon (cyclomatic 58): Icons::icon has cyclomatic complexity 58 (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":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27f3f3e78827bf2cff2ff5e9396132d7c2225e1ce3ead0b22ce75c7dd75a48d"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::build_starpos_post (cyclomatic 57): Dependencies::build_starpos_post has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e02016a6fb9ec4feb943ddc3794db6c6a2f455c73d966f44c03ace0b00c8b3"}},{"ruleId":"D1","level":"warning","message":{"text":"DB::generate_twad_key_deletes_keys (cyclomatic 56): DB::generate_twad_key_deletes_keys has cyclomatic complexity 56 (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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2193867647c9676c50e74560db6dfcd6880a1a696ca930d5a91db36b75d6b7"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_lib::files::table::encode_table (cyclomatic 56): rpfm_lib::files::table::encode_table has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec4e31bb86d4f21e81cf2189cee40ddfaaf5ed96168fbf9b79bf7fa3159dc7d"}},{"ruleId":"D1","level":"warning","message":{"text":"Diagnostics::check (cyclomatic 54): Diagnostics::check has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba85df1d9d39836697818bf7d2b27465b5af65ccf982cbcbc9bf423f1ffd769"}},{"ruleId":"D1","level":"warning","message":{"text":"TextDiagnostic::check (cyclomatic 52): TextDiagnostic::check 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":"rpfm_extensions/src/diagnostics/text.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43f949f617328cf86bebdd1b904ec5e39e0a09c69edd606e4fbabb459e83b99"}},{"ruleId":"D1","level":"warning","message":{"text":"Icons::set_standard_item_icon (cyclomatic 52): Icons::set_standard_item_icon has cyclomatic complexity 52 (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":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d5000b3daa4dd514386362c31d52e5cf90b844f89142a346cbb7b4ea0d7ff"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsUI::paint_diagnostics_to_view (cyclomatic 51): DiagnosticsUI::paint_diagnostics_to_view 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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fbf1a04c654fa1f6b0df6e49b5e2969c3b53f9102d31f9ed8486dba2df24d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::bruteforce_loc_key_order (cyclomatic 49): Dependencies::bruteforce_loc_key_order 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22a5b0368cf76efe6ffe3c0f80593631da37d4f7ff6b0658ffbfb2bd74946aa"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsUI::load_diagnostics_to_ui (cyclomatic 48): DiagnosticsUI::load_diagnostics_to_ui has cyclomatic complexity 48 (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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6956ea62cfc3c2f1483b0206457d52c2521a0a769b2d58243fab15018886085"}},{"ruleId":"D1","level":"warning","message":{"text":"FileView::reload (cyclomatic 47): FileView::reload 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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3c3d100843e1f36f972a7880efc6c87b6c784de855d72ee2297c875ac54e96"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::build_starpos_pre (cyclomatic 46): Dependencies::build_starpos_pre 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72f35d46d9b047d3d79258494ebba9fba96e88366b77ba9db938452749ee184"}},{"ruleId":"D1","level":"warning","message":{"text":"RawTable::to_table (cyclomatic 45): RawTable::to_table 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":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"be56ffafa9058603807bb9a57caa2f4b366d6553876deeb705e0a6fec3105059"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::set_data_on_cells (cyclomatic 45): TableView::set_data_on_cells 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99986383e16c920e5fe875bf0c14682af6d3df28dddec05e32839b905d78ca5"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::views::table::utils::build_columns (cyclomatic 43): rpfm_ui::views::table::utils::build_columns 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fcfbbc9855d315b9ef113d2cd54cd81bb12804a4cba3ab43b2db757843f19a"}},{"ruleId":"D1","level":"warning","message":{"text":"DecodedData::new_from_type_and_value (cyclomatic 42): DecodedData::new_from_type_and_value 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd0e735e28d7bb7ad2ba71008f9da52d66419f046d44f850af4f354d2a42904"}},{"ruleId":"D1","level":"warning","message":{"text":"RFile::encode (cyclomatic 41): RFile::encode 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"024c19fcb625cc7b7389abbed55a79a5778a2772209ec0f48d48f13436bb8057"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::new_row (cyclomatic 40): Table::new_row has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f735112f004e9f3fa04198ede35b7565abc6e52c08101752d4dfeb26146719f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolTranslator::new (cyclomatic 40): ToolTranslator::new has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"646b419a064f89851051e972421818858dcfd42ccc057c7f95bbda3b9b6683b5"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::views::table::utils::load_data (cyclomatic 40): rpfm_ui::views::table::utils::load_data has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8296cbdac81720cdf1f46b95a156e1ff352d0eb15d853e4e351fc749b96e4f37"}},{"ruleId":"D1","level":"warning","message":{"text":"RFile::guess_file_type (cyclomatic 39): RFile::guess_file_type has cyclomatic complexity 39 (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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55247db2eca9611d313d5cbb28930fd5a2b2ffd63cf4905647bc3b3d44edfb6"}},{"ruleId":"D1","level":"warning","message":{"text":"PackedFileDecoderViewSlots::new (cyclomatic 37): PackedFileDecoderViewSlots::new 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":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"06615fe33d3e8f6fc18ca8072c90bfadbc7c78a15c16353b8f533b3cf91c57ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::db_reference_data_generic (cyclomatic 36): Dependencies::db_reference_data_generic 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a414f528abd03044d281a4f36e505810752da7f8e6b809e9c0618f64b9005b"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalSearchUI::load_anim_fragment_battle_matches_to_ui (cyclomatic 35): GlobalSearchUI::load_anim_fragment_battle_matches_to_ui 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a858243893926a653bd7753eb9bc22960f8e5ecb1c262083f2a89c95101783"}},{"ruleId":"D1","level":"warning","message":{"text":"FileView::save (cyclomatic 35): FileView::save has cyclomatic complexity 35 (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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ca54e304113701cb45edb033669ed70bd61dd5ce047aa2f1be983e4a1f10b0"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimFragmentBattle::search (cyclomatic 34): AnimFragmentBattle::search has cyclomatic complexity 34 (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":"rpfm_extensions/src/search/anim_fragment_battle.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f42c64774215e21e11f8aa283634b2574e8cbd2d2c642312fd13870699cac5"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_lib::integrations::assembly_kit::update_schema_from_raw_files (cyclomatic 34): rpfm_lib::integrations::assembly_kit::update_schema_from_raw_files 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":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"064764851cc84398294881e8ff007e30be717b9952731b2a86b502ee4ab50096"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimFragmentBattleDiagnostic::check (cyclomatic 33): AnimFragmentBattleDiagnostic::check 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":"rpfm_extensions/src/diagnostics/anim_fragment_battle.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d435ae90606b838c2fb29d9c235c85ba8fa416d7d990c39850a313dece8a87a"}},{"ruleId":"D1","level":"warning","message":{"text":"PackTranslation::new (cyclomatic 33): PackTranslation::new 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":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10df87f17c87a69cb85d6f9a49d415d29a596f1044ac8cd264b4c820c578b27"}},{"ruleId":"D1","level":"warning","message":{"text":"PackedFileDecoderView::decode_data_by_fieldtype (cyclomatic 33): PackedFileDecoderView::decode_data_by_fieldtype has cyclomatic complexity 33 (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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"a416b9f4418132aa6055648fb0d4320513a9a36eb34e3ee078e3fb0721c0a0db"}},{"ruleId":"D1","level":"warning","message":{"text":"TableDiagnostic::check_loc (cyclomatic 32): TableDiagnostic::check_loc has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a403685b4c3d2779532e28fae6bf2be7d5e57c7fc0ca8c6f75dc4068ec190cb"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::new_file_dialog (cyclomatic 32): AppUI::new_file_dialog has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e6a38fb562d0ba52922a7493664ff63d3bf5a9bc2b7d791ada3c35a43a4ae7"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupFormationsSlots::new (cyclomatic 32): GroupFormationsSlots::new has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cc07e30d1fd4082b4fce1e5f8692d8a80b38ef48917fcf4a8b4040bdacf5f4"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::paste_as_it_fits (cyclomatic 32): TableView::paste_as_it_fits has cyclomatic complexity 32 (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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"267d430d5508bfad9c9a1c8bbdb6261522e2561806949c02fbfe579480004c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimFragmentBattle::from_table (cyclomatic 31): AnimFragmentBattle::from_table 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":"rpfm_lib/src/files/anim_fragment_battle/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb25cec87823bae512b9b7bcb9ba23ee6bcca604bbfa3f803d97a7d51cda57b"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_lib::files::table::decode_field (cyclomatic 31): rpfm_lib::files::table::decode_field 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9853d9f7c8ee7323ce05813e27ca922d69106be61dac3e6d7882e1c922fd8d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::app_ui::slots::handle_tab_current_changed (cyclomatic 31): rpfm_ui::app_ui::slots::handle_tab_current_changed 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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"583a44089469d68778b05ddf769324e1ad8dab084abd5ca19e460e5f84b4ed7c"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::views::table::utils::setup_item_delegates (cyclomatic 31): rpfm_ui::views::table::utils::setup_item_delegates 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbad864929437e87e854a6229d47955326efba79dbdd7f6cb8f1a41fb73cd80e"}},{"ruleId":"D1","level":"warning","message":{"text":"Diplomacy::new (cyclomatic 30): Diplomacy::new 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":"rpfm_extensions/src/startpos/world/diplomacy.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eff9ea38fdcb33af6f1122675e43ea4e5e6011bf8671451a2e39c2fa6e26a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool::load_definition_to_detailed_view_editor (cyclomatic 30): Tool::load_definition_to_detailed_view_editor 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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"658914d44789c7c96af9e6ec18347097011f6eb4e13bedd0859e1848ea86c63f"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::patch_column (cyclomatic 30): TableView::patch_column 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3519}}}],"partialFingerprints":{"codehealthFindingId/v1":"778ae9f85a61f072095286a9eafc28b82cde7aa0e07dba03c941879a01cf7223"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::update_from_raw_definition (cyclomatic 29): Definition::update_from_raw_definition 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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"610fefa2d798ce0197b38ac1c227dc4fa19d09cfb7e2a0c085f6f29473011fe1"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::new_view (cyclomatic 29): TableView::new_view has cyclomatic complexity 29 (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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca08c24ce891bfe0f7c8d94bc27ac6e8cb0bd251b837393d4d77695da19264e1"}},{"ruleId":"D1","level":"warning","message":{"text":"DB::cascade_edition (cyclomatic 28): DB::cascade_edition 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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"791d55e08a7fc4f3c49869b112117fea061811828be187887335a9a95bac34bc"}},{"ruleId":"D1","level":"warning","message":{"text":"PackedFileDecoderView::get_fields_from_view (cyclomatic 28): PackedFileDecoderView::get_fields_from_view 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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0837b4fa2eb53415de51a94408aa47b2213d3529cbd7d323b892af8c57010b2"}},{"ruleId":"D1","level":"warning","message":{"text":"UI::finish_online_init (cyclomatic 28): UI::finish_online_init 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":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31bc6119c0e89ed573ebf3a99d44628b65f45b4578535131039fd32488a7cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"RawDefinition::read_all (cyclomatic 27): RawDefinition::read_all 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":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bb78e7cc1812f69f3003c3b5eb176318f987e971162f6cb9b371fc6485fe60"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::build_open_mymod_submenus (cyclomatic 27): AppUI::build_open_mymod_submenus 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43e9af414e88e22cf99acf5e94a92ab4719b7558be4520333e16309a3d8ea33"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalSearchUI::load_portrait_settings_matches_to_ui (cyclomatic 27): GlobalSearchUI::load_portrait_settings_matches_to_ui 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"781f0a43dd43b4d861989524a2b8ca07e1a9c12048dedaf748170dcbb9b8e498"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalSearchUI::load_rigid_model_matches_to_ui (cyclomatic 27): GlobalSearchUI::load_rigid_model_matches_to_ui 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"677e831d5020f5eba8ca679c588ba53e8284f4ed3a537d49b2d8482f1f921d10"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchView::replace_all (cyclomatic 27): SearchView::replace_all 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25293bd05ea4ade36842e7c11b46331f9fa486f1003400ed47f1bf27c8c7c48"}},{"ruleId":"D1","level":"warning","message":{"text":"PortraitSettings::search (cyclomatic 26): PortraitSettings::search 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":"rpfm_extensions/src/search/portrait_settings.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5d1efcce95cb25ca93bc546cdb35081f75aa7b2466db602efb12bd281aeda7"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidModel::search (cyclomatic 26): RigidModel::search 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":"rpfm_extensions/src/search/rigid_model.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89c8c731a42925bfe6d2a2ba63e1668875537dd56c12adfcdd52118f5b8b9b8"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::update_views_names (cyclomatic 26): AppUI::update_views_names 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f571307d53189300f5e8c94bd4e0be64860a2af51257578f20c94bc64c2ba721"}},{"ruleId":"D1","level":"warning","message":{"text":"PackedFileDecoderView::update_rows_decoded (cyclomatic 26): PackedFileDecoderView::update_rows_decoded 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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bfdab6159c2e01a15142cd482020679b26ee26c63920399e7868451435a6a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool::get_table_data (cyclomatic 26): Tool::get_table_data 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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7e1dcfc5fe57da2cbabaca091e8fd901ed0f2c1e7623f24c6792ccf32a9fef"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::go_to_file (cyclomatic 26): TableView::go_to_file 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08a97bac5fb5e27738127ab4f3d5963f1ff19424fc1bcd7cb3c95373a3ee949"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::tools::ceo_builder::build_ceo_builder (cyclomatic 26): rpfm_ui::tools::ceo_builder::build_ceo_builder has cyclomatic complexity 26 (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":"rpfm_ui/src/tools/ceo_builder/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db82c8e163a0efeea87b19a18dd0450abffd1b83a331410e51ac6e32288147"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolFactionPainter::get_faction_data (cyclomatic 25): ToolFactionPainter::get_faction_data 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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f83c263580e518c09afa3c58d56884e4695c79b1c43efb87eed2e1770128c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::process_edition (cyclomatic 25): TableView::process_edition 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50e04a739833d79feb27e512b047ce1fe5b728accb3d48ba26273834b5b9d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchView::update_search_ui (cyclomatic 25): SearchView::update_search_ui 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3610bb0acda2aa6007b6752c79b981ef267cc408cf4bb8db94ff46921ede992"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::communications::websocket_loop (cyclomatic 25): rpfm_ui::communications::websocket_loop 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":"rpfm_ui/src/communications/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c541444aebd48fcb7974257a8f9c34329c4848bf302f3bdea755ade8aec9a4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::pack_tree::sort_item_in_tree_view (cyclomatic 25): rpfm_ui::pack_tree::sort_item_in_tree_view 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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a8201ca8b9fd06ff374f35fe644730c14b3181dd22cfb46da67531abaa7651"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::write_pfh3 (cyclomatic 24): Pack::write_pfh3 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":"rpfm_lib/src/files/pack/pack_versions/pfh3.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a033766d01598c969fc85859ef37a595c8894b86deb85ae350cc4ffbf1432250"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::build_pack_submenus (cyclomatic 24): AppUI::build_pack_submenus 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa6b854d97b0d6e5ad7c036226e494d828e1022f131be9ee41f08e8d2b0ff22"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::follow_chain (cyclomatic 23): Checker::follow_chain 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":"rpfm_extensions/src/lua/check.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"534bde9ac136fcdda653c4fe9f9b1b558b4fcee70291e7f4ac5eef8c8cdbbb26"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchOn::types_to_search (cyclomatic 23): SearchOn::types_to_search 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: GlobalSearch::replace_possible (cyclomatic 26) 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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d75b485a5b6dcb0f6decc2a330caeae7870ee3e4958cdbe0a4c6534e95ee06a"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::write_pfh6 (cyclomatic 23): Pack::write_pfh6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh6.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c90bd1a6156a989a4a573d0dad5110c5d81105266027d970e2589dc0c35546"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::update_fields_processed (cyclomatic 23): Definition::update_fields_processed 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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e29d807d4323e96daa549d806c927aa4f51faf7f011df4e03afc171a515eb8b"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::new_queek_packed_file (cyclomatic 23): AppUI::new_queek_packed_file 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f03e6f5a35e81f2e8825bebef6738fb20718d15df09811abdd983a8705618e"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsUI::new_with_parent (cyclomatic 23): SettingsUI::new_with_parent 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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4250dabe3325b4946b9f231848d364d61d237f80ad5d676cfb6d8a22036599d5"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::go_to_definition (cyclomatic 23): TableView::go_to_definition 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"93de01e2b1927491fac2d785d9709084fefab6f947412106bf1ec4dbe68e68e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::read (cyclomatic 22): Pack::read has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e19d8a4d8ff731acb5f60cba1257124374e977978697589c4f2e16cb1b1dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::generate_missing_loc_data (cyclomatic 22): Pack::generate_missing_loc_data 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"186dcb22c42db705b1656493db9be688a843a2b6d71772169287bad9a7a46420"}},{"ruleId":"D1","level":"warning","message":{"text":"TableInMemory::tsv_import (cyclomatic 22): TableInMemory::tsv_import 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":"rpfm_lib/src/files/table/local.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f75ff40ee1efc5f05629050740eb1de7ea2cde257bb962d9aae3226727f5187"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::change_game_selected (cyclomatic 22): AppUI::change_game_selected 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4053}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c8268dc3d6c1189735e048ca53c347b971a39efdf5a080f1bb41f1b550efef"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagerContext::write_desire (cyclomatic 21): ManagerContext::write_desire has cyclomatic complexity 21 (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":"rpfm_extensions/src/startpos/cai/managers.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b5f2a20989e470c04141b08285ff5d3d0a2752f69d1aeb5b7323bc75fa7098"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::write_pfh5 (cyclomatic 21): Pack::write_pfh5 has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"650ca36c2633556135d725a01a48073a7d4b314f3f4320f9f41bab9a40acfebf"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_lib::files::table::decode_field_postprocess (cyclomatic 21): rpfm_lib::files::table::decode_field_postprocess has cyclomatic complexity 21 (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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c39be8039a1506d1d23f2bf61e12556dcc479d477671cf85729a0569866c952"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_server::server_websocket::handle_socket (cyclomatic 21): rpfm_server::server_websocket::handle_socket 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":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b98059d2f09c6eb84d79d81600adf24d080e53f5e4b86f33fb0abe769e4b5b"}},{"ruleId":"D1","level":"warning","message":{"text":"StartingStances::new (cyclomatic 20): StartingStances::new 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":"rpfm_extensions/src/startpos/cai/stances.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4fcfad3030b6b2ce26846f63224c92a1410764727244d93807886437e4ecd3"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::read_v12 (cyclomatic 20): Cs2Parsed::read_v12 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. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v12) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v12.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec512584816a7643f7cd956ffa6a4707472f0eab61ddbdc061912689edf9ccae"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::write_v12 (cyclomatic 20): Cs2Parsed::write_v12 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. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v12) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v12.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"598356565a0aa12b1467f0540bb0edda9734566455f5288b4feb2fdfe621a82f"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::read_v13 (cyclomatic 20): Cs2Parsed::read_v13 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. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v13) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v13.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8719a5e5395346a3a95f3b577d18576baf2749640efbe14eeb5fa82b50801c"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::write_v13 (cyclomatic 20): Cs2Parsed::write_v13 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. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v13) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v13.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fe960750f79d8d3cef94d76b20ac8772b05a8dab97532e252d99ba308f975f"}},{"ruleId":"D1","level":"warning","message":{"text":"RawDefinition::from (cyclomatic 20): RawDefinition::from 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":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"3948cb2439c90a51d383f8b2c9a782d09d328f79ffb3dfa82f90c3c7f7d86fe1"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::go_to_loc (cyclomatic 20): TableView::go_to_loc 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"e403612dafc183e17cf235e290e792f500767d1fc3f902f3a1e45309da263a49"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::views::table::utils::get_default_item_from_field (cyclomatic 20): rpfm_ui::views::table::utils::get_default_item_from_field 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4375a67d17d1e170e7fec65b2ebbea6b5628514add542f249497735961024b02"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::generate_references (cyclomatic 19): Dependencies::generate_references 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"611e30853a041fe9949028c9a3014ffe7f55b6d0d8bb81e09464d0b6ca4c1b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::db_and_loc_data (cyclomatic 19): Dependencies::db_and_loc_data 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1719af93ff5d26f696fd983985881228ec7174975d55aa06ec798216558d79"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::db_reference_data (cyclomatic 19): Dependencies::db_reference_data 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d65400dcb7e1f97773f292a122e8112c1df3fa3c65e56b613787a2b8fc34a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"CampaignIndex::new (cyclomatic 19): CampaignIndex::new 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":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0b37dfe80ec766d40d26e381f7568a3f07a24c347ee5f2bde7d3cf142df67d"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::read_v20 (cyclomatic 19): Cs2Parsed::read_v20 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. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v20) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v20.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a908c000d3cf9e820991c8fada95893c2fad4e280edef933cd3ce98a245c430"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::write_v20 (cyclomatic 19): Cs2Parsed::write_v20 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. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v20) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v20.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a268b6c76a73199c64f9cca5f99b96854107fc29f856366b44a71fb8ca059c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::read_v21 (cyclomatic 19): Cs2Parsed::read_v21 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. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v21) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v21.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a52a6bb43d8fdc57aaddb8f806c61aa972feeddfecfc301743c0e8ade255a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::write_v21 (cyclomatic 19): Cs2Parsed::write_v21 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. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v21) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v21.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b2d8e6cf37da516a1381b8d8b3384124d1d65b3acbf1518ae14c5986b19b62"}},{"ruleId":"D1","level":"warning","message":{"text":"ESF::read_caab (cyclomatic 19): ESF::read_caab 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":"rpfm_lib/src/files/esf/caab.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b745f4286a1814f5597d1b6e5dfc640a7f82855fd8da5652e669f80983e181e"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::update_anim_ids (cyclomatic 19): Pack::update_anim_ids 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7637b3a40c4520357a80a2804c1ccecd7a4e96742349272f7997a78d9ce23681"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::open_special_view (cyclomatic 19): AppUI::open_special_view 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66bde4c6d56a6d5003099b511c3ae10a42a9ff6d911eb643e27e45436a1c1a"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsUI::update_entry_path (cyclomatic 19): SettingsUI::update_entry_path 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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"929f4e1ba2270ba35cb341ae57174f383953a4084aa69a8eb31c4ff6d4a04e2e"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolFactionPainter::load_data (cyclomatic 19): ToolFactionPainter::load_data 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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"176865188d62fd68a51e30595c9a053771d56fc5e9f80279152276d5bf404a56"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolTranslator::batch_translate_all (cyclomatic 19): ToolTranslator::batch_translate_all 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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"876dc991097c1a6e428b6623f5d5d8a78295587ba22a9e7b34bd82955f097527"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::undo_redo (cyclomatic 19): TableView::undo_redo 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd65a408f34b37329f069f59ee9f85c4ceac3b778f555827d3eba78c9dc4a0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::packedfile_views::esf::esftree::get_node_type_from_tree_node (cyclomatic 19): rpfm_ui::packedfile_views::esf::esftree::get_node_type_from_tree_node 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":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ec9f3d8f4a97f75a2ef03f0ea17a883025f216fff5531e1a500c1457a0af6"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::views::table::filter::parse_predicate (cyclomatic 19): rpfm_ui::views::table::filter::parse_predicate 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":"rpfm_ui/src/views/table/filter/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2ec871108dbda44855b6e6aa9f9e88b0db249c3168fd51215a05170d975ee9"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimFragmentBattleMatch::replace (cyclomatic 18): AnimFragmentBattleMatch::replace 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":"rpfm_extensions/src/search/anim_fragment_battle.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0be0132e5926365ed2023691d2f91eecbc40410b37f2871d03f1b4917bbcfb1"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalSearch::search (cyclomatic 18): GlobalSearch::search 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: GlobalSearch::replace_possible (cyclomatic 26) 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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"520c3417d2e23b17e78c87bf0284c33d79183b5bec4237203c4635a10abeb4ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Container::extract (cyclomatic 18): Container::extract 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: FileType::from (cyclomatic 30) 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"023864a52dc6d67ffc9228247c2886abbe3f3a6ecf1bb98a45f30641f62f8928"}},{"ruleId":"D1","level":"warning","message":{"text":"Field::from (cyclomatic 18): Field::from 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":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"5404376434b84167686a1322941bfdf7ec88ce49679b3aa9c4dd609c0be19d50"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_server::ceo_builder::build_ceo_entries::insert_row (cyclomatic 18): rpfm_server::ceo_builder::build_ceo_entries::insert_row 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. This shape REPEATS in the file: one other method here (rpfm_server::ceo_builder::build_ceo_entries) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"339fdecec67af67ddd6f641dcb2a59f9d0d0fba7cf0144472fdba40f223a02cd"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::open_packfile (cyclomatic 18): AppUI::open_packfile 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9cbdaef778ba4d54f613d07e7c3cd681c13ef745932d7aa75fa6a05626a0ec"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::build_starpos (cyclomatic 18): AppUI::build_starpos 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f025a0665a3aa0cc2c9cdbe5284ef3946655561f656891cb75ab3be44ac135ef"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsUISlots::new (cyclomatic 18): SettingsUISlots::new 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":"rpfm_ui/src/settings_ui/slots.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df1c8124f13bbe0cab29f816f56f067561153b627e2ba9687024e427ffa5a46"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::get_indexes_as_lua_table (cyclomatic 18): TableView::get_indexes_as_lua_table 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"595f22ffcc3fa3f2f5fd148792773bf3f71b852dfdc0c55c3cba921e175be5a6"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchView::replace_current (cyclomatic 18): SearchView::replace_current 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1134e5d7a52ffb4a9b46d9222abf7dbab56242fa094d7321c2ae4a782f5d95"}},{"ruleId":"D1","level":"warning","message":{"text":"PortraitSettingsDiagnostic::check (cyclomatic 17): PortraitSettingsDiagnostic::check 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":"rpfm_extensions/src/diagnostics/portrait_settings.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdfae70ff36a4e4b3ce6d3543e1c36c94ca2d7a7344432ec91eb284dc135008"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::read_v18 (cyclomatic 17): Cs2Parsed::read_v18 has cyclomatic complexity 17 (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. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v18) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v18.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"edac7eef68a11d3b6a884dd826839228108a4c96223cabe86a51b1f6f18ba09d"}},{"ruleId":"D1","level":"warning","message":{"text":"Cs2Parsed::write_v18 (cyclomatic 17): Cs2Parsed::write_v18 has cyclomatic complexity 17 (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. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v18) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v18.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c127e154740aef711b0db6c179eda4d27f1b0c02f022fdb3b81c28d6dc780c8b"}},{"ruleId":"D1","level":"warning","message":{"text":"ESF::save_caab (cyclomatic 17): ESF::save_caab 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":"rpfm_lib/src/files/esf/caab.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13457f29cadd9beaac0ba468b6824084df5516ae05271a5fc4c624891e41b43"}},{"ruleId":"D1","level":"warning","message":{"text":"ESF::read_cbab (cyclomatic 17): ESF::read_cbab 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":"rpfm_lib/src/files/esf/cbab.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c047b446c82ea14762826e80be029865a150248eba73297f3ce522e12bff4344"}},{"ruleId":"D1","level":"warning","message":{"text":"ESF::save_cbab (cyclomatic 17): ESF::save_cbab 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":"rpfm_lib/src/files/esf/cbab.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c07a3658a1220fe750919c4c6c5952e2686d23d85a9a00ad2321afc30e12d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::patch_siege_ai (cyclomatic 17): Pack::patch_siege_ai 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a17063267416454465c4b3d0dd33f1aa83cc25c105f1c832b52e1ddb4d8caa9"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionState::import_dependencies (cyclomatic 17): SessionState::import_dependencies has cyclomatic complexity 17 (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":"rpfm_server/src/state/files.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"560d797976c4101a3894cc3ec073cd2157c9a63fcae0f6c87596ee3de8de840a"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_server::updater::check_updates_rpfm_with (cyclomatic 17): rpfm_server::updater::check_updates_rpfm_with 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":"rpfm_server/src/updater.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f806edcfe703ece1cbdac19a8e2f2f340468aa5439bd707cf57ebd35e2bc59"}},{"ruleId":"D1","level":"warning","message":{"text":"AppUI::save_packfile_by_key (cyclomatic 17): AppUI::save_packfile_by_key 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"748512978b1154c45dc1a2cc15575e6c2343654eb9334d9aedbf8fc05ad4eb9c"}},{"ruleId":"D1","level":"warning","message":{"text":"DependenciesUISlots::new (cyclomatic 17): DependenciesUISlots::new 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":"rpfm_ui/src/dependencies_ui/slots.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad4acc455e05899d9c67407148d3101f06770deb55ddc586169254b42caf1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsUI::clean_diagnostics_from_views (cyclomatic 17): DiagnosticsUI::clean_diagnostics_from_views 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. This is NOT this file\u0027s highest cyclomatic complexity: DiagnosticsUI::update_level_counts (cyclomatic 22) 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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a05a9728ee3935d066412ffaa02c8aa4f6d78522350054717394df0e4930e"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalSearchUI::load_unit_variant_matches_to_ui (cyclomatic 17): GlobalSearchUI::load_unit_variant_matches_to_ui 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d253e55b6b3a2cd9d4152cb306c7a4bba23d7195ad0076a23932cde754f9a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"PackedFileDecoderView::add_field_to_view (cyclomatic 17): PackedFileDecoderView::add_field_to_view 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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7cfcde2e82ee34fc48171cd5d8f9e649e61506eff98c97b1f7c316acc67788"}},{"ruleId":"D1","level":"warning","message":{"text":"PortraitSettingsSlots::new (cyclomatic 17): PortraitSettingsSlots::new 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":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a14839b3adc64418724827b3724139a5b5a48c282c845669ab15e73f61b3cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsUI::load (cyclomatic 17): SettingsUI::load 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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedb0b5a9308e081a9892ff5e07dc4157b34022140a43fff1f4857ce6750590c"}},{"ruleId":"D1","level":"warning","message":{"text":"TableView::smart_delete (cyclomatic 17): TableView::smart_delete 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"55419d22057b4275f92d8e8b908bea8193b33cc581f21ec840469bd96108c1b7"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_ui::app_ui::slots::handle_tab_unpreview (cyclomatic 17): rpfm_ui::app_ui::slots::handle_tab_unpreview 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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d912eb60827ea0edc39eec2b12f530bcc5cf3379336072e6fac99b07c78420ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependencies::db_data_datacored (cyclomatic 16): Dependencies::db_data_datacored 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"78543ca157ee45ae37e5248990b7f400eff850f22e15e098cb8012391ce7a9a9"}},{"ruleId":"D1","level":"warning","message":{"text":"rpfm_extensions::startpos::world::availability::available_chains (cyclomatic 16): rpfm_extensions::startpos::world::availability::available_chains 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":"rpfm_extensions/src/startpos/world/availability.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"138ba636b2be7b81b41645fd88cecdf8f901546cb2678509c802d8d51a438229"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings::init (cyclomatic 16): Settings::init 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":"rpfm_ipc/src/settings.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59cfdac55fe6042814e94f930572d31eb542a763a322c85ad14ec4062c20a90"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupFormation::validate (cyclomatic 16): GroupFormation::validate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/group_formations/validation.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a657b93edab6b5fcb8aedf16075601f08d4c78da49558def04a786e6918d94"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::write_pfh4 (cyclomatic 16): Pack::write_pfh4 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":"rpfm_lib/src/files/pack/pack_versions/pfh4.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"387bfee739413f56e75d8df1e48be2054aa68676acee088e839f1308dd52bf51"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack::read_pfh5 (cyclomatic 16): Pack::read_pfh5 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":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c85235b9ae61223a7f12751a577b2da67c5d85594dd2f91ac9c50f8b9207b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::tables_and_columns_referencing_our_own (cyclomatic 16): Schema::tables_and_columns_referencing_our_own 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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cc914a3cc388a08c9c001bf9cc876f7cefa3a68f38820e6e71647b0d6e1393"}},{"ruleId":"D1","level":"warning","message":{"text":"RigidModelView::change_selected_row (cyclomatic 16): RigidModelView::change_selected_row 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":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1d5adb884efc26eea1cd9b1c58d0d3b1d80c9dad7fc8fc962cfe22774b9be0"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolTranslator::change_selected_row (cyclomatic 16): ToolTranslator::change_selected_row 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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"56049a69a7050150badd3800ca4078bab6183a6ca570d33aefe5dfb179423962"}},{"ruleId":"D2","level":"warning","message":{"text":"PackFileContentsSlots::new (cognitive 559): PackFileContentsSlots::new has cognitive complexity 559 (threshold 15). Drivers by points: if/else 157 (341 pts), loops 39 (122 pts), match/switch 39 (72 pts), boolean chains 24 (nesting depth added 300). 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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6691601a2ac6921438ffa16ede5a27d32e92ed6048fe3af3b32d771f0cf9dab5"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_server::ceo_builder::build_ceo_entries (cognitive 489): rpfm_server::ceo_builder::build_ceo_entries has cognitive complexity 489 (threshold 15). Drivers by points: if/else 104 (355 pts), loops 36 (123 pts), match/switch 3 (10 pts), boolean chains 1 (nesting depth added 345). Of this number, 458 points are the body\u0027s own statements and 31 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"679611596d02d201434687ccb5d8a6db5489c3834aafa18c4d8843a1ec3e9db2"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::open_packedfile (cognitive 337): AppUI::open_packedfile has cognitive complexity 337 (threshold 15). Drivers by points: if/else 57 (224 pts), match/switch 22 (104 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 251). 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eb0f98fdf6ba59b4cb90ed65aced49148fc292037c5225adb8f220b491f69f"}},{"ruleId":"D2","level":"warning","message":{"text":"TableDiagnostic::check_db (cognitive 308): TableDiagnostic::check_db has cognitive complexity 308 (threshold 15). Drivers by points: if/else 51 (225 pts), loops 9 (33 pts), boolean chains 29, match/switch 5 (21 pts) (nesting depth added 214). 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":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4456780664177ec4c8e171bef0e88461b207b37bea6d77be933f85c516862b16"}},{"ruleId":"D2","level":"warning","message":{"text":"TextDiagnostic::check (cognitive 290): TextDiagnostic::check has cognitive complexity 290 (threshold 15). Drivers by points: if/else 45 (214 pts), loops 10 (58 pts), match/switch 3 (15 pts), boolean chains 3 (nesting depth added 229). 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":"rpfm_extensions/src/diagnostics/text.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faebca65f83b8b068a4e20a2d7da6ee2fce7aff20e64896b77c268805ae1dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"TableViewSlots::new (cognitive 289): TableViewSlots::new has cognitive complexity 289 (threshold 15). Drivers by points: if/else 82 (230 pts), loops 6 (25 pts), match/switch 6 (24 pts), boolean chains 10 (nesting depth added 185). 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":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba56b2734a135068ac0c313b6fa94398fdaa7041f659ae0fc92270cf1ddadee"}},{"ruleId":"D2","level":"warning","message":{"text":"ESFDetailedView::save_from_detailed_view (cognitive 279): ESFDetailedView::save_from_detailed_view has cognitive complexity 279 (threshold 15). Drivers by points: if/else 78 (273 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 198). 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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f325efc453787de46ad67616b01ace4a5219c402b3569bf4290c1a242d550c"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedFileDecoderView::import_from_assembly_kit (cognitive 274): PackedFileDecoderView::import_from_assembly_kit has cognitive complexity 274 (threshold 15). Drivers by points: if/else 84 (240 pts), loops 7 (17 pts), match/switch 4 (16 pts), boolean chains 1 (nesting depth added 178). 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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"756a5f8694562bdbc659dcb4fccfd69d6b08325490c5508d8c30ec41443450b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::generate_automatic_patches (cognitive 266): Dependencies::generate_automatic_patches has cognitive complexity 266 (threshold 15). Drivers by points: if/else 66 (172 pts), boolean chains 69, match/switch 5 (21 pts), loops 3 (4 pts) (nesting depth added 123). 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8329a0f1c9b4b749152ceb5a4a2261ea9e9580f6f64c8c989e2d19383a7b83a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::db_reference_data_generic (cognitive 211): Dependencies::db_reference_data_generic has cognitive complexity 211 (threshold 15). Drivers by points: if/else 29 (148 pts), loops 7 (40 pts), match/switch 4 (23 pts) (nesting depth added 171). 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cf3da85186a82e1336a68fd5aee1c3a90f6a5dcfffe893551e73294c6bdd3d"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundBankDatabase::read_sho2 (cognitive 195): SoundBankDatabase::read_sho2 has cognitive complexity 195 (threshold 15). Drivers by points: loops 111 (195 pts) (nesting depth added 84). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SoundBankDatabase::write_sho2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/games/sho2.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"103b58f3d63cf7c890c2b34e063f9065e7a44429528153769f06f6b7ce34418a"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundBankDatabase::write_sho2 (cognitive 195): SoundBankDatabase::write_sho2 has cognitive complexity 195 (threshold 15). Drivers by points: loops 111 (195 pts) (nesting depth added 84). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SoundBankDatabase::read_sho2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/games/sho2.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"558e6adb1c5debee08b6e4fa0b0f153b564b08a8d94d21a9c7790f9d8647fc95"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUISlots::new (cognitive 187): AppUISlots::new has cognitive complexity 187 (threshold 15). Drivers by points: if/else 82 (124 pts), match/switch 18 (36 pts), loops 10 (17 pts), boolean chains 10 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f4da9303648fb4e22c6ce8a80937dad621bfe43c6fa9b1bad25ab5f53a14ca"}},{"ruleId":"D2","level":"warning","message":{"text":"RawDefinition::read_all (cognitive 185): RawDefinition::read_all has cognitive complexity 185 (threshold 15). Drivers by points: if/else 25 (153 pts), loops 3 (27 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 153). 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":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8014cfcac70946f66587f4d13724ed739dfd3e5bf183d6af2e2c11b1b767002"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsUI::paint_diagnostics_to_view (cognitive 175): DiagnosticsUI::paint_diagnostics_to_view has cognitive complexity 175 (threshold 15). Drivers by points: if/else 20 (93 pts), loops 9 (54 pts), match/switch 9 (24 pts), boolean chains 4 (nesting depth added 133). 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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7911757f5a670813febe6f9d28ff17c4bee893fb714fca119ae9a3876e0bf13"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsUI::open_match (cognitive 172): DiagnosticsUI::open_match has cognitive complexity 172 (threshold 15). Drivers by points: if/else 34 (126 pts), loops 4 (21 pts), match/switch 3 (14 pts), boolean chains 11 (nesting depth added 120). 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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d80466dd8930e32ddccb397750eda1ef01fdcf80309b9cd7cc11781d3492f1"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearch::replace (cognitive 170): GlobalSearch::replace has cognitive complexity 170 (threshold 15). Drivers by points: if/else 33 (118 pts), match/switch 12 (51 pts), loops 1 (nesting depth added 124). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"156ff7e079025cd6a61a8aec1f1dfa1dc5214f771a0b2d5f3e7145c1f65d12f6"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::app_ui::slots::handle_tab_current_changed (cognitive 170): rpfm_ui::app_ui::slots::handle_tab_current_changed has cognitive complexity 170 (threshold 15). Drivers by points: if/else 22 (121 pts), loops 5 (36 pts), match/switch 1 (10 pts), boolean chains 3 (nesting depth added 139). 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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"529ddc11533adbd2f56b1d1e927a7765c26ec90cc30f69151a30f6257fc133f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::get_table_data (cognitive 155): Tool::get_table_data has cognitive complexity 155 (threshold 15). Drivers by points: if/else 15 (80 pts), loops 9 (54 pts), match/switch 3 (20 pts), boolean chains 1 (nesting depth added 127). 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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"55defff0c00e7dcb29806c1bdf75cd8cd8f393eb323bff7119653724883d38f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_lib::integrations::assembly_kit::update_schema_from_raw_files (cognitive 153): rpfm_lib::integrations::assembly_kit::update_schema_from_raw_files has cognitive complexity 153 (threshold 15). Drivers by points: if/else 27 (129 pts), loops 4 (18 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 118). 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":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5884f4a2564824477c0ad7d14166dbac9f0a25638dedb023ab7ac2343013905e"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::optimize (cognitive 144): Pack::optimize has cognitive complexity 144 (threshold 15). Drivers by points: if/else 33 (100 pts), boolean chains 19, loops 6 (18 pts), match/switch 3 (7 pts) (nesting depth added 83). 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":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c543f18bc734ffa5238ee385c9ffe65b56b94e9813b8d13fca6fe07b2753b0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::bruteforce_loc_key_order (cognitive 140): Dependencies::bruteforce_loc_key_order has cognitive complexity 140 (threshold 15). Drivers by points: if/else 33 (88 pts), loops 11 (35 pts), match/switch 5 (13 pts), boolean chains 4 (nesting depth added 87). 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbb9e3374caa100d510898bcf057a251f57f49b79f85f936a305f10c0f18ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::set_data_on_cells (cognitive 128): TableView::set_data_on_cells has cognitive complexity 128 (threshold 15). Drivers by points: if/else 34 (105 pts), loops 3 (10 pts), match/switch 2 (10 pts), boolean chains 3 (nesting depth added 86). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"2543464aa64082c02439bbcc9b3d276ed7db5b8bc8414093d58f5784c06fdb48"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::load_data (cognitive 128): rpfm_ui::views::table::utils::load_data has cognitive complexity 128 (threshold 15). Drivers by points: if/else 27 (95 pts), loops 5 (16 pts), match/switch 3 (14 pts), boolean chains 3 (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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a06566aee9fcf5b4899a8c5618f0c088bf8a909fe0793a155918502fc42a771"}},{"ruleId":"D2","level":"warning","message":{"text":"Matches::find_matches (cognitive 126): Matches::find_matches has cognitive complexity 126 (threshold 15). Drivers by points: if/else 69 (102 pts), boolean chains 24 (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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a89d50b97813077b286502337ea7b293e4ec4ac35498b187ba675cdfac203a"}},{"ruleId":"D2","level":"warning","message":{"text":"DB::cascade_edition (cognitive 126): DB::cascade_edition has cognitive complexity 126 (threshold 15). Drivers by points: if/else 18 (84 pts), loops 9 (36 pts), match/switch 1 (6 pts) (nesting depth added 98). 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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aecb6ddce266bf61c0e123ae98e0b57483c8fd699f68e65aaee41755aa3b584"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_lib::files::table::encode_table (cognitive 122): rpfm_lib::files::table::encode_table has cognitive complexity 122 (threshold 15). Drivers by points: if/else 26 (67 pts), match/switch 9 (45 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9871ca923cf865cb97dbaf1ab5de3b6e0cb232ac345ec4d0f7a6ba1fedb304"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::load_definition_to_detailed_view_editor (cognitive 121): Tool::load_definition_to_detailed_view_editor has cognitive complexity 121 (threshold 15). Drivers by points: if/else 14 (71 pts), match/switch 13 (50 pts) (nesting depth added 94). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efa144fdbf09badf9d6feea60c56d157d5c2fc23832dd2a6de392cb8bdb4095"}},{"ruleId":"D2","level":"warning","message":{"text":"FileView::reload (cognitive 119): FileView::reload has cognitive complexity 119 (threshold 15). Drivers by points: if/else 46 (114 pts), match/switch 2 (5 pts) (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"835b0caa22eddb315a2e771975d62dcfdb8b1e3875df2c3ca424b5d13456418f"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::go_to_file (cognitive 113): TableView::go_to_file has cognitive complexity 113 (threshold 15). Drivers by points: if/else 28 (104 pts), loops 1 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 82). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e649d46ba7104faa7fc8e1a0633f79468fe35d759006fefd0369aa3d3f22b08a"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolFactionPainter::get_faction_data (cognitive 110): ToolFactionPainter::get_faction_data has cognitive complexity 110 (threshold 15). Drivers by points: if/else 20 (59 pts), match/switch 8 (46 pts), loops 2 (5 pts) (nesting depth added 80). 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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"896c49f0846be6b4213fe9f964a9fd4816c000dc4b7b65e10ff92faa9408a537"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearchUI::open_match (cognitive 109): GlobalSearchUI::open_match has cognitive complexity 109 (threshold 15). Drivers by points: if/else 50 (101 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 53). 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"6234a3ecab6daeaad41ee59b86e646a50d56fd6666d6d3b7894a14136f4c4b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::build_starpos_post (cognitive 104): Dependencies::build_starpos_post has cognitive complexity 104 (threshold 15). Drivers by points: if/else 42 (78 pts), loops 6 (12 pts), boolean chains 7, match/switch 4 (7 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"262f957b80ca4dc3ccc90f4c982b22e600afc03366f162b71d8e2c4fb862fbff"}},{"ruleId":"D2","level":"warning","message":{"text":"ESF::read_node (cognitive 104): ESF::read_node has cognitive complexity 104 (threshold 15). Drivers by points: loops 22 (65 pts), if/else 13 (24 pts), match/switch 6 (12 pts), boolean chains 3 (nesting depth added 60). 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":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c101d91ba915dde4a8e40633432065ce9bf499e4d71d1fd505db4f9f9106324"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostics::check (cognitive 96): Diagnostics::check has cognitive complexity 96 (threshold 15). Drivers by points: if/else 43 (71 pts), match/switch 5 (13 pts), boolean chains 6, loops 4 (6 pts) (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":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b5a3bc1e2d7cf3621796770557debbcadb382cbb2dc87e0eb340b152638f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::process_edition (cognitive 96): TableView::process_edition has cognitive complexity 96 (threshold 15). Drivers by points: if/else 16 (72 pts), loops 3 (16 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 72). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b027a67705062adf53ecdf3895952c866fb60fdc0d19d2714ce0119591c080ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::build_starpos_pre (cognitive 91): Dependencies::build_starpos_pre has cognitive complexity 91 (threshold 15). Drivers by points: if/else 36 (71 pts), match/switch 5 (13 pts), loops 1 (4 pts), boolean chains 3 (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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac76cd174b758c5c5b82bcf9d935b449725c6ec237ada10121915559ea8dc67"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::communications::websocket_loop (cognitive 91): rpfm_ui::communications::websocket_loop has cognitive complexity 91 (threshold 15). Drivers by points: if/else 16 (74 pts), match/switch 4 (13 pts), loops 2 (4 pts) (nesting depth added 69). 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":"rpfm_ui/src/communications/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a6bf3149539658eb7089ce07c201b80c2eb0270a421bb98a07d625a69f2c14"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimFragmentBattleDiagnostic::check (cognitive 90): AnimFragmentBattleDiagnostic::check has cognitive complexity 90 (threshold 15). Drivers by points: if/else 20 (73 pts), boolean chains 12, loops 2 (5 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/anim_fragment_battle.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cc4f0b819b2fb3127c1aafa00bd7597c8085b5b3f9c12565d6ce006bf5073b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimFragmentBattle::search (cognitive 89): AnimFragmentBattle::search has cognitive complexity 89 (threshold 15). Drivers by points: loops 30 (84 pts), if/else 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 55). 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":"rpfm_extensions/src/search/anim_fragment_battle.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0ae74967df589e22a7709acc39c241149da87b91cd88c80993063606641205"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition::update_from_raw_definition (cognitive 89): Definition::update_from_raw_definition has cognitive complexity 89 (threshold 15). Drivers by points: if/else 17 (66 pts), match/switch 2 (9 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 59). 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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa04db6bf4cd69fb7e3fc11b819e2c216711f8ce2859ab6f93c438e8370ab947"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidModel::search (cognitive 87): RigidModel::search has cognitive complexity 87 (threshold 15). Drivers by points: loops 22 (82 pts), if/else 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 61). 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":"rpfm_extensions/src/search/rigid_model.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c104bff4f86b9959c743e66d3d1d013395e66a986fc791257e05dfb023919c"}},{"ruleId":"D2","level":"warning","message":{"text":"ESF::save_node (cognitive 84): ESF::save_node has cognitive complexity 84 (threshold 15). Drivers by points: if/else 40 (61 pts), loops 3 (11 pts), boolean chains 7, match/switch 3 (5 pts) (nesting depth added 31). 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":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"435eaf37bfdf24bbc985385e8634dc46382908e710692c480610fda60f26513c"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::new_row (cognitive 83): Table::new_row has cognitive complexity 83 (threshold 15). Drivers by points: if/else 48 (82 pts), match/switch 1 (nesting depth added 34). 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c89e3903eaf500b41b9fe37bfc3f97fc494a34c78dd03e33e62ddaf7c753487"}},{"ruleId":"D2","level":"warning","message":{"text":"PortraitSettings::search (cognitive 81): PortraitSettings::search has cognitive complexity 81 (threshold 15). Drivers by points: loops 20 (70 pts), if/else 4 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 55). 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":"rpfm_extensions/src/search/portrait_settings.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ef78e02139ecd02198b5f960735033574adb457e90ff7936ef9844abb725f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TableDiagnostic::check_loc (cognitive 78): TableDiagnostic::check_loc has cognitive complexity 78 (threshold 15). Drivers by points: if/else 15 (50 pts), match/switch 4 (14 pts), loops 6 (8 pts), boolean chains 6 (nesting depth added 47). 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":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7254255e1ad04c87ef2a68c4fe0254d651d04dc6f4db8c15bb02d7c3f4a0ffb5"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedFileDecoderViewSlots::new (cognitive 75): PackedFileDecoderViewSlots::new has cognitive complexity 75 (threshold 15). Drivers by points: if/else 37 (63 pts), loops 7, match/switch 3, 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":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f69663d1209601c8fab0891d2511c08e11c3310567ad514093e2b296b03944d"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::go_to_definition (cognitive 75): TableView::go_to_definition has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (64 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 51). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c79ce0393e2e6cedc8157591902296e2c2013e86cf350f65eff9c9abac5010c"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::packedfile_views::esf::esftree::get_node_type_from_tree_node (cognitive 71): rpfm_ui::packedfile_views::esf::esftree::get_node_type_from_tree_node has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 5 (19 pts), match/switch 3 (7 pts) (nesting depth added 49). 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":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c35bd890df852442645d95bc408d7968313073d154c4717f3ef0f206ec9439"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimFragmentBattle::from_table (cognitive 70): AnimFragmentBattle::from_table has cognitive complexity 70 (threshold 15). Drivers by points: if/else 28 (65 pts), loops 2 (5 pts) (nesting depth added 40). 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":"rpfm_lib/src/files/anim_fragment_battle/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a537cd9a91f38f170d70c19035337bd6c052c6c1264016cd3d4f97d8a9d65e62"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolTranslator::new (cognitive 70): ToolTranslator::new has cognitive complexity 70 (threshold 15). Drivers by points: if/else 32 (49 pts), loops 7 (17 pts), boolean chains 3, match/switch 1 (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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"128bf785edbbf5378ef3a1356c4265d0e2c3fddab50f116f785b94bb67008b72"}},{"ruleId":"D2","level":"warning","message":{"text":"RawTable::to_table (cognitive 68): RawTable::to_table has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (46 pts), match/switch 3 (13 pts), loops 4 (8 pts), boolean chains 1 (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":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb3169b3729a850329f303c3ff4a30e02c6a82523eb1a751e9e3b8623eb098d"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::go_to_loc (cognitive 67): TableView::go_to_loc has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (58 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 47). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84ded75d7390a09aa6a267baced98ceee9b58f0da4474bc147910e2e01016fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::generate_missing_loc_data (cognitive 66): Pack::generate_missing_loc_data has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 2 (8 pts), boolean chains 3 (nesting depth added 42). 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"940444291fef44a6fc1adae4114bede05cc59f25af64137e7cb6246065f2359e"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::build_pack_submenus (cognitive 65): AppUI::build_pack_submenus has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 6 (14 pts) (nesting depth added 42). 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffef7a9589d95ef532aa82a389cb4117b046f7231c9ba59b99885a359bd2df92"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchView::update_search_ui (cognitive 64): SearchView::update_search_ui has cognitive complexity 64 (threshold 15). Drivers by points: if/else 30 (59 pts), match/switch 2 (4 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa1182bb551f4103d399c13a4124b0db849a5789efe7021c88b9679e21c957d"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::save_table_data (cognitive 63): Tool::save_table_data has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (46 pts), loops 3 (13 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 43). 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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b673f67cce4856529ce13b57d3444cb191d740b9560d0cb77a8d1a4f131f920"}},{"ruleId":"D2","level":"warning","message":{"text":"RawDefinition::from (cognitive 61): RawDefinition::from has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (50 pts), match/switch 1 (7 pts), loops 1 (4 pts) (nesting depth added 42). 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":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb41facb8292c5a62cbbf25c2c6b8a2845602e56ba8d560ee28087b320fc372"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsUI::load_diagnostics_to_ui (cognitive 60): DiagnosticsUI::load_diagnostics_to_ui has cognitive complexity 60 (threshold 15). Drivers by points: loops 11 (29 pts), match/switch 10 (17 pts), if/else 7 (14 pts) (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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2c4f1d87cd61fa0b8cf02420f84626f5770e5e2c1b5dd68b13905e77f41f01"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolFactionPainter::load_data (cognitive 60): ToolFactionPainter::load_data has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (57 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 41). 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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c9d41d91a0f955e56dbca3044ea39b8301f77d3d9f1b4b523df0f5db9dca93"}},{"ruleId":"D2","level":"warning","message":{"text":"ESF::read_caab (cognitive 58): ESF::read_caab has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (52 pts), boolean chains 3, loops 3 (nesting depth added 40). 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":"rpfm_lib/src/files/esf/caab.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"488acbab9501d07c5a7b4d26730d1a0340727b68ed04538c9bbd8debd7728d57"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v12 (cognitive 57): Cs2Parsed::read_v12 has cognitive complexity 57 (threshold 15). Drivers by points: loops 19 (57 pts) (nesting depth added 38). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v12) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v12.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba284b329809899c9534647ceaf9a42c0f8f7f20ac1251730debfce0b829eb99"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v12 (cognitive 57): Cs2Parsed::write_v12 has cognitive complexity 57 (threshold 15). Drivers by points: loops 19 (57 pts) (nesting depth added 38). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v12) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v12.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc74cf24fc660862d53a8a30ec4812299b1206c7e7ae1b36c5b9818f2de60280"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v13 (cognitive 57): Cs2Parsed::read_v13 has cognitive complexity 57 (threshold 15). Drivers by points: loops 19 (57 pts) (nesting depth added 38). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v13) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v13.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"65feffbc3e621719695664349757ee6bafbc7351dcd676d965743439aa637abe"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v13 (cognitive 57): Cs2Parsed::write_v13 has cognitive complexity 57 (threshold 15). Drivers by points: loops 19 (57 pts) (nesting depth added 38). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v13) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v13.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9d77905c8c5b93e84db69fb0ce604f4e6ba84092a454bafd35abee680f635d"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::update_anim_ids (cognitive 57): Pack::update_anim_ids has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (46 pts), 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9e7996a4dee0f4533e64411d744d7177d618a07ed286cbf48f7bea001aaacd"}},{"ruleId":"D2","level":"warning","message":{"text":"PackTranslation::new (cognitive 56): PackTranslation::new has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 6, loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 24). 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":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdbc83f550861b1219be85fb2332bffdbc7ea85fc15dd0af52d1f2c2e6f8702"}},{"ruleId":"D2","level":"warning","message":{"text":"ESF::read_cbab (cognitive 56): ESF::read_cbab has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (52 pts), loops 3, boolean chains 1 (nesting depth added 40). 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":"rpfm_lib/src/files/esf/cbab.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4878626ed170d2e5bf5d6b9e5d417f711d34be1d5fc2210851d6ed48c24786ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolFactionPainter::get_faction_banner_data (cognitive 56): ToolFactionPainter::get_faction_banner_data has cognitive complexity 56 (threshold 15). Drivers by points: if/else 6 (28 pts), match/switch 4 (23 pts), loops 2 (5 pts) (nesting depth added 44). 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. This shape REPEATS in the file: one other method here (ToolFactionPainter::get_faction_uniform_data) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"593fb3c0c9f87ed77ffdba047366daba4a18157d3a3c0b163d306762dd568590"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolFactionPainter::get_faction_uniform_data (cognitive 56): ToolFactionPainter::get_faction_uniform_data has cognitive complexity 56 (threshold 15). Drivers by points: if/else 6 (28 pts), match/switch 4 (23 pts), loops 2 (5 pts) (nesting depth added 44). 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. This shape REPEATS in the file: one other method here (ToolFactionPainter::get_faction_banner_data) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef14385d8bb2ffc22f7d4080a18f6ce3d52519bb9cf1bc360407d065a4a1f20"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::loc_key_source (cognitive 54): Dependencies::loc_key_source has cognitive complexity 54 (threshold 15). Drivers by points: if/else 8 (35 pts), loops 4 (19 pts) (nesting depth added 42). 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58cde9139723e8b7dab33ba1e66558470fa439db876a1233639249230f89998"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v20 (cognitive 54): Cs2Parsed::read_v20 has cognitive complexity 54 (threshold 15). Drivers by points: loops 18 (54 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v20) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v20.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd038160ab0baf61e8be3cbafdd225cf09cdc36d8bcf9fa6048d59b672986351"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v20 (cognitive 54): Cs2Parsed::write_v20 has cognitive complexity 54 (threshold 15). Drivers by points: loops 18 (54 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v20) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v20.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"470c1670acdd8d7fcd6cef1b5375a5907953babe1779a7f23a6a6dc49426582f"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v21 (cognitive 54): Cs2Parsed::read_v21 has cognitive complexity 54 (threshold 15). Drivers by points: loops 18 (54 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v21) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v21.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2053667c0b70be30126360f1cfedc6939cbdbeae2639e2373927ad9cf2c51e"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v21 (cognitive 54): Cs2Parsed::write_v21 has cognitive complexity 54 (threshold 15). Drivers by points: loops 18 (54 pts) (nesting depth added 36). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v21) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v21.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d8994c0e2a4f88d7a15ecacbd901874065de266f7bde6d99827c1cef3163f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::tables_and_columns_referencing_our_own (cognitive 54): Schema::tables_and_columns_referencing_our_own has cognitive complexity 54 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 5 (20 pts), match/switch 1 (7 pts), boolean chains 3 (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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"703a677796d723fd7ae08cf15462ece42d9b1ea01aca153d66acf622c7821f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsUI::new_with_parent (cognitive 54): SettingsUI::new_with_parent has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 8 (15 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdede10753d3467642e818f611c05e2df0e299aa9525ddcc62d868da7e6466f"}},{"ruleId":"D2","level":"warning","message":{"text":"Icons::icon (cognitive 54): Icons::icon has cognitive complexity 54 (threshold 15). Drivers by points: if/else 37 (41 pts), boolean chains 9, match/switch 2 (4 pts) (nesting depth added 6). 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":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5729096bfc6d5a1ae028322615be97199ae069700305538c3b55c79da07d4b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::follow_chain (cognitive 53): Checker::follow_chain has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (35 pts), match/switch 6 (13 pts), boolean chains 4, loops 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":"rpfm_extensions/src/lua/check.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28e1f5c52554ac9d03476b41bbb5b03648ec2d5b285aba996c0ebfa6c973a68"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::build_open_mymod_submenus (cognitive 53): AppUI::build_open_mymod_submenus has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (37 pts), loops 2 (9 pts), match/switch 1 (5 pts), boolean chains 2 (nesting depth added 39). 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d53007f81ec98b0191c96c64d7ac3b771e649617b6441278d4bc18c2b690532"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::update_views_names (cognitive 53): AppUI::update_views_names has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (39 pts), match/switch 3 (9 pts), loops 3, 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3866}}}],"partialFingerprints":{"codehealthFindingId/v1":"6068841d1545ea131243467400679dd7f6ae6e8f4b40f4a8a62b82161d070665"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::paste_as_it_fits (cognitive 53): TableView::paste_as_it_fits has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (12 pts), boolean chains 8, match/switch 2 (6 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f3c05fc831e740ce5a51e8eff46cccc074f8e61c34c3a1ced66c832d61fec2"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::build_columns (cognitive 53): rpfm_ui::views::table::utils::build_columns has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 5 (18 pts), loops 4 (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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"580097ca4b17390f8e07dd924041223210c61b858dcef4a93735b4575d361479"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::db_and_loc_data (cognitive 52): Dependencies::db_and_loc_data has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 6 (18 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdbcf0007f28d6f106cd21cb5c8639694999c3fe5556bb0ef99a06e7983b084"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::search (cognitive 52): Schema::search has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (34 pts), loops 5 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/schema.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"446fe75093223fab73156c32d129f6a75416b9ad201a30ec3d5a184943b18b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::new_queek_packed_file (cognitive 52): AppUI::new_queek_packed_file has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (37 pts), match/switch 3 (9 pts), boolean chains 6 (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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4d6b96ebb6915577bb37d31fe357b13e0f70de6ffc3657f18e1e5060affcf8"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsUI::clean_diagnostics_from_views (cognitive 51): DiagnosticsUI::clean_diagnostics_from_views has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 5 (19 pts) (nesting depth added 35). 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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"bece85062199e5ebda7f76dbdda79eac88f51b51e576e60828c969e435034b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidModelView::change_selected_row (cognitive 51): RigidModelView::change_selected_row has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 4 (8 pts) (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":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6ae7e06771f8dffad0ed0b79c3dbac6ed7c14222b1a6aaa663ddf62738542c"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolTranslator::change_selected_row (cognitive 51): ToolTranslator::change_selected_row has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 4 (8 pts) (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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2611c8efdf49049dda549ccea622244ffce684c83cc47120e39095e0da9d768"}},{"ruleId":"D2","level":"warning","message":{"text":"Container::extract (cognitive 50): Container::extract has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 25). 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fd576704357761f2f637309e656ac5a0eb5ecbbb6248e70d42512f3ce91221"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::generate_references (cognitive 48): Dependencies::generate_references has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (41 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf4779dd7f4420433d8fcdc6474ec08cc16ad8257bc04fa56985eefd927f6e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Diplomacy::new (cognitive 47): Diplomacy::new has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 10 (16 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":"rpfm_extensions/src/startpos/world/diplomacy.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd7ac434a9db014b99e3510ac41c1f48bd216a53a405a9a60db4b1b9c401082"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v18 (cognitive 47): Cs2Parsed::read_v18 has cognitive complexity 47 (threshold 15). Drivers by points: loops 16 (47 pts) (nesting depth added 31). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v18) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v18.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e637ad457001af97e57efcfccc9b70515348a2abebb49c5ea57052813c8961f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v18 (cognitive 47): Cs2Parsed::write_v18 has cognitive complexity 47 (threshold 15). Drivers by points: loops 16 (47 pts) (nesting depth added 31). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v18) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v18.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea50e242fe244a39764821facfedfda37268950fb1a5b038f41e682564af7518"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::update_row_diff_marker (cognitive 47): TableView::update_row_diff_marker has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 2 (13 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 32). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deaa8637b0c19f0e6fa6700ec16f091e105516579da5421736623ca8acb4440"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::rewrite_selection (cognitive 46): TableView::rewrite_selection has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (36 pts), match/switch 1 (6 pts), loops 2 (4 pts) (nesting depth added 32). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e3c44951d65119feb8bfe2a244b71a933501811fbf7e53877ed1e675f3e088"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::app_ui::slots::handle_tab_unpreview (cognitive 46): rpfm_ui::app_ui::slots::handle_tab_unpreview has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (42 pts), match/switch 1 (3 pts), loops 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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7448c990ab3f3b2aa003398e2a4dd824294fffc50f1ea89a87521faa33714308"}},{"ruleId":"D2","level":"warning","message":{"text":"DecodedData::new_from_type_and_value (cognitive 45): DecodedData::new_from_type_and_value has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 3 (5 pts) (nesting depth added 22). 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bcb14b452d0eb3340e3c314386a73eb9972c54cc3c68ee6ef69fef82875f54"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::change_game_selected (cognitive 45): AppUI::change_game_selected has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4053}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46aca3b502e7609492ba32a2cb77c5c8d3d2f4295b880ca23b04b54d7409a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearchUI::load_rigid_model_matches_to_ui (cognitive 45): GlobalSearchUI::load_rigid_model_matches_to_ui has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"762e503db1897de774c30e9447a1bd9eb4786a86dcda2fb58fcc3dd07e858452"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchView::replace_all (cognitive 45): SearchView::replace_all has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 3 (11 pts), loops 3 (7 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc908d3770d946260007b6e47c7b2b94863a1e7a792d2b425b5145378cfbdae"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_lib::files::table::decode_field (cognitive 44): rpfm_lib::files::table::decode_field has cognitive complexity 44 (threshold 15). Drivers by points: if/else 26 (39 pts), match/switch 3 (5 pts) (nesting depth added 15). 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b7d6076a3c00072dc3323f6c47da5411c27942babe0c9bd398a8452669afc5"}},{"ruleId":"D2","level":"warning","message":{"text":"ESF::save_caab (cognitive 43): ESF::save_caab has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 5 (10 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/caab.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e529ef13fae84e80a93f9e1ea3ae41cdedf9730b4843d593c267b508228e979"}},{"ruleId":"D2","level":"warning","message":{"text":"ESF::save_cbab (cognitive 43): ESF::save_cbab has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 5 (10 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/cbab.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f85af037e2da269cfc5bf433d1e4e1a085ce1fd8c6c42cdd3824bd4d3f0ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::new_file_dialog (cognitive 43): AppUI::new_file_dialog has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 3 (7 pts), match/switch 3 (4 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7ce43c786731b84da5a7e88a45ff94c746c17e4f69681849398785f9f2150a"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::pack_tree::sort_item_in_tree_view (cognitive 42): rpfm_ui::pack_tree::sort_item_in_tree_view has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 7, match/switch 2 (6 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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"624f0540c882c2214c7d09f049172dcd2b4c8d223324f6db16b4a64584d2e2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::db_reference_data (cognitive 41): Dependencies::db_reference_data has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 3 (4 pts), boolean chains 3, 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"718425f2972d005cf5057c5322312a63ab8ce70351d8a5a7804378552e1ef923"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition::update_fields_processed (cognitive 41): Definition::update_fields_processed has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 3 (8 pts), boolean chains 6, 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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d80622acd3bd2cbc0a831aefe00f3efa4a8c6d269df2aca6b66fa8d244dac1b"}},{"ruleId":"D2","level":"warning","message":{"text":"StartingStances::new (cognitive 40): StartingStances::new has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 6 (13 pts), match/switch 1 (3 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":"rpfm_extensions/src/startpos/cai/stances.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d03039762e303bc8767d9f90b09fcc4eb869fff68b2ed6315e87368285cce"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::init (cognitive 40): Settings::init has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8690fb7fef3d7ae0cad541c132bceb387e9cc877cdc0f3eb2d68e7e9c3eec09"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedFileDecoderView::get_fields_from_view (cognitive 40): PackedFileDecoderView::get_fields_from_view has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 2 (4 pts), match/switch 1 (3 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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d603cd0f463f8a95a19c6cc2b2be0ff8598e06943180fa8c92d00a517329ec89"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::db_data_datacored (cognitive 39): Dependencies::db_data_datacored has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 6 (15 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a43b6cbd25d237253ab6483210c0e575196ee036720586f81bc8a0feba866e8"}},{"ruleId":"D2","level":"warning","message":{"text":"PortraitSettingsDiagnostic::check (cognitive 39): PortraitSettingsDiagnostic::check has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 6, loops 2 (5 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":"rpfm_extensions/src/diagnostics/portrait_settings.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6a1e32ab151a972509944f674feb6ffee55e9e111aac692a6965de392c8131"}},{"ruleId":"D2","level":"warning","message":{"text":"RFile::guess_file_type (cognitive 39): RFile::guess_file_type has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, boolean chains 10. 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"336b4140a4b7f82937746ccbcf34ca98b1d713e41ed890aa7f72fa0eb1c8f693"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::import_dependencies (cognitive 39): SessionState::import_dependencies has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 7 (26 pts), loops 4 (9 pts), if/else 2 (4 pts) (nesting depth added 26). 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":"rpfm_server/src/state/files.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f47bc485741d20fb6b67ca26914f6c6c13ef2896cc9681f2dc4ff5c9d76353"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::get_indexes_as_lua_table (cognitive 39): TableView::get_indexes_as_lua_table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (6 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17d52813c4eee46d9f85a9b773fcd2508152d08daa0b2f89166b1490f039b84"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::add_recursive_lookups (cognitive 38): Dependencies::add_recursive_lookups has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 1 (7 pts), boolean chains 1 (nesting depth added 22). 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a627c07c22dcf69ca67f5cb068a9ac1cf9fcff9a3df766b8ffa60e2ade0b9065"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_server::server_websocket::handle_socket (cognitive 38): rpfm_server::server_websocket::handle_socket has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 5 (14 pts), loops 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":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68acbbfbffde7b06602b2e66db2bccb28968e0693c3feaf4e308ad12d632104"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::patch_column (cognitive 38): TableView::patch_column has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 9, match/switch 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3519}}}],"partialFingerprints":{"codehealthFindingId/v1":"756b851d1fa6ef52f197d59301c243f719a6cd4dab3b5a6b28753c6b8241e22d"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::new_file (cognitive 37): AppUI::new_file has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 4 (10 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e47e037e030559299dd0546f46661ece3b43a845d2f830d33cf422677791806"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearchUI::load_anim_fragment_battle_matches_to_ui (cognitive 37): GlobalSearchUI::load_anim_fragment_battle_matches_to_ui has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (28 pts), match/switch 2 (5 pts), loops 2 (4 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c377e9d3021e5894ca0be6261f1f29d38c60be56d3e169c1c91e279c5558715d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileView::save (cognitive 37): FileView::save has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (12 pts), loops 1 (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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0966f1e617d61fe2d4b9ddfdabda6ad6065cd4fd153d9546eb5785f0832d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::write_pfh3 (cognitive 36): Pack::write_pfh3 has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (30 pts), loops 4 (5 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":"rpfm_lib/src/files/pack/pack_versions/pfh3.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb4849e777ee05a760b59f4934a97abb50a67bf58cbe99d19f924ad15c2627f"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearchUI::load_portrait_settings_matches_to_ui (cognitive 36): GlobalSearchUI::load_portrait_settings_matches_to_ui has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (5 pts), loops 2 (4 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5781046125a6a4c6e32127958535614a05504e26691f9214b5a015ee1ff1231"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::packedfile_views::esf::esftree::load_node_to_view (cognitive 36): rpfm_ui::packedfile_views::esf::esftree::load_node_to_view has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (10 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa599031e41a255ea769aa1ba75bfa6f96a87420909d6e9f18056e926f88b31"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::setup_item_delegates (cognitive 36): rpfm_ui::views::table::utils::setup_item_delegates has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 22). 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ff7079402870c5d192310688e23d7a9df6fef1398684a0675da1d8f75510e7"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_server::ceo_builder::get_trait_ceos (cognitive 35): rpfm_server::ceo_builder::get_trait_ceos has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (13 pts) (nesting depth added 20). Of this number, 29 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b2050477c3a5e291675b9f9c3663d4f837b031dbbad008a9ca45ed175ee797"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::purge_that_one_specifically (cognitive 35): AppUI::purge_that_one_specifically has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 1 (4 pts), boolean chains 2 (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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c205705e3780a6dc1bfbec4932b930737df8cd2ea61db4ed1f133ae15e2f92b"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedFileDecoderView::add_field_to_view (cognitive 35): PackedFileDecoderView::add_field_to_view has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (26 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"86be0d9d0d32614fe32cce2a9f73b8263bd73de1c2c4d2444218dd78271b07b3"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedFileDecoderView::decode_data_by_fieldtype (cognitive 35): PackedFileDecoderView::decode_data_by_fieldtype has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 17 (31 pts), if/else 2 (4 pts) (nesting depth added 16). 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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3451c20a38ef9ac9cb71e5f0116540d9f9003e3d3ef450600d113a35b1bf58"}},{"ruleId":"D2","level":"warning","message":{"text":"UI::finish_online_init (cognitive 35): UI::finish_online_init has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (11 pts), match/switch 1 (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":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2bbcc627575acfd250e7d37e2e4022d3d1a3fcb13ec4b9d0c517800e705ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::undo_redo (cognitive 35): TableView::undo_redo has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 5 (11 pts), boolean chains 1, 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d097222e3aa6297e571f3e5c709639dcb9027f259bb032508f288c3890db3480"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::ffi::generate_tooltip_message (cognitive 35): rpfm_ui::ffi::generate_tooltip_message has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (32 pts), boolean chains 3 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"8950563ca07ebfebcd6ab9d2f4e183c7ceed48ad844b09a9d6ff04d4bfc6c99e"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::get_column_tooltips (cognitive 35): rpfm_ui::views::table::utils::get_column_tooltips has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 1 (4 pts) (nesting depth added 20). 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7caee800944290b0142b20f61d4444de06dc5a48e182265e1c01708a3f5b44f"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v10 (cognitive 34): Cs2Parsed::read_v10 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v10) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v10.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2fa7e99a4e8ed13a0c77d62879669bfa20706ea754c1a89ab308609db4b674"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v10 (cognitive 34): Cs2Parsed::write_v10 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v10) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v10.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"87064467ed87472d005225779c6fe9c5d5e81c47014e95dc08608464b83a4460"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v11 (cognitive 34): Cs2Parsed::read_v11 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v11) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v11.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95763beed7fd3024f37db52b3c4d2b71acb3fd576af31dece511c6903acf4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v11 (cognitive 34): Cs2Parsed::write_v11 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v11) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v11.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fdf54e3e24513b853c9d9fb961ad13f87179b97bb2f0708fc6c5502eb80bec"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v8 (cognitive 34): Cs2Parsed::read_v8 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v8) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v8.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"084be1b6a6329ec2e3b8cf0674c31d10124b561a463e59bdc142c4cd151d8ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v8 (cognitive 34): Cs2Parsed::write_v8 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v8) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v8.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9094536755e591d9de33d2b8e3c96eb000df120af0b78c32beb0c5c8105ae7c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::read_v9 (cognitive 34): Cs2Parsed::read_v9 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::write_v9) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v9.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4085a671cd0121dcb32b8ae56617fa2586e97df552017cba75d4b40b5c11877"}},{"ruleId":"D2","level":"warning","message":{"text":"Cs2Parsed::write_v9 (cognitive 34): Cs2Parsed::write_v9 has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (34 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (Cs2Parsed::read_v9) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/versions/v9.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b315174d0a3a44810c0abbfde43296c523b998b1496699eba14337573d3bdac"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolTranslator::batch_translate_all (cognitive 34): ToolTranslator::batch_translate_all has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 4 (9 pts), loops 3 (6 pts), boolean chains 3 (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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad71f3429e9dbb7aa3649f636385b4d052402b9216146b55d98b0831d1c398b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::get_default_item_from_field (cognitive 34): rpfm_ui::views::table::utils::get_default_item_from_field has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (33 pts), 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e9b3b83a0c612b859bf38ab697ab3a4fb068eed0cefabad44d8e6b89cb4122"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::merge::delta_merge_rows (cognitive 33): rpfm_extensions::merge::delta_merge_rows has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (9 pts), match/switch 2 (7 pts), boolean chains 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":"rpfm_extensions/src/merge/mod.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b2c43d0de849f3ab233299387b7c598c1fd5782321f86e2654a28d78c3dba8"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitVariant::search (cognitive 33): UnitVariant::search has cognitive complexity 33 (threshold 15). Drivers by points: loops 10 (32 pts), match/switch 1 (nesting depth added 22). 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":"rpfm_extensions/src/search/unit_variant.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a1cb74a5ff13d99b7a496521e24f0d6262d250c0b8e25f0c1ccdb20b5ad66e"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormationsSlots::new (cognitive 33): GroupFormationsSlots::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 30 (32 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7625de68415fd3edb21873a88e92afc9125fdb97bec4d91e194602a0eb79be31"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::revert_values (cognitive 33): TableView::revert_values has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 3 (6 pts) (nesting depth added 22). 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6703e6f1dbbd78908481d378a3d032ad1d81620bf29cc705d0472f9f5b61968"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::db_reference_data_generic_lookup (cognitive 32): Dependencies::db_reference_data_generic_lookup has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 1 (2 pts) (nesting depth added 20). 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"68662011369c460252f1ca1650799a9607dfd072d049c5c5acb4ed7a4c6061f4"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearch::search (cognitive 32): GlobalSearch::search has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60cb932430bd8ae33e1c13545be6f93fc39aaf40c670b4724809b5f7f3104e2"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidModelMatch::replace (cognitive 32): RigidModelMatch::replace has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (32 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":"rpfm_extensions/src/search/rigid_model.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"29995fc30fc10547aefce674b1dabc1b0e6437fdca9643d26d6f33d9eb10c50d"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::open_special_view (cognitive 32): AppUI::open_special_view has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 5 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 18). 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5f2365b8d4af841b2dca15c5bf60586ce6602ba7b6a770a23ccf06acdb3a13"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::tools::ceo_builder::build_ceo_builder (cognitive 32): rpfm_ui::tools::ceo_builder::build_ceo_builder has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (19 pts), loops 9, boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/ceo_builder/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed952a18e5b5df3541355ad90ac80202da7d2ba30ba3ebb0a9f1542723b1051"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::open_subtable (cognitive 32): rpfm_ui::views::table::utils::open_subtable has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (27 pts), match/switch 1 (5 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d10270f577ea268cb75af6a05da4a9fceb11fc73b27460683393b8b59ee2362"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::validation::validate_references (cognitive 31): rpfm_extensions::startpos::validation::validate_references has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (6 pts), boolean chains 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":"rpfm_extensions/src/startpos/validation.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a29de1f78047389c18ce4130007723bbef67a1d4dfacf1a8d4bbd48810339df"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::move_path (cognitive 31): Pack::move_path has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 4 (8 pts), loops 1 (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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a61bbf915a98d3a9ff102e1924814fe7795f8c84688ae7672d4a8296d299fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::write_pfh6 (cognitive 31): Pack::write_pfh6 has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (24 pts), loops 3, boolean chains 2, match/switch 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":"rpfm_lib/src/files/pack/pack_versions/pfh6.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4c2ac3d2f473d9a489f59fc01aa9809cf430d6c70b9e76532ac575b3922dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::toggle_main_window (cognitive 31): AppUI::toggle_main_window has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (28 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eed4be880aee96cb0965fd4b482b47a198d00580ab8933a0ea32abb9449a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearchUI::load_unit_variant_matches_to_ui (cognitive 31): GlobalSearchUI::load_unit_variant_matches_to_ui has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (5 pts), loops 2 (4 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d272f19b4fa4e5dbaee0a1380889ce3e23867f14e15f1b442737c77fb03363"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::get_loc_data (cognitive 31): Tool::get_loc_data has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (10 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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d7c5e42cdf39e52f3cdabd43adbe3ab440766e5840e0c5739a13a312200491"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::files_by_path (cognitive 30): Dependencies::files_by_path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 1 (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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"421a09280de7eca0a7f4895833acda5ed1a31cce0decbe9b408f3b1703dc9c04"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostics::ignore_data_for_file (cognitive 30): Diagnostics::ignore_data_for_file has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (7 pts), match/switch 1 (6 pts), boolean chains 3 (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":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc811eab591004308b74c72f0500e1026a5f256a1117b2f8b5e91b684cda44a6"}},{"ruleId":"D2","level":"warning","message":{"text":"PackDiagnostic::check (cognitive 30): PackDiagnostic::check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 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":"rpfm_extensions/src/diagnostics/pack.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4413d1cc260652988e14177709028de0913d25d1c49fef79a74d6fd603e857"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimFragmentBattleMatch::replace (cognitive 30): AnimFragmentBattleMatch::replace has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (24 pts), match/switch 2 (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":"rpfm_extensions/src/search/anim_fragment_battle.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"783efd5288911678c18f468e4cc04b16e01f9abc6d24fff2da1a1adc61beb687"}},{"ruleId":"D2","level":"warning","message":{"text":"CampaignIndex::new (cognitive 30): CampaignIndex::new has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8 (10 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":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fa8010568e6d12c30839fd5568a62945a414660b6384466b19a89158d455c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::patch_siege_ai (cognitive 30): Pack::patch_siege_ai has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 3, 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7301b71c03d45b2d75ca8d1c6fe2d01d28f8959114ec609b762b775c7608a7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::write_pfh5 (cognitive 30): Pack::write_pfh5 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (24 pts), loops 3, boolean chains 2, 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, 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":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cbb72521b8f7f01fa97cae8643ef8ec0a24991147838b7d66a21727c37e8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::smart_delete (cognitive 30): TableView::smart_delete has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (9 pts), match/switch 2 (9 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"792197f501bef865193208a951001b5e278a5b3c54b2e4dea59b2d5e1e10f1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::db_data (cognitive 29): Dependencies::db_data has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (9 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab678178f90d684ba2de97e59cf612dbb46edae6d3eb9df455cacac54285b1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"TableInMemory::tsv_import (cognitive 29): TableInMemory::tsv_import has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (17 pts), match/switch 2 (8 pts), loops 2 (4 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":"rpfm_lib/src/files/table/local.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b522f9d6aede6272a2fc9cf28910a8bcc8f770ecb7e8ff2f9df4d0df0060b58f"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedFileAnimPackViewSlots::new (cognitive 29): PackedFileAnimPackViewSlots::new has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (9 pts), match/switch 3 (6 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":"rpfm_ui/src/packedfile_views/animpack/slots.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac92b11493ec251935fe8a2600e3c9b202ccf66cf21e07fb5287dfed6336dbe9"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::new_view (cognitive 29): TableView::new_view has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (23 pts), loops 4, boolean chains 1, 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, 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a34f896bb1a909fe20423dca752497a12dcb8f9bd6e29981ce7823a72c62bd"}},{"ruleId":"D2","level":"warning","message":{"text":"RFile::decode (cognitive 28): RFile::decode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 5 (8 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e0bf808b5844d74f6747680e8b189c3c2df34672e0349c70760c77945a59ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Container::move_path (cognitive 28): Container::move_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 4 (8 pts), loops 1 (3 pts) (nesting depth added 17). 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7f4c20b50574e1206cc0c76662eefedbc64521cbcdb00777a75771b8e08743"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfo::language_path (cognitive 28): GameInfo::language_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (28 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":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbab662ce52d6d7aa14095c227ffde891efa60b61761ecccf533a6f9550bc63c"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::save_packfile_by_key (cognitive 28): AppUI::save_packfile_by_key has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"35500768d411fc9a502005bfbcfc9e054bfd61044e015ac1c27b7defbfc43807"}},{"ruleId":"D2","level":"warning","message":{"text":"PackedFileDecoderView::update_rows_decoded (cognitive 28): PackedFileDecoderView::update_rows_decoded has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1002c464a62de77aaf534c35d35ec1d6bc02eb0f34420b7f570e86c7dd2d9188"}},{"ruleId":"D2","level":"warning","message":{"text":"Text::search (cognitive 27): Text::search 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":"rpfm_extensions/src/search/text.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b232aea90f827ea1eff74822db4c7a8853e801f78885eb0b3005d18aa26623"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::open_packfile (cognitive 27): AppUI::open_packfile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (5 pts), loops 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a91b79683db6e7f2f941f5fa2ae5664143c74dd446f95d8c869c0569313617"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsUI::update_entry_path (cognitive 27): SettingsUI::update_entry_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (10 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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92824f651728d7bb4400d1e31c0adb616bd748bce9c25bc864885424455794c"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchView::replace_current (cognitive 27): SearchView::replace_current has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (6 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"49402a41403f4efd38371db4390f42e4d317e0b0ff964638d2e5bcc4276b6933"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::add_recursive_lookups_to_definition (cognitive 26): Dependencies::add_recursive_lookups_to_definition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (9 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3695}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ccf234688276ba83a888bc2870b06bbce27c24bd8a5a2cc00b32f0f7717a08"}},{"ruleId":"D2","level":"warning","message":{"text":"AreaGroups::new (cognitive 26): AreaGroups::new has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (11 pts), boolean chains 3 (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":"rpfm_extensions/src/startpos/cai/map.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0689b50d6bb229c2fd0660bf95e7610276aaf76f27cca2c666ca733dc3ee24c"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::lua::parse_function_block (cognitive 26): rpfm_extensions::lua::parse_function_block has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (5 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":"rpfm_extensions/src/lua/mod.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"483a96e484b9e403087d5cba6fd514d2a13abe08dc75b27994896fb776de9a25"}},{"ruleId":"D2","level":"warning","message":{"text":"DB::generate_twad_key_deletes_keys (cognitive 26): DB::generate_twad_key_deletes_keys has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (25 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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f59076280dce6efad83804c7cec0e3efb823efad20c01390fc437565b7889f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::read_pfh4 (cognitive 26): Pack::read_pfh4 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 3, loops 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":"rpfm_lib/src/files/pack/pack_versions/pfh4.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0301530238883c18de98142e51c2d3366716dafcdff887274479f124a97f95d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::read_pfh5 (cognitive 26): Pack::read_pfh5 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"425163ee5ea8368ee6a20542ce93611a2ff8786e29e1c6d941185da61164482e"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_lib::files::table::decode_field_postprocess (cognitive 26): rpfm_lib::files::table::decode_field_postprocess has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 7 (10 pts), loops 1 (3 pts) (nesting depth added 13). 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"574c5a51d9e78ae5cae625c4b5a7a4d43543b27fb3defc5fe413a91c20760011"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_server::ceo_builder::export_ceo_tables (cognitive 26): rpfm_server::ceo_builder::export_ceo_tables has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (11 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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"047fb53a1f8d553004a47f0c8e0ffcd2844e54c080a41bb795d84286c1ec56d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DependenciesUISlots::new (cognitive 26): DependenciesUISlots::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/dependencies_ui/slots.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fbeaef17ffb94b769c8eafe322f590643f29aaef3024b0a688eac15bd098a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PortraitSettingsSlots::new (cognitive 26): PortraitSettingsSlots::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 4 (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":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec5c190d7ee26fbaac22a88eb8f1c68c134db859a3fc0ddc2540e3c37481a5b"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionUI::populate_radio_buttons (cognitive 26): SessionUI::populate_radio_buttons has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2, 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":"rpfm_ui/src/session_ui/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"794ac05327a789d29be46390a0c49bce41259c893d0ab18a21756c8fc82c006c"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::file (cognitive 25): Dependencies::file has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (25 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"30913382d021fb86d99fc68caa2518b3aa28df908af82d46b5d5dda4ef2c97cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ForcePlan::new (cognitive 25): ForcePlan::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 6 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/world/writer/forces.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"50eba89267ba087320952cc9c05ba90c2296cedd23db2d1423e1a11cffd324ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::cai::technologies::faction_technologies (cognitive 25): rpfm_extensions::startpos::cai::technologies::faction_technologies has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (6 pts), boolean chains 4, match/switch 1 (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":"rpfm_extensions/src/startpos/cai/technologies.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8760fcac6ced233ec07e535a7d2b34d60d5148ca3db40f9fdd2ca27c3b326750"}},{"ruleId":"D2","level":"warning","message":{"text":"DecodedData::convert_between_types (cognitive 25): DecodedData::convert_between_types has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 10 (13 pts), if/else 6 (12 pts) (nesting depth added 9). 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f40be592c36108393c2aaadee51c0022a033ae9ff7433770fa9b9568b7d09d"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfo::ca_packs_paths (cognitive 25): GameInfo::ca_packs_paths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (6 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":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3fe70bf73e2574a11ad75fc6bdf05c5eb51be830c3b2e4cacf102200b255f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Field::from (cognitive 25): Field::from has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 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":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"76868fad142be88bf1aa43e5552211987185ed72f9e03d80af68d7259af638cd"}},{"ruleId":"D2","level":"warning","message":{"text":"MyModUI::new (cognitive 25): MyModUI::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/mymod_ui/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44901d3a9a00e98df0d5b3de471416b8f9fcaf5983edc8f2b2224c3fd23ddb1"}},{"ruleId":"D2","level":"warning","message":{"text":"PackFileExtraViewSlots::new (cognitive 25): PackFileExtraViewSlots::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 1 (3 pts), match/switch 1 (2 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":"rpfm_ui/src/packedfile_views/packfile/slots.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9753b471974222695f669b065318979ea06c36c2f957640414034df2017c580"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolUnitEditor::new (cognitive 25): ToolUnitEditor::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f739b87b12d4c2e6f06963d7a55780e3a0dfb86e06e5d8af3f57d29752e798fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::paste (cognitive 25): TableView::paste has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, loops 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"28425369f5712149fd1f062774f23257124ac993af009b9ee9a3eb258c0cdf44"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::load_parent_pack (cognitive 24): Dependencies::load_parent_pack has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (24 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"f602ea9b4cc3bb3b9626e8df4781550e2b05920ddbd616e27c2e7ab48d0d2131"}},{"ruleId":"D2","level":"warning","message":{"text":"CampaignRows::new (cognitive 24): CampaignRows::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/split.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebab02e41806d3737963bd2fdedbaa394d3cf116810701a5653691350851abc"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterWriter::family_links (cognitive 24): CharacterWriter::family_links has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), match/switch 1 (2 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":"rpfm_extensions/src/startpos/world/writer/family.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe1159274e9aee85ced30e10abb11519e37feb7e815d85746e3d5a82212456d"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::search::replace_match_string (cognitive 24): rpfm_extensions::search::replace_match_string has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c63c05139e86e36bd31c6e316550795f5358df99b18e4e2c122c00d967f52ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::extract::compare::compare_tables (cognitive 24): rpfm_extensions::startpos::extract::compare::compare_tables has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/extract/compare.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65961650535c367a9094784101de03e6809a09c7e8a203bbca929d31e8727c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::extract::regions::province_values (cognitive 24): rpfm_extensions::startpos::extract::regions::province_values has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/extract/regions.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3afc075d9f7546f041a7a95f90f7943bf8cd7abcc545ab401d219c73fdd3288"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::world::availability::available_chains (cognitive 24): rpfm_extensions::startpos::world::availability::available_chains has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/world/availability.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"face24db56db0197c26cc810823eb6665a548114ab19759f8cd0b0af37741cf7"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::decode_rom_2 (cognitive 24): GroupFormations::decode_rom_2 has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 1 (3 pts) (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":"rpfm_lib/src/files/group_formations/versions/rome_2.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"135552f5139dbe8440e6fd19a96ecc642937334a86a102b35d48c3e46f8b0412"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::encode_rom_2 (cognitive 24): GroupFormations::encode_rom_2 has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 1 (3 pts) (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":"rpfm_lib/src/files/group_formations/versions/rome_2.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e011b494b3436f663a66030ab2b80d981e115a7db3039c651a29c0084a096e9"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::decode_wh3 (cognitive 24): GroupFormations::decode_wh3 has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 1 (3 pts) (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":"rpfm_lib/src/files/group_formations/versions/warhammer_3.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb8b9bb5b51a6b44911fdf244b6fb15d8b63a492b4c1401a1ae911fa58cd14"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::encode_wh3 (cognitive 24): GroupFormations::encode_wh3 has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (21 pts), match/switch 1 (3 pts) (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":"rpfm_lib/src/files/group_formations/versions/warhammer_3.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7f15497a9003ecd329d9434a63d73f15bc1005d153124eed648116b7bb29f7"}},{"ruleId":"D2","level":"warning","message":{"text":"RFile::encode (cognitive 24): RFile::encode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c7d8d410b217e2a859622699bfa0d9c865194c40036f84bc2c859883df87b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::write_pfh4 (cognitive 24): Pack::write_pfh4 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (21 pts), loops 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, 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":"rpfm_lib/src/files/pack/pack_versions/pfh4.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c022cec74547e11bbb49a469ef021d9165ac8acfd4dc8fec13317e58f1e08938"}},{"ruleId":"D2","level":"warning","message":{"text":"DependenciesUI::import_dependencies (cognitive 24): DependenciesUI::import_dependencies has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 13). 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":"rpfm_ui/src/dependencies_ui/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d01bf3ae2dfedf1b1a73f59fe80b3facd61b84e73b4511fe953f1817cfa0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"PackFileContentsUI::create_rename_dialog (cognitive 24): PackFileContentsUI::create_rename_dialog has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, match/switch 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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4616a2acec6720d299859385fbfb1b77a733ae26419ce3a0429fdb8debc0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolTranslator::import_from_another_pack (cognitive 24): ToolTranslator::import_from_another_pack has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (9 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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"df39f5761e93932954361a75b90274d9b7dd22aa357ac7c5117a30b8f974764c"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::copy_selection (cognitive 24): TableView::copy_selection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (5 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57865724ecb8e32e146e6bd96625ca6133577636aaad1ef8c188f5843ca12aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::command_palette_ui::collect_actions_from_menu (cognitive 24): rpfm_ui::command_palette_ui::collect_actions_from_menu has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 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":"rpfm_ui/src/command_palette_ui/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28f4bec9a14ca38ea3d71fdb57d6ba2a1c24a7da48171a0f755193ffc170ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"Icons::set_standard_item_icon (cognitive 24): Icons::set_standard_item_icon has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (10 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":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4dc4a092b3b10b31643e4576309f4712d91a7593baddf40995d5b07924f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"LuaApi::add_scripting_doc (cognitive 23): LuaApi::add_scripting_doc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/mod.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6424da052c522cf6d0bd136d471dab2a83008d84cbb2e01f8d5c0641e38d1f19"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::extract::characters::push_forces (cognitive 23): rpfm_extensions::startpos::extract::characters::push_forces has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/extract/characters.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1590186bf14b1d6e4b5f50f1e3a5fe6ae91491af1f97f0f0e7c5bd1479ce84"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::extract::factions::diplomacy (cognitive 23): rpfm_extensions::startpos::extract::factions::diplomacy has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (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":"rpfm_extensions/src/startpos/extract/factions.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef83b2e3de23ee2a89656e01cb7a8122abbc4a98c0f132649aa82a5ad7e757f"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetVariationDb::validate (cognitive 23): AssetVariationDb::validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (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":"rpfm_lib/src/files/asset_variation_db/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbcffc19e7f14edafee1bee57c8e15489483cdf72b6d8f866e6b6f2228fa922"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormation::validate (cognitive 23): GroupFormation::validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), loops 4 (5 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":"rpfm_lib/src/files/group_formations/validation.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e4bd0d0a1e38907f10c3fcc9557b365be0c36421b47ae745684a52f75775f5"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::pack_map_dialog (cognitive 23): AppUI::pack_map_dialog has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 6, 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba53e9e9eb4319e449c9ec7e4c42ca130076dbc8653ecd59eb75996cedeb9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalSearchUI::update_pack_sources (cognitive 23): GlobalSearchUI::update_pack_sources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 3, loops 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b62922c1f9d25c2485ccde28a213010a318d486a826444097bb0bce475a776f"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::command_palette_ui::show_command_palette (cognitive 23): rpfm_ui::command_palette_ui::show_command_palette has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (5 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/command_palette_ui/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74848f733cb7530e514a183db301de4bedea0418f5837735868089ea504b6cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::load_loose_files (cognitive 22): Dependencies::load_loose_files has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"441ab5daf9b0729df6986dc11f68000431f13da1f3247cd2acf30e526dfbd900"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchOn::types_to_search (cognitive 22): SearchOn::types_to_search has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22. 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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b43d84467df4996e5792eb625d17d3a6e5cd1ccb91a164fa92cfc205aa1d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"PortraitSettingsMatch::replace (cognitive 22): PortraitSettingsMatch::replace has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (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":"rpfm_extensions/src/search/portrait_settings.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"140b1c9caabad044e9f43700301ca7adf5dd97c677164bdde7ca5ab948e0cb40"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::faction (cognitive 22): Reader::faction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (7 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":"rpfm_extensions/src/startpos/cai/world_view.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb6963123da15bb38ec4a07bbf9f1730421a07b6fe502b858637719680e46a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DB::optimize (cognitive 22): DB::optimize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, match/switch 2 (nesting depth added 5). 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":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0ac059519a78e369aab0ea4487729691a15ec8d2400b51096409c877acb035"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::decode_sho_2 (cognitive 22): GroupFormations::decode_sho_2 has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (19 pts), match/switch 1 (3 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":"rpfm_lib/src/files/group_formations/versions/shogun_2.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"507e78a7f5cf6c7c433f944017d30545f9847ef50a371437a2bb65279a3906e0"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::encode_sho_2 (cognitive 22): GroupFormations::encode_sho_2 has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (19 pts), match/switch 1 (3 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":"rpfm_lib/src/files/group_formations/versions/shogun_2.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"284fc4991be021a8a44cb3441bce72681ca9f1cba3e63a1a713bf4e51b956bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::decode_troy (cognitive 22): GroupFormations::decode_troy has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (19 pts), match/switch 1 (3 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":"rpfm_lib/src/files/group_formations/versions/troy.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5066500e469dc63fab3459f61eb6e5539a06367b6f2d77ba04c36aaa30466b"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormations::encode_troy (cognitive 22): GroupFormations::encode_troy has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (19 pts), match/switch 1 (3 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":"rpfm_lib/src/files/group_formations/versions/troy.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23156dcbd41eb49b516dae0f8799071cb991b087e3ce4c287d27d6294b48a27"}},{"ruleId":"D2","level":"warning","message":{"text":"Container::insert_folder (cognitive 22): Container::insert_folder has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdf0da34657b6b19cd4015c88161a41031843ff9f911a28314a8a57de61e32a"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::read (cognitive 22): Pack::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"85be98de529938f0575ca391d36c06137fbd8c89babe17c81e083d2738ee394f"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::read_pfh6 (cognitive 22): Pack::read_pfh6 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh6.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4778e8a2d31f0f95821a5e84ed6964948ce866cec56a749c529bf084c54b507b"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidModel::read_v6 (cognitive 22): RigidModel::read_v6 has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (5 pts), match/switch 1 (3 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":"rpfm_lib/src/files/rigidmodel/versions/v6.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6de44c2ab3e0c0e2d350d8be4a48d6753f144043455827b81d6bbf37bd860ce"}},{"ruleId":"D2","level":"warning","message":{"text":"GitIntegration::update_repo (cognitive 22): GitIntegration::update_repo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fc372a870dcb19faafcc3cce2e32321dac675d9ec757782820026fa1ee86c5"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::paste_files (cognitive 22): SessionState::paste_files has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/files.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aa9f1593fdb46853aa53e075d4cab2fbfdd0e1436939761f7c4c3b2666f142"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_server::updater::check_updates_rpfm_with (cognitive 22): rpfm_server::updater::check_updates_rpfm_with has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/updater.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddf0944dd4404058247327489a144a79ff7ebc79b1701bfda9ae9274ac9ee59"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::build_starpos (cognitive 22): AppUI::build_starpos has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4485221f57a85820fe870cad27437856bdb3353950e94df4472fcb69e21758b0"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormationsView::load_blocks_tree (cognitive 22): GroupFormationsView::load_blocks_tree has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (6 pts), loops 3 (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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0244898f30d4b2235ac3d6984c3ead754e06c69d18f07fe94d5add4bd148cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsUI::load (cognitive 22): SettingsUI::load has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 7, 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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5361d1b2371a7800eb3d3a9bfc6e4e1e1450f4e5160fa77c43ee38b1dc32d20"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::gltf::gltf_from_rigid (cognitive 21): rpfm_extensions::gltf::gltf_from_rigid has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 3 (6 pts), match/switch 1 (6 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":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"550bf439c90a5ec0c815f36600d992ca86279cdd1a50163e18ff956bb07461c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Atlas::search (cognitive 21): Atlas::search has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 2 (3 pts), boolean chains 1, match/switch 1 (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":"rpfm_extensions/src/search/atlas.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3afeb0b20bc2f2901a8f1611d95a7a0a6cdf8c1017ebd6856dff12616af9ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfo::ca_packs_paths_no_manifest (cognitive 21): GameInfo::ca_packs_paths_no_manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fef905408bd103673386ecf6977ba1cd3790a2c7e226fa00446c7ec6494310b"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::extract_files (cognitive 21): SessionState::extract_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (6 pts), loops 2 (4 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":"rpfm_server/src/state/files.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312fc258e14fcd98d12d47234010342805dfd50e4e29097f7167c9648e97281"}},{"ruleId":"D2","level":"warning","message":{"text":"PortraitSettingsView::load_variant_image_to_label (cognitive 21): PortraitSettingsView::load_variant_image_to_label has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 2 (5 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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7f05b47c24ea1b795bf7323432db9e1e22f02b912cde9d550cbb8d6ba038b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::diagnostics_ui::slots::ignore_selection (cognitive 21): rpfm_ui::diagnostics_ui::slots::ignore_selection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, 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":"rpfm_ui/src/diagnostics_ui/slots.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3d9570c95b481fb60297127f54ff503ea61be24807640281f4c55d12302c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::db_values_from_table_name_and_column_name_for_value (cognitive 20): Dependencies::db_values_from_table_name_and_column_name_for_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd314ff6e45f6db2036925bbc94d14b8588fcbd8d09d1f54540041c33d99dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"LuaApi::hover_html (cognitive 20): LuaApi::hover_html has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (9 pts), match/switch 1 (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":"rpfm_extensions/src/lua/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed1ae02d5a9d7afff782045becabd9ef9d4bb9895b97e9795632e83f86ff5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::cai::settlements::write_building_slots (cognitive 20): rpfm_extensions::startpos::cai::settlements::write_building_slots has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (9 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":"rpfm_extensions/src/startpos/cai/settlements.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"de769947046b9bcd69b68866142f42c0d421742f44d8a03fdbc08e105cee8f20"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::extract::characters::extract (cognitive 20): rpfm_extensions::startpos::extract::characters::extract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 7 (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":"rpfm_extensions/src/startpos/extract/characters.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dab1da8c425c495bfa6260a96ff4bb694e8e7ad4204975d6aff2d8ff74321b"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchedCombat::write_v1_3k (cognitive 20): MatchedCombat::write_v1_3k has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (20 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":"rpfm_lib/src/files/matched_combat/versions/v1_3k.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b247b5c86c4277a6275108f8c7553666086d14497ab771c55fa80859282643f0"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchedCombat::read_v3 (cognitive 20): MatchedCombat::read_v3 has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (20 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (MatchedCombat::write_v3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/matched_combat/versions/v3.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf30bae307d639475671f70bbf6380a5347ec515f6614240d299c50b3f0b006"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchedCombat::write_v3 (cognitive 20): MatchedCombat::write_v3 has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (20 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (MatchedCombat::read_v3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/matched_combat/versions/v3.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc721cf8e29e1600d39b8dcb6d3c96ebee2db25f545e3fe4b6eaf984a5611ed"}},{"ruleId":"D2","level":"warning","message":{"text":"TableInMemory::set_definition (cognitive 20): TableInMemory::set_definition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts), match/switch 1 (4 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":"rpfm_lib/src/files/table/local.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6a75b18fbc11fa41e6df8a99fe30b2c77c090e53026a3e2e4e77269310ccb6"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfo::install_type (cognitive 20): GameInfo::install_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4 (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":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"478956b3b16bff1c5aa8d314c283bf99582298efecd095a05b10d449d1c13bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::anim_paths_by_skeleton (cognitive 20): SessionState::anim_paths_by_skeleton has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (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":"rpfm_server/src/state/files.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24c4c8185d1ece042508d4e73a26ccca45b2ff62d69da8fa14993dbf71999c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::reload_used_paths (cognitive 20): Tool::reload_used_paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (5 pts), boolean chains 2, 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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9799ce360097cfd19aa81f7c33449e1ab0d4294502f6084beb2a0447b61de267"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolTranslator::save_from_detailed_view (cognitive 20): ToolTranslator::save_from_detailed_view has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, loops 1 (2 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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d29afb71882b0fc643b9afd86937c7524338cc7c68763e86f321b046d94ab03"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolUnitEditor::load_unit_icons (cognitive 20): ToolUnitEditor::load_unit_icons has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"037184a0aed4f95dc970da5c64d0ec55206468cb74eaa0b4d2eed17deaf6b7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::files_mut_by_paths (cognitive 19): Dependencies::files_mut_by_paths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0553f3c5b0058ba08937de82895318820410f6a8b44d70f59281656ae27188a"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::check_call (cognitive 19): Checker::check_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 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":"rpfm_extensions/src/lua/check.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c896b6fc76d094cf457f24d9b2712cac6ca9124e0b9146fec65b79b20c40db9"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::check_listener (cognitive 19): Checker::check_listener has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 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":"rpfm_extensions/src/lua/check.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bb794d41037354da44d92a01b7bdd47d459e0ae9c9cdc44251acbb464a5196"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionMap::neighbour_pairs (cognitive 19): RegionMap::neighbour_pairs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/region_map.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9325ef21a3b151796e54d12c512a9677a4c1a2193e393c98b32935b2c6717b"}},{"ruleId":"D2","level":"warning","message":{"text":"PackSettings::diagnostics_files_to_ignore (cognitive 19): PackSettings::diagnostics_files_to_ignore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe83b2d1af51a320aa5e86761f5528d9216aaac31b98772f41efa75967501d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_lib::integrations::assembly_kit::get_raw_data_paths (cognitive 19): rpfm_lib::integrations::assembly_kit::get_raw_data_paths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (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":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ee0c53c1eb51491aa3066b3548c71492648c4a8ac54a7dbd1d317da727563a"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::update_schema_from_asskit (cognitive 19): SessionState::update_schema_from_asskit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (3 pts), loops 2, boolean chains 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":"rpfm_server/src/state/schema.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"76773a61fc6cae5bbc5295d21d5c918ad45ea77d486af13bf5957d6166f48ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::find_definition (cognitive 19): SessionState::find_definition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tables.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b500d3084d9062522109245f4ead6f631a6a23bfe65ecbcdd842d7b9dbf46a06"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_server::server_mcp::wait_reporting_progress (cognitive 19): rpfm_server::server_mcp::wait_reporting_progress has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (9 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":"rpfm_server/src/server_mcp.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ae4d8b2aad59ebf36e2027d2c213520035c862f378b09e34322e0d9e1411f5"}},{"ruleId":"D2","level":"warning","message":{"text":"AppUI::file_view_hide (cognitive 19): AppUI::file_view_hide has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2, match/switch 1 (2 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3977}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f237ac249221d3c0dd6b4b75b231eaaddb2e882589ad0dc74d99665f9730d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferencesUI::open_match (cognitive 19): ReferencesUI::open_match has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, 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":"rpfm_ui/src/references_ui/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f47d13b375e7d7ef5b84e47b28360c00bcc29c54d2bcd02e38e543ba79a5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsUISlots::new (cognitive 19): SettingsUISlots::new has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (9 pts), if/else 5 (7 pts), loops 3 (nesting depth added 3). 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":"rpfm_ui/src/settings_ui/slots.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"603a60ef9efdefea623b2d8d673452a05b7ef8a0125c65d96653f1edc9f2feb8"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::context_menu_update (cognitive 19): TableView::context_menu_update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f290d221ef8e704d6044c6f41f4ce884b7eb55212e99219e60031280b223bac5"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::generate_ids (cognitive 19): TableView::generate_ids has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf6ad88c7e64c583d94572b11200ef2f76483373116a2f4ea756a6e21dc0566"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchData::find_in_column (cognitive 19): SearchData::find_in_column has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87f874bb0df0cd79b4564f2f60d24b4eb78fedf145b3323f3cc3cecc74b28c6"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::filter::parse_predicate (cognitive 19): rpfm_ui::views::table::filter::parse_predicate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/filter/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16e37472cd03e70567eda9630829d45b127396d358a7ebcb9819d6c96c43abc"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::get_item_from_decoded_data (cognitive 19): rpfm_ui::views::table::utils::get_item_from_decoded_data has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffde5f271dd3ce846724b70c180a1b1d30c5d16565ba98630b867bbc7ee55df7"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::views::table::utils::request_backend_files (cognitive 19): rpfm_ui::views::table::utils::request_backend_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1b82c98b7e414690a741b10e24577e4606a3ea7e7b47b92d5e0c104f5ab3ad"}},{"ruleId":"D2","level":"warning","message":{"text":"References::new (cognitive 18): References::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (8 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":"rpfm_extensions/src/startpos/extract/compare.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e216504e29ef9b140e41c046bf3f3b2c6dac25ebf2f19e66b83ef728df033df"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::cai::regions::region_links (cognitive 18): rpfm_extensions::startpos::cai::regions::region_links has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (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":"rpfm_extensions/src/startpos/cai/regions.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a6334bb2a07bb97892bafdf3fde53011f0767f10c5cc77e25deaf30e235672"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::extract::regions::extract (cognitive 18): rpfm_extensions::startpos::extract::regions::extract has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/extract/regions.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe7add2d335f8becd8a6b56daa7c06cfdc4b132f3205ecaad20bfdef00d80dc"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::world::garrisons::garrisons (cognitive 18): rpfm_extensions::startpos::world::garrisons::garrisons has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 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":"rpfm_extensions/src/startpos/world/garrisons.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea0e08bbd9dfd14c03ab9ea285044687302abb9f8082bd29dafc5a32d799aff"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_lib::utils::final_folders_from_subdir (cognitive 18): rpfm_lib::utils::final_folders_from_subdir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (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":"rpfm_lib/src/utils.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a24a64bf6f03ad30db05717b52b6716e6260e57393340146a4e7e2b57cc20e"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::filter_table_with_preview (cognitive 18): TableView::filter_table_with_preview has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"483dd33a1cca9da01715c33cb6fefc3a72317e48020587ee63a3d578b28fd02e"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::escape_string_from_index (cognitive 18): TableView::escape_string_from_index has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc8922b952b0a505e53944e4e4f32f36ca7338f208d76ecb7a791868899befd"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::insert_rows (cognitive 18): TableView::insert_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"61265175bdb458082d5d53ae2290daddda8700ee279f3154f6372fbd3cd12e02"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::command_palette_ui::collect_files_recursive (cognitive 18): rpfm_ui::command_palette_ui::collect_files_recursive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/command_palette_ui/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8738cbbf55b0e8dd0b31ccd8951bc024544915a570bf34ece06d6fa25d779f3"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_ui::ffi::assets_request_callback (cognitive 18): rpfm_ui::ffi::assets_request_callback has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (7 pts), loops 2 (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":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05f9f57b44f57a83c7910acf6fda0abf547f5bc3536ee2fa57874b13e1d25ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::generate_dependencies_cache (cognitive 17): Dependencies::generate_dependencies_cache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"97474c003eef9c9e6bdec23aaf7916bf52c7d7ededd9e959d7447d1ab015f1e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::loc_data (cognitive 17): Dependencies::loc_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ccf6318d79c99eb292127943390bb91f4bd815c25e3d5e1eff5781bcd18363"}},{"ruleId":"D2","level":"warning","message":{"text":"CaiPlan::new (cognitive 17): CaiPlan::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/cai/plan.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"35923b1760841416c87bfa08b4d762190ffe88322f4f675f14301447f873ba7e"}},{"ruleId":"D2","level":"warning","message":{"text":"CampaignRows::add_referenced_rows (cognitive 17): CampaignRows::add_referenced_rows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/split.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c7015143b66010e622a1411af39df4a6a916269955ef015b0e944ceaedbe43"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::validation::validate_adoptions (cognitive 17): rpfm_extensions::startpos::validation::validate_adoptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"rpfm_extensions/src/startpos/validation.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9df922d3765e8acfadd9de01fe301a5392bd97c06b7265dcf4aa3b43a4db5ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::world::husband_factions (cognitive 17): rpfm_extensions::startpos::world::husband_factions 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":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b68356b8312d56e0a4b7f430e76fcac031ff9c64fd8e93cfbd3a2524a6434fe"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::world::provinces::sea_regions (cognitive 17): rpfm_extensions::startpos::world::provinces::sea_regions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (4 pts), match/switch 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":"rpfm_extensions/src/startpos/world/provinces.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f2fffb872d3d65d4c5233b1acd7abbbe4c24493f593844f6a8e907c875180d"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::writer::international_routes::plan_routes (cognitive 17): rpfm_extensions::startpos::writer::international_routes::plan_routes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/writer/international_routes.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"817b4069219a85b14f4a9310862b14966ca2ce0e67b7f78a8acbbf0ff94cf310"}},{"ruleId":"D2","level":"warning","message":{"text":"Image::decode (cognitive 17): Image::decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts) (nesting depth added 10). 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":"rpfm_lib/src/files/image/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f37c99cfb2fc3c00246828f19bf7b7ae146eeb52e2ddc97f1f37540c31f11b"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidModel::write_v7 (cognitive 17): RigidModel::write_v7 has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 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":"rpfm_lib/src/files/rigidmodel/versions/v7.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf8bea0cc71d19a440374110e8d3ddf1166592be939a1ce468b23aa999dcd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidModel::write_v8 (cognitive 17): RigidModel::write_v8 has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 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":"rpfm_lib/src/files/rigidmodel/versions/v8.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"087a799904a217158fb74876430ee92d8fd17a530b2f6358e96be8201d86cf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundEvents::write_emp (cognitive 17): SoundEvents::write_emp has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (11 pts), if/else 2 (5 pts), boolean chains 1 (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":"rpfm_lib/src/files/sound_events/games/emp.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaf9aa3daee08a00c48e9bbd3294d2f36124d820bbc01cea4368df2670ed75f"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundEvents::read_sho2 (cognitive 17): SoundEvents::read_sho2 has cognitive complexity 17 (threshold 15). Drivers by points: loops 13 (15 pts), if/else 1 (2 pts) (nesting depth added 3). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SoundEvents::write_sho2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_events/games/sho2.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e2cbb57f158a7ad0a6e166fcf9a78349c4fd28d5e5532c5d023079fc78a1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundEvents::write_sho2 (cognitive 17): SoundEvents::write_sho2 has cognitive complexity 17 (threshold 15). Drivers by points: loops 13 (15 pts), if/else 1 (2 pts) (nesting depth added 3). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SoundEvents::read_sho2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_events/games/sho2.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3802270500b0e91efea7c5dc3522a3327ed43b3a8ae21460bc04f508ddbbee"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::search_references (cognitive 17): SessionState::search_references has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (8 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":"rpfm_server/src/state/tables.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b74a370975a607efd03c3611b4c926eb9ad48e3e35987c4be8ffbb4900bae25"}},{"ruleId":"D2","level":"warning","message":{"text":"MyModUI::update_dialog (cognitive 17): MyModUI::update_dialog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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":"rpfm_ui/src/mymod_ui/mod.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9748bf79609436fb01dd2ba4000ec7cc148cf2c1a62aa8973ce3b6aa1fc03496"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitVariantSlots::new (cognitive 17): UnitVariantSlots::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 pts) (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":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cff68bf1e8c566837777a2c8db92901f9b78a41ecf7b8cc0bd1a2877040e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"PackFileContentsUI::add_files (cognitive 17): PackFileContentsUI::add_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 1 (3 pts), 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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0324bfe344d7c9e05e9855db4d45c9839049ea85f005d8a00cb641a3d1c91f51"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolFactionPainter::save_faction_banner_data (cognitive 17): ToolFactionPainter::save_faction_banner_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (4 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. This shape REPEATS in the file: one other method here (ToolFactionPainter::save_faction_uniform_data) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"5261cef1396f627a1f023f06267327c5c4b2bb53d09c3d1a2e6ed24d51233a87"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolFactionPainter::save_faction_uniform_data (cognitive 17): ToolFactionPainter::save_faction_uniform_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (4 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. This shape REPEATS in the file: one other method here (ToolFactionPainter::save_faction_banner_data) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcc40f02293b59dde98108ac27e7d08a58318e120c6f89a92709cd5492d2207"}},{"ruleId":"D2","level":"warning","message":{"text":"SubToolVariantUnitEditor::load_variant_mesh (cognitive 17): SubToolVariantUnitEditor::load_variant_mesh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2cafd0ba1b9032d2286cb218862321ef095457f2903ee8c626ea96e58e3914"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::load_parent_files (cognitive 16): Dependencies::load_parent_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaf180788620e66959034468b5a65e6b5049b1c07600f149a42b027f78df599"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies::file_exists (cognitive 16): Dependencies::file_exists has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe974f6ef5495211c7ac1d83c3c2321f0346a10b35694a6d99decc7e96f6e42a"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::extract::characters::push_family (cognitive 16): rpfm_extensions::startpos::extract::characters::push_family has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (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":"rpfm_extensions/src/startpos/extract/characters.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"201552dd14cfe83aa279cd1e919f9dc1f56542142e0b60e46044e777b6224436"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::validation::validate_name_kinds (cognitive 16): rpfm_extensions::startpos::validation::validate_name_kinds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 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":"rpfm_extensions/src/startpos/validation.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6060d379ffc2efcabe9741e917549681d5e7033f8aa0d8db10250dd11ca7e58f"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_extensions::startpos::world::bodyguards::bodyguard (cognitive 16): rpfm_extensions::startpos::world::bodyguards::bodyguard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 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":"rpfm_extensions/src/startpos/world/bodyguards.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d34d617045320a2df76e5097c0163152d3d9c4b9a25145d87bc1d2a7be5dce5"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetVariationDb::from_xml (cognitive 16): AssetVariationDb::from_xml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (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":"rpfm_lib/src/files/asset_variation_db/xml.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"032ef60ef3c4511591a540b9539b672e5df7e4b32da79f7044e00d3d9465bb7f"}},{"ruleId":"D2","level":"warning","message":{"text":"Atlas::from (cognitive 16): Atlas::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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":"rpfm_lib/src/files/atlas/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc20a25d6cc7f9d2941f81322200909ef8e091e434757e1411b0a1bdf3735b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupFormation::delete_blocks (cognitive 16): GroupFormation::delete_blocks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 4 (5 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/group_formations/edit.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f4172c80071f38c022db79cd628bf9ad2ad724953b3bf0bce9e51db208d320"}},{"ruleId":"D2","level":"warning","message":{"text":"Container::remove (cognitive 16): Container::remove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cfd6be95b1a7ab8ab937d867b781c9dc45a49092f81adccfd6c9bd7838aba9"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack::write_pfh2 (cognitive 16): Pack::write_pfh2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), 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":"rpfm_lib/src/files/pack/pack_versions/pfh2.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10458abb88fbbb618954176ec95ba16fd3967d64928994321f42d4e481e2873"}},{"ruleId":"D2","level":"warning","message":{"text":"RigidModel::write_v6 (cognitive 16): RigidModel::write_v6 has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (6 pts), match/switch 1 (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":"rpfm_lib/src/files/rigidmodel/versions/v6.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aa9e9eb0fdda920ff00576134b0f316413ae171fff1368750cddaf2222eeff"}},{"ruleId":"D2","level":"warning","message":{"text":"rpfm_lib::utils::files_from_subdir (cognitive 16): rpfm_lib::utils::files_from_subdir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/utils.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e5d37ada890e07013634c83f6f1b4428949add9e90d0751bbf102c18c275a"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::set_game_selected (cognitive 16): SessionState::set_game_selected has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/dependencies.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bef84f15cd3920f7b13ff4827e132b78c3f3e2b36a17714ec6d8fb202409f91"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState::missing_definitions (cognitive 16): SessionState::missing_definitions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 1, loops 1 (nesting depth added 10). 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":"rpfm_server/src/state/packs.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4294cba1f5fff9a3c7c5a7893ae29b52e1e37b884926be94ba919dcdb542d977"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::reset_selection (cognitive 16): TableView::reset_selection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3f6ab4f12805f62af96705d19abeec8aa991075f01dc50afd4c17d50624093"}},{"ruleId":"D2","level":"warning","message":{"text":"TableView::copy_selection_as_lua_table (cognitive 16): TableView::copy_selection_as_lua_table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4f16b9e16167bdb9b907e47a35bc1bf234cacae6acb361efd6e85af4827923"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackFileContentsSlots.new: MethodTooLong \u2014 new runs 1527 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 1427 over it, 15.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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4309858022136d79b69a7d7f6de14d59a40ed9bcd8acfa49b45995f262a8c2c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SupportedGames.default: MethodTooLong \u2014 default runs 1192 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 1092 over it, 11.92\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":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb20ef5a96c8fc2a9c6b5b634024022fdd65903acebd3d325ee01bb45c54f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_server::ceo_builder::build_ceo_entries: FunctionTooLong \u2014 rpfm_server::ceo_builder::build_ceo_entries runs 949 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 849 over it, 9.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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8828c132897e30ab6645e30a59959dfbade2e6beb93a20adce4060f7f81a00cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUISlots.new: MethodTooLong \u2014 new runs 949 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 849 over it, 9.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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de215f517dde85f04203855e23f4369dd2961cb63a78c4771bf15282e8c1721"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppUI: ClassTooLong \u2014 2675 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), 50 methods, 2 blocks, lines 195-4617. The bar is 400 significant lines; this is 2275 over it, 6.69\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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b282ca4d904bd5bfdaacd9faf601b877f6a008c0819e7b49c99d39eac86d3869"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionState: TooManyMethods \u2014 188 methods, declared across 9 files: state/files.rs (39), state/tables.rs (37), state/tools.rs (37), state/packs.rs (30), \u002B5 more file(s). The bar is 30 methods; this is 158 over it, 6.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"rpfm_server/src/state/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f819a25db8a44dc95054c155d92796c1c3785d3db8d5db1fcbade76cd1da106"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TableView: ClassTooLong \u2014 2352 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), 71 methods, 2 blocks, lines 209-4155. The bar is 400 significant lines; this is 1952 over it, 5.88\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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4fa1f1eeead96f50eba20e894588aff56d109d54d62088a6661c9fe290cc8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableViewSlots.new: MethodTooLong \u2014 new runs 575 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 475 over it, 5.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":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8e5d245e2aea6a926c0a67025496f1d89a34eff2e0611b455323422017612e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app_ui/mod.rs: FileTooLong \u2014 2841 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 94% of them inside a single declaration: AppUI (2 blocks, 195-4617). The bar is 500 significant lines; this is 2341 over it, 5.68\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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"616b481ba31a69e8403e1cc499617c3e69177da05023dd46b4c0ec54d6f618c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/mod.rs: FileTooLong \u2014 2552 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 92% of them inside a single declaration: TableView (2 blocks, 209-4155). The bar is 500 significant lines; this is 2052 over it, 5.10\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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12a3dce9f2d6bac915bdd5f5dcd4009a9be20bce92117bc19da12fa2c620b87"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Dependencies: ClassTooLong \u2014 1944 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 201-3799. The bar is 400 significant lines; this is 1544 over it, 4.86\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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc1a5cab2d383d5bcf21a7add3c19e34043b90c7c17d638749170f76597413f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableView.new_view: MethodTooLong \u2014 new_view runs 406 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 306 over it, 4.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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b3a96dc732a9a530522f5f0ab4aaa7654646efb2980093ff8531312c2529d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUI.open_packedfile: MethodTooLong \u2014 open_packedfile runs 402 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 302 over it, 4.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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"298251f8e3bcba8bed025384a8f09b86fee737039bed5d63972d067f6bcbd48d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PackFileContentsSlots: ClassTooLong \u2014 1600 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), 1 methods, 2 blocks, lines 88-2622. The bar is 400 significant lines; this is 1200 over it, 4.00\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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aecaf00958b76b9b214dfe0a0847f664d6a5ff8221d4dc983cb0d4b983b2de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dependencies/mod.rs: FileTooLong \u2014 1998 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 97% of them inside a single declaration: Dependencies (2 blocks, 201-3799). The bar is 500 significant lines; this is 1498 over it, 4.00\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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"874429c435f38b428261e5082659c773bdb4cb8666f6227d0b5b704e2b784d32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DB.generate_twad_key_deletes_keys: MethodTooLong \u2014 generate_twad_key_deletes_keys runs 395 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 295 over it, 3.95\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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb5442d74bbcef265a9959b33ad304396cd1ca6b5963315fd0b20abfa15b0aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsUI.new_with_parent: MethodTooLong \u2014 new_with_parent runs 392 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 292 over it, 3.92\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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc065b35d515cfc6666d77308f98212075279ac285419e73e772d4780c1c491"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DiagnosticsUI: ClassTooLong \u2014 1537 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), 29 methods, 2 blocks, lines 123-2342. The bar is 400 significant lines; this is 1137 over it, 3.84\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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dfc69e319957494cdd8539d56ad38db0328603e45a1b69a6d7f8a2949b0a43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESFDetailedView.load_to_detailed_view: MethodTooLong \u2014 load_to_detailed_view runs 384 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 284 over it, 3.84\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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c4c3b58d2c7f59d8f88ee6a4bb89ac64fa9222df6407541e1cf597ea054a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobalSearchUI: ClassTooLong \u2014 1482 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), 32 methods, 2 blocks, lines 175-2386. The bar is 400 significant lines; this is 1082 over it, 3.71\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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddacc0a423e0ce4b75e4d1726ef5b841aa0910b95896c15b6fea391bb078c16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GroupFormationsSlots.new: MethodTooLong \u2014 new runs 370 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 270 over it, 3.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":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d171bac5f2e42e4b784b60bfbe1e8f14f278f84b267426f0a57d680b264d39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolTranslator.new: MethodTooLong \u2014 new runs 369 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 269 over it, 3.69\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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ae2164b2c56bde22ce4e7dfbb3c2a0556f2e943e0cfa79e8725efed662eb41"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: McpServer: TooManyMethods \u2014 110 methods. The bar is 30 methods; this is 80 over it, 3.67\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":"rpfm_server/src/server_mcp.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e42f8df3ef987ac5446c9dd0e756a4cc0a8b7f3ca0c4c94fa71c9fe363d6c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AppUI: TooManyFields \u2014 107 stored fields beside 50 methods. The bar is 30 stored fields; this is 77 over it, 3.57\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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"653475b23dcf2301877589483e9fa17f9fda8e497f353af4b115b980bc86af33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUI.new: MethodTooLong \u2014 new runs 350 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 250 over it, 3.50\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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f801f299a416df0756894e7f7301fc5f6b3701c1185fc91d5ac57b0a5e68b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsUI.load_diagnostics_to_ui: MethodTooLong \u2014 load_diagnostics_to_ui runs 343 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 243 over it, 3.43\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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"621ca37bf9db41b47bd1806dbd0081fcd3784d6595f090f53a0a281ca933b165"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackedFileDecoderViewSlots.new: MethodTooLong \u2014 new runs 338 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 238 over it, 3.38\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":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e38f095cd3f14b40d58533cee951f6a5cb86bb242460fd95f145f937403ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packfile_contents_ui/slots.rs: FileTooLong \u2014 1682 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 95% of them inside a single declaration: PackFileContentsSlots (2 blocks, 88-2622). The bar is 500 significant lines; this is 1182 over it, 3.36\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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6056166119ccab8e0330c1d24a9732ed22e9348c3d63f6778140eae39c15a13b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SoundBankDatabase.write_sho2: MethodTooLong \u2014 write_sho2 runs 332 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 232 over it, 3.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":"rpfm_lib/src/files/sound_bank_database/games/sho2.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4edd59a3deac20492001be39085e24c948fba02012a2d32dd7dd4907d52bb6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnimFragmentBattle.search: MethodTooLong \u2014 search runs 326 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 226 over it, 3.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":"rpfm_extensions/src/search/anim_fragment_battle.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"13448b1b49522dc80ea875e91960d6f53e0cdfe42ecf38cbea031668370e58bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics_ui/mod.rs: FileTooLong \u2014 1617 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 95% of them inside a single declaration: DiagnosticsUI (2 blocks, 123-2342). The bar is 500 significant lines; this is 1117 over it, 3.23\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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5f526079a6126af83ff26ee16a185a2f279332a1f3ecaf1243a5ddc577937a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESF.read_node: MethodTooLong \u2014 read_node runs 322 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 222 over it, 3.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":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd7ff2113a3d35d4af97a60e25cfa0a5b47169b3bdb8fdf06f89f7eb769f469"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_search_ui/mod.rs: FileTooLong \u2014 1609 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 92% of them inside a single declaration: GlobalSearchUI (2 blocks, 175-2386). The bar is 500 significant lines; this is 1109 over it, 3.22\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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f88a18ad8f1783ff2083ae92173596eda82a59682d1abaa67cbf5b483addd45"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: McpServer: ClassTooLong \u2014 1285 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), 110 methods, 5 blocks, lines 262-2128. The bar is 400 significant lines; this is 885 over it, 3.21\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":"rpfm_server/src/server_mcp.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5848a1622f66befd508003a75f7be42ec7c54a83796ac22c66256082a736de78"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SupportedGames: ClassTooLong \u2014 1207 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), 5 methods, 3 blocks, lines 214-3974. The bar is 400 significant lines; this is 807 over it, 3.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":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f03d5587d2a3b32aad091a1bbe6f3f3437c3f019b5293c4bf4a4f0d6a3d2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server_mcp.rs: FileTooLong \u2014 1418 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 91% of them inside a single declaration: McpServer (5 blocks, 262-2128). The bar is 500 significant lines; this is 918 over it, 2.84\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":"rpfm_server/src/server_mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"910d714bfbb1095eafff497a2df7cd1872602875209ba9b6890ce6153c0dddf2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsUI.new: MethodTooLong \u2014 new runs 283 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 183 over it, 2.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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacb8a60aba0ffbc0f261ff46202da4a7328dafdaf99517de03707b42146e730"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: files/mod.rs: FileTooLong \u2014 1390 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 890 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eb0412749c465187a8a6114c279aa3a699aa384886f38759be4d88f9a4ab89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESF.save_node: MethodTooLong \u2014 save_node runs 277 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 177 over it, 2.77\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":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45f853997ea823e4ea04850db0a45ba9c6a76574585da3eb746e6e29cc163c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SoundBankDatabase.read_sho2: MethodTooLong \u2014 read_sho2 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":"rpfm_lib/src/files/sound_bank_database/games/sho2.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"22383ecced11df84a0bd4f94abbfdedc6fd75eec282aa2375b256091568cc6b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TableView: TooManyFields \u2014 82 stored fields beside 71 methods. The bar is 30 stored fields; this is 52 over it, 2.73\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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a86647063b1e2f6d5cb1edf1aff7abbc769552c4cd73cb51e782af337e08100"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DiagnosticsUI: TooManyFields \u2014 82 stored fields beside 29 methods. The bar is 30 stored fields; this is 52 over it, 2.73\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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f5daa4629f937991406b4c31e1425cbc26dfda8a6ff9d057929d1357e5ddba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolTranslator: ClassTooLong \u2014 1085 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), 35 methods, 2 blocks, lines 200-1956. The bar is 400 significant lines; this is 685 over it, 2.71\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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57f4e1b755bcc7881161f53386f1a568821e8bf574ea27c12d69a57d98aa1e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_extensions::gltf::gltf_from_rigid: FunctionTooLong \u2014 rpfm_extensions::gltf::gltf_from_rigid runs 265 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 165 over it, 2.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":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5720874124f9cb15c9c7505388c784cc1a0fa135995d5eaf6cf10baa94e8490b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PackFileContentsUI: TooManyFields \u2014 79 stored fields beside 11 methods. The bar is 30 stored fields; this is 49 over it, 2.63\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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"201f98228a3915de315f47dea8631d6cca5b9630e4eeb246c79bd7327369ef32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackedFileDecoderView.new_view: MethodTooLong \u2014 new_view runs 259 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 159 over it, 2.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6549bac5634bb490ed3bcd506a7fd45e4044bf313afce19d4af18a4254d7fe2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PackedFileDecoderView: ClassTooLong \u2014 1029 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), 13 methods, 2 blocks, lines 96-1640. The bar is 400 significant lines; this is 629 over it, 2.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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a17d71a79171be0ba627ca041bca1694b797665b9c1a007ebdf114c672cf22a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppUISlots: ClassTooLong \u2014 1020 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), 1 methods, 2 blocks, lines 107-2021. The bar is 400 significant lines; this is 620 over it, 2.55\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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"863de1fecb9eab0bd35823f18a4b0a12e7e154936dd184e11cf62248f021aa6e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PortraitSettingsView: TooManyFields \u2014 76 stored fields beside 24 methods. The bar is 30 stored fields; this is 46 over it, 2.53\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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0941fa82d8641f181f8294bb6b9f41381030d536736b8c9d177e41fd03b41f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PortraitSettingsView.new_view: MethodTooLong \u2014 new_view runs 253 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 153 over it, 2.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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b577aa6c50088a792514db14fd89e43d3ce3e5e3c7cfec78eb3e12fef461f8fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: games/supported_games.rs: FileTooLong \u2014 1241 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 97% of them inside a single declaration: SupportedGames (3 blocks, 214-3974). The bar is 500 significant lines; this is 741 over it, 2.48\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":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fc056712ac1c204ebe13b016cdafb1c850165651d990d1c53f0d26ef85a715"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app_ui/slots.rs: FileTooLong \u2014 1231 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 83% of them inside a single declaration: AppUISlots (2 blocks, 107-2021). The bar is 500 significant lines; this is 731 over it, 2.46\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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed451109d2b28176f8d489778ca23ff6c134e661849e5ba03291a7da4d8b3ccc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackFileContentsUI.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87c376b5082b0992e2b393992df1e858a3223112ac9fbecb9f551263aff3341"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translator/mod.rs: FileTooLong \u2014 1217 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 89% of them inside a single declaration: ToolTranslator (2 blocks, 200-1956). The bar is 500 significant lines; this is 717 over it, 2.43\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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea6f9c4de69030bb1d4e42b0f233d578bb4cb13c6118452510fd43768946c63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ceo_builder.rs: FileTooLong \u2014 1199 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 699 over it, 2.40\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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e032dd0ddcbd5cfefe5d03e45f666ca4e0b24229daf3a27097d24c954683ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dependencies.generate_automatic_patches: MethodTooLong \u2014 generate_automatic_patches runs 238 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 138 over it, 2.38\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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd77f0f4c7f60f0f71826cec6e77ed9ceeaba7ec3ddc1417fd000f1f22edd3a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TableView: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"352279b028af4c0bc26342cc5aaa1e5e7285d88092eda560277d8ff91122ac50"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PackFileContentsSlots: TooManyFields \u2014 71 stored fields beside 1 method. The bar is 30 stored fields; this is 41 over it, 2.37\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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"207e576510c4e517d10603eb0aa005bfb9066262fe8b50780a4276f515826d8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pack_tree/mod.rs: FileTooLong \u2014 1165 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: QPtr (273-1860). The bar is 500 significant lines; this is 665 over it, 2.33\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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4df396a6084868e40e8398fa7dc0b85b448c63c0065a3d61b82a4dd3c06921c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableDiagnostic.check_db: MethodTooLong \u2014 check_db runs 233 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 133 over it, 2.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":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a787eabc82d978c29f45d7f8bea29f4ad3dd6a492158f4b316dc91a8706580"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AppUISlots: TooManyFields \u2014 69 stored fields beside 1 method. The bar is 30 stored fields; this is 39 over it, 2.30\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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"843d31fb6fb59da20232487928710bd2ac7e2cb50fbcf3181518f924981a8bda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: decoder/mod.rs: FileTooLong \u2014 1134 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 91% of them inside a single declaration: PackedFileDecoderView (2 blocks, 96-1640). The bar is 500 significant lines; this is 634 over it, 2.27\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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47429edff03b0ef68f04dd4278a33e5535c6bba57884d5386939de8d079b496"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GroupFormationsView.new_view: MethodTooLong \u2014 new_view runs 225 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 125 over it, 2.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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5583733e13a03000b6c8d9d5d422d9cf1d5ddf6172db22b33b8f503e557fc3eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalSearchUI.open_match: MethodTooLong \u2014 open_match runs 216 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 116 over it, 2.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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef215cef08d99a86057a6a7281c7d84fb4d0bb51fca9b676db8060bbb9b813f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigidModel.search: MethodTooLong \u2014 search runs 214 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 114 over it, 2.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":"rpfm_extensions/src/search/rigid_model.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0df734ba06898be42e7a39e3d64029190c2902868d70bb2525cd4bdfa5944a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_server::api::dispatch: FunctionTooLong \u2014 rpfm_server::api::dispatch runs 209 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 109 over it, 2.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":"rpfm_server/src/api.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b197863ab3e0043a6cd4cdc0aa1b7b44328ef77906ee3b15a9d94cff1bb62f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackedFileDecoderView.import_from_assembly_kit: MethodTooLong \u2014 import_from_assembly_kit runs 207 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 107 over it, 2.07\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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b5f900f82616ad7c2888cd25e3363586f22def4f35dfb173d07193aa995fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalSearchUI.new: MethodTooLong \u2014 new runs 205 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 105 over it, 2.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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd115aa7c3a77f406e4a79be27a8057c4b3c0a01069cd9ae8c7d90e0e7cff5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESFDetailedView.save_from_detailed_view: MethodTooLong \u2014 save_from_detailed_view runs 202 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 102 over it, 2.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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7ffd017ed0d4b0aabe435a685cedfd987220d32d3463aa2f5d7b4c9cd6749c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsUISlots.new: MethodTooLong \u2014 new runs 199 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 99 over it, 1.99\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":"rpfm_ui/src/diagnostics_ui/slots.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d06627f436e485df44898dd417353999c9706f6140c761aa05b60dd13b8092"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: group_formations/mod.rs: FileTooLong \u2014 984 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: GroupFormationsView (2 blocks, 157-1221). The bar is 500 significant lines; this is 484 over it, 1.97\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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4389d82a1ea95b08c803bd929450ff0bd33a2c93471b241dbf8458a877f8ff32"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PackedFileDecoderView: TooManyFields \u2014 58 stored fields beside 13 methods. The bar is 30 stored fields; this is 28 over it, 1.93\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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3969f1fe9fdc588f2d50a84a3876f83a22f1190a45f87a08897edc8c69189e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Diagnostics.check: MethodTooLong \u2014 check runs 193 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 93 over it, 1.93\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":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edabf5539646c77f7e6cee8038870a95944829c263ce1f01e362f0a1b52d552"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PortraitSettings.search: MethodTooLong \u2014 search runs 192 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 92 over it, 1.92\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":"rpfm_extensions/src/search/portrait_settings.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe96d7e04391d50d5642de36746608b4b863b3d8e542d5e44550e95385ffa40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_ui::tools::ceo_builder::build_ceo_builder: FunctionTooLong \u2014 rpfm_ui::tools::ceo_builder::build_ceo_builder runs 190 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 90 over it, 1.90\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":"rpfm_ui/src/tools/ceo_builder/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e41bda6ddb16a1d48c2aa85c50029fd64e24806dee7fb26c83d2d07e2524e80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalSearchSlots.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/global_search_ui/slots.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e96abd2f0fc03581c08d31526f211a49de8a4829dbe01c67fc7921888eaf101"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PortraitSettingsView: ClassTooLong \u2014 729 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 90-1111. The bar is 400 significant lines; this is 329 over it, 1.82\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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f49ff120e26c504b6fb6457320e78d697fb4f4cf3a2aab9d41783a67401d9ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/utils.rs: FileTooLong \u2014 908 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 408 over it, 1.82\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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"141fab4180bd52d0d23136578392bf7dbc6563769cdc244436907cc211f64b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ToolTranslator: TooManyFields \u2014 54 stored fields beside 35 methods. The bar is 30 stored fields; this is 24 over it, 1.80\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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c692f31e4f5a716ebf9bfd20b626b206c6749eafa3313e26e2d1d2f4bd3d04b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Matches.find_matches: MethodTooLong \u2014 find_matches runs 179 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 79 over it, 1.79\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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf89b608d981a2ba1358d66618b40aa88a2bd80b498b4f3148950b9a85b412f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GroupFormationsView: TooManyFields \u2014 53 stored fields beside 43 methods. The bar is 30 stored fields; this is 23 over it, 1.77\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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3cb29ce84a481d91af91f1d5dd3b741026bd74c4371faafce625ce7b482a91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings_ui/mod.rs: FileTooLong \u2014 879 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 73% of them inside a single declaration: SettingsUI (2 blocks, 127-1160). The bar is 500 significant lines; this is 379 over it, 1.76\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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b003dbd7e7e4fbeaec234e3e2919e4f73682196987a74fdb5437ce94282ac48"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GroupFormationsView: ClassTooLong \u2014 700 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), 43 methods, 2 blocks, lines 157-1221. The bar is 400 significant lines; this is 300 over it, 1.75\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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1665aaaa7ab8218ce8588e99c58595b8bad79eca92534a51f7a21ae337ca45f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dependencies: 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29936f87c0a9aac0ab7a0abd878574a3ae2a87e28d3155e7c86e9a85ab0b04c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/mod.rs: FileTooLong \u2014 860 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 360 over it, 1.72\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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5a38ea7793b4ecb9f0f7b42ad3852807d4810ff237da5eae0ed23700494d4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsUI.open_match: MethodTooLong \u2014 open_match runs 172 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 72 over it, 1.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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26d22d0e326a5e5873b4607d68ba59a0ff80304f5f6b29390bf5fa31d90ddd6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Icons: TooManyFields \u2014 51 stored fields beside 4 methods. The bar is 30 stored fields; this is 21 over it, 1.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":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8094f20e69e0793596890b69bdb1a419af506fa1261cdbae33c5692de64399d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dependencies.build_starpos_post: MethodTooLong \u2014 build_starpos_post runs 167 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 67 over it, 1.67\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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f520b6cd86dd76853c62cbac823aeb54ffeebb65963dd11cf9a9876a0a64e29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pack/mod.rs: FileTooLong \u2014 834 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 76% of them inside a single declaration: Pack (5 blocks, 240-1559). The bar is 500 significant lines; this is 334 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e1cca800976f3fbb4486c4960bf194c07bd698e34c8d9504553073c9a8c9e2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppUI: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f96d2fb063bc814eb255b562ab1e01ccdfb956cb86cae9573a2796d41de0e61"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GlobalSearchUI: TooManyFields \u2014 50 stored fields beside 32 methods. The bar is 30 stored fields; this is 20 over it, 1.67\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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5494fa6ecdbbf453293223f8d54583509556a4ca1f09a3a42850dcbf7d56fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dependencies.build_starpos_pre: MethodTooLong \u2014 build_starpos_pre runs 166 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 66 over it, 1.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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a8d461cc6593545dfbb4da08b258b61ea27792f50294a2505a6412d6b45ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolFactionPainter: ClassTooLong \u2014 658 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), 20 methods, 2 blocks, lines 95-1137. The bar is 400 significant lines; this is 258 over it, 1.65\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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"563d13d1fafe09e4806d9090be86a8380b59de676f2962471efb8f1f2a11c37f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SettingsUI: ClassTooLong \u2014 638 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), 8 methods, 2 blocks, lines 127-1160. The bar is 400 significant lines; this is 238 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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5b90734f5b37b970094c57a8b109aa9a1941c7f8b426d6615100b8f3dac150"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DB: ClassTooLong \u2014 635 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), 23 methods, 5 blocks, lines 145-1380. The bar is 400 significant lines; this is 235 over it, 1.59\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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"eace32b6cc72e15ac71f34035256ce610a40fdb27891eb3c263e3e8e484bd07b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Pack: ClassTooLong \u2014 634 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), 47 methods, 5 blocks, lines 240-1559. The bar is 400 significant lines; this is 234 over it, 1.59\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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcc1742bb18d18353ea6e9e13ff43616fc2d0166663c43fbf17311136216c31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: portrait_settings/mod.rs: FileTooLong \u2014 786 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 93% of them inside a single declaration: PortraitSettingsView (2 blocks, 90-1111). The bar is 500 significant lines; this is 286 over it, 1.57\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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bce1b76106b9c640218cf4b1d29ae9080f3bb2d1fef824e711f065c9b9c443d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pack: TooManyMethods \u2014 47 methods, declared across 7 files: pack/mod.rs (35), pack_versions/pfh0.rs (2), pack_versions/pfh2.rs (2), pack_versions/pfh3.rs (2), \u002B3 more file(s). The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5dcd81d6cbd303825b1f39115aaea835ccb23a600eb8ab745a65e7465123ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EventData: TooManyFields \u2014 47 stored fields. The bar is 30 stored fields; this is 17 over it, 1.57\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":"rpfm_lib/src/files/sound_events/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a392af74658c3414f8e25f43ce13279c735b2242a2c7cf3c6440d32415f10d6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TableViewSlots: ClassTooLong \u2014 623 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), 1 methods, 2 blocks, lines 65-1058. The bar is 400 significant lines; this is 223 over it, 1.56\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":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"36525d35499a9b6a5b63df3384c0e96986b17ed00edb61d29da26575c99f9f63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUI.optimizer_dialog: MethodTooLong \u2014 optimizer_dialog runs 155 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 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3682}}}],"partialFingerprints":{"codehealthFindingId/v1":"f160904df14ef793fe245133fc7047fe1e04731ec39d341cba4acab9fab0f734"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TableViewSlots: TooManyFields \u2014 46 stored fields beside 1 method. The bar is 30 stored fields; this is 16 over it, 1.53\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":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f74cce58ded0308b42e653c3260724336eae69010e95f869785afcb5d8ea04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PortraitSettingsSlots.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1e7ae5c513529e99789728be3f0521bbe6c442521479053a42a90eec8fd8c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/files.rs: FileTooLong \u2014 760 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 82% of them inside a single declaration: SessionState (2 blocks, 83-1229). The bar is 500 significant lines; this is 260 over it, 1.52\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":"rpfm_server/src/state/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee441afa6da729552f5d33d2cb10e6332c387d0b048c451ffaddd9f06a8906bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUI.pack_map_dialog: MethodTooLong \u2014 pack_map_dialog runs 150 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 50 over it, 1.50\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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"136e1ef7d9f2ae3e0e2bb4050a40c04935b424830c6ce22a6c5b055389dee6b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolTranslatorSlots.new: MethodTooLong \u2014 new runs 150 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 50 over it, 1.50\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":"rpfm_ui/src/tools/translator/slots.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1bd03f2ba965f69b8b10f6ccd000d6916321ba4fc4f426c777c11d309dd93a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolUnitEditor.new: MethodTooLong \u2014 new runs 150 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 50 over it, 1.50\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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"811f85c42416c298a8db820f7c69c5b384c6f7c44d51161af51289b8d351308b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ESFDetailedView: ClassTooLong \u2014 595 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), 3 methods, 2 blocks, lines 60-1026. The bar is 400 significant lines; this is 195 over it, 1.49\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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f99c755843d03660ec522cc9d0c7e8e9dd9e5d73ce827d50bd1fd39171342cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileView.reload: MethodTooLong \u2014 reload runs 148 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 48 over it, 1.48\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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b3f1776ad5de405a883f160624fcf6133b426ad6f9d648779d366ee7ffce91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/mod.rs: FileTooLong \u2014 734 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 234 over it, 1.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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74425779d7d70f87d5e3a847c708395799f0f5348a6f140403e463f4f30dc0c0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tool: ClassTooLong \u2014 580 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), 31 methods, 2 blocks, lines 139-1208. The bar is 400 significant lines; this is 180 over it, 1.45\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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3358ba3080c84b44c73a2bb0cc6047004fcd00492e5ff5334e58690af26161"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalSearch.replace: MethodTooLong \u2014 replace 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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbe82ff32e2550bbd02fd4f3be0336fae280b3977d0d7cac548aef01115606f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DecodedData.convert_between_types: MethodTooLong \u2014 convert_between_types 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc39479bd1cc95a28c5db9f03526abdf5bc6b9363274c05c8a2767d83f1ff755"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GroupFormationsView: TooManyMethods \u2014 43 methods, declared across 2 files: group_formations/mod.rs (39), group_formations/slots.rs (4). The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceceb4dca15aa450853e9f6b15ebd52cf47fceb2421c9f063fc1c3a1109401b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: faction_painter/mod.rs: FileTooLong \u2014 710 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 93% of them inside a single declaration: ToolFactionPainter (2 blocks, 95-1137). The bar is 500 significant lines; this is 210 over it, 1.42\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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69058e6b5ee1a44b74e7098dec48e70cfba499cae1b5353be2327b50a994eb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: search/mod.rs: FileTooLong \u2014 707 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 207 over it, 1.41\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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"746c237bcb9cb65d55b18bd922f4dcb30c9a9beab47d7990ae54f39d55f68e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameInfo.steam_workshop_tags: MethodTooLong \u2014 steam_workshop_tags runs 140 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 40 over it, 1.40\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":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaf1f83d6e11a830c8d2bd6f40bf60c7b49b5774677d10fd7e91ce0abd5ef3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsUISlots.new: MethodTooLong \u2014 new runs 138 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 38 over it, 1.38\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":"rpfm_ui/src/settings_ui/slots.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1274492dc1bbf9d9060fed560e51b5800f2996bffd0be0137d19ffece46548fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dependencies.bruteforce_loc_key_order: MethodTooLong \u2014 bruteforce_loc_key_order runs 137 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 37 over it, 1.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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2641bf7fa5fea2746945a67a901a023dfe54ed4bddd38b2c9c3b8e1f8b30c25a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RFile: ClassTooLong \u2014 542 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), 34 methods, 2 blocks, lines 296-2938. The bar is 400 significant lines; this is 142 over it, 1.36\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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bab39885780e965561b2bc7e4699b5bfe02e18fffc50983f3e52cfa781704d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Vertex.write: MethodTooLong \u2014 write runs 134 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 34 over it, 1.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":"rpfm_lib/src/files/rigidmodel/vertices/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f3c96c81da9f11b420c8d5eeccca52144c6c362f5254f3dde40e282585a339"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GroupFormationsSlots: TooManyFields \u2014 40 stored fields beside 1 method. The bar is 30 stored fields; this is 10 over it, 1.33\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":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"627fef71817bf7722d13e6c8b85fde5b5007e761f6cf1223d7b267cc3ed14bb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: esf_detailed_view/mod.rs: FileTooLong \u2014 665 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 89% of them inside a single declaration: ESFDetailedView (2 blocks, 60-1026). The bar is 500 significant lines; this is 165 over it, 1.33\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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a455c6d79f7bd0de9f2fd0f1d816bbc972cf040489cb6785675d1bbbc0eea566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Vertex.read: MethodTooLong \u2014 read 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":"rpfm_lib/src/files/rigidmodel/vertices/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce28976a58f1b8d5d739e8d1b3ef746ec050cabf9b3198f63c20ea63bf00d71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUI.new_file_dialog: MethodTooLong \u2014 new_file_dialog 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a7a58cb837f7662937de8e3d24b7bd951678b1d4e9d6ad564ff666963cabb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/mod.rs: FileTooLong \u2014 660 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 88% of them inside a single declaration: Tool (2 blocks, 139-1208). The bar is 500 significant lines; this is 160 over it, 1.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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b7359a2d36fad10ec005559053cc27bd0e3cadd568ef23d0f3e1f557d45cae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PackFileContentsUI: ClassTooLong \u2014 527 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 86-903. The bar is 400 significant lines; this is 127 over it, 1.32\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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"822aaed9b9c18cf330d1ed91902e48b216de30f9f22fb4584aa9dafa3b8d4411"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/slots.rs: FileTooLong \u2014 658 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 95% of them inside a single declaration: TableViewSlots (2 blocks, 65-1058). The bar is 500 significant lines; this is 158 over it, 1.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":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae469c3d39aa7e69dbb262f052bdbccd24a7e877176a7b2695e0f83b453e7d39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/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), about 97% of them inside a single declaration: DB (5 blocks, 145-1380). The bar is 500 significant lines; this is 156 over it, 1.31\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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c251e025fc1ac7a395015fc177715c56fb3446344c1bfdf14deb330633722ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableView.set_data_on_cells: MethodTooLong \u2014 set_data_on_cells runs 131 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 31 over it, 1.31\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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c8fa1850e42bfe79c4de3da07260937eef660a87343c9de7116e417c98f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SubToolVariantUnitEditor: TooManyFields \u2014 39 stored fields beside 25 methods. The bar is 30 stored fields; this is 9 over it, 1.30\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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfcb223519bd4b3bd9047cbd3c7518d68f9f81900513823ace4a10a4917a0a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SettingsUI: TooManyFields \u2014 39 stored fields beside 8 methods. The bar is 30 stored fields; this is 9 over it, 1.30\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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b114940ba7cf5217e5a8998f6c2324f84b931771fa84f5704e9e34806f818b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: esf/utils.rs: FileTooLong \u2014 645 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 96% of them inside a single declaration: ESF (38-1162). The bar is 500 significant lines; this is 145 over it, 1.29\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":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"643afa647272bf2646fb8cd2c4bb3eb597d2e38857f8374487b98ed5b5915dbc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackedFileAnimPackViewSlots.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/packedfile_views/animpack/slots.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eecaeb4df5d28b18a2514a45a8353297681f87efb46256da9b52d232c55dfc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameInfo: ClassTooLong \u2014 506 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 219-1768. The bar is 400 significant lines; this is 106 over it, 1.27\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":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"353160ce0f34c94ae9fd5ef7b777a1234de8e6409846efc92e941c4a636a57c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Settings.init: MethodTooLong \u2014 init 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":"rpfm_ipc/src/settings.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13dcf6e41c2dd87b628071037368d9fe89036bfc3f98f6a015f28b6ae8f7219"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableView.patch_column: MethodTooLong \u2014 patch_column 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3519}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b1873dc6d960275d3ce2b6397f98cc862b596aeb3211fb4f1f8b2d47633286"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Chip.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/views/table/filter/chip.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3735b86f93f35207f99691e58c4c3eb4b706f5cfb904ae6d1a51b60b1accba9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DependenciesUISlots.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/dependencies_ui/slots.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a3477860d9dccb271b0e3bf263db7367190dfcadd4d16f086ac7d640799164"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigidModelView.new_view: MethodTooLong \u2014 new_view 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":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1054059fe2861b36b72ff6c3cad1337674097d2b46ad834b4eb029ce52d223"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WelcomePageUI.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/welcome_page_ui/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5669ddb6f4151e16f2d9c6bfc842e21c860fe301db6fec7fe665334a3ecbfa48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/tables.rs: FileTooLong \u2014 617 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 66% of them inside a single declaration: SessionState (2 blocks, 76-906). The bar is 500 significant lines; this is 117 over it, 1.23\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":"rpfm_server/src/state/tables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cc261816ff205ff41b96f5af87220e223658cdb18acedf423c46a0c6b60356"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnitVariantSlots.new: MethodTooLong \u2014 new runs 123 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 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e39701606f7cd2b6b55bb0e8c781e2916ccd34303aa722ad8a7203e2f454460"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableDiagnostic.check_loc: MethodTooLong \u2014 check_loc 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":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a51d3ef3bea45963d7b3e035164b436569deb7f23d9efd1dd7c7241e98d60f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SoundEvents.read_sho2: MethodTooLong \u2014 read_sho2 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":"rpfm_lib/src/files/sound_events/games/sho2.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcbe3ff6ef36f0806d45fe2d5e77e81b46fce01dd1b04f9b6ebd34a60ab77b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_ui::views::table::utils::get_default_item_from_field: FunctionTooLong \u2014 rpfm_ui::views::table::utils::get_default_item_from_field 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3ef4225feecbf8160f8df17c54567cfd0d79b3cb9c59821dfd43b1b52c767c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: startpos/layout.rs: FileTooLong \u2014 609 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 109 over it, 1.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":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bae1dc2de3b3069b4fe674ade0e262020702f2f9b0a3a637e8ae9963e046b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: games/sho2.rs: FileTooLong \u2014 609 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 100% of them inside a single declaration: SoundBankDatabase (13-1124). The bar is 500 significant lines; this is 109 over it, 1.22\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":"rpfm_lib/src/files/sound_bank_database/games/sho2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b20b6f006a3d5ed8809a18ba0ef0859c4902684d9d2a4f4cca21b40d73168d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolUnitEditor: ClassTooLong \u2014 487 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), 33 methods, 2 blocks, lines 140-1032. The bar is 400 significant lines; this is 87 over it, 1.22\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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2f5a13cb34b5fbcd5c45d4c33e9b19dce49388c1caad1e182b3b61862573b9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubToolVariantUnitEditor: ClassTooLong \u2014 487 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), 25 methods, 2 blocks, lines 91-958. The bar is 400 significant lines; this is 87 over it, 1.22\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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"68875f8b488f7b1104ead3de2bf7543edbaac092e6e2e72f32e06ac3f2e981b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Material: TooManyFields \u2014 36 stored fields beside 34 methods. The bar is 30 stored fields; this is 6 over it, 1.20\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":"rpfm_lib/src/files/rigidmodel/materials/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"853c327deebc460beb66e0144cb7a2874401e0051cddbed988d03836401e9fa7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dependencies.db_reference_data_generic: MethodTooLong \u2014 db_reference_data_generic 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"071fd5d81f264726afbe3ac2828deaaa063b97139690fcc7f17c566ce6ca0c50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUI.build_pack_submenus: MethodTooLong \u2014 build_pack_submenus 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"15642f044622456054a925e22f4a3511e55d3cea49a4cfb7694ec8f7eaf82287"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_ui::views::table::utils::load_data: FunctionTooLong \u2014 rpfm_ui::views::table::utils::load_data 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f853b1528a00f3629cc1e767d93c53f1d4900b7a6471d31feb3634e652f6817e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pack.optimize: MethodTooLong \u2014 optimize 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":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"83798ca533a271dcbcb2153b435b3b26d82d2d667ba2d819fccc4c50e7c68d00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileView.save: MethodTooLong \u2014 save 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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d516b9d82c3487095161ac36796985770506e5eb8c308584c4cf969be548e7ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: games/mod.rs: FileTooLong \u2014 585 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 86% of them inside a single declaration: GameInfo (2 blocks, 219-1768). The bar is 500 significant lines; this is 85 over it, 1.17\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":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"702d0fd70aa5242de0b97f99b3ca10d4ab0d7a37204c9eef0411403150d4e57a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_lib::files::table::encode_table: FunctionTooLong \u2014 rpfm_lib::files::table::encode_table 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a70c7384b1caa76c96a6b8a87243eaa3dfd9e755a6f14be957a0ba844dc848d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpServer.read_resource: MethodTooLong \u2014 read_resource 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":"rpfm_server/src/server_mcp.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecb846c99a5da2aa63d85ac9042f89dca38e5e81153c10d3b644b09ea9d05f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_ui::views::table::utils::build_columns: FunctionTooLong \u2014 rpfm_ui::views::table::utils::build_columns 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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2eb02eb87e2845325860201b746eae15b10dd26743cefb6e5441859364cd5b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolTranslator: TooManyMethods \u2014 35 methods, declared across 2 files: translator/mod.rs (30), translator/hub.rs (5). The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5787c842fa110f02f15e595bd61152d683d85770a337df25385a5944c1adc39b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Bmd: TooManyFields \u2014 35 stored fields beside 15 methods. The bar is 30 stored fields; this is 5 over it, 1.17\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":"rpfm_lib/src/files/bmd/mod.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4b15abbd9b21e514f20ec7a36675d0892c5399b7efc86a535b2f9192f23db8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packfile_contents_ui/mod.rs: FileTooLong \u2014 581 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 91% of them inside a single declaration: PackFileContentsUI (2 blocks, 86-903). The bar is 500 significant lines; this is 81 over it, 1.16\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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb4cfbfe07b22541ed5633dda3b10ec48f6e95de1c5f1db761c68163b46ae33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackedFileDecoderView.update_view: MethodTooLong \u2014 update_view 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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1928b23624f5e22ee1d53dbd7f3c028558407ca5f1045e63fe8e705488b16dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubToolVariantUnitEditorSlots.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/slots.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9c558cabf89b3b324211638823f1234305ea54cf46e1528049bcc441d8eee8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchView.update_search_ui: MethodTooLong \u2014 update_search_ui 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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a01c84fd3539dc8e97d88fecbcd46e8f70d2eebce4a3641458702a74bcf0596"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ffi/mod.rs: FileTooLong \u2014 569 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 97 free functions. The bar is 500 significant lines; this is 69 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":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8026df796e013b4fbdb01844d42e9a51dc3f238f8015464a9d689d885835849"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RFile: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc13ef326eabd6d6b272b2e908ea267a8a69940a3da97e55e14d3b7f46b2728"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Material: TooManyMethods \u2014 34 methods, declared across 17 files: materials/alpha_blend.rs (2), materials/cloth.rs (2), materials/collision_shape.rs (2), materials/custom_terrain.rs (2), \u002B13 more file(s). The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"rpfm_lib/src/files/rigidmodel/materials/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad19852319e8e34b7392de0eb02aac66d4a12f03d6b6ccd8af7a33ff5eb214b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ToolUnitEditor: TooManyFields \u2014 34 stored fields beside 33 methods. The bar is 30 stored fields; this is 4 over it, 1.13\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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42ae0ea25b93cfb496417970886a440e479045e84895b4080b833c4e24e300a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PackedFileDecoderViewSlots: TooManyFields \u2014 34 stored fields beside 1 method. The bar is 30 stored fields; this is 4 over it, 1.13\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":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee390c214a6ed09d226c2c1ecbebb9a49eef05d30a7db12f3a685fe4849b0b91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unit_editor/mod.rs: FileTooLong \u2014 560 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 87% of them inside a single declaration: ToolUnitEditor (2 blocks, 140-1032). The bar is 500 significant lines; this is 60 over it, 1.12\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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f468d41fd019a3dca1d3c72db6a2d2a29002996259c8ccede29cc0b0e005807c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsUI.update_level_counts: MethodTooLong \u2014 update_level_counts 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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"249b92855b8f7411de32843814c1b382827a9f7ea2ee8829a217589606520fc5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolUnitEditor: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1f07cb960a170287a741cbbd849cba382ad06749cbc175674995ec7c367f88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SoundEvents.write_sho2: MethodTooLong \u2014 write_sho2 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":"rpfm_lib/src/files/sound_events/games/sho2.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a0eea11228cb7f8c7dff4a7f0bc51f1c61a89f735e5e5c850e36952d84f90d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cs2Parsed.read_v12: MethodTooLong \u2014 read_v12 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":"rpfm_lib/src/files/cs2_parsed/versions/v12.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3850fb42145ca9e44e0f5862af4796ff3c2a8d09ac2681c04ab24f158ca6e837"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cs2Parsed.read_v13: MethodTooLong \u2014 read_v13 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":"rpfm_lib/src/files/cs2_parsed/versions/v13.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b434dc36e78adfa7315579f39e613d77b0926dd76a37d14845cea08cb49f04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Table.new_row: MethodTooLong \u2014 new_row 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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9519793e67f4751d4d8dfcfca84a36830c21a9cef256765c59208d2962a348ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rpfm_lib::integrations::assembly_kit::update_schema_from_raw_files: FunctionTooLong \u2014 rpfm_lib::integrations::assembly_kit::update_schema_from_raw_files 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":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"52157db2f374a3c39effb2a6011c13f25ed47840ed47361493a8a38d44a3dba4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tool.load_definition_to_detailed_view_editor: MethodTooLong \u2014 load_definition_to_detailed_view_editor runs 108 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 8 over it, 1.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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3062f977f6646835d3b41ab634034996509075ae98f07366d58c19eb6e31fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppUI.build_starpos: MethodTooLong \u2014 build_starpos runs 107 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 7 over it, 1.07\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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a0355b9e0d58d231d2ae52f93e80789cc640492479c135d5b5b7a55ff3f3d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubToolVariantUnitEditor.new: MethodTooLong \u2014 new runs 107 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 7 over it, 1.07\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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1632a6dfee0d3b329e17097c3a18cd14c417fd9f2167069b450948e18cd70d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GlobalSearchUI: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6378fa5c0377f895c84bb9777e6335127ec8d293fcb5c39f9e9d116739c99528"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rpfm_ui::settings_ui::backend: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\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":"rpfm_ui/src/settings_ui/backend.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fc46c9d272c56717dbb75188224f1a992b7fdb7d5be053915062b99882ba00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: variant_unit_editor/mod.rs: FileTooLong \u2014 533 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 91% of them inside a single declaration: SubToolVariantUnitEditor (2 blocks, 91-958). The bar is 500 significant lines; this is 33 over it, 1.07\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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c5723f42b92a923b379364ce5990648bae62e2f96e42286b91372ff599125"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Container: ClassTooLong \u2014 420 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), 38 methods. The bar is 400 significant lines; this is 20 over it, 1.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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"e445e32f41fbf5d9926cfbe289b3d192acee01fab7b363b3e548047b9f3a380a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalSearchUI.load_anim_fragment_battle_matches_to_ui: MethodTooLong \u2014 load_anim_fragment_battle_matches_to_ui 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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ba0f85a6486d109ae395139d0e7bded93facba348e5ff36717d8dc5b268659"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RFile.decode: MethodTooLong \u2014 decode 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9216eee27ab33beb0a1b6897db7042fe0c27882f55716ed79db29d48fa6c1563"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColumnsPopover.new: MethodTooLong \u2014 new 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":"rpfm_ui/src/views/table/columns_popover/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0041b047719ed8e33e866eb284969530ca3afacd9722817f6580ef498fe1b90a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tool: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa013ab46921a5d08239db03254de6382ce07869f703a9be7eb2394630c0485"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GroupFormationsSlots: ClassTooLong \u2014 412 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), 1 methods, 2 blocks, lines 58-694. The bar is 400 significant lines; this is 12 over it, 1.03\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":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02c3f2b9a4fd37fc49d9cf9909dba94a4c9fa23546592bdf0c7837757deb32d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsUI.filter: MethodTooLong \u2014 filter 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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c4c72d5a08c1a71350e50f59f48103a510a2925060e4b1051dd700b3301b82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/table.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), about 74% of them inside a single declaration: TableDiagnostic (2 blocks, 43-837). The bar is 500 significant lines; this is 10 over it, 1.02\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":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f54cf652d26cad67561740a186e9fcde23d308db800a243724f5d4f648e157"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cs2Parsed.write_v12: MethodTooLong \u2014 write_v12 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":"rpfm_lib/src/files/cs2_parsed/versions/v12.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc4ab6eaf82b9cdc7412540a9d58d0c0695c7481d06fdf2a4a45eaa54cadba5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cs2Parsed.write_v13: MethodTooLong \u2014 write_v13 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":"rpfm_lib/src/files/cs2_parsed/versions/v13.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"17939c94086e5ab98bb265c97b1799e84dabb491cac388d34ccda81104241a38"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CampaignIndex.new: MethodTooLong \u2014 new runs 101 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 1 over it, 1.01\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":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c556d99bd78755f92766d54e7183b1262c566b7e904fbc6ab5034199e9e7510"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 64 shared lines): rpfm_ui/src/global_search_ui/mod.rs:1193-1334 | rpfm_ui/src/global_search_ui/mod.rs:1337-1418 | rpfm_ui/src/global_search_ui/mod.rs:1421-1553 | rpfm_ui/src/global_search_ui/mod.rs:1556-1692 | rpfm_ui/src/global_search_ui/mod.rs:1695-1778 | rpfm_ui/src/global_search_ui/mod.rs:1781-1861 | rpfm_ui/src/global_search_ui/mod.rs:1864-1981 | rpfm_ui/src/global_search_ui/mod.rs:1984-2061 \u2014 These 8 members are variants of one another: a block of 64 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f412f070a8dafbfe995915b7b9b3928e9e184d3d5386413100a4f9f3cbbd59"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 16 shared lines): rpfm_ui/src/tools/faction_painter/mod.rs:930-995 | rpfm_ui/src/tools/faction_painter/mod.rs:998-1060 | rpfm_ui/src/tools/faction_painter/mod.rs:1063-1126 \u2014 These 3 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a7bc110ef9224aa003ce798111b0708b4f317240e89c57425d171e0ba15dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (102 shared lines): rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:73-309 | rpfm_ui/src/packedfile_views/unit_variant/slots.rs:69-263 \u2014 These two members are variants of one another: 102 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":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b96ea47ad96243b8582945183e1147ef92a07c2f35bab1c7843c504086edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): rpfm_ui/src/tools/mod.rs:676-857 | rpfm_ui/src/tools/mod.rs:1040-1133 \u2014 These two members are variants of one another: 68 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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c851ff799964fbe47ef2516fa99e036df450074db83f1d3c7b0f47603e1b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (20 shared lines): rpfm_ui/src/views/table/mod.rs:2630-2693 | rpfm_ui/src/views/table/mod.rs:2698-2763 \u2014 These two members are variants of one another: 20 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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1a11016cbfee38c685ba01b9495a335f3ee68a5cca453e0dd8e3f4db00d053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rpfm_extensions/src/search/mod.rs:416-532 | rpfm_extensions/src/search/mod.rs:578-828 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"439736fc37ca4eb5a47555e3d5a92c8e7709cc244fcd8029362a2eb00a7c2799"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (37 members, 50\u002B identical tokens): rpfm_lib/src/files/bmd/ai_hints/directed_points/mod.rs:38-48 | rpfm_lib/src/files/bmd/ai_hints/mod.rs:50-60 | rpfm_lib/src/files/bmd/ai_hints/polylines/mod.rs:41-51 | rpfm_lib/src/files/bmd/ai_hints/polylines_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/ai_hints/separators/mod.rs:41-51 | rpfm_lib/src/files/bmd/ai_hints/separators/separator/mod.rs:39-49 | rpfm_lib/src/files/bmd/battlefield_building_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/battlefield_building_list_far/mod.rs:38-48 | rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs:41-51 | rpfm_lib/src/files/bmd/bmd_catchment_area_list/mod.rs:40-50 | rpfm_lib/src/files/bmd/bmd_outline_list/mod.rs:38-48 | rpfm_lib/src/files/bmd/building_projectile_emitter_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/camera_zones/mod.rs:38-48 | rpfm_lib/src/files/bmd/common/building_reference/mod.rs:80-90 | rpfm_lib/src/files/bmd/composite_scene_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/custom_material_mesh_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/deployment_zone/deployment_region/boundary/mod.rs:39-49 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/deployment_zone/deployment_region/mod.rs:44-54 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/deployment_zone/mod.rs:41-51 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/mod.rs:42-52 | rpfm_lib/src/files/bmd/deployment_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/grass_list_reference_list/mod.rs:38-48 | rpfm_lib/src/files/bmd/light_probe_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/particle_emitter_list/mod.rs:68-78 | rpfm_lib/src/files/bmd/playable_area/valid_location_flags/mod.rs:41-51 | rpfm_lib/src/files/bmd/point_light_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/prefab_instance_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/sound_shape_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/river_node/mod.rs:40-50 | rpfm_lib/src/files/bmd/spot_light_list/mod.rs:41-51 | rpfm_lib/src/files/bmd/terrain_decal_list/mod.rs:38-48 | rpfm_lib/src/files/bmd/terrain_stencil_blend_triangle_list/mod.rs:38-48 | rpfm_lib/src/files/bmd/terrain_stencil_triangle_list/mod.rs:41-51 | rpfm_lib/src/files/tile_database/conversion_params/mod.rs:76-86 | rpfm_lib/src/files/tile_database/tile_link/mod.rs:69-79 | rpfm_lib/src/files/tile_database/tile_link_target/mod.rs:54-64 | rpfm_lib/src/files/tile_database/tile_set/mod.rs:64-74 \u2014 These 37 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 37 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 37 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/directed_points/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5151388c2cadf98cf7f389e1e28f5e285f3b7c4841a1f06938864342bb6b3a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): rpfm_ui/src/app_ui/mod.rs:382-886 | rpfm_ui/src/app_ui/slots.rs:482-2020 | rpfm_ui/src/diagnostics_ui/mod.rs:246-574 | rpfm_ui/src/packedfile_views/decoder/slots.rs:109-674 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:111-693 | rpfm_ui/src/packfile_contents_ui/slots.rs:188-2621 | rpfm_ui/src/tools/unit_editor/mod.rs:209-454 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:154-309 | rpfm_ui/src/views/table/slots.rs:131-1057 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c8305c0ddd54a3a5d78f0d37c3d0ab8819d59628dbfa2df5b6aafa5905a2ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rpfm_ui/src/app_ui/slots.rs:400-469 | rpfm_ui/src/global_search_ui/mod.rs:879-1189 | rpfm_ui/src/references_ui/mod.rs:221-288 | rpfm_ui/src/views/table/mod.rs:3774-3887 | rpfm_ui/src/views/table/mod.rs:3900-4014 | rpfm_ui/src/views/table/mod.rs:4029-4129 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c804b53268a5e982ca3125964901f269fcb7389361bbe606efa2fb0c0c216865"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rpfm_ui/src/packedfile_views/anim_fragment_battle/mod.rs:95-203 | rpfm_ui/src/packedfile_views/audio/mod.rs:63-98 | rpfm_ui/src/packedfile_views/group_formations/mod.rs:257-536 | rpfm_ui/src/packedfile_views/packfile/mod.rs:100-159 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:196-496 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:140-259 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/anim_fragment_battle/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"398541085c8c0d330e1f595ca4337025981a36be81f2b4b1837faf4b2de9a237"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): rpfm_ui/src/dependencies_ui/mod.rs:111-193 | rpfm_ui/src/packedfile_views/animpack/mod.rs:110-210 | rpfm_ui/src/packedfile_views/esf/mod.rs:107-188 | rpfm_ui/src/packedfile_views/packfile/mod.rs:100-159 | rpfm_ui/src/packfile_contents_ui/mod.rs:201-540 \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":"rpfm_ui/src/dependencies_ui/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8b40804f60e3f91b3ea7955041b5a944223b583d592a4d3baddbe182b8c346"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_extensions/src/dependencies/mod.rs:407-484 | rpfm_extensions/src/dependencies/mod.rs:792-897 | rpfm_extensions/src/dependencies/mod.rs:901-989 | rpfm_lib/src/files/mod.rs:1799-1822 \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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86c02a0d369cdd0574859fab1df90b5b8596454f1c24bc2d4a5ed250c294421"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_extensions/src/dependencies/mod.rs:492-550 | rpfm_extensions/src/dependencies/mod.rs:672-748 | rpfm_extensions/src/dependencies/mod.rs:792-897 | rpfm_extensions/src/dependencies/mod.rs:901-989 \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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8411b05dba8648a5909166b29f9dbbce95c39ab2ec75acbc3375d7102a22e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_lib/src/files/bmd/light_probe_list/light_probe/mod.rs:43-53 | rpfm_lib/src/files/bmd/toggleable_buildings_slot_list/toggleable_building_slot/building_link/mod.rs:42-52 | rpfm_lib/src/files/tile_database/climate/mod.rs:68-78 | rpfm_lib/src/files/tile_database/tile/mod.rs:93-103 \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":"rpfm_lib/src/files/bmd/light_probe_list/light_probe/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a08fc9f7f7432a7b985cc43943f4b67ac508ea94222cf13581a430ca6d11d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_lib/src/files/bmd/mod.rs:454-477 | rpfm_lib/src/files/bmd_vegetation/mod.rs:168-186 | rpfm_lib/src/files/hlsl_compiled/mod.rs:140-158 | rpfm_lib/src/files/tile_database/mod.rs:111-129 \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":"rpfm_lib/src/files/bmd/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cb24ee9e54b710ab2326e6d9219b48391133ca4ae0fd144f257d1de0419e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_ui/src/app_ui/mod.rs:3305-3340 | rpfm_ui/src/app_ui/mod.rs:3343-3390 | rpfm_ui/src/views/table/mod.rs:2766-2797 | rpfm_ui/src/views/table/mod.rs:2800-2843 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8701b712773e1d8db1f3911159617673c9c0f9ad3801edf0f46f19ff69f4dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_ui/src/ffi/mod.rs:804-861 | rpfm_ui/src/tools/translator/mod.rs:301-802 | rpfm_ui/src/tools/translator/mod.rs:1864-1955 | rpfm_ui/src/views/table/utils.rs:1372-1430 \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":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76e0107cbff79bd35bc42b9e03051b00dce16efc207a212ea0756ce9a5323a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:941-959 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:964-982 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:429-450 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:455-476 \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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa65dc01eea114987df26292558dc7cc4025b2273dbdb55962e376946ec8a5e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1010-1028 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1033-1051 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:487-505 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:510-529 \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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"563bed4d7bba72b9cc41b3b76758f1d43ec7a306f8b6a29ddca05fe7e4c0e17b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): rpfm_ui/src/tools/faction_painter/mod.rs:762-843 | rpfm_ui/src/tools/faction_painter/mod.rs:846-927 \u2014 These two members are one piece of code written twice and then edited apart: 82 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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96468fa34e1942b32a10a85796fe22da915cef8285a0b0f890e2c51e0496823"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (107 corresponding lines): rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:444-550 | rpfm_ui/src/tools/translator/mod.rs:980-1089 \u2014 These two members are one piece of code written twice and then edited apart: 107 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":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ab556106c96ce2095bdced2dd7e85375e913fabe4f9622f526dbed839f3048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): rpfm_lib/src/files/mod.rs:1902-1965 | rpfm_lib/src/files/pack/mod.rs:485-551 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4414baa2a7400891b01ad5a94f761fd0a9ffa858f083e0e024c5b0491b9359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rpfm_ui/src/packedfile_views/portrait_settings/connections.rs:25-58 | rpfm_ui/src/packedfile_views/unit_variant/connections.rs:25-50 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"rpfm_ui/src/packedfile_views/portrait_settings/connections.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6fe2bd61e71c6da2168f4e0bbd6030c4ca7cf30c0538b66dd1510021937535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): rpfm_ui/src/packfile_contents_ui/mod.rs:551-601 | rpfm_ui/src/packfile_contents_ui/mod.rs:800-846 \u2014 These two members are one piece of code written twice and then edited apart: 47 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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39fe5b69886c357f9b9956dc1a68c0551e82fa24ceb1a3f153dccf4dbc03030"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rpfm_extensions/src/dependencies/mod.rs:2189-2212 | rpfm_extensions/src/dependencies/mod.rs:2246-2273 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6514542047b46060d760b87908eb313cbd9a5d91af80e2e2783074b2dc1bae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): rpfm_ui/src/tools/unit_editor/mod.rs:553-598 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:405-449 \u2014 These two members are one piece of code written twice and then edited apart: 45 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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4c1e7724e67ee6ed8c41d345479d9df918557e5164de9fbb0fd6f5b4daa77a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): rpfm_ui/src/tools/unit_editor/mod.rs:656-693 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:620-664 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8700ca0784fac4266a0005db83b3200b32c977047667b019af288cf1c0745b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): rpfm_lib/src/files/rigidmodel/materials/mod.rs:586-635 | rpfm_lib/src/files/rigidmodel/materials/mod.rs:646-697 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"rpfm_lib/src/files/rigidmodel/materials/mod.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"95558301f23825e939fc52af74d74c4295f892469b984483f0ca5e0112292efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rpfm_extensions/src/merge/mod.rs:109-144 | rpfm_extensions/src/merge/mod.rs:148-177 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"rpfm_extensions/src/merge/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"82990317dc9f17af5b793b9c9b234a8be564f398b762e6911268cf6a9909eb66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rpfm_lib/src/files/asset_variation_db/mod.rs:368-399 | rpfm_lib/src/files/asset_variation_db/mod.rs:486-510 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"rpfm_lib/src/files/asset_variation_db/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e290d7745cfcb046413621da91c24f8b7735c75fc09e40752338f03ed68e9305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:314-358 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:484-510 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ccd4bff77affa83bfd873f36829524498629ba2e78f41a643f6dc27f9a38bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): rpfm_ui/src/tools/faction_painter/mod.rs:479-492 | rpfm_ui/src/tools/faction_painter/mod.rs:498-511 | rpfm_ui/src/tools/faction_painter/mod.rs:514-527 | rpfm_ui/src/tools/faction_painter/mod.rs:533-546 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17510698ecf5bd4dd755ed4ed4b07378e3d59adc3622c77fc06aee5399ba197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): rpfm_extensions/src/dependencies/mod.rs:1388-1429 | rpfm_extensions/src/dependencies/mod.rs:1437-1493 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20dbb34f9cbec7129b0cd3b4b30048f16548b315706a78a0f158ef7307c5d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): rpfm_lib/src/binary/reader.rs:657-704 | rpfm_lib/src/binary/reader.rs:866-917 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"rpfm_lib/src/binary/reader.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a27e2fd032ab1334d973d5c36c0006d6678a5fddcab3b20eaf6460a01eea2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rpfm_lib/src/integrations/assembly_kit/mod.rs:424-458 | rpfm_lib/src/integrations/assembly_kit/mod.rs:478-510 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"05be5403759627a5415f0c57d60cea32de63164786eae34896f5fc660d7a1323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): rpfm_lib/src/files/tile_database/assembly_kit.rs:213-231 | rpfm_lib/src/files/tile_database/assembly_kit.rs:248-264 | rpfm_lib/src/files/tile_database/assembly_kit.rs:311-328 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/tile_database/assembly_kit.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"37796e51af4cbd854efae4b8925f7ac93449286cfe8719d508e39f7d7cb9a611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rpfm_extensions/src/dependencies/mod.rs:1300-1319 | rpfm_extensions/src/dependencies/mod.rs:1322-1341 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6ed9c6f94d186e2a1891e1d82e6509d760b0c67c7e11a9032f5e75624bb7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rpfm_lib/src/games/mod.rs:1465-1493 | rpfm_lib/src/games/mod.rs:1519-1547 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a429eb29e0487fb4e8ec8e3d52497465b5276c1c75f7424f7959445a5055d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rpfm_ui/src/tools/faction_painter/connections.rs:25-37 | rpfm_ui/src/tools/unit_editor/connections.rs:27-43 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"rpfm_ui/src/tools/faction_painter/connections.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fb6a8c63d45cb34d6499ad3e76c768cd36c41ed264d4a4abf54dfd913e0ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rpfm_extensions/src/startpos/cai/factions.rs:289-303 | rpfm_extensions/src/startpos/cai/factions.rs:316-334 | rpfm_extensions/src/startpos/cai/lists.rs:218-230 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/cai/factions.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f84b72472080ffbb144ed5b1bda00a547fb4ad533ce036c64276e23cbc1eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rpfm_ui/src/tools/unit_editor/mod.rs:754-772 | rpfm_ui/src/tools/unit_editor/mod.rs:775-793 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ec6372ea0f26617ffabc18cfd08ca1a2d614c93d2027b7030c1b504b1a0456"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:555-572 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:281-302 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1c7d0a8b74d69764bcf7e61d163262a346d142463a341ef5dbca0adcd3163c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rpfm_lib/src/integrations/assembly_kit/mod.rs:529-550 | rpfm_lib/src/integrations/assembly_kit/mod.rs:569-590 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e757b5c7b426cf4a1d10e9dfd52a9b8035895cf0595556ab9e7aaa160e9d92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rpfm_lib/src/files/tile_database/assembly_kit.rs:233-246 | rpfm_lib/src/files/tile_database/assembly_kit.rs:339-352 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"rpfm_lib/src/files/tile_database/assembly_kit.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9b1538d3168088de0b630c498e3ac45f86070ee2411dba758fc186fe822691"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rpfm_extensions/src/startpos/layout.rs:609-618 | rpfm_extensions/src/startpos/layout.rs:625-634 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a97d7eb1f9d7229ffd8d672633060cd3cbda78302a1494a68d8535b8f61b9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rpfm_ui/src/app_ui/mod.rs:1138-1168 | rpfm_ui/src/app_ui/mod.rs:1176-1214 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"28656dff34e25a79fe344484721d2cd7afb4614c27a59c09282d71593fbb099d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rpfm_lib/src/binary/writer.rs:461-477 | rpfm_lib/src/binary/writer.rs:588-604 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/binary/writer.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"93960901a2a70f9964eb3309a96f541659db8a90bb3feb53fdf8b110b0857648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rpfm_lib/src/files/bmd/common/mod.rs:760-775 | rpfm_lib/src/files/bmd/common/mod.rs:804-823 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/common/mod.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"301fbf16043ffc39008d706e09c7e960925d4e1703aeba51feb25d3da683028d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rpfm_lib/src/schema/mod.rs:610-623 | rpfm_lib/src/schema/mod.rs:639-652 | rpfm_lib/src/schema/mod.rs:669-687 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e617ac64241faea26f3b67ce69aa6fc78e9a5ae6a0e292a06d56ca451a879dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rpfm_ui/src/tools/translator/mod.rs:1123-1141 | rpfm_ui/src/tools/translator/mod.rs:1143-1161 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ed7ae2e47d07f310200848daf8d154ee2d7de653f221981b9d8af4fc9550a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): rpfm_lib/src/files/anim_fragment_battle/mod.rs:540-563 | rpfm_lib/src/files/anim_fragment_battle/mod.rs:568-585 | rpfm_lib/src/files/matched_combat/mod.rs:267-288 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/anim_fragment_battle/mod.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85d7f00e6e9688640b64e9fad7495d19e77b2a5f4720d3582614f2eaf3dea80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:930-942 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:945-957 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"588de2aaf6a8603142c383acf4c3e5ef07312b2f388bcdd579c63be7eb1f54c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rpfm_lib/src/files/sound_bank_database/mod.rs:496-514 | rpfm_lib/src/files/sound_events/mod.rs:337-355 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ba49b8ae981c5c55baf19ea85bc872cb9334eb4b7477284dc6d0e8966ed08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rpfm_lib/src/files/bmd/common/mod.rs:740-755 | rpfm_lib/src/files/bmd/common/mod.rs:780-799 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/common/mod.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a04fb9dad56079ea536227a8acffe7cd7c883d91de91399ce1929a18a5e91f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rpfm_extensions/src/diagnostics/mod.rs:274-286 | rpfm_extensions/src/diagnostics/mod.rs:288-300 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"640e6d9177f12628af41b877e4cf63a370e028821e1fc2d38d9e3464ad9309f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rpfm_extensions/src/lua/harness/mod.rs:436-448 | rpfm_extensions/src/lua/harness/mod.rs:451-462 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c8a69e032a0ac1eadd957a134587c8f31ec62462cabd637b7106eeed267640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:46-59 | rpfm_lib/src/files/bmd/common/flags/mod.rs:130-143 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbe36777b08db8ff8e979785f48af1e653f54c9bb3ad86ab567a04e23419b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rpfm_extensions/src/merge/mod.rs:181-195 | rpfm_extensions/src/merge/mod.rs:199-213 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"rpfm_extensions/src/merge/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb26b9f74ace6de798ca7f75c7e08cef36756da5ab5c72c920ad9f8c9d627a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_telemetry/src/logger.rs:482-492 | rpfm_telemetry/src/logger.rs:503-513 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_telemetry/src/logger.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de934dc4e00bdba2f55f2b46c9112ea84cb4abe95d9f751c2c8444e73b8b600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): rpfm_lib/src/files/bmd/capture_location_set/mod.rs:73-88 | rpfm_lib/src/files/bmd/common/properties/mod.rs:184-197 | rpfm_lib/src/files/bmd/composite_scene_list/composite_scene_reference/mod.rs:52-65 | rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:54-69 | rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/mod.rs:59-73 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e909900a7362ca2b564378fe7374dcc4acb9c52d4dc53a3ebb19778bd798fbff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rpfm_server/src/state/tables.rs:1123-1132 | rpfm_server/src/state/tables.rs:1135-1146 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tables.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c24beb4f0532dec62a755bd2b1cb9fd95e5e96ae63deeae3b501be9a6b15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:64-76 | rpfm_lib/src/files/bmd/common/flags/mod.rs:148-160 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e67a0e5aeb0414a628f129782ae9db167c26fdf6e5e0a2d25b078238419a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs:53-65 | rpfm_lib/src/files/bmd/toggleable_buildings_slot_list/mod.rs:43-55 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed44fcb571a900c1e63c86bb05f50d7240681e607819f1af79a7e6e3326861c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): rpfm_lib/src/files/bmd/capture_location_set/mod.rs:93-107 | rpfm_lib/src/files/bmd/common/properties/mod.rs:202-214 | rpfm_lib/src/files/bmd/composite_scene_list/composite_scene_reference/mod.rs:70-82 | rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:74-88 | rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/mod.rs:78-91 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f222624430fec17ea31dda22c1c2eeece894ab38beab618a02921e311f1cccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_ui/src/tools/faction_painter/mod.rs:555-565 | rpfm_ui/src/tools/unit_editor/mod.rs:702-712 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2005b4ab6c5f033abb931827d866ae8251b64c9feb4ced22888ff0a120507125"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rpfm_extensions/src/startpos/world/agents.rs:57-68 | rpfm_extensions/src/startpos/world/agents.rs:81-92 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/world/agents.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7407e0e8d44b15b4e57a2f4b794ab8e18b8beea62bb5a8a1de87780572040cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rpfm_ui/src/packedfile_views/group_formations/mod.rs:750-756 | rpfm_ui/src/packedfile_views/group_formations/mod.rs:759-765 \u2014 These two members are one piece of code written twice and then edited apart: 7 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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b1741b8433b54a8c7811e10db56f920d864634e0398bb2ab28b010346401f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rpfm_lib/src/files/bmd/civilian_deployment_list/mod.rs:54-71 | rpfm_lib/src/files/bmd/civilian_shelter_list/mod.rs:51-67 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/civilian_deployment_list/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce83a2dda9378f32319d8eea3c65951489b3192a35121d28f338883fb3d55ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rpfm_lib/src/files/sound_bank_database/mod.rs:519-530 | rpfm_lib/src/files/sound_events/mod.rs:360-371 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acb506a77e00bc14594265337cf5a80475ed7c025ca2db0d6f5ea44382d60d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): rpfm_ui/src/packedfile_views/anims_table/mod.rs:41-59 | rpfm_ui/src/packedfile_views/group_formations/mod.rs:1322-1338 | rpfm_ui/src/packedfile_views/matched_combat/mod.rs:41-59 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:608-626 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/anims_table/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d78a298dbef72671c4f4c4d94877ec42017c57e614f93cd494969fdede81bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs:70-81 | rpfm_lib/src/files/bmd/toggleable_buildings_slot_list/mod.rs:60-71 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e593a6d5a53314d47b980d588c6aeac3b285f7f776b5705657911770efc37286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rpfm_lib/src/files/anims_table/mod.rs:270-283 | rpfm_lib/src/files/cs2_collision/mod.rs:296-311 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"rpfm_lib/src/files/anims_table/mod.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"433798b08ad26a94666cb4390dbaa3842d924226fd352d35417f4a36ee68b1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rpfm_lib/src/files/bmd/battlefield_building_list/building/mod.rs:76-87 | rpfm_lib/src/files/bmd/prefab_instance_list/prefab_instance/mod.rs:67-78 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/battlefield_building_list/building/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0704a5ea36c6be8354095b0ce3594eeb5cd2e0f4d77b51bff2620d12a2c96e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs:41-52 | rpfm_lib/src/files/bmd/common/building_link/mod.rs:108-120 | rpfm_lib/src/files/bmd/tree_list_reference_list/mod.rs:40-52 | rpfm_lib/src/files/bmd/zones_template_list/mod.rs:42-53 | rpfm_lib/src/files/bmd_vegetation/grass_list/mod.rs:107-118 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd0bbbfed4552077ce611c453f92b635008f2eb3b90233c9175d79e79afeaf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rpfm_ui/src/ffi/mod.rs:601-605 | rpfm_ui/src/ffi/mod.rs:615-619 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee42102bcc5e8101480e636509dd181891ac381979f9a47a88df1e67c7e90d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_ui_common/src/locale.rs:123-133 | rpfm_ui_common/src/locale.rs:136-146 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_ui_common/src/locale.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d390a42315ad8828def3783ddb2a35dd4ea70f02dafa729753d6eed5d8b96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rpfm_lib/src/integrations/github/mod.rs:265-271 | rpfm_lib/src/integrations/github/mod.rs:328-334 \u2014 These two members are one piece of code written twice and then edited apart: 7 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":"rpfm_lib/src/integrations/github/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d701edf1217c0e110e101879b34980e56c2f40c2ff67343c0fcadd673d8b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:379-389 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:392-402 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1504f0e619f0cc9e64c0d8ebe83a9a17dd607f5d8cd1fb96a22ddf659b0d742e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rpfm_lib/src/binary/reader.rs:1207-1220 | rpfm_lib/src/binary/reader.rs:1270-1283 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"rpfm_lib/src/binary/reader.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0da4f4bfbb9be47c9886b3ba39ce38ba01b62376bdc54563d1dc4dd99bf8697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rpfm_lib/src/schema/mod.rs:2427-2444 | rpfm_lib/src/schema/v4.rs:334-350 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"224305f2124248a07308b961c1b6cafef335d05e87c92cec6e6af917135f1137"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): rpfm_ui/src/dependencies_ui/mod.rs:196-214 | rpfm_ui/src/packedfile_views/esf/mod.rs:206-224 | rpfm_ui/src/packedfile_views/packfile/mod.rs:162-179 | rpfm_ui/src/packfile_contents_ui/mod.rs:604-622 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/dependencies_ui/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc20138535eeffa8b262bad97d5db90fd62523afeabfd68587834f003ef5966"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rpfm_ui/src/packedfile_views/bmd/mod.rs:93-101 | rpfm_ui/src/packedfile_views/vmd/mod.rs:170-179 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/bmd/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"583fd235e1cdc9f17c5836d0ed9ca102b5e188bef4ff1c9369c3f5eac517301d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_lib/src/files/bmd/custom_material_mesh_list/custom_material_mesh/mod.rs:68-79 | rpfm_lib/src/files/bmd_vegetation/tree_list/mod.rs:196-206 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_lib/src/files/bmd/custom_material_mesh_list/custom_material_mesh/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded22a7cfbd688b495a9619e146aa08b54735d7fed76a1b079a6edf08d9f5e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rpfm_extensions/src/startpos/cai/settlements.rs:51-58 | rpfm_extensions/src/startpos/cai/settlements.rs:67-74 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/cai/settlements.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"231cd1686595e4dfdb5a054943f5f668ff60de5eacf688dac6acbe62a2bcb468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs:57-67 | rpfm_lib/src/files/bmd/common/building_link/mod.rs:125-136 | rpfm_lib/src/files/bmd/tree_list_reference_list/mod.rs:57-68 | rpfm_lib/src/files/bmd/zones_template_list/mod.rs:58-68 | rpfm_lib/src/files/bmd_vegetation/grass_list/mod.rs:123-133 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac62659c41721a05480ff05921b4d87dae6ec14ee40b0eb0f15c813c92d8917"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rpfm_lib/src/files/mod.rs:2523-2531 | rpfm_lib/src/files/mod.rs:3012-3020 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5ae07cae180993401f45eeb7485802f785e7b093c47297ee8f76afbe40839c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rpfm_lib/src/schema/v4.rs:239-244 | rpfm_lib/src/schema/v4.rs:446-451 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"rpfm_lib/src/schema/v4.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaac8be7a6924d77eb4ff700c061927f8271456c7dc38f213f1d5ae2db1deb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_lib/src/files/bmd/battlefield_building_list/building/mod.rs:58-71 | rpfm_lib/src/files/bmd/prefab_instance_list/prefab_instance/property_override/mod.rs:54-64 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_lib/src/files/bmd/battlefield_building_list/building/mod.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f70d9791d8855a99693ae30c28ba9ca19cf3d190271a981cab0cba8311c6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/mod.rs:45-55 | rpfm_lib/src/files/bmd/prefab_instance_list/prefab_instance/mod.rs:50-62 | rpfm_lib/src/files/tile_database/render_params/mod.rs:102-112 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb36d7e93d193b48cdcb2ea8a121bf1f97e41dcb1cc51ae6ebe81121011ab922"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs:43-54 | rpfm_lib/src/files/bmd/custom_material_mesh_list/custom_material_mesh/mod.rs:51-63 | rpfm_lib/src/files/bmd/playable_area/mod.rs:44-55 | rpfm_lib/src/files/bmd/prop_list/mod.rs:70-80 | rpfm_lib/src/files/bmd/terrain_stencil_triangle_list/terrain_stencil_triangle/mod.rs:43-54 | rpfm_lib/src/files/tile_database/tile_variation/mod.rs:76-86 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"da00944e019fab70ef6296af1e29e7760b87b69e31eb8cc8528e909e71cf9d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_lib/src/files/bmd_vegetation/tree_list/mod.rs:180-191 | rpfm_lib/src/files/tile_database/texture/mod.rs:72-82 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_lib/src/files/bmd_vegetation/tree_list/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1586e5a647be7423b1abd1b7058ccc98211aeeda6cf7ed49944084eb5958bc2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rpfm_lib/src/files/bmd_vegetation/mod.rs:191-201 | rpfm_lib/src/files/hlsl_compiled/mod.rs:163-173 | rpfm_lib/src/files/tile_database/mod.rs:134-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd_vegetation/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3ee69ad1f5a12e934201ef7d6da389dd5ad7647edb6c008daa3b0d04845e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rpfm_ui/src/tools/mod.rs:861-869 | rpfm_ui/src/tools/mod.rs:873-884 | rpfm_ui/src/tools/mod.rs:888-899 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3798be02c112948211f6cb8b25e24972b6d5ad5cee20a57547f1955769b480b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_lib/src/schema/mod.rs:2283-2293 | rpfm_lib/src/schema/mod.rs:2307-2322 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3446b0e990839a79c5302cf1e94fca7925166e5b03b80d291561bf2c477fa04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rpfm_lib/src/files/fastbin_lists/mod.rs:132-139 | rpfm_lib/src/files/fastbin_lists/mod.rs:153-160 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/fastbin_lists/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16bb3776d030e2ef26953312737a63763a8a0199c974b1870ab87e0ff08b6be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rpfm_extensions/src/startpos/layout.rs:342-349 | rpfm_extensions/src/startpos/layout.rs:425-430 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa29a96259c3fc7dcc3b7d22770223f1ab4cf27387b4d6b859f0c30887e00e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rpfm_extensions/src/startpos/writer/header.rs:95-102 | rpfm_extensions/src/startpos/writer/preopen.rs:82-89 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/writer/header.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a827d2819c6c84bd97ee08a322f8b22930badee93414b4127be72ae392d0a0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rpfm_ui/src/packedfile_views/group_formations/slots.rs:713-724 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:727-738 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbaa712ea2d3154be3d073c50b4d68d00836f24452dba93eae5df897506044b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): rpfm_lib/src/games/mod.rs:682-686 | rpfm_lib/src/games/mod.rs:835-839 | rpfm_lib/src/games/mod.rs:1011-1017 | rpfm_lib/src/games/mod.rs:1038-1047 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf190aaf009970e835e99c3e1e7c7cfc17a59a5bfb60f2fd6f00aae2a6e408ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rpfm_ui/src/packedfile_views/group_formations/mod.rs:1154-1159 | rpfm_ui/src/packedfile_views/group_formations/mod.rs:1201-1207 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"453c6bb66dc35466391029ab07e689cfcc280130666b266743072d2c41e0861d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rpfm_server/src/state/files.rs:332-343 | rpfm_server/src/state/files.rs:705-717 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/files.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"de479be9170b00a23b861ff0e32a32c72db6d3a2509c50fe51e27eefc70d64a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): rpfm_extensions/src/startpos/layout.rs:641-648 | rpfm_extensions/src/startpos/layout.rs:655-662 | rpfm_extensions/src/startpos/layout.rs:669-676 | rpfm_extensions/src/startpos/layout.rs:696-703 | rpfm_extensions/src/startpos/layout.rs:710-717 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6fbb35f4ae204bd0b6283194161b981c587077df50981e0650789629a0a9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/mod.rs:60-69 | rpfm_lib/src/files/tile_database/render_params/mod.rs:117-126 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6e04ed3cad45e5fdc7fedc1f2c393127473a3e6f582d36ac65893f06627a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 10\u002B corresponding lines): rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs:59-69 | rpfm_lib/src/files/bmd/light_probe_list/light_probe/mod.rs:58-67 | rpfm_lib/src/files/bmd/playable_area/mod.rs:60-70 | rpfm_lib/src/files/bmd/terrain_stencil_triangle_list/terrain_stencil_triangle/mod.rs:59-69 | rpfm_lib/src/files/bmd/toggleable_buildings_slot_list/toggleable_building_slot/building_link/mod.rs:57-66 | rpfm_lib/src/files/tile_database/climate/mod.rs:83-92 | rpfm_lib/src/files/tile_database/tile/mod.rs:108-117 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b4d9ffa6051ac1f4f0d3acd3040c379d3decf24f982d07d313e19e34cb6bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rpfm_lib/src/files/bmd/prop_list/mod.rs:85-94 | rpfm_lib/src/files/tile_database/tile_variation/mod.rs:91-100 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/prop_list/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4842e209f190f1423bd39890dfa2bc06fb7450d5ea94c84e198923cb487a11da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rpfm_lib/src/files/mod.rs:1451-1458 | rpfm_lib/src/files/mod.rs:1470-1477 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fc089eccc95b9ab2e5155e7a08d814039c0e23df40dc280f8114e9dd4cd8aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rpfm_lib/src/files/tile_database/assembly_kit.rs:134-140 | rpfm_lib/src/files/asset_variation_db/xml.rs:207-212 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"rpfm_lib/src/files/tile_database/assembly_kit.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"559ab54a960c9e3bb085784e7952eb11362e6647abe78bc6f4740b8051fb18a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): rpfm_lib/src/integrations/github/mod.rs:370-374 | rpfm_lib/src/integrations/github/mod.rs:388-392 | rpfm_lib/src/integrations/github/mod.rs:407-411 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/github/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0156a3ef66576edeb861e745bc8e205771bb7c6b84c0c45de7d236e546ab65db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rpfm_extensions/src/startpos/esf_nav.rs:47-54 | rpfm_extensions/src/startpos/layout.rs:797-804 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/esf_nav.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2062f15d49c75ebefa9052f3918f88b412b302cb58e563a97462189836e6630e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rpfm_server/src/state/search.rs:421-428 | rpfm_ui/src/global_search_ui/mod.rs:2389-2396 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/search.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8706f9ece4156b9e24db6fd48aab3e3d37fff299e637162ec190bc1228833cb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rpfm_extensions/src/search/text.rs:137-147 | rpfm_extensions/src/search/unknown.rs:97-107 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rpfm_extensions/src/search/text.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e3acb6e9d2347112bb9bee19a98e7ef3d356bd8abfeb03a1122cfbcb017944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rpfm_extensions/src/startpos/extract/characters.rs:460-463 | rpfm_extensions/src/startpos/extract/missions.rs:177-181 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/extract/characters.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3130c4f807dd80fb07a5eb4bf3d9c307a5b0ac44d6050db61504a1f641523370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1106-1110 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:596-600 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2e815af474d6135052b578f342b2be017af43a933609a7113078a466d83c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rpfm_lib/src/files/asset_variation_db/v1.rs:114-121 | rpfm_lib/src/files/fastbin_lists/mod.rs:183-190 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/asset_variation_db/v1.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c79a79afe5444a94f35787eeb727085b54a4ce4fbed8b7babe2e18594fc015f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rpfm_lib/src/files/sound_bank/sections/hirc/object/event/mod.rs:35-40 | rpfm_lib/src/files/sound_bank/sections/hirc/object/settings/mod.rs:37-42 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"rpfm_lib/src/files/sound_bank/sections/hirc/object/event/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"783095ce03de96eb37eae3e3898fdcf76d814370cb4ff3bc8cd76f5d1cbacb39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:985-988 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:479-482 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0a3d1d18cd51bf37e3b5c57ac47e8462496b6acfbb5e639ca578c42b33b955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201349 lines \u00D7 5): rpfm_ui/src/app_ui/slots.rs:1899-1947 | rpfm_ui/src/packedfile_views/decoder/slots.rs:628-664 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:644-677 | rpfm_ui/src/packfile_contents_ui/slots.rs:2534-2570 | rpfm_ui/src/views/table/slots.rs:1006-1037 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/decoder/slots.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 240 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1899\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc0926f77fe2c341204679f1bf4b9b3ccc972cdf2ad37dc672502017085ed3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201342 lines \u00D7 8): rpfm_ui/src/global_search_ui/mod.rs:1194-1234 | rpfm_ui/src/global_search_ui/mod.rs:1338-1377 | rpfm_ui/src/global_search_ui/mod.rs:1422-1462 | rpfm_ui/src/global_search_ui/mod.rs:1557-1596 | rpfm_ui/src/global_search_ui/mod.rs:1696-1737 | rpfm_ui/src/global_search_ui/mod.rs:1782-1823 | rpfm_ui/src/global_search_ui/mod.rs:1865-1905 | rpfm_ui/src/global_search_ui/mod.rs:1985-2026 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:1194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060matches\u0060 to \u0060\u0026[AnimFragmentBattleMatches]\u0060 in one and \u0060\u0026[AtlasMatches]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fc9a0359cb5d8ba06fff13da2a1cefa5bede07ef3cd71da5d9cb45c89d66b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): rpfm_extensions/src/diagnostics/text.rs:242-283 | rpfm_extensions/src/diagnostics/text.rs:287-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/diagnostics/text.rs:242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/text.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"660fdbcf48b2b222978ea19745cc83cc58d401071753e8e720c4264b35ca582e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): rpfm_lib/src/files/mod.rs:1927-1965 | rpfm_lib/src/files/pack/mod.rs:513-551 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/mod.rs:1927\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d505afa8534bff33a5410c71418905ec50f0665faf661f01d47849080b0d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:124-189 | rpfm_ui/src/packedfile_views/unit_variant/slots.rs:120-185 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/slots.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 5 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:124\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060view\u0060 to \u0060\u0026Arc\u003CPortraitSettingsView\u003E\u0060 in one and \u0060\u0026Arc\u003CUnitVariantView\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"46487871e368987ac0e32434cfde803a707c54d32c1ab3ee639280ee69bb3ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:1389-1426 | rpfm_extensions/src/dependencies/mod.rs:1438-1475 \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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f017e3cb4be22c2530ee388d72d9c38030f16181e31156cb1fe5df964351fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): rpfm_lib/src/files/mod.rs:944-980 | rpfm_lib/src/files/mod.rs:1000-1037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/mod.rs:944\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/mod.rs:941\u0060 calls \u0060files_mut\u0060, \u0060get_mut\u0060, \u0060ok_or_else\u0060 and \u0060rpfm_lib/src/files/mod.rs:997\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"41adc1395bfb6f8cf47d9e2814824114b5acd926db1ffbab27367b724de84b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): rpfm_ui/src/tools/unit_editor/mod.rs:386-431 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:250-287 \u2014 before extracting anything, compare \u0060rpfm_ui/src/tools/unit_editor/mod.rs\u0060 and \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 261 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/unit_editor/mod.rs:386\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/tools/unit_editor/mod.rs:434\u0060 calls \u0060setup_widgets_relations\u0060 and \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:290\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"afefb7322dac7db1d6f9e10812b4b8909ae61a156cade81e238d6f6db6df4902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 3): rpfm_ui/src/diagnostics_ui/mod.rs:482-515 | rpfm_ui/src/tools/unit_editor/mod.rs:380-424 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:237-271 \u2014 before extracting anything, compare \u0060rpfm_ui/src/diagnostics_ui/mod.rs\u0060 and \u0060rpfm_ui/src/tools/unit_editor/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32548b1d3b6520118de6ccb113c6ce8cee6204e668208e0db01a769e28377e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): rpfm_ui/src/packedfile_views/group_formations/mod.rs:488-521 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:450-485 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/group_formations/mod.rs:488\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f2f5777297d39c748150e1917d0c86f1e9ab780e72534b694a582943f92e38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 8): rpfm_ui/src/app_ui/mod.rs:736-780 | rpfm_ui/src/app_ui/slots.rs:1904-1957 | rpfm_ui/src/diagnostics_ui/mod.rs:482-517 | rpfm_ui/src/packedfile_views/decoder/slots.rs:632-667 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:647-679 | rpfm_ui/src/packfile_contents_ui/slots.rs:2538-2572 | rpfm_ui/src/tools/unit_editor/mod.rs:380-426 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:237-274 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/diagnostics_ui/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22b0c70e2078ac11579afd7cf776ab6b147ad44f858163adeb6c374086e0565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:455-487 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:218-250 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:455\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1a46bf82dac6e27d229d631c9ffa080a07ee03135a11df1f56100049a7fa68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201332 lines \u00D7 3): rpfm_extensions/src/gltf/mod.rs:271-302 | rpfm_extensions/src/gltf/mod.rs:306-319 | rpfm_extensions/src/gltf/mod.rs:323-336 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/gltf/mod.rs:271\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5465c6140a669d99e2cae34a3d65d5069aa1fe878655a938a9a60e62b66a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): rpfm_ui/src/global_search_ui/mod.rs:530-561 | rpfm_ui/src/packfile_contents_ui/mod.rs:432-471 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfe27abd3f0f118665c2452e37d42ec807e9a14f07ac079790cbc6c0cb22568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 5): rpfm_ui/src/app_ui/slots.rs:1980-2020 | rpfm_ui/src/packedfile_views/decoder/slots.rs:638-674 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:659-693 | rpfm_ui/src/packfile_contents_ui/slots.rs:2588-2621 | rpfm_ui/src/views/table/slots.rs:1027-1057 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/decoder/slots.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 240 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1980\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0b4d6361f2be9c1d582378cb422e98c25ade2e30c2e3aec6b41a3a007153aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): rpfm_ui/src/app_ui/slots.rs:315-344 | rpfm_ui/src/views/table/mod.rs:3249-3279 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/views/table/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:3281\u0060 calls \u0060update_row_diff_marker\u0060, \u0060row\u0060 and \u0060rpfm_ui/src/app_ui/slots.rs:345\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a29698524891f767e1ff3b0e48cc5e9a4c8baa816ea611e1aa817d596db1416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 8): rpfm_ui/src/app_ui/slots.rs:1902-1952 | rpfm_ui/src/diagnostics_ui/mod.rs:482-516 | rpfm_ui/src/packedfile_views/decoder/slots.rs:631-666 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:646-678 | rpfm_ui/src/packfile_contents_ui/slots.rs:2537-2571 | rpfm_ui/src/tools/unit_editor/mod.rs:380-425 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:237-272 | rpfm_ui/src/views/table/slots.rs:1009-1038 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/diagnostics_ui/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1902\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"c489d265c525a0c2c69144c5e97becccaf4f6c87721f10c5120d8cdb37ce6b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 7): rpfm_ui/src/app_ui/slots.rs:1980-2019 | rpfm_ui/src/packedfile_views/decoder/slots.rs:638-673 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:659-692 | rpfm_ui/src/packfile_contents_ui/slots.rs:2588-2620 | rpfm_ui/src/tools/unit_editor/mod.rs:386-430 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:250-286 | rpfm_ui/src/views/table/slots.rs:1027-1056 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/decoder/slots.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 240 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1980\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/tools/unit_editor/mod.rs:434\u0060 calls \u0060setup_widgets_relations\u0060 and \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:290\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a42f39827029e881fc805b403ed194a1a088e14a98aec70b2e204dc517e4f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201329 lines \u00D7 7): rpfm_extensions/src/gltf/mod.rs:190-200 | rpfm_extensions/src/gltf/mod.rs:224-234 | rpfm_extensions/src/gltf/mod.rs:241-251 | rpfm_extensions/src/gltf/mod.rs:258-268 | rpfm_extensions/src/gltf/mod.rs:275-303 | rpfm_extensions/src/gltf/mod.rs:310-320 | rpfm_extensions/src/gltf/mod.rs:327-337 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/gltf/mod.rs:190\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40c42233c569c0c6c17f8fc43d5ec26d0dcbd924ffd1ab4662252e23bdf8ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201328 lines \u00D7 8): rpfm_extensions/src/gltf/mod.rs:192-201 | rpfm_extensions/src/gltf/mod.rs:209-218 | rpfm_extensions/src/gltf/mod.rs:226-235 | rpfm_extensions/src/gltf/mod.rs:243-252 | rpfm_extensions/src/gltf/mod.rs:260-269 | rpfm_extensions/src/gltf/mod.rs:277-304 | rpfm_extensions/src/gltf/mod.rs:312-321 | rpfm_extensions/src/gltf/mod.rs:329-338 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/gltf/mod.rs:192\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"192bc66230c5eff648446b8c3bb5f0fb620bdbe83b917d334a3076fb70acb8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201328 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:1349-1369 | rpfm_extensions/src/dependencies/mod.rs:1513-1540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1349\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"692c6fc63cea6983befd7c33a62ad33f5773691232b8468beb208952c5e0e21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 5): rpfm_server/src/ceo_builder.rs:381-404 | rpfm_server/src/ceo_builder.rs:472-495 | rpfm_server/src/ceo_builder.rs:554-577 | rpfm_server/src/ceo_builder.rs:647-670 | rpfm_server/src/ceo_builder.rs:730-753 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:381\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_server/src/ceo_builder.rs:380\u0060 calls \u0060as_str\u0060 and \u0060rpfm_server/src/ceo_builder.rs:553\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1dbab4421f66a83a13be26f4ece11965b679783fe6978e8de13fbc1e031a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 8): rpfm_ui/src/diagnostics_ui/mod.rs:763-785 | rpfm_ui/src/diagnostics_ui/mod.rs:812-834 | rpfm_ui/src/diagnostics_ui/mod.rs:861-883 | rpfm_ui/src/diagnostics_ui/mod.rs:921-943 | rpfm_ui/src/diagnostics_ui/mod.rs:981-1003 | rpfm_ui/src/diagnostics_ui/mod.rs:1033-1055 | rpfm_ui/src/diagnostics_ui/mod.rs:1086-1108 | rpfm_ui/src/diagnostics_ui/mod.rs:1135-1157 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:763\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"7983ff700d0a240fe1c1709e1318dc44827e8e3e2d02cb3c203df6efe947244e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:241-261 | rpfm_server/src/ceo_builder.rs:1004-1024 \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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea11289bfb686d38e76763a199162df02d5b648047e814ea064791b3078f0bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:256-275 | rpfm_ui/src/packedfile_views/vmd/mod.rs:117-137 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:256\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:277\u0060 calls \u0060load_data\u0060 and \u0060rpfm_ui/src/packedfile_views/vmd/mod.rs:139\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"227d9ba77a4fe1cd9a29d31609f555ce1c3912e953ad284c9d1079e42f4e1f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rpfm_ui/src/views/table/search/mod.rs:236-262 | rpfm_ui/src/views/table/search/mod.rs:338-364 \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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"469816e00071bcdf68b5b76e4cb0a205dc9e735db17c57af824b710040775182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rpfm_lib/src/files/pack/mod.rs:861-879 | rpfm_lib/src/files/pack/mod.rs:925-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/pack/mod.rs:861\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b190ab856e79fa2ed909a2b2dc2805079927caf0c40a31b0f8f089c7c705c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rpfm_lib/src/files/pack/mod.rs:1487-1506 | rpfm_lib/src/files/pack/mod.rs:1526-1545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/pack/mod.rs:1487\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75d1f4d720044eafcf8577ec54da7fe5a156aedf9d573bd298c6756dd724b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rpfm_ui/src/views/table/search/mod.rs:409-427 | rpfm_ui/src/views/table/search/mod.rs:452-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/search/mod.rs:409\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebffe45ffed079a7447fba4502ec19d156a1b3c8c7ebf41e006eb8150958256b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:751-768 | rpfm_ui/src/views/table/mod.rs:774-784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:769\u0060 calls \u0060add_action_q_action\u0060 and \u0060rpfm_ui/src/views/table/mod.rs:785\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91eb5770f1c5a6e960749aa522176bc67d0cccbc6e67131865ee05fd4fbf61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rpfm_extensions/src/dependencies/mod.rs:447-463 | rpfm_extensions/src/dependencies/mod.rs:853-869 | rpfm_extensions/src/dependencies/mod.rs:934-950 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:447\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f5785e035188c850236ddf29d634b815c2972020175e2763f2a012b0ed6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rpfm_extensions/src/optimizer/mod.rs:605-621 | rpfm_extensions/src/optimizer/mod.rs:669-685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/optimizer/mod.rs:605\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeb14104872472ed87d2cd55c1cc4cb02d421a148335b28f7089608193f31fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): rpfm_lib/src/files/esf/utils.rs:478-494 | rpfm_lib/src/files/esf/utils.rs:496-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/esf/utils.rs:478\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4634ce54a3026400b2fc5e13f9fac057f99270ef6cea40795dbc798e766cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rpfm_ui/src/packedfile_views/dependencies_manager/mod.rs:67-83 | rpfm_ui/src/packedfile_views/table/mod.rs:74-90 \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":"rpfm_ui/src/packedfile_views/dependencies_manager/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6b8739d01dcf170b2f173e2559593f6969e6c5f9b43130b9d4e1ba2f2ed6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:827-843 | rpfm_ui/src/tools/faction_painter/mod.rs:911-927 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:827\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"43849ed304cf49fc34792c37ff454f58c883a79e7c4df47f4fc892cf99980f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:328-344 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:494-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"63df0c4e5bab3d0b3c12df3cda0fe138a5775494ed8b66c04ce9bd1e957455cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rpfm_ui_common/src/icons/mod.rs:272-288 | rpfm_ui_common/src/icons/mod.rs:398-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui_common/src/icons/mod.rs:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a89f510a4aee517292ae04a34b1e78ce246830350644a9a900128cd9050f314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:2669-2684 | rpfm_extensions/src/dependencies/mod.rs:2832-2843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:2669\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528e42007102078ab7a09fdf0fc43a7d1c7e91f5238114c6fb2c68d79dd837f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rpfm_lib/src/files/db/mod.rs:662-677 | rpfm_lib/src/files/loc/mod.rs:259-274 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:662\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"101ef613afe36048078a784887fe9c0dda666c4e77e9fef9aece09e7a5eb0f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esftree/mod.rs:258-273 | rpfm_ui/src/packedfile_views/esf/esftree/mod.rs:299-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/esf/esftree/mod.rs:258\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3620ddc516f8f310b5536b79c781108511271cccd66c0efa14093cb70bd8a5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rpfm_ui/src/packedfile_views/text/mod.rs:80-95 | rpfm_ui/src/packedfile_views/text/mod.rs:126-141 \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":"rpfm_ui/src/packedfile_views/text/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"82049051770df188e628291382e9a29526f26f188a81a79e2776db6ecd8f6c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:772-799 | rpfm_ui/src/tools/faction_painter/mod.rs:856-883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:772\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c34d48ccc1c6a2e23796be932cf7b5051dac268b29fab356b1d2a8006a966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:841-857 | rpfm_ui/src/tools/mod.rs:1118-1133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:841\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfa013c98e0d8a63c5807d294baf8b4c7a7daf2c5e3b055a8fdf1540d05accb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201316 lines \u00D7 4): rpfm_ui/src/global_search_ui/mod.rs:1119-1122 | rpfm_ui/src/references_ui/mod.rs:274-277 | rpfm_ui/src/views/table/mod.rs:3865-3879 | rpfm_ui/src/views/table/mod.rs:4109-4124 \u2014 before extracting anything, compare \u0060rpfm_ui/src/references_ui/mod.rs\u0060 and \u0060rpfm_ui/src/views/table/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:3865\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/global_search_ui/mod.rs:1125\u0060 calls \u0060child_2a\u0060, \u0060row\u0060, \u0060text\u0060 and \u0060rpfm_ui/src/references_ui/mod.rs:280\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d461fe2230de05ecb3d65f0b83fd2805d22c71deb318edd9c5ae0720e6a284e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 7): rpfm_server/src/ceo_builder.rs:454-464 | rpfm_server/src/ceo_builder.rs:533-543 | rpfm_server/src/ceo_builder.rs:626-636 | rpfm_server/src/ceo_builder.rs:709-719 | rpfm_server/src/ceo_builder.rs:792-802 | rpfm_server/src/ceo_builder.rs:835-849 | rpfm_server/src/ceo_builder.rs:1109-1123 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"142722d825ea97bd33a8ed12f354df6de0241ab24e7e0a60a334477509886fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 4): rpfm_extensions/src/dependencies/mod.rs:451-462 | rpfm_extensions/src/dependencies/mod.rs:857-868 | rpfm_extensions/src/dependencies/mod.rs:938-949 | rpfm_lib/src/files/mod.rs:1807-1821 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a351f5d1fca2e5c6db50cd26c03a485e8f6edc24339c27e4c137d3d39214b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:417-431 | rpfm_extensions/src/dependencies/mod.rs:823-837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:417\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8755428a6c364f3b43421e2ba091611420239858fb5a7140544792bfff7983eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:1364-1378 | rpfm_extensions/src/dependencies/mod.rs:1550-1564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1364\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c539429a7dc64cc1e6d1378adea9b560b23731a640bdbb359d9db90f403c65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rpfm_lib/src/files/mod.rs:2412-2426 | rpfm_lib/src/files/mod.rs:2430-2443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/mod.rs:2430\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a9f7a98f92bb2244c7b1f437ba4ca39384c940e3258d593d685b2329b7c737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_lib/src/files/pack/mod.rs:1246-1260 | rpfm_lib/src/files/pack/mod.rs:1271-1285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/pack/mod.rs:1246\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"256828a51dffab76b6be787a6fa4716120e4bb1671f97f7e9baa11c9cefb0ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_lib/src/games/mod.rs:1479-1493 | rpfm_lib/src/games/mod.rs:1533-1547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/mod.rs:1479\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebe1c4620153c36dd8319689c7f890e4dcfbd3bd35c24c82c06aa4afe1fd613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:434-448 | rpfm_server/src/ceo_builder.rs:606-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:434\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"86282d67f9a33fea1ad9b2bc3a68a9b0a99e68648619e611a727c3ec467c638c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_ui/src/app_ui/slots.rs:1244-1258 | rpfm_ui/src/app_ui/slots.rs:1264-1278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1808bc492f5e1fb188f7343ab1948d08d1ed12b2e6493bcde92683f2b651e83a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_ui/src/global_search_ui/mod.rs:1265-1279 | rpfm_ui/src/global_search_ui/mod.rs:1475-1490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:1265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5948334550f7257b06bfc68f25d46e34c723ce05cf527e0f339ec912365685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_ui/src/tools/unit_editor/mod.rs:758-772 | rpfm_ui/src/tools/unit_editor/mod.rs:779-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/unit_editor/mod.rs:758\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d942d501a3d99396234e536c713395875962dfbfc541ff71d2551d2c6c5052d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_ui/src/ui/mod.rs:371-385 | rpfm_ui/src/welcome_page_ui/mod.rs:260-274 \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":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"626bc73375cebb26c73c43fd7e2b21fb994adddbe01162f63d500f84f1241a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 8): rpfm_server/src/ceo_builder.rs:456-466 | rpfm_server/src/ceo_builder.rs:535-545 | rpfm_server/src/ceo_builder.rs:628-638 | rpfm_server/src/ceo_builder.rs:711-721 | rpfm_server/src/ceo_builder.rs:794-804 | rpfm_server/src/ceo_builder.rs:838-851 | rpfm_server/src/ceo_builder.rs:1064-1074 | rpfm_server/src/ceo_builder.rs:1112-1125 \u2014 all 8 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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"63355b73ffffed1f7f6d8f676f72851073198772ddd25483d26161883c5392c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): rpfm_server/src/ceo_builder.rs:506-519 | rpfm_server/src/ceo_builder.rs:589-602 | rpfm_server/src/ceo_builder.rs:682-695 | rpfm_server/src/ceo_builder.rs:765-778 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:506\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8217908f01f9d72a542219451cb44affc66bfb3acf98734236c79d2dd643403d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rpfm_ui/src/tools/faction_painter/mod.rs:655-668 | rpfm_ui/src/tools/faction_painter/mod.rs:794-807 | rpfm_ui/src/tools/faction_painter/mod.rs:878-891 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:655\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"127b8596d552f5887738a49af02334fae735829efdb6a65a78dcf4c3c27bf2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:2794-2806 | rpfm_extensions/src/dependencies/mod.rs:2869-2882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:2794\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1e69bd584d1b7e80b252bf8dddc854ca304000693043898fcf871dc43301a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:3573-3586 | rpfm_extensions/src/dependencies/mod.rs:3608-3621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_extensions/src/dependencies/mod.rs:3589\u0060 calls \u0060key\u0060 and \u0060rpfm_extensions/src/dependencies/mod.rs:3623\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7472c501aea774d22b48a3946374236b22a5dca3200e75b5e9c93ee6af69ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_extensions/src/diagnostics/table.rs:586-599 | rpfm_extensions/src/diagnostics/table.rs:733-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/diagnostics/table.rs:586\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de3f31bb3c1d280c72fc80863381be2e13564cf4feafc8178a46f920cee7e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rpfm_lib/src/games/mod.rs:915-928 | rpfm_lib/src/games/mod.rs:948-959 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/mod.rs:915\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c7cf79bed0998ffed8a806af43004d6b02a86000a017eda6cb2c799f16df63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:2377-2390 | rpfm_lib/src/games/supported_games.rs:2585-2598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:2377\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"759e832b719e92c700632d9b2251b4fd9ee74ce9f4c2fd3ce142ed1c3c1f9422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_lib/src/integrations/assembly_kit/mod.rs:445-458 | rpfm_lib/src/integrations/assembly_kit/mod.rs:497-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/integrations/assembly_kit/mod.rs:445\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e3646587d9102a58fd432ce8c97901627aa126159fed1acbc35afe2b3d1d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:923-936 | rpfm_server/src/ceo_builder.rs:1164-1177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:923\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87037896fe16a1611730b84f0988eed9e02d9a0789e581314931b496caa71d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:938-951 | rpfm_server/src/ceo_builder.rs:1179-1192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:938\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d8aa9fef0a88b182ebce4d3da0fdd96a2a9010c238c4a05836ed2a0082ce19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_ui/src/packedfile_views/decoder/mod.rs:1134-1147 | rpfm_ui/src/packedfile_views/decoder/mod.rs:1257-1270 \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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c2207a27177cbf9153388ce67ab522afa6501297d334ce86b1e175cbca7689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/mod.rs:325-338 | rpfm_ui/src/packfile_contents_ui/mod.rs:358-370 \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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a506f685230f8f3d092758d594bbdc44da3270191ce0b7ba334a244759414f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): rpfm_lib/src/games/supported_games.rs:1062-1074 | rpfm_lib/src/games/supported_games.rs:1362-1373 | rpfm_lib/src/games/supported_games.rs:1882-1893 | rpfm_lib/src/games/supported_games.rs:2159-2170 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:1062\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"570629cf81195f95b90709f6d09529f1d15790df8f27ea33d60ca08c997011ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rpfm_ui/src/app_ui/mod.rs:2308-2320 | rpfm_ui/src/app_ui/mod.rs:2333-2345 | rpfm_ui/src/app_ui/mod.rs:2440-2452 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:2308\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9094ea0b5dd39ac43b08dfae756bccffdb5ef7faa5a2bcc3765164db155a16b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_lib/src/files/animpack/mod.rs:289-301 | rpfm_lib/src/files/pack/mod.rs:600-612 \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":"rpfm_lib/src/files/animpack/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3a3b729a38f398eab0a249d531f3b77fbb944ed4f1f8e5a77e37c962fc6bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rpfm_lib/src/files/mod.rs:1906-1918 | rpfm_lib/src/files/pack/mod.rs:493-504 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/mod.rs:1906\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/pack/mod.rs:489\u0060 calls \u0060contains\u0060, \u0060Err\u0060 and \u0060rpfm_lib/src/files/mod.rs:1905\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"d738f757d71e9868b9b0f8f4e18ca5ecd7571e993d8edaa5630cc424a01cf291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:272-284 | rpfm_lib/src/games/supported_games.rs:2938-2950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"431412d9d3458d7447afc82184be0ef0993d2217517d61df887ec9e140f0d118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:434-446 | rpfm_lib/src/games/supported_games.rs:633-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:434\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"588f84364cda043230a4d98dae75c843eab8edc54d2f81c1aade25bfdd27991d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:3122-3134 | rpfm_lib/src/games/supported_games.rs:3532-3544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:3122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":3122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea45917a1d9dd039bc8ee003edec2563a2b8c114404fbb930a5ba5d2fcd8d380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rpfm_lib/src/integrations/assembly_kit/mod.rs:342-354 | rpfm_lib/src/integrations/assembly_kit/mod.rs:357-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/integrations/assembly_kit/mod.rs:342\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/integrations/assembly_kit/mod.rs:339\u0060 calls \u0060fields_processed\u0060 and \u0060rpfm_lib/src/integrations/assembly_kit/mod.rs:354\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd9dba43245e1f9230113eb0770451bc7b8a055a2e2c2ef64ec4535e8d79172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:3599-3611 | rpfm_ui/src/app_ui/mod.rs:3643-3655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:3599\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b01fa938856d6daac013f4d5c3506cce95cfc29a3178e853055133eeda04c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:4239-4251 | rpfm_ui/src/packfile_contents_ui/mod.rs:731-743 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:4239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4239}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d350bb8b7d6bb721c10197a40856956e1275410505c682309539b35e6f9df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rpfm_ui/src/diagnostics_ui/mod.rs:1527-1538 | rpfm_ui/src/diagnostics_ui/mod.rs:1577-1589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1527\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecbb9d799aa71790794d20f909bd69ae58a54407fae7e85ddcf10eb3ca2c5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_ui/src/packedfile_views/decoder/mod.rs:779-791 | rpfm_ui/src/packedfile_views/decoder/mod.rs:817-829 \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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ba0f8602ecfc7c3c71d534c0dbae68b33fa838961f3d921d45db954505a3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rpfm_ui/src/packedfile_views/group_formations/slots.rs:230-242 | rpfm_ui/src/packedfile_views/group_formations/slots.rs:293-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/group_formations/slots.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b087cb41857eb317a20ab75a26b5a228dba52a11d72a211846b9e00e9c9292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/mod.rs:583-595 | rpfm_ui/src/packfile_contents_ui/mod.rs:832-844 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/mod.rs:583\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e991f5cb75b001cb1ea5b92377d5bfdc11b417b3a563aa6ba8ed1a6379e9fbf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 8): rpfm_ui/src/global_search_ui/mod.rs:1315-1334 | rpfm_ui/src/global_search_ui/mod.rs:1399-1418 | rpfm_ui/src/global_search_ui/mod.rs:1534-1553 | rpfm_ui/src/global_search_ui/mod.rs:1673-1692 | rpfm_ui/src/global_search_ui/mod.rs:1759-1778 | rpfm_ui/src/global_search_ui/mod.rs:1842-1861 | rpfm_ui/src/global_search_ui/mod.rs:1962-1981 | rpfm_ui/src/global_search_ui/mod.rs:2042-2061 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:1315\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/global_search_ui/mod.rs:2039\u0060 calls \u0060append_q_standard_item\u0060, \u0060new_item\u0060, \u0060into_ptr\u0060 and \u0060rpfm_ui/src/global_search_ui/mod.rs:1396\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dd8a319a1d2e62efca51355b86c55f0b6f72dcc8804d0f79f0913ed30b8e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): rpfm_lib/src/games/supported_games.rs:437-448 | rpfm_lib/src/games/supported_games.rs:636-647 | rpfm_lib/src/games/supported_games.rs:1065-1076 | rpfm_lib/src/games/supported_games.rs:1364-1375 | rpfm_lib/src/games/supported_games.rs:1884-1895 | rpfm_lib/src/games/supported_games.rs:2161-2172 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:437\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5bc00cc4f2740cfcd5e48ba8ae41841421e98f52150723c63431d1b7621da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 6): rpfm_ui/src/diagnostics_ui/mod.rs:1533-1543 | rpfm_ui/src/diagnostics_ui/mod.rs:1547-1557 | rpfm_ui/src/diagnostics_ui/mod.rs:1560-1571 | rpfm_ui/src/diagnostics_ui/mod.rs:1584-1594 | rpfm_ui/src/diagnostics_ui/mod.rs:1598-1608 | rpfm_ui/src/diagnostics_ui/mod.rs:1611-1622 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1533\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a770cbc7dd36d8dff4224aca297dc082416b93220b1e6b7a5b6d91ede1603306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): rpfm_server/src/ceo_builder.rs:411-422 | rpfm_server/src/ceo_builder.rs:500-511 | rpfm_server/src/ceo_builder.rs:583-594 | rpfm_server/src/ceo_builder.rs:676-687 | rpfm_server/src/ceo_builder.rs:759-770 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:411\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"402684924cf0562358629a6caf86487f0ac8061945b6e20c5f740ef25a99fd78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): rpfm_ui/src/ffi/mod.rs:828-839 | rpfm_ui/src/tools/translator/mod.rs:479-490 | rpfm_ui/src/tools/translator/mod.rs:509-520 | rpfm_ui/src/tools/translator/mod.rs:1895-1906 | rpfm_ui/src/views/table/utils.rs:1397-1408 \u2014 there are 5 copies across 3 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"7548d3f17054bf82da754c045e457055a7a8f1e26ef7703baf7eef1e56f5667a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 5): rpfm_ui/src/app_ui/mod.rs:1757-1768 | rpfm_ui/src/app_ui/mod.rs:1781-1792 | rpfm_ui/src/app_ui/mod.rs:1805-1816 | rpfm_ui/src/app_ui/mod.rs:1837-1848 | rpfm_ui/src/app_ui/mod.rs:1995-1998 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:1757\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"323709cb80fd6aefd62aaa6bac81b609cb83234a6288c037827d3a6fd7973d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201312 lines \u00D7 5): rpfm_ui/src/app_ui/mod.rs:3578-3589 | rpfm_ui/src/app_ui/mod.rs:3594-3605 | rpfm_ui/src/app_ui/mod.rs:3622-3633 | rpfm_ui/src/app_ui/mod.rs:3638-3649 | rpfm_ui/src/diagnostics_ui/mod.rs:2316-2320 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:3578\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e950576afaf23283185fbb77b27bc90b40b711dd2835385b70120315420f05bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rpfm_lib/src/files/esf/utils.rs:540-551 | rpfm_lib/src/files/esf/utils.rs:555-566 | rpfm_lib/src/files/esf/utils.rs:570-581 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/esf/utils.rs:540\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"776ea75134139ce239c05d035ea6f643a727a3f3ab91bf28d5f35c5d6c0912e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rpfm_ui/src/global_search_ui/mod.rs:1510-1521 | rpfm_ui/src/global_search_ui/mod.rs:1649-1660 | rpfm_ui/src/global_search_ui/mod.rs:1938-1949 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:1510\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"69545ee615406bdc89f787656ea99aa4c7e18cd3e6359eb90cd9d91df6373905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:623-634 | rpfm_extensions/src/dependencies/mod.rs:653-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:623\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a0af50fc9439d7d16e756adae52791437403c9418ae8a16fb1eabca5dd46e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_extensions/src/diagnostics/table.rs:406-417 | rpfm_extensions/src/diagnostics/table.rs:426-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/diagnostics/table.rs:406\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea277e03976203975b97a01bef487a8618495c21462ad004a35d55bf780f9b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_extensions/src/search/table.rs:116-127 | rpfm_extensions/src/search/table.rs:133-144 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/table.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53d51672abc03b820e80a28713c778e151121ebdc935c91bacae102ee385c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_lib/src/files/esf/utils.rs:585-596 | rpfm_lib/src/files/esf/utils.rs:600-611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/esf/utils.rs:585\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"e021209faf96a89e12127efd8cd565300b2829154e760966ef3fdd7ad508a941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rpfm_lib/src/files/mod.rs:2217-2227 | rpfm_lib/src/files/mod.rs:2279-2290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/mod.rs:2217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a25376eb144dc3443a8fea704f6e62a6b9601acfd309b1a8d41cb92e04fbd4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:398-408 | rpfm_lib/src/games/supported_games.rs:595-606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:398\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f6a6b1fbf8c672f5ab0f9904a0c55aa0d2e7387aca8cc2c976c3a664db9917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_ui/src/diagnostics_ui/mod.rs:1305-1316 | rpfm_ui/src/diagnostics_ui/mod.rs:1328-1339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8d9d97e625e6ffddf435fec2a73c3fffb1c933e32920a86cdfc40bbed61734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:360-371 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:181-192 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4bdbc1711d1de832b261e16a2873be3c8a947f599f1d53bf003d907fa5852b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:391-402 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:209-220 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:391\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:390\u0060 calls \u0060set_single_shot\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.rs:208\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e251b61dc32cb95c7c96c81a997f5f934616fb3298396c98a84619cd96399e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:1045-1056 | rpfm_ui/src/tools/faction_painter/mod.rs:1111-1122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:1045\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5f7f4a1bd8355d91ffca239170bddeef93a72ddd8ecb789fe9cf8602750094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:721-732 | rpfm_ui/src/tools/mod.rs:1064-1075 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:721\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060\u0026HashMap\u003CString, String\u003E\u0060 in one and \u0060\u0026mut HashMap\u003CString, String\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6b3b2bc26b4ae98bdc8cc8f76f85119c8acba48a4f82004e757c4557729156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_ui/src/views/table/columns_popover/mod.rs:247-258 | rpfm_ui/src/views/table/columns_popover/mod.rs:415-426 \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":"rpfm_ui/src/views/table/columns_popover/mod.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4aba4f709af88bcb0087918f65a6deaee653ce9bcd616cf3be2fc2b0c73e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): rpfm_lib/src/files/esf/utils.rs:541-551 | rpfm_lib/src/files/esf/utils.rs:556-566 | rpfm_lib/src/files/esf/utils.rs:571-581 | rpfm_lib/src/files/esf/utils.rs:586-596 | rpfm_lib/src/files/esf/utils.rs:601-611 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/esf/utils.rs:541\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b302a8842efd3e85c898528be00320a28f8a66b5d44e05216ed0dd0f6dd871c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rpfm_extensions/src/diagnostics/anim_fragment_battle.rs:133-143 | rpfm_extensions/src/diagnostics/anim_fragment_battle.rs:153-163 | rpfm_extensions/src/diagnostics/anim_fragment_battle.rs:171-181 | rpfm_extensions/src/diagnostics/anim_fragment_battle.rs:189-199 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/diagnostics/anim_fragment_battle.rs:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/anim_fragment_battle.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b940f7937483ac330e9e98556ee1c33ef2bca03fb127985c435f4a5f71bacbae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rpfm_lib/src/games/supported_games.rs:560-570 | rpfm_lib/src/games/supported_games.rs:757-767 | rpfm_lib/src/games/supported_games.rs:1173-1183 | rpfm_lib/src/games/supported_games.rs:1992-2002 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:560\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5196afeff46c5cdc58c1c2a5f744d4b201ac220e2a358363951ebfd8b628d6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201311 lines \u00D7 12): rpfm_ui/src/app_ui/slots.rs:436-438 | rpfm_ui/src/app_ui/slots.rs:446-448 | rpfm_ui/src/app_ui/slots.rs:456-458 | rpfm_ui/src/global_search_ui/mod.rs:933-935 | rpfm_ui/src/global_search_ui/mod.rs:944-946 | rpfm_ui/src/global_search_ui/mod.rs:955-957 | rpfm_ui/src/references_ui/mod.rs:240-250 | rpfm_ui/src/views/table/mod.rs:3831-3841 | rpfm_ui/src/views/table/mod.rs:3953-3955 | rpfm_ui/src/views/table/mod.rs:3970-3972 | rpfm_ui/src/views/table/mod.rs:3989-3990 | rpfm_ui/src/views/table/mod.rs:4075-4085 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/views/table/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/references_ui/mod.rs:250\u0060 calls \u0060is_valid\u0060 and \u0060rpfm_ui/src/app_ui/slots.rs:438\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"04830f985bb9d139efd1bb1141bb6d6290f7181db29b32e238a35c86713579c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:2909-2920 | rpfm_extensions/src/dependencies/mod.rs:2949-2960 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:2909\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a94ae455195088bf871dc8455f100cf5ebd0800b9c1823875fa0fbf431257c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:3077-3087 | rpfm_extensions/src/dependencies/mod.rs:3379-3389 \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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3077}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f672edaf6ead68e3a6883bcae7a91f8b25ce3b5fcb29025a8ddc8d3b272484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_lib/src/binary/reader.rs:661-671 | rpfm_lib/src/binary/reader.rs:870-880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/binary/reader.rs:661\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/binary/reader.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c0698adfffae346a49c0cc0fd37918a1e25822acda68954f703d609ba76910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_lib/src/files/esf/utils.rs:359-369 | rpfm_lib/src/files/esf/utils.rs:405-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/esf/utils.rs:359\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbff79948226ef27e85518dcc2be01d5acb367e71544f908dec129a4225dd30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:808-818 | rpfm_server/src/ceo_builder.rs:1090-1100 \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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcb9455c1a91ee58f9ad90eeff086e9db0053590945554c782fa94475560c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:3319-3329 | rpfm_ui/src/app_ui/mod.rs:3355-3365 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f505a129a9459389ed824a1fde871d1f806cd8198e1a183c5a4044def31371c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/diagnostics_ui/mod.rs:1709-1719 | rpfm_ui/src/diagnostics_ui/mod.rs:1760-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1709\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"14688aabd87c8db03161ad6f9a9b5e165ebf571b6feb657ad1741a1e5ab50e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rpfm_ui/src/packedfile_views/bmd/slots.rs:43-62 | rpfm_ui/src/packedfile_views/text/slots.rs:48-67 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060view\u0060 to \u0060\u0026Arc\u003CFileBMDView\u003E\u0060 in one and \u0060\u0026Arc\u003CPackedFileTextView\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/bmd/slots.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baaabc0562267cc38f8fbfeda205f81cf7982490885bd09d966511df6109c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:2349-2359 | rpfm_ui/src/packfile_contents_ui/slots.rs:2391-2401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:2349\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ecd3d9d000bfd8865e0b9b2862871ed2b0d8f2de7742b56f21b335ac400049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 3): rpfm_ui/src/tools/faction_painter/mod.rs:953-956 | rpfm_ui/src/tools/faction_painter/mod.rs:1021-1031 | rpfm_ui/src/tools/faction_painter/mod.rs:1086-1096 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:953\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/tools/faction_painter/mod.rs:1021\u0060 calls \u0060par_iter\u0060 and \u0060rpfm_ui/src/tools/faction_painter/mod.rs:953\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab1fefe6b233bf6224f4f5635504b0fb5ff791ac1ac1473dd8e7d324182696f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:678-688 | rpfm_ui/src/tools/mod.rs:1042-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:678\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060\u0026HashMap\u003CString, String\u003E\u0060 in one and \u0060\u0026mut HashMap\u003CString, String\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/tools/mod.rs:1055\u0060 calls \u0060is_reference\u0060, \u0060Some\u0060 and \u0060rpfm_ui/src/tools/mod.rs:691\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b965ed6dfb4e2e5ca1536dfabca97c39a548017549ed29072dff954f5a48d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:816-826 | rpfm_ui/src/tools/mod.rs:1103-1113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:816\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"02259c13b216648b5cad7c21c7956bde267d24ffa4db6b79cbb586e6a20456a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:810-820 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:883-893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:810\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"122d309537c986ff6d9a1dc17fe81a3ac3d82ba06b1d098df284c26f7c6ef575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): rpfm_ui/src/views/table/columns_popover/mod.rs:225-235 | rpfm_ui/src/views/table/columns_popover/mod.rs:257-265 \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":"rpfm_ui/src/views/table/columns_popover/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ad678f19c58aa197473ff2cbbc72ec061a090c554781d84763200a6dbf167b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 13): rpfm_ui/src/app_ui/mod.rs:2212-2220 | rpfm_ui/src/app_ui/mod.rs:2236-2245 | rpfm_ui/src/app_ui/mod.rs:2262-2270 | rpfm_ui/src/app_ui/mod.rs:2286-2295 | rpfm_ui/src/app_ui/mod.rs:2386-2395 | rpfm_ui/src/app_ui/mod.rs:2417-2426 | rpfm_ui/src/app_ui/mod.rs:2468-2477 | rpfm_ui/src/app_ui/mod.rs:2493-2502 | rpfm_ui/src/app_ui/mod.rs:2517-2526 | rpfm_ui/src/app_ui/mod.rs:2543-2552 | rpfm_ui/src/app_ui/mod.rs:2602-2610 | rpfm_ui/src/app_ui/mod.rs:2624-2633 | rpfm_ui/src/app_ui/mod.rs:2650-2659 \u2014 all 13 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:2212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d50227395c8a5569eda5efea0a5a99c9db4fc5495d00b06ce3c5de53fc9105d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rpfm_extensions/src/gltf/mod.rs:271-280 | rpfm_extensions/src/gltf/mod.rs:306-315 | rpfm_extensions/src/gltf/mod.rs:340-349 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/gltf/mod.rs:271\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffa92267f7b8c4f6cec0cc750e5cad49428ba40c08ab76105d9a354d96bb889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 4): rpfm_lib/src/files/dat/mod.rs:173-182 | rpfm_lib/src/files/dat/mod.rs:186-195 | rpfm_lib/src/files/dat/mod.rs:199-208 | rpfm_lib/src/files/dat/mod.rs:209-214 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/dat/mod.rs:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/dat/mod.rs:186\u0060 calls \u0060read_u32\u0060 and \u0060rpfm_lib/src/files/dat/mod.rs:209\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/dat/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f55970eede12582021cafba1f021e04595939caa9e242dc3dd7ad19691f91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rpfm_ui/src/app_ui/mod.rs:645-654 | rpfm_ui/src/packfile_contents_ui/mod.rs:326-335 | rpfm_ui/src/packfile_contents_ui/mod.rs:359-368 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d990fa15a288452e0443ae316c323b0ed6f2b70436392fa5d2288d8bedd3a693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rpfm_ui/src/app_ui/mod.rs:3161-3171 | rpfm_ui/src/app_ui/mod.rs:3317-3327 | rpfm_ui/src/app_ui/mod.rs:3353-3363 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/app_ui/mod.rs:3315\u0060 calls \u0060from_q_string\u0060, \u0060qtr\u0060 and \u0060rpfm_ui/src/app_ui/mod.rs:3351\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ad947810955e10d8d3cb1352868dbe786fdab27a0bcd75ead54c857949d3dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): rpfm_ui/src/app_ui/slots.rs:314-322 | rpfm_ui/src/views/table/mod.rs:3248-3257 | rpfm_ui/src/views/table/utils.rs:515-523 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/views/table/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e634cdea63b2f0a079244665e69afa575ae6b47f4ee5e4a8f3ec4a1a16a922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rpfm_ui/src/app_ui/slots.rs:422-431 | rpfm_ui/src/diagnostics_ui/mod.rs:1235-1244 | rpfm_ui/src/global_search_ui/mod.rs:918-927 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/diagnostics_ui/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"c535d67169a4c61eae971535fe2129e303f364d3166b63f5d8a6ec365f9a435f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rpfm_ui/src/tools/translator/slots.rs:115-124 | rpfm_ui/src/tools/translator/slots.rs:136-145 | rpfm_ui/src/tools/translator/slots.rs:155-164 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/translator/slots.rs:115\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/slots.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c5186c6343191caa03778a75e09161c564b1318ae107c96de164101461affe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:3324-3333 | rpfm_extensions/src/dependencies/mod.rs:3429-3438 \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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63df8aea334a121f266c8e50d89ab16c4cc237a4a3c11cce2df1ddb9c632214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_extensions/src/gltf/mod.rs:166-175 | rpfm_extensions/src/gltf/mod.rs:380-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/gltf/mod.rs:166\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4de93b2a17cbeb741eb8bf048061187d464f80937e999e4849aeaf715972a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rpfm_extensions/src/search/mod.rs:422-436 | rpfm_extensions/src/search/mod.rs:599-613 \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":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d26dbc237ff1505cd289d9c23e2323369cd66b72ed728559cd2787bbfee98e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs:42-51 | rpfm_lib/src/files/bmd/playable_area/valid_location_flags/mod.rs:42-51 \u2014 before extracting anything, compare \u0060rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs\u0060 and \u0060rpfm_lib/src/files/bmd/playable_area/valid_location_flags/mod.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"47779e42f34bdaa6b8a1e25df298be25380ff0335066ff97acce527f939ad3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_lib/src/files/esf/utils.rs:336-345 | rpfm_lib/src/files/esf/utils.rs:511-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/esf/utils.rs:336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1e3b1f28e452886a38f5bd31ad886a20afc673def1169594bcb1c5fe8aa73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): rpfm_lib/src/files/mod.rs:2231-2270 | rpfm_lib/src/files/mod.rs:2294-2333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/mod.rs:2231\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"95803a68d08842dc48d3339097095fc26063057478e9430f704cff00541003c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:1141-1150 | rpfm_ui/src/app_ui/mod.rs:1181-1190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:1141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"86709e812e9a53a066628b8617b83c4dc204f0f65243c79ae51e69b2aeb615fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:1343-1352 | rpfm_ui/src/app_ui/mod.rs:1358-1367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:1343\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d947a2f040e4e7727351136a1db58e2639f300e3f13d0122722dfb6bb78f315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:2861-2867 | rpfm_ui/src/app_ui/mod.rs:2871-2880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:2861\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bee129bc28cb331076a91e6c275a94430238b80f5492c475d263cdcb4760eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rpfm_ui/src/packedfile_views/mod.rs:520-529 | rpfm_ui/src/packedfile_views/mod.rs:544-552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/mod.rs:520\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a379255bd293e363c893d6f942f0dfdf6b772daca5a6d6b077f8fe0db45f624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:477-486 | rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:489-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:477\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4dd2887be8c62f1195ff38f0f09ae99cdfd4dc544f057b1d214cf409f39eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:2403-2412 | rpfm_ui/src/packfile_contents_ui/slots.rs:2415-2425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:2403\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecd7ded93e645bbff6b1813f428ed47892bb6fbe1e13b4b1c8c4e4875fe8c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:679-688 | rpfm_ui/src/tools/faction_painter/mod.rs:805-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:679\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15cad4e002530a046d1fd29a29e07ae4dc84fe44b4a8b63d3c27594b1cf661a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:752-761 | rpfm_ui/src/tools/mod.rs:1079-1088 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:752\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7743d0232eb8de0aa16f47b2af8f9715a116e09492b9a5346bf38a0ee1725f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/tools/translator/mod.rs:1012-1021 | rpfm_ui/src/tools/translator/mod.rs:1024-1033 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/translator/mod.rs:1012\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"631bdd18522917c888088598ee5beea5ff2dfa1d4d4723bd3d98708be1d43e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): rpfm_ui/src/utils/mod.rs:189-196 | rpfm_ui/src/welcome_page_ui/mod.rs:152-161 \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":"rpfm_ui/src/utils/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33f3e427d2b82fc2eeab2f4c943178cb39eedae5bdb2f0e73da8fdc08de0ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:2645-2653 | rpfm_ui/src/views/table/mod.rs:2726-2735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:2655\u0060 calls \u0060push\u0060 and \u0060rpfm_ui/src/views/table/mod.rs:2735\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c185366a3d82d883bb4f1a6bf6ab51643efa801ec10ac7df7054693178d55a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 21): rpfm_ui/src/app_ui/mod.rs:2208-2214 | rpfm_ui/src/app_ui/mod.rs:2232-2238 | rpfm_ui/src/app_ui/mod.rs:2258-2264 | rpfm_ui/src/app_ui/mod.rs:2282-2288 | rpfm_ui/src/app_ui/mod.rs:2306-2314 | rpfm_ui/src/app_ui/mod.rs:2331-2339 | rpfm_ui/src/app_ui/mod.rs:2357-2363 | rpfm_ui/src/app_ui/mod.rs:2381-2388 | rpfm_ui/src/app_ui/mod.rs:2413-2419 | rpfm_ui/src/app_ui/mod.rs:2438-2446 | rpfm_ui/src/app_ui/mod.rs:2464-2470 | rpfm_ui/src/app_ui/mod.rs:2489-2495 | rpfm_ui/src/app_ui/mod.rs:2513-2519 | rpfm_ui/src/app_ui/mod.rs:2538-2545 | rpfm_ui/src/app_ui/mod.rs:2563-2571 | rpfm_ui/src/app_ui/mod.rs:2598-2604 | rpfm_ui/src/app_ui/mod.rs:2620-2626 | rpfm_ui/src/app_ui/mod.rs:2646-2652 | rpfm_ui/src/app_ui/mod.rs:2670-2677 | rpfm_ui/src/app_ui/mod.rs:2687-2694 | rpfm_ui/src/app_ui/mod.rs:2705-2712 \u2014 all 21 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:2306\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2862f947e259d87041a997947c903614610422e83f975809310d4ddc541816ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 8): rpfm_ui/src/diagnostics_ui/mod.rs:801-809 | rpfm_ui/src/diagnostics_ui/mod.rs:851-858 | rpfm_ui/src/diagnostics_ui/mod.rs:911-919 | rpfm_ui/src/diagnostics_ui/mod.rs:970-977 | rpfm_ui/src/diagnostics_ui/mod.rs:1022-1029 | rpfm_ui/src/diagnostics_ui/mod.rs:1075-1082 | rpfm_ui/src/diagnostics_ui/mod.rs:1124-1132 | rpfm_ui/src/diagnostics_ui/mod.rs:1170-1178 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:801\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd705ff4a27dc468b6db8c3f125399498e22697c24dd5fd697f7a849a37ef1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 8): rpfm_ui/src/global_search_ui/mod.rs:1311-1319 | rpfm_ui/src/global_search_ui/mod.rs:1395-1403 | rpfm_ui/src/global_search_ui/mod.rs:1530-1538 | rpfm_ui/src/global_search_ui/mod.rs:1669-1677 | rpfm_ui/src/global_search_ui/mod.rs:1755-1763 | rpfm_ui/src/global_search_ui/mod.rs:1838-1846 | rpfm_ui/src/global_search_ui/mod.rs:1958-1966 | rpfm_ui/src/global_search_ui/mod.rs:2035-2037 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:1311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/global_search_ui/mod.rs:1309\u0060 calls \u0060append_q_standard_item\u0060, \u0060new_item\u0060, \u0060into_ptr\u0060 and \u0060rpfm_ui/src/global_search_ui/mod.rs:1394\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcdf41bbb1b729afbe31e6908f0c770301a293230b9f3f38639673ab393317c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): rpfm_lib/src/games/supported_games.rs:834-842 | rpfm_lib/src/games/supported_games.rs:1338-1346 | rpfm_lib/src/games/supported_games.rs:1858-1866 | rpfm_lib/src/games/supported_games.rs:2135-2143 | rpfm_lib/src/games/supported_games.rs:2353-2361 | rpfm_lib/src/games/supported_games.rs:2561-2569 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:834\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd324d9e2b740f3f6fdc28548d619958a3e5a8aaef8b718762ca6027f23eb1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rpfm_lib/src/files/bmd/mod.rs:455-463 | rpfm_lib/src/files/bmd_vegetation/mod.rs:169-177 | rpfm_lib/src/files/hlsl_compiled/mod.rs:141-149 | rpfm_lib/src/files/tile_database/mod.rs:112-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/mod.rs:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd2988ec621efabb8785fe63ce4a6a2b8f714e5e067c68c9dc60681e643de84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rpfm_lib/src/games/supported_games.rs:2008-2016 | rpfm_lib/src/games/supported_games.rs:2278-2286 | rpfm_lib/src/games/supported_games.rs:2473-2481 | rpfm_lib/src/games/supported_games.rs:2676-2684 \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":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb17ca246ef2b06388360627bfd273d279bf2abe56e4a59120941910ee08c72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:108-116 | rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:135-143 | rpfm_ui/src/packedfile_views/unit_variant/slots.rs:104-112 | rpfm_ui/src/packedfile_views/unit_variant/slots.rs:131-139 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/slots.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 5 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060view\u0060 to \u0060\u0026Arc\u003CPortraitSettingsView\u003E\u0060 in one and \u0060\u0026Arc\u003CUnitVariantView\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a263f94e8e9b70af8000869cea358bdba7b582b79e3e32dbbcc2696bcd37a2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rpfm_lib/src/files/dat/mod.rs:241-249 | rpfm_lib/src/files/dat/mod.rs:253-261 | rpfm_lib/src/files/dat/mod.rs:265-273 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/dat/mod.rs:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/dat/mod.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"64308683876f10aee38bae7856928e9f8b15beaf8ca9ad43f687f6a2fd9bbf61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): rpfm_ui/src/app_ui/mod.rs:3331-3337 | rpfm_ui/src/app_ui/mod.rs:3373-3381 | rpfm_ui/src/views/table/mod.rs:2788-2794 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:3331\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0c7be93c557b29174549c086a72d181481b4d29f9fb72a1bf412987d1e4ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rpfm_ui/src/app_ui/slots.rs:1244-1252 | rpfm_ui/src/app_ui/slots.rs:1264-1272 | rpfm_ui/src/app_ui/slots.rs:1285-1293 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"940a68a74082df47c61af5a82ba90f9fa8297fa1748fb506b937b0f477c49405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rpfm_ui/src/packedfile_views/decoder/mod.rs:766-774 | rpfm_ui/src/packedfile_views/decoder/mod.rs:796-804 | rpfm_ui/src/packedfile_views/decoder/mod.rs:832-840 \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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f851487a7d97cc248041b224e7852a2911b7b2842ec12e7f62dbec858780b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rpfm_ui/src/tools/faction_painter/mod.rs:678-686 | rpfm_ui/src/tools/faction_painter/mod.rs:804-812 | rpfm_ui/src/tools/faction_painter/mod.rs:888-896 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:678\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e290b32dbace95ce1a61d51503182f5e7d95581683790dd68ccb92ce958a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:1263-1271 | rpfm_extensions/src/dependencies/mod.rs:1283-1291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1263\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0900d8c1cddc0ac7630c20d746be40e4b9b3d07a6d6ae363564952d525fa10ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:2648-2656 | rpfm_extensions/src/dependencies/mod.rs:2820-2828 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:2648\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"0def4372a2ecd5af708f3a325f38ff1daf4862183e6c082bb380e43fe6f396c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_extensions/src/diagnostics/table.rs:741-749 | rpfm_extensions/src/diagnostics/table.rs:796-804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/diagnostics/table.rs:741\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9878d930ec55bc5096f3c456f61d7d28fb02090d64b2fe912a7e56bc2d1657e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_extensions/src/merge/mod.rs:187-195 | rpfm_extensions/src/merge/mod.rs:205-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/merge/mod.rs:187\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/merge/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a4546e5ae3e4831a7a5d5260cde0dd60719310d49cf74d4fc8efa5f508b6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/files/rigidmodel/vertices/mod.rs:359-367 | rpfm_lib/src/files/rigidmodel/vertices/mod.rs:374-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/rigidmodel/vertices/mod.rs:359\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/vertices/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"269849f2f8735922cfbbb93ad62c51660dd7debb323ebfb5323b75491a1211da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/files/rigidmodel/vertices/mod.rs:547-555 | rpfm_lib/src/files/rigidmodel/vertices/mod.rs:560-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/rigidmodel/vertices/mod.rs:547\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/vertices/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b56edab65f1e3d87cbceffffde6b19e9d9372aeae2d66ad38d35cfc3552a4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:2459-2467 | rpfm_lib/src/games/supported_games.rs:2662-2670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:2459\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6f7401c87baae605b18fe201935d4fc2e42094fb830b54c8ae5a9c0001de38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:3043-3051 | rpfm_lib/src/games/supported_games.rs:3372-3380 \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":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"c839c5af2f8dc7bd6583554a6e57a286c445c5c1cd3cb22ac4a8ecb856c17093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/games/supported_games.rs:3358-3366 | rpfm_lib/src/games/supported_games.rs:3821-3829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:3358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"393023837adcf344769706f11c18556615b01db2bb58bdf79be032367725c0b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/integrations/assembly_kit/mod.rs:538-546 | rpfm_lib/src/integrations/assembly_kit/mod.rs:578-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/integrations/assembly_kit/mod.rs:538\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2130198b2921c193b3a8db5116e25a100403fb23a61f76b96b88fb800c1970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:1144-1152 | rpfm_ui/src/app_ui/mod.rs:1241-1249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:1144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe63c4792d27c341c7c92c034fb694955b353d59d8b646ad1c95bb243c182e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/global_search_ui/slots.rs:130-138 | rpfm_ui/src/global_search_ui/slots.rs:189-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/slots.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/slots.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b5e3881d51a6e237e51b3b28e46c039277508142bf74e4a5341fe9737cf061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:371-379 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:411-419 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd635275ca1c62b474a659533bfc939e0844fb5caf5d13ceb38475cb1adcece"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:462-470 | rpfm_ui/src/tools/translator/mod.rs:997-1005 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:462\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d0b21f7caf2d10bbc87548369c35a1bc245aab677218dc096bbd08dfdeab7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/views/table/columns_popover/mod.rs:199-209 | rpfm_ui/src/views/table/columns_popover/mod.rs:235-243 \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":"rpfm_ui/src/views/table/columns_popover/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c08551d2e42486ebdce59149ae8dd78f0fe2cf4505ec6bc0550ab6efdf84a4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 3): rpfm_ui/src/views/table/mod.rs:3821-3829 | rpfm_ui/src/views/table/mod.rs:3987-3989 | rpfm_ui/src/views/table/mod.rs:4065-4073 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:3821\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:3829\u0060 calls \u0060is_valid\u0060 and \u0060rpfm_ui/src/views/table/mod.rs:3989\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df6dbccb512ac5495c0d135de1df115afc039dfe53c004fb917ee41e636494a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20139 lines \u00D7 3): rpfm_ui/src/views/table/mod.rs:3844-3852 | rpfm_ui/src/views/table/mod.rs:3942-3943 | rpfm_ui/src/views/table/mod.rs:4088-4096 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:3844\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:3852\u0060 calls \u0060Some\u0060, \u0060get_packed_file_path\u0060 and \u0060rpfm_ui/src/views/table/mod.rs:3943\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca24f36117c0439002b175fe3da22a4533763126d7a8e596c3a0d26d9739eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): rpfm_lib/src/games/supported_games.rs:412-420 | rpfm_lib/src/games/supported_games.rs:611-619 | rpfm_lib/src/games/supported_games.rs:835-843 | rpfm_lib/src/games/supported_games.rs:1038-1046 | rpfm_lib/src/games/supported_games.rs:1339-1347 | rpfm_lib/src/games/supported_games.rs:1859-1867 | rpfm_lib/src/games/supported_games.rs:2136-2144 | rpfm_lib/src/games/supported_games.rs:2354-2362 | rpfm_lib/src/games/supported_games.rs:2562-2570 | rpfm_lib/src/games/supported_games.rs:2765-2773 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:412\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b51bac3fae7617d8708f426408e9d51121e44e0bbfd69c8116f0d6b88b9707d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 7): rpfm_lib/src/games/supported_games.rs:1061-1068 | rpfm_lib/src/games/supported_games.rs:1361-1367 | rpfm_lib/src/games/supported_games.rs:1881-1887 | rpfm_lib/src/games/supported_games.rs:2158-2164 | rpfm_lib/src/games/supported_games.rs:2376-2382 | rpfm_lib/src/games/supported_games.rs:2584-2590 | rpfm_lib/src/games/supported_games.rs:2787-2793 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:1061\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14e8fa040326475f17fe23f0102afd7492c969d842a974175cc32469817d0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): rpfm_lib/src/games/supported_games.rs:2460-2467 | rpfm_lib/src/games/supported_games.rs:2663-2670 | rpfm_lib/src/games/supported_games.rs:2856-2863 | rpfm_lib/src/games/supported_games.rs:3030-3037 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:2460\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a86154acecb641584a7282021c7a1ef3c0436600a537c63a4436a97c05f5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_extensions/src/dependencies/mod.rs:1251-1258 | rpfm_extensions/src/dependencies/mod.rs:1262-1269 | rpfm_extensions/src/dependencies/mod.rs:1282-1289 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1251\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"390d218def0b093a0d8ec5ebb383886a85adcaa8e84c931b35b218f1f8b35a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_extensions/src/optimizer/mod.rs:569-576 | rpfm_extensions/src/optimizer/mod.rs:583-590 | rpfm_extensions/src/optimizer/mod.rs:594-601 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/optimizer/mod.rs:569\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e904dd7ee6b7c5056e6125de960d7326b622c815039e3cf9d28b6997d83d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_lib/src/games/supported_games.rs:398-405 | rpfm_lib/src/games/supported_games.rs:595-603 | rpfm_lib/src/games/supported_games.rs:808-815 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:398\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb4a8e78f3e6b56a6caaa05954134dd9fb7c665dc7c73ee674d418a456eda1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_ui/src/app_ui/mod.rs:1144-1151 | rpfm_ui/src/app_ui/mod.rs:1184-1191 | rpfm_ui/src/app_ui/mod.rs:1241-1248 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d9326e185466d441b5eec23229e5412bd7edb4491a748c2896e8b46018ab7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_ui/src/packedfile_views/bmd/slots.rs:49-56 | rpfm_ui/src/packedfile_views/text/slots.rs:54-61 | rpfm_ui/src/packedfile_views/vmd/slots.rs:52-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/bmd/slots.rs:49\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060view\u0060 to \u0060\u0026Arc\u003CFileBMDView\u003E\u0060 in one and \u0060\u0026Arc\u003CPackedFileTextView\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/bmd/slots.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b7953441321aa00eb3d1d0479afddea6461e3fc4b397ba0bd6e47851be55b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rpfm_ui/src/tools/faction_painter/mod.rs:984-995 | rpfm_ui/src/tools/faction_painter/mod.rs:1049-1060 | rpfm_ui/src/tools/faction_painter/mod.rs:1115-1126 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:984\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1b8cf40a8edc5a978916c163523ca89529cfa6300e1f2b7215e2bb1372671d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:681-688 | rpfm_extensions/src/dependencies/mod.rs:692-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:681\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47e26cdb9d9ebf70b9a1bcd3129fecba5817a549fd7d1b636227e5dfc7b9fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_extensions/src/search/atlas.rs:107-114 | rpfm_extensions/src/search/portrait_settings.rs:211-218 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/search/atlas.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/atlas.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0914786e92300c1d2eaa9172fb3e1296772cd848a5c71ba88fba710eb55092f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_lib/src/files/bmd/battlefield_building_list/mod.rs:118-131 | rpfm_lib/src/files/bmd/prefab_instance_list/mod.rs:87-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/battlefield_building_list/mod.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/battlefield_building_list/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"329c1eb9c2d3806fd943e082bc9e4ee9cee808523b77a505403f8c88bba49132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_lib/src/files/sound_bank_database/mod.rs:497-504 | rpfm_lib/src/files/sound_events/mod.rs:338-345 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/sound_bank_database/mod.rs:497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_lib/src/files/sound_events/mod.rs:347\u0060 calls \u0060read_emp\u0060 and \u0060rpfm_lib/src/files/sound_bank_database/mod.rs:507\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aa892431acf82d97e3b5b1ecefb6b8e2e8ade5bb33537fd9a5ba1c02ecca47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_lib/src/integrations/assembly_kit/mod.rs:426-433 | rpfm_lib/src/integrations/assembly_kit/mod.rs:480-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/integrations/assembly_kit/mod.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe777359f25b5011bc06bc89a58c7e029962507053cd8b185a47118bca25a0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_lib/src/integrations/git.rs:223-230 | rpfm_lib/src/integrations/git.rs:320-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/integrations/git.rs:223\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c911993c6c12a45d2dff6f09dcd403a32bce6d390af9adbb2e35126e3800d3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 6): rpfm_ui/src/dependencies_ui/mod.rs:121-129 | rpfm_ui/src/packedfile_views/animpack/mod.rs:119-120 | rpfm_ui/src/packedfile_views/animpack/mod.rs:124-125 | rpfm_ui/src/packedfile_views/esf/mod.rs:116-117 | rpfm_ui/src/packedfile_views/packfile/mod.rs:114-115 | rpfm_ui/src/packfile_contents_ui/mod.rs:211-218 \u2014 there are 6 copies across 5 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 6 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/packfile_contents_ui/mod.rs:223\u0060 calls \u0060new_packed_file_treeview_safe\u0060, \u0060static_upcast\u0060 and \u0060rpfm_ui/src/dependencies_ui/mod.rs:134\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/dependencies_ui/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"677b013048f748f62f2036d34f4e657fd78ce7bc31dc3f1d8bfc6208dd431465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/global_search_ui/mod.rs:755-762 | rpfm_ui/src/global_search_ui/mod.rs:813-820 \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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"580d40c73580e462449f0f16ea6b84f6be3431b526d72eb9709d0c20ac5cfaa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rpfm_ui/src/packedfile_views/decoder/mod.rs:1122-1129 | rpfm_ui/src/packedfile_views/decoder/mod.rs:1213-1219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/decoder/mod.rs:1122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f683c0e942241351ddb378f2770d35a2cfd2dc276ebd4e2b97915ecc45f0aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esftree/mod.rs:245-253 | rpfm_ui/src/packedfile_views/esf/esftree/mod.rs:285-293 \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":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d847bd390414ddcfbe9a9e362df91c370b1486bb7ca78c8def1938584648077e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:198-205 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:171-178 \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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e617697cebf39139d1799451fc84b1b18f08197010a2a7c8923971cd79fbcc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:785-792 | rpfm_ui/src/tools/mod.rs:1092-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:785\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"8472101ae9f64046b0821560a830cdcd5d25823ecfbb7ade4a4b827bb2db3487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:786-793 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:867-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:786\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:865\u0060 calls \u0060set_current_text\u0060 and \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:784\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51d2b4c5fa762c598e4942311d7d76a457d187694038b0d1262278bb46ac20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/unit_editor/variant_unit_editor/slots.rs:82-89 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/slots.rs:103-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/slots.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/slots.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"962ce693e391ae70cb43d4360b1492df19e3bdde4e7632928b25eec6224424a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/views/table/filter/slots.rs:85-92 | rpfm_ui/src/views/table/filter/slots.rs:123-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/filter/slots.rs:85\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/filter/slots.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de8206b90125c57a28ae0dda16fe099712057b53643cbdeba4a3595d6326e38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:3542-3549 | rpfm_ui/src/views/table/mod.rs:3728-3735 \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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3542}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a616f01e94629fb15b1415904889657013fc524bb97a13dd4e92a7e5edc84c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:3776-3783 | rpfm_ui/src/views/table/mod.rs:3902-3909 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:3776\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3776}}}],"partialFingerprints":{"codehealthFindingId/v1":"5936a9b59a84f46c9c46e660cac3fa8dd6f9b58cc9c9bf64020f3d1c7f365fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/views/table/search/mod.rs:296-306 | rpfm_ui/src/views/table/search/mod.rs:322-332 \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":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4b5ac46dd414f986b2f063eff7d0683e2554c4203159ec3b790ad6a048ee9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 16): rpfm_ui/src/app_ui/mod.rs:2201-2207 | rpfm_ui/src/app_ui/mod.rs:2225-2231 | rpfm_ui/src/app_ui/mod.rs:2251-2257 | rpfm_ui/src/app_ui/mod.rs:2275-2281 | rpfm_ui/src/app_ui/mod.rs:2299-2305 | rpfm_ui/src/app_ui/mod.rs:2324-2330 | rpfm_ui/src/app_ui/mod.rs:2350-2356 | rpfm_ui/src/app_ui/mod.rs:2374-2380 | rpfm_ui/src/app_ui/mod.rs:2431-2437 | rpfm_ui/src/app_ui/mod.rs:2457-2463 | rpfm_ui/src/app_ui/mod.rs:2482-2488 | rpfm_ui/src/app_ui/mod.rs:2506-2512 | rpfm_ui/src/app_ui/mod.rs:2531-2537 | rpfm_ui/src/app_ui/mod.rs:2591-2597 | rpfm_ui/src/app_ui/mod.rs:2613-2619 | rpfm_ui/src/app_ui/mod.rs:2639-2645 \u2014 all 16 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:2201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d22f331cefdf9225244800c65dd92043d86137290bcf2a206b811ab2d8b8dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): rpfm_ui/src/diagnostics_ui/mod.rs:766-773 | rpfm_ui/src/diagnostics_ui/mod.rs:815-822 | rpfm_ui/src/diagnostics_ui/mod.rs:864-871 | rpfm_ui/src/diagnostics_ui/mod.rs:924-931 | rpfm_ui/src/diagnostics_ui/mod.rs:984-991 | rpfm_ui/src/diagnostics_ui/mod.rs:1036-1043 | rpfm_ui/src/diagnostics_ui/mod.rs:1089-1096 | rpfm_ui/src/diagnostics_ui/mod.rs:1138-1145 | rpfm_ui/src/global_search_ui/mod.rs:1373-1379 | rpfm_ui/src/global_search_ui/mod.rs:1732-1739 \u2014 there are 10 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 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42bd4a45bca47d2174254fe69b8e2921f69fef605a5afafc4cbb54b70e171be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): rpfm_extensions/src/gltf/mod.rs:177-184 | rpfm_extensions/src/gltf/mod.rs:195-201 | rpfm_extensions/src/gltf/mod.rs:212-218 | rpfm_extensions/src/gltf/mod.rs:229-235 | rpfm_extensions/src/gltf/mod.rs:246-252 | rpfm_extensions/src/gltf/mod.rs:263-269 | rpfm_extensions/src/gltf/mod.rs:280-304 | rpfm_extensions/src/gltf/mod.rs:315-321 | rpfm_extensions/src/gltf/mod.rs:332-338 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/gltf/mod.rs:177\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"396d1da45180aa4670e9f7b5934efc1cd38d798ce81d9b50fe1a3c98b5491265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): rpfm_ui/src/packedfile_views/mod.rs:567-573 | rpfm_ui/src/packedfile_views/mod.rs:577-583 | rpfm_ui/src/packedfile_views/mod.rs:599-606 | rpfm_ui/src/packedfile_views/mod.rs:624-630 | rpfm_ui/src/packedfile_views/mod.rs:675-681 | rpfm_ui/src/packedfile_views/mod.rs:706-712 | rpfm_ui/src/packedfile_views/mod.rs:716-722 | rpfm_ui/src/packedfile_views/mod.rs:726-732 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/mod.rs:567\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3693a07da3520a97b4229d6c456ba3d7cf5fe437bb0041fa3fd84998bde4d84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): rpfm_server/src/ceo_builder.rs:429-435 | rpfm_server/src/ceo_builder.rs:510-516 | rpfm_server/src/ceo_builder.rs:593-599 | rpfm_server/src/ceo_builder.rs:686-692 | rpfm_server/src/ceo_builder.rs:769-775 \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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1081a4efe9329c66fab5afbe06f6502aa4231057767a0fbcf2c357f564a7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 5): rpfm_ui/src/views/table/utils.rs:268-274 | rpfm_ui/src/views/table/utils.rs:283-289 | rpfm_ui/src/views/table/utils.rs:303-308 | rpfm_ui/src/views/table/utils.rs:318-323 | rpfm_ui/src/views/table/utils.rs:333-338 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/utils.rs:268\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f29d279e14a4c31ac37df19f8182b1fa1d2cd6567d0643ede31fb2a98933f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): rpfm_ui/src/app_ui/slots.rs:459-464 | rpfm_ui/src/references_ui/mod.rs:252-258 | rpfm_ui/src/views/table/mod.rs:3843-3849 | rpfm_ui/src/views/table/mod.rs:4087-4093 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/views/table/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:459\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4f2c60c0f8663bd30628ca5e2bf2e77f16b958d71397f4790e48493723263c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): rpfm_ui/src/packedfile_views/packfile_settings/mod.rs:94-101 | rpfm_ui/src/packedfile_views/packfile_settings/mod.rs:109-116 | rpfm_ui/src/packedfile_views/packfile_settings/mod.rs:125-132 | rpfm_ui/src/packedfile_views/packfile_settings/mod.rs:140-147 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/packfile_settings/mod.rs:94\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/packedfile_views/packfile_settings/mod.rs:92\u0060 calls \u0060set_word_wrap\u0060 and \u0060rpfm_ui/src/packedfile_views/packfile_settings/mod.rs:107\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/packfile_settings/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95f1fae3734777a6ab7c45defd4d6209206a0064aaf6b8cc5f1a587bc90ca89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:950-959 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:973-982 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:441-450 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:467-476 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:950\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"7331962084ca97db92f4c1a9ba9d124c8c8c67f4aa36b3848db821685fad3dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1019-1028 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1042-1051 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:496-505 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:520-529 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1019\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"8375834bf94c878d35c16d9da6a120ca1890cfd2514d423ed1c1d8d9615d3331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rpfm_extensions/src/search/mod.rs:1154-1160 | rpfm_extensions/src/search/mod.rs:1167-1173 | rpfm_extensions/src/search/mod.rs:1180-1186 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/search/mod.rs:1154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0980ae7252992ef320852df727cb81429fde221427f6d318373e952301e8913f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:47-53 | rpfm_lib/src/files/bmd/common/building_link/mod.rs:109-115 | rpfm_lib/src/files/bmd/common/flags/mod.rs:131-137 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:54\u0060 calls \u0060read_v4\u0060 and \u0060rpfm_lib/src/files/bmd/common/building_link/mod.rs:116\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc66d179a9667deef691586c7cea189500deb416f602b25dc35879b5bed861f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:55-61 | rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs:54-60 | rpfm_lib/src/files/bmd/toggleable_buildings_slot_list/mod.rs:44-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:62\u0060 calls \u0060read_v8\u0060, \u0060read_v9\u0060, \u0060read_v10\u0060 and \u0060rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs:61\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5c65b7d0f2dc01f6727281b4d4b1525677417c39c359126a7e15b8a90afda6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:527-533 | rpfm_extensions/src/dependencies/mod.rs:887-893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:527\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7a0b5460e0fa8c2a3aa10c9ad535b71dae4f99fcff6bb7c550da9bb44738d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:968-974 | rpfm_extensions/src/dependencies/mod.rs:980-986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:968\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f2eb66a9fcf482315e85405326441fa12524235ce6344cb29bccf886052ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:1313-1319 | rpfm_extensions/src/dependencies/mod.rs:1335-1341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1313\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1215d264e0a29d91eab837da38a5638f1fdac3f9635f89091304d1d445b4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_extensions/src/gltf/mod.rs:139-145 | rpfm_extensions/src/gltf/mod.rs:148-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"956efdf2d686c9fd4babd82ee2a323661255882aa1579638995184a55f273541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_extensions/src/merge/mod.rs:123-136 | rpfm_extensions/src/merge/mod.rs:155-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060baseline\u0060 to \u0060Option\u003C\u0026DB\u003E\u0060 in one and \u0060Option\u003C\u0026Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_extensions/src/merge/mod.rs:120\u0060 calls \u0060patches\u0060, \u0060clone\u0060, \u0060table_name\u0060 and \u0060rpfm_extensions/src/merge/mod.rs:153\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/merge/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e08e0ad83cd8c69c4a19512b6088607c7b45d94b2d4a7efe57db5fb7a052952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_extensions/src/search/table.rs:81-92 | rpfm_extensions/src/search/table.rs:99-110 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/table.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"87278a78932cbd450d1a9952b7348d476ab5c5342dde66fc30c8ec266b58619d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:65-71 | rpfm_lib/src/files/bmd/common/flags/mod.rs:149-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207b9270db67396dfc022d4813596136eddf0f4cb57fe5f0341a20cc348492e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_lib/src/files/esf/utils.rs:1011-1017 | rpfm_lib/src/files/esf/utils.rs:1021-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/esf/utils.rs:1011\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f897811418600a7e81a9f4a8acf89d2ce96a9365e25e1cb30452c977b3654e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_lib/src/files/mod.rs:2525-2531 | rpfm_lib/src/files/mod.rs:3014-3020 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/mod.rs:2525\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"4333e74488b05b69944424b901cc85d3f16ca8ca6039a8ef85dbaa3e2429c227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_lib/src/games/mod.rs:1468-1474 | rpfm_lib/src/games/mod.rs:1522-1528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"689c66781efb925f0c2720b0c5de60a634c8c43c28ad0e21084190930fc0e1d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_lib/src/integrations/assembly_kit/mod.rs:530-536 | rpfm_lib/src/integrations/assembly_kit/mod.rs:570-576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/integrations/assembly_kit/mod.rs:530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7701ec42c563210c8b102fab73d1ce8376f9dd0cfe9f72bf4a2090113e7146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rpfm_server/src/updater.rs:246-252 | rpfm_server/src/updater.rs:253-259 | rpfm_server/src/updater.rs:265-271 | rpfm_server/src/updater.rs:276-282 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/updater.rs:246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_server/src/updater.rs:259\u0060 calls \u0060Ok\u0060 and \u0060rpfm_server/src/updater.rs:252\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/updater.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"870a962605c06e970c85565fca178492fc3aa7a83808b2ebf6838dd119638b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:2556-2562 | rpfm_ui/src/app_ui/mod.rs:2575-2581 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d00c94530bf0c909eeaa444624d02e07dbd3d03dd1c93c43b5ee635b9001f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/diagnostics_ui/mod.rs:1946-1952 | rpfm_ui/src/diagnostics_ui/mod.rs:1983-1990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1946\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d96673046531b4e72ce10a4d4175dcadde2a56e7f0d99e2da49bbb492cea480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/global_search_ui/mod.rs:1049-1055 | rpfm_ui/src/global_search_ui/mod.rs:1150-1156 \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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b608901e982a87535b6c57e36ae4145c77522cd42c94ed064e5d8550ced256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/packedfile_views/mod.rs:614-620 | rpfm_ui/src/packedfile_views/mod.rs:665-671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/mod.rs:614\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0699a944264364259a5231f36254f1e88c912da6f0f2a1cf1a9e0fba160daaea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:312-318 | rpfm_ui/src/tools/faction_painter/mod.rs:321-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"19722f64274c3e533c2e913af50589c281e3d61beb0c2191fee005f87f8d32d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:960-967 | rpfm_ui/src/tools/faction_painter/mod.rs:1040-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:960\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c7b54409cdccdae5db374abf172d0b4b5b8783ea7f71cf6624db4d9a679a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:971-978 | rpfm_ui/src/tools/faction_painter/mod.rs:1106-1113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:971\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bbfda09ecb47ec200adf353517019b7949d0f177e837c2c1e6e6b3f28da44a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:1009-1038 | rpfm_ui/src/tools/faction_painter/mod.rs:1074-1103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:1009\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19dcbab06a4515f1472b219d29c6ed88608942a11964a8cee95c2a24fb136dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:706-712 | rpfm_ui/src/tools/mod.rs:825-831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:706\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b9859b074cc0ce49e5829dc4e43223b6ce589b834665e4142d6b6575efff8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/tools/unit_editor/mod.rs:683-689 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:654-660 \u2014 before extracting anything, compare \u0060rpfm_ui/src/tools/unit_editor/mod.rs\u0060 and \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 261 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/unit_editor/mod.rs:683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a0fd8e6a174a086aa88f068e0d06d54c8c76e203ca41a4964f2707d2152a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:1179-1185 | rpfm_ui/src/views/table/mod.rs:1245-1251 \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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e19024fab9d3ab7e432338d31a5020c9fc725f2191d27469786e9a6059c60f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): rpfm_lib/src/files/db/mod.rs:729-734 | rpfm_lib/src/files/db/mod.rs:874-879 | rpfm_lib/src/files/db/mod.rs:903-908 | rpfm_lib/src/files/db/mod.rs:957-962 | rpfm_lib/src/files/db/mod.rs:1022-1027 | rpfm_lib/src/files/db/mod.rs:1062-1067 | rpfm_lib/src/files/db/mod.rs:1139-1144 | rpfm_lib/src/files/db/mod.rs:1205-1210 | rpfm_lib/src/files/db/mod.rs:1287-1292 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:729\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/db/mod.rs:871\u0060 calls \u0060column_position_by_name\u0060, \u0060unwrap_or_default\u0060 and \u0060rpfm_lib/src/files/db/mod.rs:954\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"151622938b622cc881f7feb86ae2342c5cd1abd001cae5d9b2b55bd010faaba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): rpfm_lib/src/files/db/mod.rs:741-746 | rpfm_lib/src/files/db/mod.rs:801-806 | rpfm_lib/src/files/db/mod.rs:813-818 | rpfm_lib/src/files/db/mod.rs:838-843 | rpfm_lib/src/files/db/mod.rs:862-867 | rpfm_lib/src/files/db/mod.rs:915-920 | rpfm_lib/src/files/db/mod.rs:927-932 | rpfm_lib/src/files/db/mod.rs:984-989 | rpfm_lib/src/files/db/mod.rs:1193-1198 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:741\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe85e75439c0c08acc3365438f528fce7a0943240d99ddb6efde15730f486df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): rpfm_lib/src/games/supported_games.rs:380-387 | rpfm_lib/src/games/supported_games.rs:577-584 | rpfm_lib/src/games/supported_games.rs:774-781 | rpfm_lib/src/games/supported_games.rs:1190-1197 | rpfm_lib/src/games/supported_games.rs:1474-1481 | rpfm_lib/src/games/supported_games.rs:3838-3845 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"429d6613180bbb692b0fa89b23d29d8a108e75b7828ec71b04538f90dcaaf5c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): rpfm_extensions/src/search/mod.rs:643-648 | rpfm_extensions/src/search/mod.rs:705-710 | rpfm_extensions/src/search/mod.rs:725-730 | rpfm_extensions/src/search/mod.rs:780-785 | rpfm_extensions/src/search/mod.rs:800-805 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/search/mod.rs:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ce027e2d77a450cc5fab8fc61b49aee5e75de7dbfc6957525ce82e49ae6ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rpfm_extensions/src/dependencies/mod.rs:681-686 | rpfm_extensions/src/dependencies/mod.rs:692-697 | rpfm_extensions/src/dependencies/mod.rs:703-708 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:681\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"da26c5b372fd5641a2b001681c8044cd7f595001c7cd59aa56e87d1d6cfb539c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs:44-49 | rpfm_lib/src/files/bmd/playable_area/mod.rs:45-50 | rpfm_lib/src/files/bmd/terrain_stencil_triangle_list/terrain_stencil_triangle/mod.rs:44-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7e0758abcb9240cdd6dd3ab2b7bbfe6ec37dfaa90b3a557fb280c6d8ff8519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rpfm_lib/src/files/db/mod.rs:1217-1222 | rpfm_lib/src/files/db/mod.rs:1229-1234 | rpfm_lib/src/files/db/mod.rs:1241-1246 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:1217\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c3552d63bcff9dd81b046f5f3928d1999edb11016584e97df4e619571962f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rpfm_ui/src/app_ui/mod.rs:3373-3380 | rpfm_ui/src/views/table/mod.rs:2788-2793 | rpfm_ui/src/views/table/mod.rs:2831-2836 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:3373\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3373}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7a23f6f2eddad22168740fbea1578fb9f7f67fa848ffe2b6ccff64adc2e22d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 5): rpfm_ui/src/app_ui/mod.rs:3570-3575 | rpfm_ui/src/app_ui/mod.rs:3591-3592 | rpfm_ui/src/app_ui/mod.rs:3614-3619 | rpfm_ui/src/app_ui/mod.rs:3635-3636 | rpfm_ui/src/tools/ceo_builder/mod.rs:262-269 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:3570\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a52990114ee2328f64b76204e9820ac82a207cc379bec7de58c8e45047a5a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rpfm_ui/src/diagnostics_ui/mod.rs:1306-1311 | rpfm_ui/src/diagnostics_ui/mod.rs:1329-1334 | rpfm_ui/src/global_search_ui/mod.rs:1128-1133 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0948e904ed467ef4c99de8509bef1acd94635caa3b91acfe3d34c4e1a83ae91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rpfm_ui/src/diagnostics_ui/mod.rs:1701-1707 | rpfm_ui/src/diagnostics_ui/mod.rs:1752-1758 | rpfm_ui/src/views/table/mod.rs:4134-4140 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1701\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1708\u0060 calls \u0060is_null\u0060 and \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1760\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce6c04cff32221493eb1a650a86da201f91c2a8b6a270a1db72c6d3e3aff473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rpfm_ui/src/tools/faction_painter/mod.rs:304-309 | rpfm_ui/src/tools/faction_painter/mod.rs:312-317 | rpfm_ui/src/tools/faction_painter/mod.rs:321-326 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/faction_painter/mod.rs:304\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe351ecb0d04b08c9831fec150304ea25afd558f9f21c1df0f7afb08b41067a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 3): rpfm_extensions/src/dependencies/mod.rs:1022-1027 | rpfm_extensions/src/dependencies/mod.rs:1034-1039 | rpfm_extensions/src/dependencies/mod.rs:1046-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1022\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_extensions/src/dependencies/mod.rs:1022\u0060 calls \u0060dependencies\u0060, \u0060iter\u0060, \u0060for_each\u0060 and \u0060rpfm_extensions/src/dependencies/mod.rs:1046\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"db15427f84b19e3444fd14c2e741428860d4cb81d85a06425601f7da4a841fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:2542-2549 | rpfm_extensions/src/dependencies/mod.rs:2555-2562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:2542\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc1897d0da9ccca8162e1c77f38f8618487376e29d907fe8c64d37aa669d39d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:3308-3314 | rpfm_extensions/src/dependencies/mod.rs:3337-3343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_extensions/src/dependencies/mod.rs:3316\u0060 calls \u0060arg\u0060 and \u0060rpfm_extensions/src/dependencies/mod.rs:3345\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e734cbfaace23813a292bc6bf30b41f351342792aa65464c5850b996a8788871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_extensions/src/startpos/world/mod.rs:468-473 | rpfm_extensions/src/startpos/world/mod.rs:494-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/startpos/world/mod.rs:468\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0b9a5bae2bd8d8614ac50c7abc8a48f895cd9fb616f94c0e0ad5c269ba68eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rpfm_extensions/src/translator/mod.rs:394-403 | rpfm_extensions/src/translator/mod.rs:411-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/translator/mod.rs:394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa52bd0e52b156bbc0f841ff66ec76372a44a859daf70acb7b5f6ab94f6e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs:42-47 | rpfm_lib/src/files/bmd/zones_template_list/mod.rs:43-48 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b41fec44e344015d5f19ac8603059c001bd07b77e4bcb2665ef5309e924018b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs:71-76 | rpfm_lib/src/files/bmd/toggleable_buildings_slot_list/mod.rs:61-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/point_light_list/point_light/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27196f54c5fedc0fd4d5317b58da7e5482c6734add643f17d39d66f4a8907b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_lib/src/files/sound_bank_database/mod.rs:520-525 | rpfm_lib/src/files/sound_events/mod.rs:361-366 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/sound_bank_database/mod.rs:520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_lib/src/files/sound_events/mod.rs:368\u0060 calls \u0060write_emp\u0060 and \u0060rpfm_lib/src/files/sound_bank_database/mod.rs:528\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ee084937664e1ef19d1487b4d9bc74809deff9c2812f27310dd4f129d41b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_lib/src/files/table/mod.rs:676-681 | rpfm_lib/src/integrations/assembly_kit/table_data.rs:473-478 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_lib/src/files/table/mod.rs:682\u0060 calls \u0060ColourRGB\u0060, \u0060to_owned\u0060, \u0060StringU8\u0060 and \u0060rpfm_lib/src/integrations/assembly_kit/table_data.rs:479\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3672f0df69c5a124621c169560a4a76026d256d21319cb3294569838c54757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:2965-2971 | rpfm_ui/src/app_ui/mod.rs:3067-3074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:2965\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5214ccd4586d8740556d6d0d412513c009779f56eb8b9db258f1a1dea7550ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/diagnostics_ui/mod.rs:1292-1298 | rpfm_ui/src/diagnostics_ui/mod.rs:1320-1326 \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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19a7ff110787ed10e9ddb931d99ebcfdffd3faeb5b3ce1ef1d9734ed171df1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/global_search_ui/mod.rs:684-689 | rpfm_ui/src/global_search_ui/mod.rs:738-743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:684\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"100bb235258bfcd245e18f77fd752a476f938464ff319e2480182ed42274cb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/global_search_ui/mod.rs:1071-1079 | rpfm_ui/src/global_search_ui/mod.rs:1166-1174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/global_search_ui/mod.rs:1071\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ceb65721320776c47dd1c2b5fbb8a877e4d3c22cd16c85696fa0aa5567ba0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/packedfile_views/decoder/mod.rs:1344-1351 | rpfm_ui/src/packedfile_views/decoder/mod.rs:1600-1607 \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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a53c55e8e5566b226d01855fce8798cb97c1e1f7029e54d1256b70cdc3bb9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:208-213 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:385-391 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"897e4e0ede4c97422af6fc720beb3ed9d2ebf4395ab56aafb76ebc63c47de8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 6): rpfm_ui/src/packedfile_views/anim_fragment_battle/mod.rs:98-100 | rpfm_ui/src/packedfile_views/audio/mod.rs:66-68 | rpfm_ui/src/packedfile_views/group_formations/mod.rs:260-262 | rpfm_ui/src/packedfile_views/packfile/mod.rs:106-110 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:201-206 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:145-150 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/packedfile_views/audio/mod.rs:72\u0060 calls \u0060set_text\u0060, \u0060qtr\u0060 and \u0060rpfm_ui/src/packedfile_views/anim_fragment_battle/mod.rs:104\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/anim_fragment_battle/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e699f9660a2d050c25eea7fd0f751462de4a1b2ff442b089fc82b4ce46586e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:383-388 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:203-208 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:389\u0060 calls \u0060new_1a\u0060, \u0060as_ptr\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.rs:209\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91187ed24d99e5325a2e85be599679c45994e7c5491351f3d5e9ad67e07b5d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:74-86 | rpfm_ui/src/packedfile_views/unit_variant/slots.rs:70-82 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/slots.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 5 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060view\u0060 to \u0060\u0026Arc\u003CPortraitSettingsView\u003E\u0060 in one and \u0060\u0026Arc\u003CUnitVariantView\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7980887efce44f6a5c727860d9669df1ae17f647e5279a2ce4ac660f39a9895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:455-460 | rpfm_ui/src/tools/translator/mod.rs:990-995 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2d4c109a645d0b02d49e0778968cb4e73b2ee1857050e330c023ca380208db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/mod.rs:408-415 | rpfm_ui/src/tools/mod.rs:442-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/mod.rs:408\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfd41783d52d954ec736283358f1cca87a2a913e76f1a025b0658199d3aee47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): rpfm_ui/src/tools/unit_editor/mod.rs:564-566 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:413-418 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:706-711 \u2014 before extracting anything, compare \u0060rpfm_ui/src/tools/unit_editor/mod.rs\u0060 and \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 261 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bafd07fad3baa4a054235bfe88f93ccf2adb36ddffff6af1d2f2250dbb8c1c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 4): rpfm_ui/src/references_ui/mod.rs:262-262 | rpfm_ui/src/views/table/mod.rs:3854-3859 | rpfm_ui/src/views/table/mod.rs:3943-3946 | rpfm_ui/src/views/table/mod.rs:4098-4103 \u2014 before extracting anything, compare \u0060rpfm_ui/src/references_ui/mod.rs\u0060 and \u0060rpfm_ui/src/views/table/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:3854\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:3854\u0060 calls \u0060set_is_preview\u0060 and \u0060rpfm_ui/src/views/table/mod.rs:3943\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/references_ui/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49d44ba3b66dad1fcf77c7c1156489653a4cd81fcdf36a8898e034d292f6998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/views/table/utils.rs:637-642 | rpfm_ui/src/views/table/utils.rs:659-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/utils.rs:637\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9085a077028dc5ab1eeaa43a0af6eb81ba962983b300e5bd78b813565a8e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/views/table/utils.rs:650-656 | rpfm_ui/src/views/table/utils.rs:672-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/utils.rs:650\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc87b3f03441231095a18c85f9e9e3ce36848e85b82815201c218fa58f80aab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/welcome_page_ui/mod.rs:127-132 | rpfm_ui/src/welcome_page_ui/mod.rs:159-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/welcome_page_ui/mod.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/welcome_page_ui/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae32c04f4cd2f35e9cd789ed96bebfd9b5d6e7d350b0a8819385f636954403e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 22): rpfm_ui/src/app_ui/mod.rs:2204-2211 | rpfm_ui/src/app_ui/mod.rs:2228-2235 | rpfm_ui/src/app_ui/mod.rs:2254-2261 | rpfm_ui/src/app_ui/mod.rs:2278-2285 | rpfm_ui/src/app_ui/mod.rs:2302-2309 | rpfm_ui/src/app_ui/mod.rs:2327-2334 | rpfm_ui/src/app_ui/mod.rs:2353-2360 | rpfm_ui/src/app_ui/mod.rs:2377-2384 | rpfm_ui/src/app_ui/mod.rs:2409-2416 | rpfm_ui/src/app_ui/mod.rs:2434-2441 | rpfm_ui/src/app_ui/mod.rs:2460-2467 | rpfm_ui/src/app_ui/mod.rs:2485-2492 | rpfm_ui/src/app_ui/mod.rs:2509-2516 | rpfm_ui/src/app_ui/mod.rs:2534-2541 | rpfm_ui/src/app_ui/mod.rs:2559-2566 | rpfm_ui/src/app_ui/mod.rs:2578-2585 | rpfm_ui/src/app_ui/mod.rs:2594-2601 | rpfm_ui/src/app_ui/mod.rs:2616-2623 | rpfm_ui/src/app_ui/mod.rs:2642-2649 | rpfm_ui/src/app_ui/mod.rs:2666-2673 | rpfm_ui/src/app_ui/mod.rs:2683-2690 | rpfm_ui/src/app_ui/mod.rs:2701-2708 \u2014 all 22 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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0ae442f56525d752100acdeecf6b2619ae39dbae99304c38409de702f9f7a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): rpfm_lib/src/files/db/mod.rs:766-770 | rpfm_lib/src/files/db/mod.rs:778-782 | rpfm_lib/src/files/db/mod.rs:790-794 | rpfm_lib/src/files/db/mod.rs:851-855 | rpfm_lib/src/files/db/mod.rs:1011-1015 | rpfm_lib/src/files/db/mod.rs:1076-1080 | rpfm_lib/src/files/db/mod.rs:1089-1093 | rpfm_lib/src/files/db/mod.rs:1099-1103 | rpfm_lib/src/files/db/mod.rs:1115-1119 | rpfm_lib/src/files/db/mod.rs:1349-1353 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:766\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/db/mod.rs:1348\u0060 calls \u0060extend\u0060, \u0060data\u0060, \u0060iter\u0060 and \u0060rpfm_lib/src/files/db/mod.rs:1099\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"02375bb7e53e4205443e38ded480b4084415c2db4cfd61083ec91a6ebb6320d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): rpfm_lib/src/games/supported_games.rs:379-383 | rpfm_lib/src/games/supported_games.rs:576-580 | rpfm_lib/src/games/supported_games.rs:773-777 | rpfm_lib/src/games/supported_games.rs:992-996 | rpfm_lib/src/games/supported_games.rs:1189-1193 | rpfm_lib/src/games/supported_games.rs:1473-1477 | rpfm_lib/src/games/supported_games.rs:3837-3841 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:379\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c69b25eb1bccd80c5430492b037c2c95b2a1773729f553a004b5695e5ac456e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): rpfm_ui/src/global_search_ui/mod.rs:1302-1307 | rpfm_ui/src/global_search_ui/mod.rs:1386-1391 | rpfm_ui/src/global_search_ui/mod.rs:1521-1526 | rpfm_ui/src/global_search_ui/mod.rs:1660-1665 | rpfm_ui/src/global_search_ui/mod.rs:1746-1751 | rpfm_ui/src/global_search_ui/mod.rs:1829-1834 | rpfm_ui/src/global_search_ui/mod.rs:1949-1954 \u2014 all 7 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/global_search_ui/mod.rs:1309\u0060 calls \u0060append_q_standard_item\u0060, \u0060new_item\u0060, \u0060into_ptr\u0060 and \u0060rpfm_ui/src/global_search_ui/mod.rs:1393\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b67aa4da73d98e6feb5bf44b29b68f180fedc46e14ab134d5bf6ad87c37538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): rpfm_ui/src/settings_ui/mod.rs:383-387 | rpfm_ui/src/settings_ui/mod.rs:435-439 | rpfm_ui/src/settings_ui/mod.rs:472-476 | rpfm_ui/src/settings_ui/mod.rs:501-505 | rpfm_ui/src/settings_ui/mod.rs:517-521 | rpfm_ui/src/settings_ui/mod.rs:533-537 | rpfm_ui/src/settings_ui/mod.rs:559-563 \u2014 all 7 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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31213e8fbd61c626b18f03f9f9c2f18295ab5046abe13a119d6ab4ae1a2515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): rpfm_extensions/src/dependencies/mod.rs:527-531 | rpfm_extensions/src/dependencies/mod.rs:538-542 | rpfm_extensions/src/dependencies/mod.rs:738-742 | rpfm_extensions/src/dependencies/mod.rs:887-891 | rpfm_extensions/src/dependencies/mod.rs:968-972 | rpfm_extensions/src/dependencies/mod.rs:980-984 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:527\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_extensions/src/dependencies/mod.rs:546\u0060 calls \u0060bruteforce_loc_key_order\u0060, \u0060default\u0060, \u0060Some\u0060 and \u0060rpfm_extensions/src/dependencies/mod.rs:988\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c1d5d6dfd8c103d18c26e4f8f7340e604c9c5c8c14f4cbc6397399790cb80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): rpfm_extensions/src/search/mod.rs:642-647 | rpfm_extensions/src/search/mod.rs:704-709 | rpfm_extensions/src/search/mod.rs:724-729 | rpfm_extensions/src/search/mod.rs:745-750 | rpfm_extensions/src/search/mod.rs:779-784 | rpfm_extensions/src/search/mod.rs:799-804 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/search/mod.rs:642\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce485cf957fc9e47b0c7ef10dd13a9b488a546a5b48da6e563a232c6318a58c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): rpfm_ui/src/app_ui/slots.rs:439-443 | rpfm_ui/src/app_ui/slots.rs:449-453 | rpfm_ui/src/app_ui/slots.rs:459-463 | rpfm_ui/src/references_ui/mod.rs:252-256 | rpfm_ui/src/views/table/mod.rs:3843-3847 | rpfm_ui/src/views/table/mod.rs:4087-4091 \u2014 before extracting anything, compare \u0060rpfm_ui/src/app_ui/slots.rs\u0060 and \u0060rpfm_ui/src/views/table/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:439\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b061557929c48afb4ee5b5f193cb143cf97ea51499ab5994debd09ed78bab1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): rpfm_ui/src/global_search_ui/mod.rs:1233-1237 | rpfm_ui/src/global_search_ui/mod.rs:1378-1382 | rpfm_ui/src/global_search_ui/mod.rs:1461-1465 | rpfm_ui/src/global_search_ui/mod.rs:1595-1599 | rpfm_ui/src/global_search_ui/mod.rs:1738-1742 | rpfm_ui/src/global_search_ui/mod.rs:1904-1908 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/global_search_ui/mod.rs:1375\u0060 calls \u0060new_item\u0060 and \u0060rpfm_ui/src/global_search_ui/mod.rs:1229\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d48957901a13036cf9f4637656380f930789797a8bd4e3632341497a07d89c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:465-472 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:485-492 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:545-552 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:565-572 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:748-755 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd39ef8c32a083c4e9d50bdc6667a33ce7aee66bf0d6851d1a7ab5523478e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): rpfm_ui/src/views/table/slots.rs:343-348 | rpfm_ui/src/views/table/slots.rs:358-363 | rpfm_ui/src/views/table/slots.rs:395-399 | rpfm_ui/src/views/table/slots.rs:409-413 | rpfm_ui/src/views/table/slots.rs:533-538 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/slots.rs:343\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07ac9a7e11bb0179ed6b598a9c96c51107b83f5daf74302450085bf027bda88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rpfm_ui/src/diagnostics_ui/mod.rs:1307-1311 | rpfm_ui/src/diagnostics_ui/mod.rs:1330-1334 | rpfm_ui/src/diagnostics_ui/mod.rs:1362-1366 | rpfm_ui/src/global_search_ui/mod.rs:1129-1133 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/diagnostics_ui/mod.rs:1307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ae038901ad0914c358ed888bc082dfee5aac264657b73a6af9c536926e069f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): rpfm_lib/src/games/supported_games.rs:419-438 | rpfm_lib/src/games/supported_games.rs:618-637 | rpfm_lib/src/games/supported_games.rs:842-861 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:419\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e899cb39c7cac1b06557ee5fbe8919680acf96e79a82cf311c0e251486ce81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rpfm_ui/src/app_ui/mod.rs:1748-1753 | rpfm_ui/src/app_ui/mod.rs:1772-1777 | rpfm_ui/src/app_ui/mod.rs:1796-1801 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:1748\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"070577ebd09d4e675fe9169bab18793684e12476ab9fa8cce7e7341135adab55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:425-432 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:505-512 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:585-592 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d145353f44b8e8dd945a9d7d21035b6c31d49c145cfc9eceb78b51cde0483a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rpfm_ui/src/packedfile_views/notes/mod.rs:177-181 | rpfm_ui/src/views/table/mod.rs:3542-3546 | rpfm_ui/src/views/table/mod.rs:3728-3732 \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":"rpfm_ui/src/packedfile_views/notes/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"441d8367a2c95ec77fb0fce7fabd2ba6231d4831e4455292534966f00c11f4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rpfm_ui/src/tools/unit_editor/mod.rs:685-691 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:656-662 | rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs:728-734 \u2014 before extracting anything, compare \u0060rpfm_ui/src/tools/unit_editor/mod.rs\u0060 and \u0060rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 261 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaeb7b71bf980acb4bb57fa8bba92915725479d849f963b544e3b2ae998a555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:1307-1311 | rpfm_extensions/src/dependencies/mod.rs:1329-1333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91ca5aea99225cdb17074cb79ec1012076441c38dee0673ee2552e11170760f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:1873-1879 | rpfm_extensions/src/dependencies/mod.rs:1896-1902 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1873\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c521c64bd4b9a7ed602a84e8f01b865a42036970cc9305693d0fec0320aee24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_extensions/src/startpos/layout.rs:1271-1277 | rpfm_extensions/src/startpos/layout.rs:1300-1306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/startpos/layout.rs:1271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3ac9b375ab11941a47afe16ac9d9d65ff815505388c24903b369382ea83586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:60-64 | rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/mod.rs:64-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:59\u0060 calls \u0060read_v5\u0060 and \u0060rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/mod.rs:63\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea01b7ff5e345cc770b74faca43d82de0aaf492e8dfaee28d908ac5cd6098e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:79-83 | rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/mod.rs:82-86 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs:78\u0060 calls \u0060write_v5\u0060 and \u0060rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/mod.rs:81\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/particle_emitter_list/particle_emitter/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15a1c886bf535b131d866955b0a2c463d09e292aac36ee3d7b8deb5feb3c63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:2134-2138 | rpfm_ui/src/app_ui/slots.rs:369-375 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:2134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bfffedf0b9b05021e3e970d270309d8c211716cfdafbf55ebeb2defa3e55f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/decoder/mod.rs:414-419 | rpfm_ui/src/views/table/mod.rs:633-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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"55205ad818bdd6d73326501a22ca09f15a1fccd95ff77f2505ee936d199413ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:176-180 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:400-405 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"75af6418a8e8e55fc7be720ef24140ff09108f740a51f29c76c6d990094835e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:278-282 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:307-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:312\u0060 calls \u0060from_q_string_q_widget\u0060, \u0060from_std_str\u0060 and \u0060rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:283\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"385b4eeb77ff46f1b297b041bcb80ff2cbc387e6c84d1b3810a76a32117c35e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:297-301 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:334-338 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344dbd5ad5a6170271e63f4c71792ccca2349deb9aca75953f5e13d4cd496eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:525-532 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:605-612 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"08079063d9eb8a52d7b4739aefd5ffe5d38c0d1c93724bfe847ead0c0d47aa0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:625-632 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:645-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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0963c796cce76047756802eb39af2349f7f219a798bb4f5e7c84606670505caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:708-715 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:728-735 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"34531568e7d9987f31e57262d187506c53ec7543b0870bb1ef5796b6dba6595e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:894-906 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:389-401 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/mod.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 8 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:894\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d547dae2ae749bbc76817c267b04c99939d3acacf18734a72b7fa9374cd1583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/rigidmodel/mod.rs:213-217 | rpfm_ui/src/tools/translator/mod.rs:558-562 \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":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef9830579fca401371db45b54f7adb870b943e26a72aa375399b642331f61cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): rpfm_ui/src/packedfile_views/unit_variant/mod.rs:319-322 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:431-435 | rpfm_ui/src/packedfile_views/unit_variant/mod.rs:457-461 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5548597d3d90b33484cea2dc638397e3c5460d67a8d5b8b66974be9c3e58c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/settings_ui/mod.rs:1233-1238 | rpfm_ui/src/settings_ui/mod.rs:1309-1314 \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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd3a63a7a4d3bb077f2ba90f84eafe87b795dd0e6fb91bc4c17d3724b9ccf17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:1621-1628 | rpfm_ui/src/views/table/mod.rs:3456-3463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:3453\u0060 calls \u0060packfile_contents_tree_view\u0060, \u0060update_treeview\u0060, \u0060UpdateTooltip\u0060 and \u0060rpfm_ui/src/views/table/mod.rs:1617\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4859cea37ac17915cb73816f4ba2464142e3bb002567896fcdd474baba683c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:2507-2514 | rpfm_ui/src/views/table/mod.rs:2516-2523 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6126abeedfc775668a01848e830ca84d8a2bd5d548ef47bf80ae595e85347ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:2586-2590 | rpfm_ui/src/views/table/mod.rs:2599-2603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:2586\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e90518a516220cd46e53f9fce262bca9a47d2492fc139e773de1529d285dde3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/views/table/search/mod.rs:489-496 | rpfm_ui/src/views/table/search/mod.rs:561-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/search/mod.rs:489\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9c70eb10d410c11eaaed287846c8af218797a8407f2305e23a3e9709a235f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/views/table/utils.rs:353-359 | rpfm_ui/src/views/table/utils.rs:365-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/utils.rs:353\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"494f7469d4814c376dda30e11c5a15fa80fc317de53bd9254cf02699e841f124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui_common/src/icons/mod.rs:251-257 | rpfm_ui_common/src/icons/mod.rs:382-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui_common/src/icons/mod.rs:251\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb9cf43a7a829744a66bc464cd6e0dde6006ff1add7c0b9882d5f3d664854a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui_common/src/locale.rs:124-128 | rpfm_ui_common/src/locale.rs:137-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui_common/src/locale.rs:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/locale.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2243bcd433a26662d13faf0250a3db158792350b5ad603a23e87490d749edc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_lib/src/files/audio/mod.rs:105-118 | rpfm_lib/src/files/unknown/mod.rs:78-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/audio/mod.rs:105\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/audio/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf4501e142f02373c2aa718fbaa5e642381dc4a170258e573133a0fd3f5521f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rpfm_lib/src/files/bmd/ef_line_list/mod.rs:35-52 | rpfm_lib/src/files/bmd/lite_building_outlines/mod.rs:36-53 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ef_line_list/mod.rs:35\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ef_line_list/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"afff6a2e26c724168af8152abd2f54c160e8a6873998ba35117202c044fb51ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4): rpfm_lib/src/files/bmd/go_outlines/mod.rs:35-55 | rpfm_lib/src/files/bmd/non_terrain_outlines/mod.rs:35-55 | rpfm_lib/src/files/bmd/terrain_outlines/mod.rs:36-56 | rpfm_lib/src/files/bmd/water_outlines/mod.rs:35-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/go_outlines/mod.rs:35\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/go_outlines/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec371ebec817eee68beb98bdf428fe3fa07b821041cd4aca73ae4a88f46eacc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_lib/src/files/sound_bank/sections/hirc/object/actor_mixer/mod.rs:35-47 | rpfm_lib/src/files/sound_bank/sections/hirc/object/audio_bus/mod.rs:35-47 \u2014 \u0060rpfm_lib/src/files/sound_bank/sections/hirc/object/actor_mixer/mod.rs\u0060 and \u0060rpfm_lib/src/files/sound_bank/sections/hirc/object/audio_bus/mod.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 1 separate duplicated blocks between them, totalling at least 13 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":"rpfm_lib/src/files/sound_bank/sections/hirc/object/actor_mixer/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"107a5c5256f0865593263e03746dd352b714b587d989b6da239c0f56029063f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): rpfm_extensions/src/search/anim_fragment_battle.rs:538-548 | rpfm_extensions/src/search/atlas.rs:150-160 | rpfm_extensions/src/search/portrait_settings.rs:354-364 | rpfm_extensions/src/search/rigid_model.rs:380-390 | rpfm_extensions/src/search/unit_variant.rs:174-184 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060search_matches\u0060 to \u0060\u0026AnimFragmentBattleMatches\u0060 in one and \u0060\u0026AtlasMatches\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/anim_fragment_battle.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fab0ae95edc2a6f5d21aefe7f1df2d1da5205befc8235c43c7ec831d114e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): rpfm_extensions/src/search/anim_fragment_battle.rs:554-561 | rpfm_extensions/src/search/atlas.rs:166-173 | rpfm_extensions/src/search/portrait_settings.rs:370-377 | rpfm_extensions/src/search/rigid_model.rs:396-403 | rpfm_extensions/src/search/table.rs:151-158 | rpfm_extensions/src/search/unit_variant.rs:190-197 | rpfm_extensions/src/search/unknown.rs:113-120 \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 7 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/anim_fragment_battle.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c6af812dad1295193cabd48cafd6ee87cc3fa0a452d9fe4a545d61b0fbf887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_extensions/src/startpos/world/writer/sight.rs:290-295 | rpfm_extensions/src/startpos/writer/mod.rs:205-210 \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":"rpfm_extensions/src/startpos/world/writer/sight.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cefd6550ca60858d682d17747b9e019346bf037c387ee4f9143b085903c9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_lib/src/files/atlas/mod.rs:199-213 | rpfm_lib/src/files/loc/mod.rs:154-163 \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":"rpfm_lib/src/files/atlas/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12d84966ef62d94c1d10919ba8a6d056d07158cbe6d505de1ca54ec112b1351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs:56-65 | rpfm_lib/src/files/bmd/playable_area/valid_location_flags/mod.rs:56-65 \u2014 before extracting anything, compare \u0060rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs\u0060 and \u0060rpfm_lib/src/files/bmd/playable_area/valid_location_flags/mod.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dc92caf411721a9e7f4f97090b43bee7bc24d56cf8c3e55ee85b6efdf1a52b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_lib/src/files/bmd/particle_emitter_list/mod.rs:52-59 | rpfm_lib/src/files/bmd/prop_list/mod.rs:54-61 \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":"rpfm_lib/src/files/bmd/particle_emitter_list/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"35495e305a44e4e0670e010f16445c61f0905da010bd6f9bd66cd29c112c513c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:1129-1136 | rpfm_ui/src/tools/unit_editor/mod.rs:916-923 \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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"04676b8276812a64915a2a3ce4ca02fefaa2d13130533ea859f3768baaedce41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_lib/src/files/bmd/particle_emitter_list/mod.rs:43-49 | rpfm_lib/src/files/bmd/prop_list/mod.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":"rpfm_lib/src/files/bmd/particle_emitter_list/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"14beb925e3dc4ef7b339390326abe68b91c279806995b90ae22aa9de0024c98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rpfm_lib/src/files/bmd/mod.rs:636-653 | rpfm_lib/src/files/bmd/mod.rs:662-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/mod.rs:636\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/mod.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b643aa58f18a6a6be8a832b26cb3ffe9bd3132dfef93bdfcfee1691514b5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/app_ui/slots.rs:1228-1242 | rpfm_ui/src/app_ui/slots.rs:1254-1262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/app_ui/slots.rs:1251\u0060 calls \u0060show_dialog\u0060 and \u0060rpfm_ui/src/app_ui/slots.rs:1228\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbb8470ee40d618a26541b579755af40b6cbe89c99a9377e986331585ce0f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rpfm_ui/src/views/table/slots.rs:538-552 | rpfm_ui/src/views/table/slots.rs:636-648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/slots.rs:538\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ce775d3b4d9d644f4bbfe16b26fa61d4162a8d0d2a0195987f1587e0f59491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rpfm_ui/src/packfile_contents_ui/slots.rs:1278-1290 | rpfm_ui/src/packfile_contents_ui/slots.rs:1432-1443 | rpfm_ui/src/packfile_contents_ui/slots.rs:1514-1524 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:1278\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8527b696068b33748fa979f7453716f4ae00d02d1a734549fdbbf14793262d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:1400-1411 | rpfm_ui/src/packfile_contents_ui/slots.rs:1416-1427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:1400\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27e20c22adbc0354391d0484506674b33092c2d4966914da94541c1a704a771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:1909-1920 | rpfm_ui/src/packfile_contents_ui/slots.rs:1925-1932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:1909\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4132ff8ebb73defdefe856026613f61f5cf4e77e4596f99cfed231c7b672ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:1667-1677 | rpfm_ui/src/packfile_contents_ui/slots.rs:1690-1700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:1667\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a1fd091d21c21aa2b50aaaa0e1be5a2a78aff9593538a9a2def2d2e3de8de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:1110-1120 | rpfm_ui/src/packfile_contents_ui/slots.rs:1192-1202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:1110\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29c370daa15b2efc85c8e14b445b7cfdaa86603bed369c9dbdcc5b7c4ef0f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:303-313 | rpfm_ui/src/packfile_contents_ui/slots.rs:318-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:303\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7689160fdf1d2fa53ce5f85b63636b1c6a71f26db98a66749aa55c32a291f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:1645-1655 | rpfm_ui/src/packfile_contents_ui/slots.rs:1679-1688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:1645\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"0831aec1b4b2b34a2b8af1427d932e1211d510206b3bac0ec578707f8cba859a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/packfile_contents_ui/slots.rs:2202-2211 | rpfm_ui/src/packfile_contents_ui/slots.rs:2221-2230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packfile_contents_ui/slots.rs:2202\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1a0fc030384fde24cc9e4c2255812193d6fc7e6daf3f1555b8093a93a4d22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rpfm_ui/src/packedfile_views/decoder/slots.rs:267-276 | rpfm_ui/src/packedfile_views/decoder/slots.rs:308-317 | rpfm_ui/src/packedfile_views/decoder/slots.rs:342-351 | rpfm_ui/src/packedfile_views/decoder/slots.rs:383-392 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/decoder/slots.rs:267\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd799afc99c00730d3bb345e75adc589f72ebe3805509918d4332d5641360aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): rpfm_lib/src/games/supported_games.rs:259-267 | rpfm_lib/src/games/supported_games.rs:399-407 | rpfm_lib/src/games/supported_games.rs:596-605 | rpfm_lib/src/games/supported_games.rs:809-817 | rpfm_lib/src/games/supported_games.rs:2028-2036 | rpfm_lib/src/games/supported_games.rs:2298-2306 | rpfm_lib/src/games/supported_games.rs:2889-2897 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:259\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93062c0a8e35e1d1e6e02c5cd007f6481ba038192f8705259c9d9d5b8214869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/mod.rs:47-55 | rpfm_lib/src/files/tile_database/render_params/mod.rs:104-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/mod.rs:47\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1033b789ccbd77d11620ad0e509c4e428564132a739c12bf222382eddacebe01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rpfm_ui/src/tools/translator/slots.rs:99-107 | rpfm_ui/src/tools/translator/slots.rs:121-129 | rpfm_ui/src/tools/translator/slots.rs:142-150 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/translator/slots.rs:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/slots.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc00dd9a8c6e9450a777fbb30f2d457b80665d299f36afade18d17544fe814c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/schema/mod.rs:2285-2293 | rpfm_lib/src/schema/mod.rs:2313-2321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/schema/mod.rs:2285\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"187523687a52cf0cd12450e45cf8818ad6e16e0ff1980169ec9855954becf0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rpfm_lib/src/files/bmd/light_probe_list/light_probe/mod.rs:45-53 | rpfm_lib/src/files/bmd/toggleable_buildings_slot_list/toggleable_building_slot/building_link/mod.rs:44-52 | rpfm_lib/src/files/tile_database/climate/mod.rs:70-78 | rpfm_lib/src/files/tile_database/tile/mod.rs:95-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/light_probe_list/light_probe/mod.rs:45\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/light_probe_list/light_probe/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cdb85701e68a0293159a6021528d0175e0f1e0e33a2ae2294d5df788a3cc7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): rpfm_lib/src/games/supported_games.rs:261-268 | rpfm_lib/src/games/supported_games.rs:401-408 | rpfm_lib/src/games/supported_games.rs:598-606 | rpfm_lib/src/games/supported_games.rs:811-818 | rpfm_lib/src/games/supported_games.rs:1027-1034 | rpfm_lib/src/games/supported_games.rs:2030-2037 | rpfm_lib/src/games/supported_games.rs:2300-2307 | rpfm_lib/src/games/supported_games.rs:2891-2898 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/games/supported_games.rs:261\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a4d0b9e403d1ffadae2675057cfd2c19e01974cdb5dc6f12f1de82102133ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_lib/src/files/hlsl_compiled/mod.rs:165-173 | rpfm_lib/src/files/tile_database/mod.rs:136-143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/hlsl_compiled/mod.rs:165\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/hlsl_compiled/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f911db3f3334fb469b75e55aa336d40a2aa530acf187212322a4e0969d3f5d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 37): rpfm_lib/src/files/bmd/ai_hints/directed_points/mod.rs:40-48 | rpfm_lib/src/files/bmd/ai_hints/mod.rs:52-60 | rpfm_lib/src/files/bmd/ai_hints/polylines/mod.rs:43-51 | rpfm_lib/src/files/bmd/ai_hints/polylines_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/ai_hints/separators/mod.rs:43-51 | rpfm_lib/src/files/bmd/ai_hints/separators/separator/mod.rs:41-49 | rpfm_lib/src/files/bmd/battlefield_building_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/battlefield_building_list_far/mod.rs:40-48 | rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs:43-51 | rpfm_lib/src/files/bmd/bmd_catchment_area_list/mod.rs:42-50 | rpfm_lib/src/files/bmd/bmd_outline_list/mod.rs:40-48 | rpfm_lib/src/files/bmd/building_projectile_emitter_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/camera_zones/mod.rs:40-48 | rpfm_lib/src/files/bmd/common/building_reference/mod.rs:82-90 | rpfm_lib/src/files/bmd/composite_scene_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/custom_material_mesh_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/deployment_zone/deployment_region/boundary/mod.rs:41-49 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/deployment_zone/deployment_region/mod.rs:46-54 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/deployment_zone/mod.rs:43-51 | rpfm_lib/src/files/bmd/deployment_list/deployment_area/mod.rs:44-52 | rpfm_lib/src/files/bmd/deployment_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/grass_list_reference_list/mod.rs:40-48 | rpfm_lib/src/files/bmd/light_probe_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/particle_emitter_list/mod.rs:70-78 | rpfm_lib/src/files/bmd/playable_area/valid_location_flags/mod.rs:43-51 | rpfm_lib/src/files/bmd/point_light_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/prefab_instance_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/sound_shape_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/sound_shape_list/sound_shape/river_node/mod.rs:42-50 | rpfm_lib/src/files/bmd/spot_light_list/mod.rs:43-51 | rpfm_lib/src/files/bmd/terrain_decal_list/mod.rs:40-48 | rpfm_lib/src/files/bmd/terrain_stencil_blend_triangle_list/mod.rs:40-48 | rpfm_lib/src/files/bmd/terrain_stencil_triangle_list/mod.rs:43-51 | rpfm_lib/src/files/tile_database/conversion_params/mod.rs:78-86 | rpfm_lib/src/files/tile_database/tile_link/mod.rs:71-79 | rpfm_lib/src/files/tile_database/tile_link_target/mod.rs:56-64 | rpfm_lib/src/files/tile_database/tile_set/mod.rs:66-74 \u2014 before extracting anything, compare \u0060rpfm_lib/src/files/bmd/bmd_catchment_area_list/bmd_catchment_area/valid_location_flags/mod.rs\u0060 and \u0060rpfm_lib/src/files/bmd/playable_area/valid_location_flags/mod.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ai_hints/directed_points/mod.rs:40\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/directed_points/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"50596daa2463d45f2885e105fb7bbee249ce14b4235bd0dcde2344638ffe7eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rpfm_server/src/ceo_builder.rs:523-531 | rpfm_server/src/ceo_builder.rs:699-707 | rpfm_server/src/ceo_builder.rs:782-790 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:523\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"95767a02cb74e8dab92bc69f88e7f5f114faaba5e59d0963c7b994b657280d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/packedfile_views/decoder/slots.rs:468-476 | rpfm_ui/src/packedfile_views/decoder/slots.rs:497-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/decoder/slots.rs:468\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3700a3c94fad144912e7cf7a8937544b252cb47640970a383895f3dd6827bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): rpfm_ui/src/packedfile_views/decoder/slots.rs:235-243 | rpfm_ui/src/packedfile_views/decoder/slots.rs:269-277 | rpfm_ui/src/packedfile_views/decoder/slots.rs:310-318 | rpfm_ui/src/packedfile_views/decoder/slots.rs:344-352 | rpfm_ui/src/packedfile_views/decoder/slots.rs:385-393 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/decoder/slots.rs:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5c81eea023ccc5b1cf549424da290238b0a55b4621d459f1375787d2a837b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:3536-3544 | rpfm_ui/src/app_ui/mod.rs:3557-3565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/mod.rs:3536\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0890df5fd52407239c47cb6e27de0768a888f58ad3c0412bcd5d8a59cb2d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rpfm_lib/src/files/bmd/prop_list/mod.rs:72-80 | rpfm_lib/src/files/tile_database/tile_variation/mod.rs:78-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/prop_list/mod.rs:72\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/prop_list/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"548e3aeb134225ed0f0b3a33621e2b0e5193fb897fe54d3626ce0756f4471277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/tools/translator/mod.rs:496-503 | rpfm_ui/src/tools/translator/mod.rs:526-533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/tools/translator/mod.rs:496\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"390868e00d5ec5ed76679dd39cf77efa0de979f81124b49eb3b2af69f692def4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_ui/src/app_ui/slots.rs:1628-1635 | rpfm_ui/src/app_ui/slots.rs:1647-1654 | rpfm_ui/src/app_ui/slots.rs:1665-1672 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/app_ui/slots.rs:1628\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"432ce6093b27b09eecd9f1d042ea3c76e8082c75a1b9c194b599e8e062cd7a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/dependencies_ui/slots.rs:82-89 | rpfm_ui/src/dependencies_ui/slots.rs:94-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/dependencies_ui/slots.rs:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/dependencies_ui/slots.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98ce9c97f4ed93bd211f02b0da75fbf493e5f047c8988270053ca5a15c0b68c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_lib/src/files/hlsl_compiled/mod.rs:151-158 | rpfm_lib/src/files/tile_database/mod.rs:122-129 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/hlsl_compiled/mod.rs:151\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/hlsl_compiled/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"05348384a3f9f329154181e7b47c80a17be84112ccd9c0d195b5428563b1ab6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs:60-67 | rpfm_lib/src/files/bmd/zones_template_list/mod.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs:60\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines_list/hint_polyline/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"802ccb16b7d40f789bdda6e6118b4c8b8b886f5951ad77758e2db9a3b4c88c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs:62-69 | rpfm_lib/src/files/bmd/playable_area/mod.rs:63-70 | rpfm_lib/src/files/bmd/terrain_stencil_triangle_list/terrain_stencil_triangle/mod.rs:62-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/building_projectile_emitter_list/building_projectile_emitter/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f55bbcf6304967f5ae4990dd34a843fc77cb7201810f48eff80d8b94b1db595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:246-252 | rpfm_ui/src/packedfile_views/unit_variant/slots.rs:227-233 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/slots.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 5 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96b8310bf9784ae4944e0cf5a78e1c8aa59e503bc7ff51500df00bb896c1134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:70-76 | rpfm_lib/src/files/bmd/common/flags/mod.rs:154-160 | rpfm_lib/src/files/bmd/custom_material_mesh_list/custom_material_mesh/mod.rs:73-79 | rpfm_lib/src/files/bmd/tree_list_reference_list/mod.rs:62-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:70\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:68\u0060 calls \u0060write_v1\u0060 and \u0060rpfm_lib/src/files/bmd/custom_material_mesh_list/custom_material_mesh/mod.rs:71\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31ef91239e156f9a64fe03b3ced3d3aa8f535494f409ce3e3bfed0b0abfb03b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_lib/src/files/bmd/capture_location_set/mod.rs:101-107 | rpfm_lib/src/files/bmd/composite_scene_list/composite_scene_reference/mod.rs:76-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/capture_location_set/mod.rs:101\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5452b7150a84d73d2206e58362ea5b91311b51836f396fd0d030a4b3fbd3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:199-205 | rpfm_ui/src/packedfile_views/unit_variant/slots.rs:195-201 \u2014 \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/slots.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 5 separate duplicated blocks between them, totalling at least 102 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/packedfile_views/portrait_settings/slots.rs:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1fabb38c7fbb9376a930f0745f399e6074636b9e78d77180c40cc3650bc25b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:53-59 | rpfm_lib/src/files/bmd/common/flags/mod.rs:137-143 | rpfm_lib/src/files/bmd/custom_material_mesh_list/custom_material_mesh/mod.rs:57-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs:51\u0060 calls \u0060read_v1\u0060 and \u0060rpfm_lib/src/files/bmd/custom_material_mesh_list/custom_material_mesh/mod.rs:55\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/ai_hints/polylines/hint_polyline/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaf88082b75cdbe066e1d66916dc016c4261c06e46afd44aa25b859e8366bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:3082-3088 | rpfm_ui/src/app_ui/mod.rs:3309-3314 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3082}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5c1e8a6666bb4957c33aa98c40079bbe360979f4adcb43c725f68dba3806fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_telemetry/src/logger.rs:487-492 | rpfm_telemetry/src/logger.rs:508-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_telemetry/src/logger.rs:487\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_telemetry/src/logger.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a404defac1d40d4d617712ab659ff46f74fec63c34dc763869c4a63be5ea7167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rpfm_lib/src/files/db/mod.rs:1001-1006 | rpfm_lib/src/files/db/mod.rs:1130-1135 | rpfm_lib/src/files/db/mod.rs:1154-1159 | rpfm_lib/src/files/db/mod.rs:1168-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:1001\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_lib/src/files/db/mod.rs:1176\u0060 calls \u0060column_position_by_name\u0060, \u0060unwrap_or_default\u0060 and \u0060rpfm_lib/src/files/db/mod.rs:1010\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"0267ffd7037e444084556510b1afbabbdfa2abea263bbb96f209ae9ab7ab6b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:823-828 | rpfm_server/src/ceo_builder.rs:1126-1131 \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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"096710d3cdb4bc9b6b2ca4763d7ea6a0b6255b2f4c8dc476cc61af7f232b108e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rpfm_lib/src/files/db/mod.rs:886-891 | rpfm_lib/src/files/db/mod.rs:1176-1181 | rpfm_lib/src/files/db/mod.rs:1300-1305 | rpfm_lib/src/files/db/mod.rs:1331-1336 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:886\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_lib/src/files/db/mod.rs:883\u0060 calls \u0060column_position_by_name\u0060, \u0060unwrap_or_default\u0060 and \u0060rpfm_lib/src/files/db/mod.rs:1173\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"2419613d20a1da84593f0d2fd196c3026371987718c5a757c691a7e642ccef4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:299-304 | rpfm_server/src/ceo_builder.rs:1029-1034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_server/src/ceo_builder.rs:299\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d47d63ab94faef24b48a85a75ca8b5be37f68d55e918846981f38d4fc85f93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14): rpfm_lib/src/files/db/mod.rs:741-746 | rpfm_lib/src/files/db/mod.rs:753-758 | rpfm_lib/src/files/db/mod.rs:801-806 | rpfm_lib/src/files/db/mod.rs:813-818 | rpfm_lib/src/files/db/mod.rs:838-843 | rpfm_lib/src/files/db/mod.rs:862-867 | rpfm_lib/src/files/db/mod.rs:915-920 | rpfm_lib/src/files/db/mod.rs:927-932 | rpfm_lib/src/files/db/mod.rs:984-989 | rpfm_lib/src/files/db/mod.rs:1193-1198 | rpfm_lib/src/files/db/mod.rs:1217-1222 | rpfm_lib/src/files/db/mod.rs:1229-1234 | rpfm_lib/src/files/db/mod.rs:1241-1246 | rpfm_lib/src/files/db/mod.rs:1320-1325 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/db/mod.rs:741\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a9ac7f5ee9df9b87f9c71f6fbda75ffdb6ce7d3303f838435871a44e1468d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_lib/src/files/asset_variation_db/mod.rs:390-395 | rpfm_lib/src/files/asset_variation_db/mod.rs:501-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_lib/src/files/asset_variation_db/mod.rs:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/asset_variation_db/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ca9f39472b5ee412e98a97d5186254a2b4cb05fcc189ea1805312981c75c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_server/src/ceo_builder.rs:344-349 | rpfm_server/src/ceo_builder.rs:354-359 \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":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8581c22de797b13ab860d84c6de4342a7c4965c16f751f98fb663fb022c1cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/global_search_ui/mod.rs:492-497 | rpfm_ui/src/global_search_ui/mod.rs:515-520 \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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d2172a6e923e436e03b5a78250126bf084a19f1d339fb16b4db4110d7c07ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/welcome_page_ui/mod.rs:137-141 | rpfm_ui/src/welcome_page_ui/mod.rs:145-149 \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":"rpfm_ui/src/welcome_page_ui/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e6759c87373ab7932ea7297ba1bc05466cd6e16cb51b2afc338f40ab3d87be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/settings_ui/mod.rs:365-369 | rpfm_ui/src/settings_ui/mod.rs:559-563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/settings_ui/mod.rs:362\u0060 calls \u0060set_style_sheet\u0060, \u0060from_std_str\u0060, \u0060from_q_string_q_widget\u0060 and \u0060rpfm_ui/src/settings_ui/mod.rs:558\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bd21c8ceef88d20c4c74a06d0277228eb537118cfeba325f4380f5dec5c990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:3603-3607 | rpfm_ui/src/views/table/mod.rs:3740-3744 \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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a9fbe68371d55fd81125474e6c035c2ee7f315ccb6ed27f0fbc27dec0a6f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rpfm_extensions/src/dependencies/mod.rs:1068-1072 | rpfm_extensions/src/dependencies/mod.rs:1079-1083 | rpfm_extensions/src/dependencies/mod.rs:1090-1094 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:1068\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"3544b1479cebd84bcce2e4867068ab677b3dab28ec272710ddda814553157116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_extensions/src/dependencies/mod.rs:2200-2204 | rpfm_extensions/src/dependencies/mod.rs:2259-2263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_extensions/src/dependencies/mod.rs:2200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd54ce3f644cb0009cfcf7dab70bace0daffdb62fdbc3b9f93b50a83d58fce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rpfm_lib/src/files/table/mod.rs:730-743 | rpfm_lib/src/files/table/mod.rs:970-983 \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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee3dd9123b8721712812e3d47919dd7c7c42da5cffb252c670e54caa4dcb3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_lib/src/files/table/mod.rs:876-880 | rpfm_lib/src/files/table/mod.rs:895-899 \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":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feb2076a7305e5270eef083916a73180c04b567aa4fc83d82b0423d91e9e945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_lib/src/integrations/git.rs:306-310 | rpfm_lib/src/integrations/git.rs:377-381 \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":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c37d32ded957ae0a1b49dad2944d1dc06b674f91261c797007e74933c8e60bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_lib/src/schema/v4.rs:240-244 | rpfm_lib/src/schema/v4.rs:447-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/v4.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40e71d8efeec0e4f6934626bc75ed84733d0691714ffcc14f4fc4d18d2ddb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:3810-3827 | rpfm_ui/src/app_ui/mod.rs:3842-3859 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8afeae91ec0b2df0e8472830d9d9893612931f5a5cb5cb38606309618e786f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rpfm_ui/src/app_ui/mod.rs:4043-4050 | rpfm_ui/src/app_ui/mod.rs:4209-4216 \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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4043}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd43205bbf1ea448089d8eecc1f805ab7895b2cd74d005394ba9fca6c98b946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rpfm_ui/src/dependencies_ui/connections.rs:28-32 | rpfm_ui/src/packedfile_views/esf/connections.rs:28-32 | rpfm_ui/src/packfile_contents_ui/connections.rs:41-45 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060slots\u0060 to \u0060\u0026DependenciesUISlots\u0060 in one and \u0060\u0026PackedFileESFViewSlots\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/dependencies_ui/connections.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edaa74223d536bee04a06cfb2c85c1889d0041f9911fb477b7fa81622ef1932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rpfm_ui/src/dependencies_ui/mod.rs:114-118 | rpfm_ui/src/diagnostics_ui/mod.rs:249-253 | rpfm_ui/src/packfile_contents_ui/mod.rs:204-208 \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":"rpfm_ui/src/dependencies_ui/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b9f243c200e35bfef83074f1f43246f477cf01bb8cd5ed56b4de7fbc0211ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/decoder/mod.rs:364-368 | rpfm_ui/src/packedfile_views/video/mod.rs:109-113 \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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f98f74618d3c1b6f504138dd5d57536b4da35e5286022d1560b71d41573a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:665-669 | rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs:686-690 \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":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61d37b3098687d6d5b2d2843af88d6fc5dcc7c1c3c9cd469f553c3d89ec2d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/connections.rs:26-45 | rpfm_ui/src/packedfile_views/unit_variant/connections.rs:26-45 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060slots\u0060 to \u0060\u0026PortraitSettingsSlots\u0060 in one and \u0060\u0026UnitVariantSlots\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rpfm_ui/src/packedfile_views/portrait_settings/connections.rs:46\u0060 calls \u0060main_list_delete_filtered\u0060, \u0060triggered\u0060, \u0060connect\u0060 and \u0060rpfm_ui/src/packedfile_views/unit_variant/connections.rs:47\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/connections.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb8c211c3f4e92ccd8a98466e8938ceb9765d092c96378fed22294bf629abd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:943-952 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:966-975 \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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0a7b13793b38bb4b3fa90ff0f63cb4943a5ebe3e189d48843913c0e9d700b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1012-1021 | rpfm_ui/src/packedfile_views/portrait_settings/mod.rs:1035-1044 \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":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"27051ed874711ffa45c0b6d4fba4b131080686a3de958cdaa2721689cc3b6fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/packedfile_views/text/mod.rs:143-147 | rpfm_ui/src/packedfile_views/vmd/mod.rs:174-178 \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":"rpfm_ui/src/packedfile_views/text/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"779637e116c263587c51f03643ebf84353042acd00fbad5f884fe83bfa66dd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:697-702 | rpfm_ui/src/tools/faction_painter/mod.rs:819-824 \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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6d6857bccc882fba1ad66ef8f640a289cef9187c264860da3704409cd3d6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/tools/faction_painter/mod.rs:704-709 | rpfm_ui/src/tools/faction_painter/mod.rs:903-908 \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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"0228e088eb785568a5febfc02b5b4129c4523ae7c73f47b3609b77e304a935e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:2158-2162 | rpfm_ui/src/views/table/mod.rs:2181-2185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:2158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2075a369208e58dff33bb21584d9a160465db2f938a42649a3fc2253959ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:2633-2638 | rpfm_ui/src/views/table/mod.rs:2701-2706 \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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edade6af48b6d9cc1fbac49b6754503c717a8cdddf2b97bb2de2a6338a4beea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rpfm_ui/src/views/table/mod.rs:2689-2693 | rpfm_ui/src/views/table/mod.rs:2759-2763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/mod.rs:2689\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rpfm_ui/src/views/table/mod.rs:2687\u0060 calls \u0060row_count_0a\u0060 and \u0060rpfm_ui/src/views/table/mod.rs:2756\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3771abe26013193032b6013938505a2bf4682eae4aa61ee48f2a5d213618f6a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rpfm_ui/src/views/table/utils.rs:816-821 | rpfm_ui/src/views/table/utils.rs:842-847 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rpfm_ui/src/views/table/utils.rs:816\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"011619401bc36a77166392f6c3e002e83c63cbb08f4fe7f062b99b9cc022800c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rpfm_telemetry: rpfm_telemetry: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"951014dc8069497ef4c26f1becd8d7e2ac47be4ec86125cd8d8ac2a73b0282c4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rpfm_lib: rpfm_lib: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c6a9234c4b74b6ff0a0c85fbf058f62de63f7d0c15a26e9656542431b780a2aa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rpfm_extensions: rpfm_extensions: abstractness 0.02, instability 0.25, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80c0d11bab4f0f87806e413399205d0fcd649a2568dc09aad15b56219264c590"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Tool (LCOM4 15): Tool\u0027s methods fall into 15 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"667a4ed1dcd1cf8cd82c025a06aeead4d88da2c51ec817b0c44cfe8aa28de39c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ToolUnitEditor (LCOM4 10): ToolUnitEditor\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d3bc27199bd296c3b76e87c7314d6aec2ca2a612f44a2c5b69095d7e8351fa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ToolFactionPainter (LCOM4 6): ToolFactionPainter\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"343366ce243b2eb2e8f6777bef7fd6c06b00d829523a22e8a67fbe71823fcfbc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PackTranslation (LCOM4 5): PackTranslation\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0784893543b3d09ed13b6913a3954042caaa50578465d60e8704e78e6cf57b25"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AnimFragmentBattle (LCOM4 4): AnimFragmentBattle\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/anim_fragment_battle/mod.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"253a42e4542b4eddd710568383f14754a037156dfb269e9a4a04874c5a4d442f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TreeListReferenceList (LCOM4 4): TreeListReferenceList\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/tree_list_reference_list/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da23a317c6e9ac11a3d4db793413fc5dcf53c2bf4e976a5955abf944223610b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PortraitSettings (LCOM4 4): PortraitSettings\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/portrait_settings/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"073245a8f1837b69dedd02ed6733afe91c40e3f0dd8c6da06aef59fae19e8102"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Schema (LCOM4 4): Schema\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d81927aa7efad31e2d175c129b8900c964f23edfc2a1a1f84e30faa821e8988"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: evalexpr: \u0060evalexpr\u0060 13.1.0 is published on crates.io under \u0060AGPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"83ed91d7db2a427c92f37d0118fcaedbbb2ae32bc4efb765627a82e9b0e3285f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/packfile_contents_ui/slots.rs: rpfm_ui/src/packfile_contents_ui/slots.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 266 in PackFileContentsSlots::new at line 181. 1 of those changes was a fix/bug commit, and the other 15 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/packfile_contents_ui/slots.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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"42de657d37f26d1a397caa7eff42d40cf26f572661f5eb62f76ed84730992308"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/app_ui/mod.rs: rpfm_ui/src/app_ui/mod.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in AppUI::open_packedfile at line 2019. 5 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/app_ui/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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa5e610d970f6ae8cf4fa7ba7644e2ae62f7f397654f178b8bf17e47d336c94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/app_ui/slots.rs: rpfm_ui/src/app_ui/slots.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in AppUISlots::new at line 475. 2 of those changes were fix/bug commits, and the other 14 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/app_ui/slots.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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c49339195ad9aea898c586201b4f58b449916235e3f452f1645e5b7ba4882ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/views/table/slots.rs: rpfm_ui/src/views/table/slots.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in TableViewSlots::new at line 122. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/views/table/slots.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":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1b80f18d8aa8f175429e3cad15430d8375bbb91e794e006375e1565aac9fb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_extensions/src/dependencies/mod.rs: rpfm_extensions/src/dependencies/mod.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Dependencies::build_starpos_post at line 3376. 7 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_extensions/src/dependencies/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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2676001e611c96672010bdac3e9aa7e87233b1f2c082515d6fb734e9a90ce245"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/tools/translator/mod.rs: rpfm_ui/src/tools/translator/mod.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ToolTranslator::new at line 294. 1 of those changes was a fix/bug commit, and the other 14 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/tools/translator/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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e80590ce3a9077c49dfdbc988cd0df5208dde50a3fd23d2d20c2b56083e0543"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_lib/src/files/esf/utils.rs: rpfm_lib/src/files/esf/utils.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in ESF::save_node at line 675. 3 of those changes were fix/bug commits, and the other 4 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_lib/src/files/esf/utils.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":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f11df2384eb475ec4fabd275c1ce17270801c853af536ebf15080d6e27b7f07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/views/table/mod.rs: rpfm_ui/src/views/table/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in TableView::new_view at line 398. 4 of those changes were fix/bug commits, and the other 15 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/views/table/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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4085c75b23cef7be3710a1f5bf5840504a606aa561a3f4c5052a03e58b70681f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/diagnostics_ui/mod.rs: rpfm_ui/src/diagnostics_ui/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in DiagnosticsUI::open_match at line 1208. 1 of those changes was a fix/bug commit, and the other 6 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/diagnostics_ui/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":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f617f4c1152a587a441e453dfe729e18541f509e557635bfcb58adf25caa76ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/packedfile_views/mod.rs: rpfm_ui/src/packedfile_views/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in FileView::reload at line 502. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/packedfile_views/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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b49c84d6924593b40be2231e2b92c074818d535fac6d1679f95a12e2e550417"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_server/src/state/files.rs: rpfm_server/src/state/files.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SessionState::import_dependencies at line 789. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_server/src/state/files.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":"rpfm_server/src/state/files.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6318f0ce90228be1c8107bb4cf2089def84a65ab19b2321fe0a7fbd1223a73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/communications/mod.rs: rpfm_ui/src/communications/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rpfm_ui::communications::websocket_loop at line 385. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/communications/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":"rpfm_ui/src/communications/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32a320a6b77b919fbd6cdb5317c811eb97acd567224d3fc91dd591528005551"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_extensions/src/startpos/world/mod.rs: rpfm_extensions/src/startpos/world/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CampaignIndex::new at line 267. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_extensions/src/startpos/world/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":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8059c63f8bf946db9f40c84ad573a373e92989945d3463c8a9f07e2585967a2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ipc/src/settings.rs: rpfm_ipc/src/settings.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Settings::init at line 152. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ipc/src/settings.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":"rpfm_ipc/src/settings.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"83152895c3042036523f29dc80ec03f56928a38ff74890324e005d6e07172ee7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_extensions/src/diagnostics/mod.rs: rpfm_extensions/src/diagnostics/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in Diagnostics::check at line 314. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_extensions/src/diagnostics/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":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6854a51a9ddfaf0114d56375d8d2e6bad7726626e1521c9694ecb0fcc62071"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/global_search_ui/mod.rs: rpfm_ui/src/global_search_ui/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in GlobalSearchUI::load_anim_fragment_battle_matches_to_ui at line 1193. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/global_search_ui/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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5f03f977b97897e54d83a0de540f9d9f20dfd9cd167bf93d13b7f289e05c60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_server/src/server_websocket.rs: rpfm_server/src/server_websocket.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rpfm_server::server_websocket::handle_socket at line 108. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_server/src/server_websocket.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":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e525bbdb0b2bdb284c8a47a55bb35f627eb373c2e0c427b8d0c4f9df4a257d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_extensions/src/translator/mod.rs: rpfm_extensions/src/translator/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in PackTranslation::new at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_extensions/src/translator/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":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a70779a4ef4c98a04f515ed8a8ca0cd802456eab186198f550fe60f488efc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/ui/mod.rs: rpfm_ui/src/ui/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in UI::finish_online_init at line 215. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/ui/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":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d4ba95eb0db102bb3901d25522fe3079b5f165356355dc4ad73fa163ad33e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_lib/src/files/db/mod.rs: rpfm_lib/src/files/db/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in DB::cascade_edition at line 485. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_lib/src/files/db/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":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"2520ad038ba84581f4a14b59b13c93a823f4a01c8d2348cf4785732aa976df7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/settings_ui/mod.rs: rpfm_ui/src/settings_ui/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SettingsUI::new_with_parent at line 222. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/settings_ui/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":"rpfm_ui/src/settings_ui/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8babe9d3f66fa22a0ac1f424ebcfd02626c627cfbe7e141f31b2fd5f35a1ea1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_extensions/src/startpos/cai/managers.rs: rpfm_extensions/src/startpos/cai/managers.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ManagerContext::write_desire at line 394. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_extensions/src/startpos/cai/managers.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":"rpfm_extensions/src/startpos/cai/managers.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0538899db87f6387ca7bca3b2bc58535934f405c7fd7d379e53e6d9bb911d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_lib/src/files/esf/caab.rs: rpfm_lib/src/files/esf/caab.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ESF::read_caab at line 89. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_lib/src/files/esf/caab.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":"rpfm_lib/src/files/esf/caab.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb6f5a90a70488375f2357257e71c796bd92df0fcecec3b296f413c0dccc9b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/packedfile_views/group_formations/slots.rs: rpfm_ui/src/packedfile_views/group_formations/slots.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in GroupFormationsSlots::new at line 111. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/packedfile_views/group_formations/slots.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":"rpfm_ui/src/packedfile_views/group_formations/slots.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edf8a13466058b47edd7624226a9189dac5866ab82e2903c3715351c915aec3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_lib/src/files/esf/cbab.rs: rpfm_lib/src/files/esf/cbab.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ESF::save_cbab at line 211. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_lib/src/files/esf/cbab.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":"rpfm_lib/src/files/esf/cbab.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a474a5789f17a9299a06c18d23ddaadfc9abf51c8a3fb04680be42344ce895"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_extensions/src/startpos/world/diplomacy.rs: rpfm_extensions/src/startpos/world/diplomacy.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Diplomacy::new at line 119. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_extensions/src/startpos/world/diplomacy.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":"rpfm_extensions/src/startpos/world/diplomacy.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b8eb2a7fe0751f51df53f76e74c544898a0a5aaf481906dd8af2d92e105a18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_ui/src/settings_ui/slots.rs: rpfm_ui/src/settings_ui/slots.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SettingsUISlots::new at line 79. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_ui/src/settings_ui/slots.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":"rpfm_ui/src/settings_ui/slots.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2306ef687a7ff6b822c18edc06685c26e1ed7e04b21543d3a69a6698cfdd43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_lib/src/files/pack/pack_versions/pfh6.rs: rpfm_lib/src/files/pack/pack_versions/pfh6.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Pack::write_pfh6 at line 128. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_lib/src/files/pack/pack_versions/pfh6.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":"rpfm_lib/src/files/pack/pack_versions/pfh6.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98f265832e0a48f65c661dfc68f11fd3b38920fce01da79892bd765b7766e90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rpfm_lib/src/files/pack/pack_versions/pfh5.rs: rpfm_lib/src/files/pack/pack_versions/pfh5.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Pack::write_pfh5 at line 129. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 19:26:56 \u002B01:00\u0027 --until=\u00272026-10-28 19:26:56 \u002B01:00\u0027 --full-history --no-merges -- rpfm_lib/src/files/pack/pack_versions/pfh5.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":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c06be57822611fb490f23173f1a6cd134b68205d16a01d891b8215c7d754d09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: detect .bin files for maps and campaign. \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":"rpfm_ui_common/src/icons/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"32295348b77390f84a2d0c1f3c26302a3ad2c76d05b074b191ab818f095191ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is still very slow. We need some kind of range optimization. \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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6503646b3c87104ad9b334f973b06768329fa4571f9b597029f9b9ae5d18a755"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rework the enum system to work like lookups. \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":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34e9d9b0241c5e5a9bbcec7d544a7068a31c891857ed32a84bf652b6c46e570"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this work with multi-key columns. \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":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"02591e9c048e4fc925976fcc385fe022683e2d35768a8fcda957bb8ebd2072b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this check against the full key list, not just a subset. \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":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/slots.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7094dabd95bbaf875b14df02e1ae573bb01ea826074f4a75becd590cb8cc56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Old games need to overwrite the localisation.loc file instead of using a custom loc file. \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":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0039a46ae0a70854b0ceb62ab0c5fe617ce0e719412d984e89065e662fd1dec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move this to a tool var. \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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bb3c2c2a8e632ee92fdadc3cb435954203aa35df893a76d7ee7513c0d825a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change this so it\u0027s not done on EVERY SINGLE ROW. \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":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c48851477d0da9621594ed62408c4d013396cc02bcb569d09c5dc5a3e98356"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Validator to ensure than on multifile edit {x} is used as long as more than one file shares folder with another one. \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":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"751abb484dbbec74bb6103d90bf45626d8d8fda0106cbefe4131e534e00a9ca0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Filter out reserved files with some generic logic. \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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ad18f6fda3b8138780b4c1b70c03c6486765d0dd9e92eb94db20cd25dc878f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Filter out reserved files with some generic logic. \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":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f6ba24d622473ea1991913c1b6f86c5a6eab384505e7f65554aaf1aedb85af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move notes on this exact path to the new path. \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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d65ec049643c8c520a64cd80f7f06b9d7e2dc64d3c6cbcd41b27913f7be39d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move this out of here, as it can (and will) fail on broken jsons. \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":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfeac97a8a4141aacd56b591133b3d52d0fdf66f88e8b7985122ba6d5dffa98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: calculate a checksum of the file to also detect when it has gone back to its \u0022unmodified\u0022 state. \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":"rpfm_ui/src/packedfile_views/vmd/slots.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4d25a0649fa813e412e922a41f2c988d2eedea83bac204f87cefa6e2191690"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: calculate a checksum of the file to also detect when it has gone back to its \u0022unmodified\u0022 state. \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":"rpfm_ui/src/packedfile_views/text/slots.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cec0f905a9df3f49e3c9cbf6f2fac7256fe58d87cdf27253b01f514946ca178"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: calculate a checksum of the file to also detect when it has gone back to its \u0022unmodified\u0022 state. \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":"rpfm_ui/src/packedfile_views/bmd/slots.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4519ab8ada7629a11c4637c68467731da841c07434e63dad232bc2ff5da22c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check this returns the exact same ESF if there are no changes. \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":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e11279effc37480b1807b1a445f64348ad3d3beee21c6d680119ba02c8b49ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rework this into a backend call. No reason to do it in the view. \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":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85818d4fcb47e2a3656626b69b65bf52dbe7f8064a2644e23d09516d5327e27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: This needs heavy optimization. \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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ce91c1c0dda94a2cc003cb5e659224e32419dd77aa5fb18832e7b0487b008d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Investigate this, as it shouldn\u0027t happen. \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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df379b58b6f2bac9a481a3d8bb16bd1794bf484cb545d8c8390e887d7a14c53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Investigate this, as it shouldn\u0027t happen. \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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"566b0e1b16dea933174d6f13de77e36532fb3a10fb84fac32dc384239fbfd483"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Investigate this, as it shouldn\u0027t happen. \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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef6126bff78d500fe5ba6a6ceb364487269e3193fe8ab20435fd67d5e0320f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This may be slow on big moves. Fix it with a hashmap. \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":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6655a6be2f4b36947b68b8f01724988b1746f99c7d3681dd939bad42db8ccefb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0589ccc9aeaed143b83924633aba997aa748ba8cdb4061466aef3ba6325485"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: populate this with more types when the ui has them. \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":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83972b4c98834994c2886345b44914b28120a4273cf4a5909bf6e8c355248b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this fail in case of sentry being not working? \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":"rpfm_telemetry/src/logger.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d49c1ce3002429643a8600aae7678018a01166d54a46b1d2fdea34ee0dc627a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check this, it may have broken with the latest update. \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":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"a280ea0526416bbfdcb4534af5e2ad7ed498a1a548678a7e945d3b7a8dbe9e29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: detect bin files for maps and tile maps. \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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b83ad61fde2055c4b03cf4a67ec4a4ed695bf47de3ff8e2a1539915f9053f49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Unhardcode this version. \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":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71edcf0bfa577033b3a2f8361dee5151f4dd242cf1842939549dc18341d5f15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make tsv trait. \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":"rpfm_lib/src/files/table/local.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6218ba165f2558335f30d10fb8116b4932b8911d7d917e8f9c5108d5b66b9e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is supposedly hashed. Need to fix it with the fnv stuff. \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":"rpfm_lib/src/files/sound_bank/sections/bkhd/v136.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e98a53b3f10a67d44261d400bda0ac694589741ed2e62daea0eedea0db18e54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Finish it, as there are still fields I don\u0027t know what they are. \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":"rpfm_lib/src/files/portrait_settings/versions/v1.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfb60ef36e261f8d47ad6dad54af20b769af159ffcaf80f99d82a8db9f5ffa7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this more.... \u0060fluent\u0060. \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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6663ba167bc4ccc5394b20a016452ef8df726d11c636a2938501b3ca18135a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Move this to rpfm_extensions. \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":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"84479e2ee5949014115465936cdfe7c9ba7f6aba0ef675e9964726872faa4d4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Revise this. \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":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"80848e885c4651ae73d85b5ca5fc07988ade9cda811eb6acff668b8aa856ffba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add combined colour columns for testing. \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":"rpfm_lib/src/files/db/db_test.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8a8ed1045063def58fee7366751522c9a8572cc4f6e4acac2b7a671d0cf552"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: FIX THIS SHIT. It duplicates ALL DATA IN ALL TABLES CHECK. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c253b37d8579d1e508cd1e9f45291f12fb29de042e6e6bcf0ded914e6c6ebe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Possible wrong implementation. \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":"rpfm_lib/src/files/dat/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"028eb51d42e1daba9b4b4e80f759c9722d436de54f4dbcaa4c4352d0f6db160b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: USE GLB instead of faction specific as a fallback. \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":"rpfm_lib/src/files/cs2_parsed/cs2_parsed_test.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecb54866622ce00a9baa33611b9c3420ff026a23e3a0fae9e26ae29810b0dee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: calculate this based on the geometry of the model. \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":"rpfm_lib/src/files/cs2_parsed/cs2_parsed_test.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"86414717ddc569d04cc72406ded50649501d84d77cd7f4de2fda0b172202a169"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How the fuck do we get a 194 here?!!! It\u0027s supposed to be a boolean. \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":"rpfm_lib/src/files/bmd/point_light_list/point_light/v5.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d48359423d5125106cae9378fe672d5a98cbad220fbc8e89d3fd15afb11490"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How the fuck do we get a 194 here?!!! It\u0027s supposed to be a boolean. \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":"rpfm_lib/src/files/bmd/point_light_list/point_light/v6.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41a0d8aa1c20666c353e788e32d6d07c1fcfd6e1b48b7baf24d5322a8e1ac27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How the fuck do we get a 194 here?!!! It\u0027s supposed to be a boolean. \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":"rpfm_lib/src/files/bmd/point_light_list/point_light/v7.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd39c7aa4d9148483230069d59adee9ec9766deff93b522fb4e8a49f306fbaf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This is possibly not table_name, but skeleton_type, and skeleton_type is possibly skeleton_type_cinematic. \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":"rpfm_lib/src/files/anims_table/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"227791a50466db9f726bd9a6f10e6df402d1a06c81d90abc6d764b3e987502b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move this to the normal merge functions. \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":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed630bb901a1168e45a469025d40255cb44b71a349776f0365593f59df755df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make it so this also checks if the PackFile actually exists, \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":"rpfm_extensions/src/diagnostics/dependency.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b7fa1ffe89384480a70f2b95475aba0d6de4a2ad879c4677f0735a3c563ba1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check if we should split this so each pack is only affected by their own ignored files. \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":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7251a2bc00a075f06df05c7b986652e4c87c8f5fdd3e145c452754d95f1cee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: report missing loc data here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/table.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9232b217610b12672516398d33e6dccfe7e654ebca55eee3a9336036a46f6c"}},{"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. ADRs are expected here because \u0060rpfm_ui/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b12b70a29fdd62b508bf974997eff8ae3d36c23adc82b5345f233ae4ad2ba8"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060rpfm_lib\u0060 (64043 LoC, 431 module-visible types across 158 directories) overshoots its size bounds. 3 of 8 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 2.5/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d96618aa2177a62a641acd10ff9998435fc5560370a3bc3854e318787122a98"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060rpfm_ui\u0060 (50224 LoC, 181 module-visible types across 58 directories) overshoots its size bounds. 3 of 8 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 2.5/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"099bcd040957c99ed409fe68db0f13ded62606edda199f21aa0b3ab03a043e0a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060rpfm_extensions\u0060 (31395 LoC, 264 module-visible types across 15 directories) overshoots its size bounds. 3 of 8 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 2.5/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"690dadee110d7fd57f1e22d4bff865f60de2bc6556cc691ded94a491c2e887ef"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcbf4d779cf07f790c0d0ba1d8da6d961ac9b32e13838085730c606989c927a3"},"properties":{"commitSha":"d9c0a790a7506cc8d35fb2d0457c1720750612ef"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"263c254a743369452c40b41321f6b5eeea269cca5c2caf7c7db46a6a04960520"},"properties":{"commitSha":"1527304ba75faa737d212fc9664455112d3ffac5"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9487cc9f592b1ef566d9c12241351b9005753a6501fc8ace8c2cbae97b992a44"},"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":"b706ed2a27e8c0d5699d283d57dcca19c68d4a509c7d8f0db9d18a079df8b958"},"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":"88538f394b880fda487413e5eca1147e8f894fc21ca49d1b158d0083fc910f4e"},"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":"0bbe5dba1b91f40514f8827ab8fa601a5f2ef924ab77b91df20428f54458c3fe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74c522c3e5c61024a65597538a4e5da77f195f3780618b05d7a52c63440639e8"},"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":"a224565b7f7481ccd2f03f17dd7c78b06ed2d5ecc5cc8a62e81901357a6629e8"},"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":"b9430b6ad77be31cdc12d4297f1b973821b9e62941bf33865fb672d4b3cb4b97"},"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":"117fef6adb43010f42ba93d222485b9642b3e940ccb8e018b674a31dacc09d75"},"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":"38ca89a867a6303556c9e770c6230ec784b17ed83ab826bc123f413d2d4d1d3d"},"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":"91fe0c20a4b0a62b0755ca1bf37d9a36df3aa6a1476e6c5b0ea2a4fbd0cf75d9"},"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":"9bc6fece6fea79185555e02e6980eca7376ec4accc891a616bff223b360b8253"},"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":"7e18c70b5d00375ba1a367126ce13d0a89e47997974218e94d91e18e7c3b1c27"},"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":"ad3bebcb826b5c5cd4b26565e2f4e777c9cc0d04e0052453d3af4e1dcfa62aad"},"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":"533b9993eb1a069e8dfe7bec1c8a462370e59e117812f4b32d504f7ea277da44"},"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":"b923d2a6d4bf9f3d17a069114b8d29dce8e6bc49ce4ae2931de0efd9a515de40"},"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":"67bf8f011650fe8a50379f5798aca37ad37177e0a7b235bc97eb3dd53c62c434"},"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":"3b05ba515a0129218f03788d09f94768f02609db43e2061d6ce787be3145aa87"},"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":"f18331da58bfbd744b69dff53bd73edcbaff8db2d0c56f9c1b036d4b7083c8b7"},"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":"1e879dcf110227241e9011871c569b6776b65ab47bdbba928b8b07e0a0153128"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff4ab769af2e2a0f7eddc25b2871df10c7158d636f06e81405c70ef565a57597"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69888e3e51e1f404167d875e869d4607228b5ac37e4406c111f5b67130e23826"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ac27dd932e788f2be5a22d00593014a4ec285d4ac6bb9b385a9920b60398842"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a2407302b7c5fb42733b47fcd8a76186a612f869077b35afcc441ff3fcd48ad"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d74cfa515dcef3cc68d8bfc3354effb3ba9bf0b0bc33a7307743555e7bbd0a23"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","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":"a2f90f4b45d3755e157b6061c5da2ef37c46fa96f3a6665edcb7c9f45a7422c0"},"properties":{"dependency":{"package":"zip","version":"2.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429","RUSTSEC-2026-0545","RUSTSEC-2026-0548"],"severity":"critical","fixedVersion":"9.0.5","relation":"separate-copy","declaredRange":"^8","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"044cfe6f9021f80cadaa1e9914a118b5e17a4358af4e9b5deeffa1bc9d7081e9"},"properties":{"dependency":{"package":"zip","version":"8.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429","RUSTSEC-2026-0545","RUSTSEC-2026-0546","RUSTSEC-2026-0547","RUSTSEC-2026-0548"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"^8","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"b5308f9ed219ff7d361ed2b01ab7b5fa7a33b0013fcd35575e7068ccda1d2997"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0185","RUSTSEC-2026-0338","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"high","fixedVersion":"0.11.15","relation":"transitive","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":"e2cc0412d7d7d1687bafca8cd45b662d4bbd215f7e22b475fbad02fd994fc6d2"},"properties":{"dependency":{"package":"actix-http","version":"3.12.1","advisory":"RUSTSEC-2026-0446","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0447","RUSTSEC-2026-0448","RUSTSEC-2026-0455","RUSTSEC-2026-0552","RUSTSEC-2026-0553","RUSTSEC-2026-0554"],"severity":"medium","fixedVersion":"3.20.2","relation":"transitive","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":"71d284c2c3ef21070fb428fa814d2df2464ff71e41623904ac7b7f9e4eee0a88"},"properties":{"dependency":{"package":"actix-web","version":"4.13.0","advisory":"RUSTSEC-2026-0447","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0448"],"severity":"medium","fixedVersion":"4.18.2","relation":"transitive","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","severity":"medium","fixedVersion":"1.0.103","relation":"direct","declaredRange":"^1","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":"09aadcc6f21d12b1dc09249844a2aae646dbfe24d2ce9815fa31408b55cf97c8"},"properties":{"dependency":{"package":"chrono","version":"0.4.45","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"transitive","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","severity":"medium","fixedVersion":"0.9.20","relation":"transitive","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":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","severity":"medium","fixedVersion":"0.4.4","relation":"transitive","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":"9985e934bf5258966ba30771d636042c3373acbe5f9699173950198ff207d4c4"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0183","severity":"medium","fixedVersion":"0.21.0","relation":"direct","declaredRange":"^0.20","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":"1eae401a2a8770be38f5a54c3afe36fa4464ebe4004c5fb285ffaa2f1ae4d5b7"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0184","severity":"medium","fixedVersion":"0.21.0","relation":"direct","declaredRange":"^0.20","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]"],"severity":"medium","fixedVersion":"0.4.16","relation":"transitive","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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.37.0","advisory":"RUSTSEC-2026-0459","aliases":["BIT-sqlite-2026-119375","[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"severity":"medium","fixedVersion":"0.39.0","relation":"transitive","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":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","advisory":"RUSTSEC-2026-0418","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0544"],"severity":"medium","fixedVersion":"1.1.31","relation":"transitive","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":"705e8761c5e609601c0419d94a8bad1aeb6aee434f48ec4660c92e8bf534c9de"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","severity":"medium","relation":"transitive","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","severity":"medium","relation":"transitive","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.37.5","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"medium","fixedVersion":"0.41.0","relation":"transitive","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":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","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":"b0a650926c1446a30b78b4d0bd1ac0b14a584b7ecfe488180d3a51ffb3e8d361"},"properties":{"dependency":{"package":"rmcp","version":"3.1.0","advisory":"RUSTSEC-2026-0457","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0461","RUSTSEC-2026-0462"],"severity":"medium","fixedVersion":"3.7.0","relation":"direct","declaredRange":"^3","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":"eb06bf1a5b468562f27083e65fe030dcb536a61a73f48691bb193a4b1d691f8a"},"properties":{"dependency":{"package":"rtrb","version":"0.3.4","advisory":"RUSTSEC-2026-0274","severity":"medium","fixedVersion":"0.3.5","relation":"transitive","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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","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.40","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.45","relation":"transitive","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":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"0.103.16","relation":"transitive","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","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"^1","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":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.7","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","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":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","severity":"medium","relation":"transitive","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","severity":"medium","fixedVersion":"0.13.4","relation":"separate-copy","declaredRange":"^0","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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"],"severity":"medium","fixedVersion":"7.4.0","relation":"transitive","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","severity":"medium","fixedVersion":"2.1.2","relation":"transitive","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":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.15.0","advisory":"RUSTSEC-2026-0370","severity":"medium","relation":"transitive","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":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.0","advisory":"RUSTSEC-2026-0372","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: background_thread.rs \u2194 mod.rs: \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) and \u0060rpfm_ui/src/communications/mod.rs\u0060 (context rpfm_ui) sit in DIFFERENT parts of the tree yet change together 87% of the time (216 of the 249 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 216 shared commits counted here, the most recent 3 are \u0060a1204036\u0060 Moved the file operations of the Qt UI to the version 2 server API.; \u00607d601c5c\u0060 Moved the file info queries of the Qt UI to the version 2 server API.; \u00604816131b\u0060 Moved the file decoding and saving of the Qt UI views to the version \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/background_thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59279716cde265a9e69b48e99467242856348ded1f9dfe8a792cad966ca22cd"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: background_thread.rs \u2194 slots.rs: \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) and \u0060rpfm_ui/src/packedfile_views/rigidmodel/slots.rs\u0060 (context rpfm_ui) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060f5d01420\u0060 Expanded ui, and added some limited texture support for the gltf expo\u2026 (at that commit the file was still \u0060rpfm_ui/src/background_thread.rs\u0060); \u0060af2b324b\u0060 Migrated UI to use the new WIP rigidmodel editor. (at that commit the file was still \u0060rpfm_ui/src/background_thread.rs\u0060); \u0060ac145f2c\u0060 Fix warnings. (at that commit the file was still \u0060rpfm_ui/src/background_thread.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/background_thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"959577983f1a8ced2df4fa28b24bc7026fd823e7086b14981e47349ed5b58790"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: helpers.rs \u2194 background_thread.rs: \u0060rpfm_ipc/src/helpers.rs\u0060 (context rpfm_ipc) and \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) sit in DIFFERENT parts of the tree yet change together 57% of the time (12 of the 21 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060a1204036\u0060 Moved the file operations of the Qt UI to the version 2 server API.; \u006055fc1e0e\u0060 Moved the pack lifecycle of the Qt UI to the version 2 server API.; \u0060253a2a14\u0060 Moved the tools of the Qt UI to the version 2 server API. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c421c2910f21176c48c53166c768bccc7e473bf309480e6eb6b395ecd9281e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: background_thread.rs \u2194 connections.rs: \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) and \u0060rpfm_ui/src/app_ui/connections.rs\u0060 (context rpfm_ui) sit in DIFFERENT parts of the tree yet change together 55% of the time (41 of the 74 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 41 shared commits counted here, the most recent 3 are \u006097d443eb\u0060 Moved autosaving from the UI to the server, so it never makes the UI \u2026; \u00606f18f39c\u0060 Cleanup of the CEOs feature.; \u006092850793\u0060 Merge pull request #337 from Ironictw2st/ceos \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/background_thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9c210116d5be640bfef0ab51c39b01995b7c360c4905c149ae24bff6ed9b07"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: background_thread.rs \u2194 mod.rs: \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) and \u0060rpfm_ui/src/packedfile_views/packfile_settings/mod.rs\u0060 (context rpfm_ui) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006055fc1e0e\u0060 Moved the pack lifecycle of the Qt UI to the version 2 server API.; \u00601c4e5a14\u0060 Multicommit: - Fixed missing/misalinged text in Pack Settings View. -\u2026 (at that commit the file was still \u0060rpfm_ui/src/background_thread.rs\u0060); \u0060895c5c0c\u0060 Partially restored cascade edition functionality (missing loc support). (at that commit the file was still \u0060rpfm_ui/src/background_thread.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/background_thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f576e4bee3f3cc37a60d07fa22c6fabe38e93f1ec78e0563ad45fd6be8b8ef30"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: background_thread.rs \u2194 mod.rs: \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) and \u0060rpfm_ui/src/references_ui/mod.rs\u0060 (context rpfm_ui) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060c1614fb9\u0060 Moved the references of the Qt UI to the version 2 server API.; \u0060a228d0a3\u0060 Fixed a few more instances of stuff broken due to multipack support: \u2026; \u0060ace88fc9\u0060 Initial implementation for Copy/Cut/Paste/Duplicate operations. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/background_thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d11464d003a659c6803f6131b4cbda7683c6e086d35e910ba4d91c56345600"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: background_thread.rs \u2194 connections.rs: \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) and \u0060rpfm_ui/src/packfile_contents_ui/connections.rs\u0060 (context rpfm_ui) sit in DIFFERENT parts of the tree yet change together 54% of the time (25 of the 46 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are \u006064e4b8e2\u0060 Implemented pack encryption.; \u0060d1389177\u0060 Added experimental script processing.; \u006092850793\u0060 Merge pull request #337 from Ironictw2st/ceos \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/background_thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af60995685f850293d0795e3165cbce76e34837d4b245229cdae787d1d25c81"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: background_thread.rs \u2194 slots.rs: \u0060rpfm_server/src/background_thread.rs\u0060 (context rpfm_server) and \u0060rpfm_ui/src/packedfile_views/packfile/slots.rs\u0060 (context rpfm_ui) sit in DIFFERENT parts of the tree yet change together 52% of the time (14 of the 27 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060a1204036\u0060 Moved the file operations of the Qt UI to the version 2 server API.; \u0060ace88fc9\u0060 Initial implementation for Copy/Cut/Paste/Duplicate operations.; \u00607c409c5c\u0060 Restored Upload/Import Definition Patch. (at that commit the file was still \u0060rpfm_ui/src/background_thread.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/background_thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b06665e62446b5d8fa460ad74b06696200721c79b6c48069b7baec2ed659c72"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: connections.rs \u2194 tips.rs: \u0060rpfm_ui/src/app_ui/connections.rs\u0060 and \u0060rpfm_ui/src/app_ui/tips.rs\u0060 change together 75% of the time (9 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 9 shared commits counted here, the most recent 3 are \u0060ca568891\u0060 Implemented Import/Export All Open MyMod Actions.; \u00604432e81e\u0060 Make MyMod system multi-pack aware.; \u006053463625\u0060 Implemented Save PackFile for Release. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/connections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39025878778a9aae5760e4071329dd1178dfaee762f38ac85543888e2f6aec05"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: slots.rs \u2192 tips.rs, slots.rs, mod.rs: \u0060rpfm_ui/src/app_ui/slots.rs\u0060 changes together with 3 other files \u2014 \u0060rpfm_ui/src/app_ui/tips.rs\u0060, \u0060rpfm_ui/src/packedfile_views/packfile/slots.rs\u0060, \u0060rpfm_ui/src/welcome_page_ui/mod.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0911874f9d6f13d735c8a2a069bfc706488cb6d4b883ead6cf23ed531dfaec17"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 slots.rs: \u0060rpfm_ui/src/packedfile_views/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/rigidmodel/slots.rs\u0060 change together 75% of the time (9 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 9 shared commits counted here, the most recent 3 are \u0060af2b324b\u0060 Migrated UI to use the new WIP rigidmodel editor.; \u0060e414371f\u0060 Initial implementation of a RigidModel View, by Phazer.; \u00602daca1d1\u0060 Fixed a bug that caused certain crashes when renaming items in the tr\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5602835486075cb403164a540d4915f76e4f1b9b68dec85e104b57c9f53a2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 slots.rs: \u0060rpfm_ui/src/packedfile_views/table/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/text/slots.rs\u0060 change together 73% of the time (8 of the 11 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 8 shared commits counted here, the most recent 3 are \u0060726ea67c\u0060 Fix modified file markings not respecting the pack the files are in.; \u00602daca1d1\u0060 Fixed a bug that caused certain crashes when renaming items in the tr\u2026; \u00604a03bf35\u0060 Implemented the \u0060Is Modified\u0060 feature. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/table/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca8dfc82639a1ce1a2aea9f3092f396c1e722355bdbf85e8b754d9f794ac8e4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: reader.rs \u2194 writer.rs: \u0060rpfm_lib/src/binary/reader.rs\u0060 and \u0060rpfm_lib/src/binary/writer.rs\u0060 change together 60% of the time (6 of the 10 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 6 shared commits counted here, the most recent 3 are \u006013c0144b\u0060 Fixed ESF 24-bit integers being read and written as little-endian.; \u006082fbcdd1\u0060 Added some more binary helpers.; \u00602989ad55\u0060 Added additional readers and writers. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/binary/reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed5a84f5fcf9325d8f4bb8515975db8d5871bd82de22e197a401f9a6e6ef47e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 slots.rs: \u0060rpfm_ui/src/communications/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/rigidmodel/slots.rs\u0060 change together 58% of the time (7 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 7 shared commits counted here, the most recent 3 are \u0060f5d01420\u0060 Expanded ui, and added some limited texture support for the gltf expo\u2026; \u0060af2b324b\u0060 Migrated UI to use the new WIP rigidmodel editor.; \u0060ac145f2c\u0060 Fix warnings. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/communications/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc4ef293f80b72bb40abd2bd11b927d5452cd7d54dbc077ff6cb0cedfb606c5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 slots.rs: \u0060rpfm_ui/src/packedfile_views/mod.rs\u0060 and \u0060rpfm_ui/src/packedfile_views/packfile/slots.rs\u0060 change together 52% of the time (14 of the 27 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 14 shared commits counted here, the most recent 3 are \u006095f3bfd6\u0060 Re-implemented add from pack.; \u006075e04418\u0060 Replaced \u0022Add from Pack\u0022 feature with a \u0022Copy to Pack\u0022 feature using \u2026; \u0060ace88fc9\u0060 Initial implementation for Copy/Cut/Paste/Duplicate operations. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a1bd4dd6ffda9a88f53162534bf098b42bbc7abbd4d9a0a12749d55e1df01"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: connections.rs \u2194 mod.rs: \u0060rpfm_ui/src/app_ui/connections.rs\u0060 and \u0060rpfm_ui/src/welcome_page_ui/mod.rs\u0060 change together 50% of the time (5 of the 10 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 5 shared commits counted here, the most recent 3 are \u00605674df9b\u0060 Implemented split view.; \u0060032253ef\u0060 Fixed old re-entrancy CTD on open packs.; \u0060f48b4396\u0060 Implemented user feedback dialog. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/connections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"489da6f6547e39ac1a0812500df1e59f877bf22b82b6deb16835a95fa178d7a3"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23210b5d750bd0205a5f6cfbb557a9ada80bedbec1603a5f28f24bf8dafa2f39"},"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":"6b1273c81a1ca9b5eb097489b2567416912a145951451afeec807249ffa5e5b8"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.cta\u0060 moves (\u0060transition: background 150ms ease, border-color 150ms ease, color 150ms ease, transform 80ms 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":"website/style.css"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2603ae9e7989168f01d06087a2194b3cb239d01a615beb62227114c27f2b28c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.cta-split-toggle svg\u0060 moves (\u0060transition: transform 150ms 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":"website/style.css"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadecdcbfc37c48a70baea91f34e8c4eb83e055c0635b5d6f0c37a53c981ce6d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.feature\u0060 moves (\u0060transition: border-color 160ms ease, transform 160ms ease, background 160ms 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":"website/style.css"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68105aed4d2693d5aa2a607156391780e2f3af4b39c150278ebfbf98d4abe23"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Settings.read_from calls \u0060File::open\u0060: \u0060Settings.read_from\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f419bc6ea0592951df9000ec8df65c412e7a98159e626881c85727777d510017"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Settings.load_or_recover calls \u0060std::fs::copy\u0060: \u0060Settings.load_or_recover\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::copy\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4e888af2354e1ca3f2446cc0c32a9381d01e368f6cb8906d268bda8ce36baa"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Settings.load_or_recover calls \u0060std::fs::metadata\u0060: \u0060Settings.load_or_recover\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce20111f05dc1c234a634ec459ad670dd648357c806b250ee166ff6719950c43"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Settings.load_or_recover calls \u0060std::fs::copy\u0060: \u0060Settings.load_or_recover\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::copy\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbc9336f86ba34285943271d4b59ed1185816735c1cdc6b4bf85985e94d8e8a"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: settings.custom_config_path calls \u0060std::fs::read_to_string\u0060: \u0060settings.custom_config_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"17342e9562b27b53f04d248b48666d9d953f242f89aafc9ebb7181738e2f89c5"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: settings.init_config_path calls \u0060File::create\u0060: \u0060settings.init_config_path\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba00b37a63ed4cf62ebd9acc8a5d5cfc17c6b1b3716465590f4c986e99feee05"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060apply\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"750477a6dae29e6d6293e8f04dd5d1f550bd6807848013e613878bbfa12a527c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21063887eb98ab33ca28926d08df8038f942ea7f2cd2c36037a6c41d7aa7b5a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"a709bc43356f8556af1664656c563a83291d2a0c3061587c66075ffbb9615a91"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aab25bf1ab2b806135e25bb0de9d62e141e757e02b8c321129cb1dcda8f86a5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ac837b285e2e1a0dabf6997133677da29c14b1ab1ee471c8498ca28fbdda4b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b1a82cf50c6cb6b0a64bd7b47045e220319b2d0072904a568247dc09ed419"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48ef5312a2522f61c575794826808428153bbf1571f8d9aa1e5d88de590426b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"2126a884bb17abc8e36444d01852e3994c05c0ce1c5f91bda26adf12e20f7a40"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb6861c42b7b04699bde7f665eeee922702c466983d03e78c74a3a352b5532b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060replace\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad607ee5d02c929f9212ce80da64c13231990149cf7da07644b05a08719da41"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060apply\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91b9b647cdba2f9fa51e0dd8ef2ab382c460ec2d52ee56cb9e4e7c2a16d2b7c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060encode\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_collision/mod.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3470a25d742408235a4d8aaf687d6ae4cfcf352bafe568cc36117d4acea9d1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060encode\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/cs2_parsed/mod.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"0883bfd9e2f08aa0e513c699c3e2b9e14c5b34d0687e4222549874168853f70d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060table_name_without_tables\u0060 does real work, but one of its branches is \u0060panic!\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/db/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8054ff6299e41e143335acf056deeb2f49b87d9c543300698a27faca9307c6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060save_node\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"472e71d367ab805b7321cd3c9c7932dc868a1b2fef44bfbc270761c043273b91"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060from\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f87d2afd15913b41122a1ec94bd452d0e0d344049fff4e67a13f67ec4e42c18"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060encode\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/portrait_settings/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c4937505dc2bfa0dd6a08edd87ce7a30f6d7c897e41b8d578c7cf0e4531d83"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060read_rs_river\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/rs_river.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"984907efe40ee75d0f81022480e33a99e1c0f3bdbc26c89c16022e8b35c8096f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060write_rs_river\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/rs_river.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"199e7f18e231cecabec2cefba2edee3844b81d93ea5ef1630b6a2e1ccb6fca36"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060read\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank/common/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc72298ad52ce753b18df5a2a3fae49e0ce80791fb0b044e93f11f5b004e394"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060read\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank/common/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"248bf1929fc2778bb4012b751b17b7e33a494b293d947d75dc12abeb2864554b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060read\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank/common/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e0fb37702ecffc177df5597fd7e8b626c84cf7387918aeda22ba38d246deed"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060write\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank/common/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0e293873556d12a1c65343cbccd77dfa3847994c981bf72ef1b0cfe33fb231"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060write\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank/common/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba19b32eab42a91296e053d24ba874566d8bc295e17a11706725c0260518823"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060write\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank/common/mod.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3639968671ac790e3b9922ae17c687cf7d7d402aa400f3e13fec6c0c500319e3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060decode_field_postprocess\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae8e2056a7b39f34dc54f96debc5431b7b63394ab82c90a2667fd870e634614"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060decode_field_postprocess\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"960fd50e32299d670549d75cadbb1aa1c54184bef125508e0ee270902ba2945c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060decode_field_postprocess\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/mod.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"088b1b64b15042df6ccf06d5318dc72afb848c8075b4c5aafa10c76b87b0cd10"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060decode\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b83013878a3fba33a1f5f7e3eed8a61681944ba0f58ccce19a99ac56e42883"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060encode\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63d05f30e153e64ab18689a9cb1e039bd876845d27fa99073e97680bfb24ab5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060encode\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad07541b603a5a5c3e020a5bbd1a0fa9a290cf0342dfadf3a6ff25a0bde5137"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060to_table\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"d503bd2558ebb6b60fdf05ec60f855f0281db8c8f064c5eeee73dc7a7d573e88"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060from\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4f6e0177684767fec5021a07c0a8046da9d907b38bbb89a9b63b07a2066989"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060closest_valid_char_byte\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/utils.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf04def4067eb89e88299a386106ca3e6a44816657b05227c9595acd841bd0a1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060notify\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/jobs.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afd1445d638600c4ec0bd1bb93b7b56a5f107c965933285f51715258f80fd9a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060build_open_mymod_submenus\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2ab54525a6c71198934bd1af45d063ba6d655aaeff914dbc52fe754a933e04"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060open_packedfile\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1ec3b2a3f922a4112842f879f225fa07ec46c35ee643d8138530214a664007"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new_file_dialog\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1890efd4e8a73638d60c8ee5acaad667c499f781d8a9f9cf3bbd07d746fe15d1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new_file_dialog\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0780cfc29a6ed110c8f215dbafe6edabefa64f3e9e6a68f464ce5aaf52683812"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new_file_dialog\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"471bcba70c0fda7af7b48f76d8b9030107a0cc57de05b5ebae732b75221962b2"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff13ffb69c19bc1518b16cc810eb5e9859ef0caa3be96adcb830d313b135c947"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060get_root_source_type_from_index\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf465ff0c61b5b5c35f080c51215f9fe64ca7f53f77e9f40e4ceaf86930caea"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a6593395a1b7bbf90daf982b6e68144de595e545a603c3fe941c80d8ec90e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d04377aebcecbaa79433ec6712c4b146843a2ac59f27eca32a130835b30575"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea33715452b324405681419c85449201b318ee291d481b8cfb9db9c0f7f5754"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3d80317c51ebabc699e6cc7fa9832396386e618345393a9945d8e0200e3104"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b23dc6eb859292bca9d30a40b9cb315e1efc03df116c874e05efca9e97af89"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e007cc9c22da2829b13afeb2cf60b7b9ec73d8f8e7aa06e125b203457941e90"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a592e0e94b58f367ff237c71f589de795ff35fc927bcaa0f5483fdf24ee22f7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_treeview\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f0feef8fe8b5fa576ea06d4077f12cea14605f0faa97ddd6a43d27e88eab0d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update_rows_decoded\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ac9a3b3a928db09b7b8cec4bafb26bed53ef32b57b34764697dc352a95c29"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060get_fields_from_view\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a8fbc70a84ea2cef11c3dc7a6d9b49f378df9ed3d2295e385ee1d63377f80a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060import_from_assembly_kit\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4e788c0baad80c875218453d2ff5cdbd3f913e742c23c8c4d1957bf5003d1f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060load_to_detailed_view\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f289d6b70c72485d6d1d3ab122a850d2be2fb8e22f1a9787bc4f66978af00786"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060save_from_detailed_view\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ba239bbd04993ae3dfb0414af398f6c20ea7f207d3ed2daf28afff4b14a1e6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060save\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3ecf684d435f8071def681756cb9a68f3bcc8ca39c90fc12fc2cb7003dfdf9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new_view\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/table/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aaa70c11684416deb392f6dbd4dd476916d919307c89548eebddd268505c2b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6139732c27da23d9f61706748cf5744c0e3c45dc3900e4fa0c9524f3b865504"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060save_faction_banner_data\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e18f61f94df9c6ae5756d1d132f16812ff6d66252df368ea64c816e7244f44"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060save_faction_uniform_data\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8095b8602fe25afc9b51b4c1cdf7b9029339bf3153a8360f38bf6e4eb8f9a8d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060load_definition_to_detailed_view_editor\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f1e5f32be6f887f540c8b7d176c0e64ff23d9a3c7432138697ba6bdca06cbe"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060save_definition_from_detailed_view_editor\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d6ad9834252444aaf7695bd57d6243282a1c350b6afc3e85804bc0e185d1c5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060set_game_selected_icon\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3362defc932e4d11cb7469cd4168c574838936be9eb171f52c415f87ca01646"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new_view\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/debug/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10c036fb558f85b57c5e36b5923e7102e9d65df4317e252def59831eb3be186"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060save_view\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/debug/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a95d23ba85df446faa821a2a0df9c7588cde3d75842eb993647851c8ad63339"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060clone\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":4189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2271721466b1ef7e7ccb60649e09256ccf4164a4b4601d95ec29d0df672f9683"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/slots.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d245aa3732bd5155a49c1c56284136f01c6e634a06a015af330336b8614b2f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060open_subtable\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"649460029b1105109eaaeca2beb6bdf8173b10b007fac39ba1e066115dfd9923"}},{"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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/test.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060Cargo.toml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f1258ac0739cd1e0a2e83a9aae67bcefcf633d7f90f15ee6eb51c19cdb530"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::blocking::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/session_ui/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4814a626c315bbab538cbcdbc68ca392ed71d3d657906e8311ada034cf2c9f"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"544bd99c7e7f452788b2dd67d5ce6fd6a6e1f0793fb0b2bcf92abb8350ee823b"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d66e37f818c1b790b93232c42e3b470f9b741e2c1ed8703a264acfcae1deea6"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (rpfm_server/src/main.rs:198)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (rpfm_server/src/main.rs:198)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"S1","level":"note","message":{"text":"No inbound request validation detected: No handler of this repository\u0027s Rust server answers 400, 413 or 422 (\u0060StatusCode::BAD_REQUEST\u0060, \u0060HttpResponse::BadRequest()\u0060, \u0060Status::BadRequest\u0060, tonic \u0060Status::invalid_argument\u0060), and nothing declares validation \u2014 no \u0060validator\u0060/\u0060garde\u0060 derive, no body limit (\u0060DefaultBodyLimit::max\u0060, \u0060RequestBodyLimitLayer\u0060, \u0060JsonConfig::default().limit(\u2026)\u0060, Rocket \u0060Limits\u0060) \u2014 nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (rpfm_server/src/main.rs:198)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ffa303f3c9cef4b4c2cf028a78ce2f3c83f6078f80716eea7362fad047265eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!complete_path.is_empty() \u0026\u0026 !complete_path.ends_with(\u0027/\u0027)\u0060 appears character-identically in 2 files \u2014 rpfm_ui/src/app_ui/mod.rs, rpfm_ui/src/packfile_contents_ui/slots.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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ba9c9835fb25cf326fd8ed50c561bbcdd52c51b481742e94f56251af71e93d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!disk_file_path.is_empty() \u0026\u0026 !is_encrypted \u0026\u0026 extra_data.lazy_load\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/files/animpack/mod.rs, rpfm_lib/src/files/pack/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":"rpfm_lib/src/files/animpack/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae87759c9cb04fa1627c92ad87c36eb38becfe7ae45952e7c10015192505479e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ref_table.is_empty() \u0026\u0026 !ref_column.is_empty()\u0060 appears character-identically in 2 files \u2014 rpfm_extensions/src/dependencies/mod.rs, rpfm_ui/src/packedfile_views/decoder/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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fc49903d27df2ae7c57ded5326c16389470c25295732ed3d0c63c042902c25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(self.header.bitmask.contains(PFHFlags::HAS_EXTENDED_HEADER) \u0026\u0026 data_len \u003C 44) || (!self.header.bitmask.contains(PFHFlags::HAS_EXTENDED_HEAD\u2026\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/files/pack/pack_versions/pfh4.rs, rpfm_lib/src/files/pack/pack_versions/pfh5.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":"rpfm_lib/src/files/pack/pack_versions/pfh4.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05a01b920791f69109ae9147690b8d31246570b0d3e29fa69d07473a8bfdb02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060campaign.is_empty() || campaign == *index.campaign()\u0060 appears character-identically in 2 files \u2014 rpfm_extensions/src/startpos/world/agents.rs, rpfm_extensions/src/startpos/world/legacy.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":"rpfm_extensions/src/startpos/world/agents.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d1350dc65681d2e854ef415029de14983196be3c303430020bb1d825e496b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compress \u0026\u0026 file.is_compressible(game_info)\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/files/pack/pack_versions/pfh5.rs, rpfm_lib/src/files/pack/pack_versions/pfh6.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":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a2fc80f8bbaac2dc79652ad574838b509b9fb514b07395fc69cb34c2386d29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060curr_pos != data_len \u0026\u0026 !Self::only_padding_remains(data)\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/files/esf/caab.rs, rpfm_lib/src/files/esf/cbab.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":"rpfm_lib/src/files/esf/caab.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1086ec49bad21b1a13415033c6c1a8002a1b5bab3499dc3b4d65c59d69d88c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field_ref.is_key(patches) \u0026\u0026 field_ref.is_reference(patches).is_none()\u0060 appears character-identically in 2 files \u2014 rpfm_ui/src/views/table/mod.rs, rpfm_ui/src/views/table/slots.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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b561098b6bff0f451230bc82e6ef0b402c312a90ea006beb7bd71ff9795fe2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060game_key != KEY_EMPIRE \u0026\u0026 game_key != KEY_NAPOLEON \u0026\u0026 game_key != KEY_ARENA\u0060 appears character-identically in 2 files \u2014 rpfm_ipc/src/settings.rs, rpfm_ui/src/settings_ui/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":"rpfm_ipc/src/settings.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9de8cc19104af44254eec1c6c88d0cee6f801cf03885f4d86511db336dc434"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C path.len() - 1 \u0026\u0026 !folder.is_empty()\u0060 appears character-identically in 2 files \u2014 rpfm_extensions/src/dependencies/mod.rs, rpfm_lib/src/files/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":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea92d958f855c0407d71a851634051e725af33cd8cffeba406386d6936fb297"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item_old.text().compare_q_string(item.text().as_ref()) != 0 || item_old.check_state() != item.check_state()\u0060 appears character-identically in 2 files \u2014 rpfm_ui/src/views/table/mod.rs, rpfm_ui/src/views/table/slots.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":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0838bec61c9ca1d38024148cd601f48f122ea7aec23398dc47c70a7bccbbb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.ends_with(anim_fragment_battle::EXTENSION_OLD) || (path.starts_with(anim_fragment_battle::BASE_PATH) \u0026\u0026 path.contains(anim_fragment_bat\u2026\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/files/mod.rs, rpfm_ui_common/src/icons/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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ac65ed2b324234186fe1f0f8e11f833f48fb0f9467e54650ec87f6739aeef3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.starts_with(anims_table::BASE_PATH) \u0026\u0026 path.ends_with(anims_table::EXTENSION)\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/files/mod.rs, rpfm_ui_common/src/icons/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":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0775428ce07073c36c7f086dcba3581dc31b59649a7f9d161ee520490d9cd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw_field.fragment_path.is_some() \u0026\u0026 raw_field.filename_relative_path.is_none()\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/integrations/assembly_kit/table_definition.rs, rpfm_lib/src/schema/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":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9792670ee20322176ff3ce1cf1cf0d691b384dc988945ddd33061c7712d500"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref_table.trim().is_empty() || ref_column.trim().is_empty()\u0060 appears character-identically in 2 files \u2014 rpfm_lib/src/schema/mod.rs, rpfm_lib/src/schema/v4.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":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee774ab45f9bbd4c0148b7cb34f0801bc66b7f293b79c47bdd3e0f1c4d8db82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root_type != rpfm_ui_common::ROOT_NODE_TYPE_EDITABLE_PACKFILE \u0026\u0026 root_type != rpfm_ui_common::ROOT_NODE_TYPE_MYMOD_PACKFILE\u0060 appears character-identically in 2 files \u2014 rpfm_ui/src/app_ui/mod.rs, rpfm_ui/src/command_palette_ui/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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4339}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c84315253aa5764419fe6ab470425b20d5ca05ad3a64bbb8a40e80596dda1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_faction.is_empty() \u0026\u0026 row_subculture == *faction.subculture()\u0060 appears character-identically in 3 files \u2014 rpfm_extensions/src/startpos/world/bodyguards.rs, rpfm_extensions/src/startpos/world/government.rs, rpfm_extensions/src/startpos/world/legacy.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":"rpfm_extensions/src/startpos/world/bodyguards.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9164afdb06c1da213779aeb9e529fe829190c5cb28ce114b20790d23dd99cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_faction.is_empty() \u0026\u0026 row_subculture.is_empty() \u0026\u0026 row.str(\u0022culture_key\u0022)\u0060 appears character-identically in 2 files \u2014 rpfm_extensions/src/startpos/world/bodyguards.rs, rpfm_extensions/src/startpos/world/government.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":"rpfm_extensions/src/startpos/world/bodyguards.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19b552bb21e9f2728be7aefd328d1106562097fbce61cbd17ca6e6cc7210b2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.compress \u0026\u0026 compression_format != CompressionFormat::None \u0026\u0026 self.supports_compression_format(compression_format)\u0060 appears character-identically in 3 files \u2014 rpfm_lib/src/files/pack/pack_versions/pfh3.rs, rpfm_lib/src/files/pack/pack_versions/pfh5.rs, rpfm_lib/src/files/pack/pack_versions/pfh6.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":"rpfm_lib/src/files/pack/pack_versions/pfh3.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f9237cfa7bb265eb9e66a4c7619d72b7a170a6268a4ee13b8f76be82f8e10f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060settings_bool(ENABLE_ICONS) \u0026\u0026 field.is_filename(patches)\u0060 appears character-identically in 3 files \u2014 rpfm_ui/src/app_ui/slots.rs, rpfm_ui/src/views/table/mod.rs, rpfm_ui/src/views/table/slots.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":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c65e547041db3619c3547ccb8cb51bc73df5ffa1610a7b5f4e48959ceb90938"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060total \u003E= request.offset \u0026\u0026 page.len() \u003C limit\u0060 appears character-identically in 2 files \u2014 rpfm_server/src/state/diagnostics.rs, rpfm_server/src/state/search.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":"rpfm_server/src/state/diagnostics.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c1d50c2423aea6622146113394588132e8be5ae4632e3a8692b34fe7ec0716"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060variant.is_valid() \u0026\u0026 !variant.is_null()\u0060 appears character-identically in 3 files \u2014 rpfm_ui/src/app_ui/mod.rs, rpfm_ui/src/global_search_ui/mod.rs, rpfm_ui/src/pack_tree/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":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4097}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b8e75b561df4d1980694747c2ac798c29fd8e27346262b8adb8e166ae20992"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060num_frames\u0060 is read from the bytes being parsed at line 47 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 53 \u2014 and nowhere in its scope is \u0060num_frames\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060num_frames\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/video/ivf.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef05c950a7ad5d35f1a60202351920c903d86a1cb16bef648624a1838afcc2"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060variants_on_this_category\u0060 is read from the bytes being parsed at line 184 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 190 \u2014 and nowhere in its scope is \u0060variants_on_this_category\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060variants_on_this_category\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/unit_variant/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cc312cfeb9ca7dd824fa9d73c3fc1730e4a43794043e3360036fb1cfe17946"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060mesh_count\u0060 is read from the bytes being parsed at line 43 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 44 \u2014 and nowhere in its scope is \u0060mesh_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060mesh_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v6.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"78287a437bd83f4bfe2b6818e50eecd7aee53681821994f2c58ee40e8745e6f0"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060vertex_count\u0060 is read from the bytes being parsed at line 76 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 94 \u2014 and nowhere in its scope is \u0060vertex_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060vertex_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v6.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7968bf0a11b20c8abb55cfec2522ca9fef5f431a626b6a48facc1d69083fa1e2"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060index_count\u0060 is read from the bytes being parsed at line 78 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 95 \u2014 and nowhere in its scope is \u0060index_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060index_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v6.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c58412576e4b45da0fba8589c279b98d573803c78419a7066d8c4412a77fdf"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060mesh_count\u0060 is read from the bytes being parsed at line 36 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 37 \u2014 and nowhere in its scope is \u0060mesh_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060mesh_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v7.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"47056190c0f9f61f7688bafc92953249bc0de2eb5b06b2261352f64df2b95673"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060vertex_count\u0060 is read from the bytes being parsed at line 63 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 75 \u2014 and nowhere in its scope is \u0060vertex_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060vertex_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v7.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9441c3ca5a04716a4f55f2ed78453c9a3473d0a5a9bd906617eddbf3572dc9"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060index_count\u0060 is read from the bytes being parsed at line 65 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 76 \u2014 and nowhere in its scope is \u0060index_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060index_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v7.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b33d0312a6754c9cec24c5f9591ca3bc6be188f664e95e93d8f253d4e9f59"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060mesh_count\u0060 is read from the bytes being parsed at line 36 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 37 \u2014 and nowhere in its scope is \u0060mesh_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060mesh_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v8.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2764ce5f6e3a13aac1636cccfb0151dc294901aa8338c7881e0fb9f3e3b2ed25"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060vertex_count\u0060 is read from the bytes being parsed at line 63 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 75 \u2014 and nowhere in its scope is \u0060vertex_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060vertex_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v8.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"909b613851faa0de6f18c8ddc5044466ad142a2afbd704127eb274f92f15bf87"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060index_count\u0060 is read from the bytes being parsed at line 65 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 76 \u2014 and nowhere in its scope is \u0060index_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060index_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/versions/v8.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffd9ec52d50248d86348f8c7658c4c528497b4fdeec835c9d694a596992c36c"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060uk_7_count\u0060 is read from the bytes being parsed at line 22 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 23 \u2014 and nowhere in its scope is \u0060uk_7_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060uk_7_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/cloth.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee44cb13ca96ef9d1128ce3b300056641907264b2bfa4f52638d7e11ac1e56f4"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060uk_8_count\u0060 is read from the bytes being parsed at line 25 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 26 \u2014 and nowhere in its scope is \u0060uk_8_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060uk_8_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/cloth.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b16fc6a97df2f2c592663186bb14b909229dce0dec18b7152a5de28f545b86"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060uk_9_count\u0060 is read from the bytes being parsed at line 28 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 29 \u2014 and nowhere in its scope is \u0060uk_9_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060uk_9_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/cloth.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1ca422039020de7060710caea2caefc88ad9ac9fcfcf7d3be27edb44d3408f"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060attachment_points_count\u0060 is read from the bytes being parsed at line 51 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 52 \u2014 and nowhere in its scope is \u0060attachment_points_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060attachment_points_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/default.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4686e3a5462048d70223fdf4f8c8d5a92620b86295b373d793a6ff00b3e1d67"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060texture_count\u0060 is read from the bytes being parsed at line 54 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 55 \u2014 and nowhere in its scope is \u0060texture_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060texture_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/default.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1933077740cf5ee90cb642fa3f5613bfc3937f68177c388ceb7f3ad46b02a627"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060param_string_count\u0060 is read from the bytes being parsed at line 57 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 58 \u2014 and nowhere in its scope is \u0060param_string_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060param_string_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/default.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c2ddd2c09cdbbb271116620ede13747e8c4040b8727ddd3d38279140885081"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060param_f32_count\u0060 is read from the bytes being parsed at line 60 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 61 \u2014 and nowhere in its scope is \u0060param_f32_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060param_f32_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/default.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd8b03a4c59b494264c6a419956557bba4f113682f8c1c73e2ce8d489a80d6"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060param_i32_count\u0060 is read from the bytes being parsed at line 63 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 64 \u2014 and nowhere in its scope is \u0060param_i32_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060param_i32_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/default.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"20abb556b286c9eb8c3f40f26f8e196e63dfbc44729b894ca7f312646ffd96ee"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060param_vector4df32_count\u0060 is read from the bytes being parsed at line 66 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 67 \u2014 and nowhere in its scope is \u0060param_vector4df32_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060param_vector4df32_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/default.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a9ff6ce8547121611082b65ad345c96d24f41eb49a9d46df71c6f7035f47b"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060node_count\u0060 is read from the bytes being parsed at line 24 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 30 \u2014 and nowhere in its scope is \u0060node_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060node_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/rope.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"644abe3b0065662c96119d40095769bb20b82a668e2ab85d63d41fc1cd6b0134"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060bone_count\u0060 is read from the bytes being parsed at line 25 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 27 \u2014 and nowhere in its scope is \u0060bone_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060bone_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/weighted_cloth.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6128c10d477d2d3429c5918bf169b6936714d77e0a2d818770714590ccac9bcf"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060define_count\u0060 is read from the bytes being parsed at line 26 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 27 \u2014 and nowhere in its scope is \u0060define_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060define_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/fxc/v4.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f7cb55e8253dd4136df1cb08d7b67e3c0f0caec8503cd8312386fb6afffdc1"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060include_count\u0060 is read from the bytes being parsed at line 36 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 37 \u2014 and nowhere in its scope is \u0060include_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060include_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/fxc/v4.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9efeecd54d79196e0c1aa06b8e871d9e6e7ff469279cbe49a53a8d77c85a6f7"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060category_count\u0060 is read from the bytes being parsed at line 41 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 42 \u2014 and nowhere in its scope is \u0060category_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060category_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/asset_variation_db/v1.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7b958ada0f662588bc1e9b6a28dd9cd1dac79cd32033edcd6bc23c30a429fc"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060entry_count\u0060 is read from the bytes being parsed at line 52 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 53 \u2014 and nowhere in its scope is \u0060entry_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060entry_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/asset_variation_db/v1.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"410fe4d530c5f4cac6e0ab3a847831b2ce6038fb0dea9524fe522616e3da2436"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060variation_count\u0060 is read from the bytes being parsed at line 58 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 59 \u2014 and nowhere in its scope is \u0060variation_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060variation_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/asset_variation_db/v1.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c89db746103dffaac516cdb515c90b3e8851b79bcff3b9920e15d7de1a78c6c"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060u_size\u0060 is read from the bytes being parsed at line 228 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 264 \u2014 and nowhere in its scope is \u0060u_size\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060u_size\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/compression/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb131114762cffdaf069ad35e0215f546c98056be0ac029fe16a0fa105a37d6a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060encode\u0060 is public and takes a \u0060RFile\u0060 as its receiver from its caller, and it calls itself at line 2368 with a piece of the document (and at line 2369, line 2370, line 2371, line 2372, line 2373, line 2374, line 2375, line 2376, line 2377, line 2378, line 2379, line 2380, line 2381, line 2382, line 2383, line 2384, line 2385, line 2386, line 2387, line 2388, line 2389, line 2390, line 2391, line 2392, line 2393, line 2394, line 2395, line 2396) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060encode\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f382d6f24988e3b432f1946637e847b48dea1c336dcd4b7c0df7b3a4d8bbe61"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060update\u0060 is public and takes a \u0060RFile\u0060 as its receiver from its caller, and it calls itself at line 2863 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060update\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a948b1d7b8d099a6238685326d4e920ef14c88d472ed5a30690412c1660d86"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060insert\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it recurses at line 444 through \u0060write\u0060, \u0060encode\u0060 and back with a piece of the document (and at line 431, line 434, line 437, line 564, line 745, line 751, line 757) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060insert\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9030d781be179174bee1fc6000275604bd8ac38a5bc6f2a8bf39e2490d1bd36d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pfh_version\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1033 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060pfh_version\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faf5f58d3040452bdd197af2ee863ae075aadd35da53ddbc484f015cfdb63ef"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pfh_file_type\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1038 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060pfh_file_type\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dde05ccc0b03eccd9bc57204659a70f1633a4c500d08da5628c54bbb113d938"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060bitmask\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1043 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060bitmask\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"2428a0f35fdddaf7f310d6411955103abfc2460db4ab09c74c128678f7dc14b8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060internal_timestamp\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1048 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060internal_timestamp\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eae7a969dc531be52a5317399994e601dbdc9cf4727b1b66ecca8ec7fdeac48"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060game_version\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1053 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060game_version\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9db3cd597e2c95dfacfcdac510d58bee88ef11db8b969e5da6aa36539b838a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060build_number\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1058 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060build_number\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5313b4fc9a8b1b605de9d4a52b4516d915808525f5b53d6fa0ea00c195f7e77"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060authoring_tool\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1063 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060authoring_tool\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"8345cc263d612bae6571f5a5c6e4122a7e1675715c01741419d62932e4c3040b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060extra_subheader_data\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1068 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060extra_subheader_data\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7477cad2535760ca5a421daba71770f5c74add211774d3f8f8f26e7319d5134"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_pfh_version\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1092 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_pfh_version\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bec34b1a73f85876b601bd413d87aff6aa40d769f113ced56132245c88a1a8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_pfh_file_type\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1097 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_pfh_file_type\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba02b9f423b1bcd1c8478a5f7fdcc4d360485f5c71ad1156db8015ad7c180ae"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_bitmask\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1102 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_bitmask\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"825df354a3cc094b3f5178864d4ecd10433bd4aed26ab48f58d53f645d25cd7a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_internal_timestamp\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1107 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_internal_timestamp\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bb94b63f8ab651ad3f65f2f9572dad8e8d8effc9670e3826c1fd35959e785b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_game_version\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1112 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_game_version\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8699524b5403a21abce2f2f7e66f869cb95e8e7ebc9fa4cd910910f26132996e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_build_number\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1117 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_build_number\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3683a97c2744c325cf603cb5b2f2755fde87d495fdae9bbdb138d8ea59df90"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_authoring_tool\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1122 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_authoring_tool\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dccf387d50a6d307b417ec10d0bec0203975a58f1c26a203f59c58e4202447"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_extra_subheader_data\u0060 is public and takes a \u0060Pack\u0060 as its receiver from its caller, and it calls itself at line 1127 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_extra_subheader_data\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dff2598d956103ec1ab981dcc76e3c220e93419a67c4c2585aac109f88db7c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060save_node\u0060 is public and takes \u0060node_type: \u0026NodeType\u0060 from its caller, and it calls itself at line 1069 with a piece of the document (and at line 1084) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060save_node\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fde7d8d98bb87328aa2172de3a0af03884b7d9bf97893aeb46023438eb07a2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060read_string_from_node\u0060 is public and takes \u0060node_type: \u0026NodeType\u0060 from its caller, and it calls itself at line 1137 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060read_string_from_node\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cde59e70ba7ab666b9d889513df62d7e5948226eb0b934f073074eb27e360fb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060encode\u0060 is public and takes a \u0060AnimPack\u0060 as its receiver from its caller, and it calls itself at line 408 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060encode\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/animpack/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d7ffbb2c1034644ba643eb000141c7cb0c73a08afa72631db6d039aac90caf"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 68) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/tools/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"03730e5c7b12aee46941b4cd897fb10edacc500ad381032ed2196a8bede82737"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 1252) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7721039bbb9f378b3fa0e2149524c67e1f6809627ba8543a25a78d5355ad03b"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 404) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_telemetry/src/logger.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"feff945a21dbf64bc2124f719c5cceba0a1e59e4e3d2a58d9747020de9463b58"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 847) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6fa929eabcb93ce742a3ef13e2d586e39438fceb2a55c91a7e29967b1ced85"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 860) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca19c775da4434e44ddae9e6d0baa056088ce998aa2e4dd9ca90ba44ae2ae144"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 875) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf8b2020a06f979983c6c25fb9ba8f708c3a87b01a72786b6fecb86368168d4"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 618) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20492d5058376cac5ac23a9f7a8e3cadaad2fe772f10caacd548abdb4b79572"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 647) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"24596df3dd33dc71d82f55e1fdd3c2aaec11d1d481bf6db4a01a1aabc0c89891"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 682) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8db8cd33af6ded8a75ee14258b3906a232eef6601d47c480d56a568e70ff0b6"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 1007) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"482d7a03b1fc9285eaba327a1eb3dd8b8084741709da32a7633109035e2b77ee"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 1078) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e3a148679f4568779a5fc36805b231217e808c09a0d52c5a523c7ff31b572"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 169) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2894c72c442b178619295132b327e94787b07d19fc84557e561688f55fd9d3c2"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 2896) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"1142884f4305fd8a15207929d5220f939ca92ebeb3dc9f521d719e2bfa780f22"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 1462) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a80d3c85f8fe46bbe0dd9e3896975e30cbcaefef643d74b92fded374552088e"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060terry_file\u0060 (line 574) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7155dccd4047ebba9aada58ad900b2a4c71e833bb5a1ef424196999c1f6e52fb"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060layer_file\u0060 (line 691) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/mod.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5d9c252d953a389f4e67df2c24e90bca85fa553ebe50661d22064e0de3da36"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 427) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc9707128513024022cb1ced6eccb6d754b4184dca1722cc6354be96ca1e9c"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 728) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06f12884bcf182363cd91c79d5253cf44f37685a5ffccad5ed3ce26ec24d761"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 705) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d0aae5a354fa78390db4ba0eba76bb421b00e59b73a4430bf462371a0f6173"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060file\u0060 (line 317) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac6011fda83b95f649414b9b47e4decc632ea62046c88a785dfd93f565c8563"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060Box::\u003C[T]\u003E::into_raw(alloc)\u0060 (line 619) gives up ownership in exchange for a raw handle \u2014 the value\u0027s \u0060Drop\u0060 will no longer run \u2014 and nothing in the crate\u0027s code ever reclaims a \u0060Box\u0060 from a raw pointer (\u0060Box::from_raw\u0060). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a \u0060free\u0060 function that rebuilds the owner with \u0060from_raw\u0060 and drops it), or keep the owning value."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"96103bb08882874317671de100f304675ac644bb37d9be883eb67fb3d258c99b"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060writer_gltf\u0060 (line 494) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aafe3f89f02a59041999fd4188c51b8d26a36fb28f064161d7f53961f907c47"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TableReferences.referenced_table_is_ak_only\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71ed925056383f666ceee12b3516c8b3b3631b6e3aaf38d87be7abb0bae5cc4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TableReferences.referenced_column_is_localised\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"978661e2caf8ae456225be5297ee5d85b34fe8d7ff2aaf5724f03ce91ba570dc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Diagnostics.folders_ignored\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"87128e01451db48742128d94da2517f130904abf2dff04ebb2b9919329b6e519"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Diagnostics.files_ignored\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"42be2dafb5af6bad7a619ce546f9b52c594bc570a48ad1b236517470f31be80f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Diagnostics.fields_ignored\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/diagnostics/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"779b46b41e56b5a88ac9c2b9f766a6008757eeb01e6289af17d60647f9d3402c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LuaTestOptions.faction_keys\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4085eaecc36dde5cfb6c24944366941b52691c1521f090f68e8b3cb7c2c90c74"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LuaTestReport.boot_errors\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4846861a8d8b6b5e53570d0318135c0f887784f5f743ce0535c7423e9edc95dd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LuaSave.errors\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cbb4fb16b801b157f40939223e0676b14375af6b2bac45f5124646da095b32"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LuaTestResult.passed\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d7b1207de3b3504fd598edfaddd65355bf1f7d13b3e9478a48358934d741ea"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LuaTestResult.errors\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8109677f904afe6cda61589d2befb34a492bc82fdaad93f2ccaa2a80fadb5bc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LuaTestResult.unmocked_calls\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7401f12adbd194e9cdf47cfb3a65f00ebc929088b484317fe95b522b39364858"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LuaTestResult.log\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/lua/harness/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"996399a0c037bc3a827b898906a1ee5c103e8919418369e382594e7468b79035"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeOptions.delta_merge\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/merge/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c2ad7ab1dd5d4f3ed05292c75c3bccbe65c8b8769376c0556d0b8f19584cfb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060GlobalSearch.game_key\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6beeef95da141a03018bee1ae91fb5c3429b7b272cdf74661c9dfbd15de25592"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SettlementLayout.sprawl\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/settlements.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"13452e572db5259a7977ae0a50883a637d603cda04982e019f6b77c07b2aaadc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SlotLayout.walls\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/settlements.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5877903427dc4320d71dbef82441a358e299bff3fa11bfaa8c491907ec552a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SlotLayout.touching_slots\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/settlements.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fbe51c76acbf69f34aa31b8f3b396071eab93d8e85c0a74e11f09f66201f48"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SprawlCell.in_footprint\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/settlements.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3109a3f98af809b0fd4f4ace90b3a9e4617f0d14dab0956a29d47d8f690fd5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SprawlCell.in_zone\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/settlements.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6431612d8090784786cadc561369b9e8ba0aaa76284f62584eb0ba09b285b0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SprawlCell.zone_slots\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/settlements.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a595176e694477afdd3012d6e51510735f7223493285b41e2e0d59c2f303a835"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060NetworkSpline.speed_tables\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/trade.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50cca410c67ab55b534692c5911cef87b6125304bbaa329aa21d950a44ee29a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060NetworkSpline.lengths\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/trade.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f1036b9b054379554d437a9acec329c035acb23d59b8b042a45d2db1b839b1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060NetworkSpline.total_length\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/trade.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb235229a06ab507e87c5783a91052e666f5dc9842f9eca8cb4804698c0f8c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PackTranslation.glossary\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/translator/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8939055dbcb0eb860001446469c1c569a637cd23d87df5c0ee9b0eee20417f43"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060FilesExtracted.extracted\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/files.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2316804b13e0aaeae0c492924a90023b28060d9b7f1953fd9fbfadb63eada379"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RowLocs.locs\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/references.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0f4c35ee6082ea747407fd3b5237d512ec30609a56a5ca2b5d72a019bf3c97"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060UnusedNumbers.numbers\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tables.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"30913215d58af446d375b1ff00830110c3bd8f9010bda6e510faf97895569669"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TablesMerged.conflicts\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tables.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90f9c74e02f76bde3b2c244869df5f65c4d11daa2834d8070f60caa2efe7b69"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TableUpgraded.old_version\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tables.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae08fea4516c2d06207900ac69d2b62b3bff5a511c3bcb80a6b6820a361e27d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TableUpgraded.new_version\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tables.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d218e70662f21c956ebcd33b4cf273ac1053d018363af7d3a8ee14d9cc771eee"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TableUpgraded.deleted_columns\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tables.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f467927f5a7384f368e13f2a6579b850b567f024154f2154e2f7a3994f7a12"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TableUpgraded.added_columns\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tables.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3f5b396253f7681bdbe39e064e0c540933786795d9bd12e6c162f990e47ed7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060StartposTableComparison.match_ratio\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tools.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec90af1092fa655c4151d80dad985f5869b5d5c346e73743de7722390cf3c13"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060StartposValueDifference.original\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tools.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb65827de5d123b33080bf5116ee8c10aa1da3e4e9ce6e093ed692e6cc2e9b8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060StartposValueDifference.extracted\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/api/tools.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a6e1429aa188dd086628361b068e243b7d1bdbe96ca44abf446d0e5d6e5187"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DependenciesInfo.parent_packed_files\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/helpers.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf3e74fab1c19acef15585bed43ec144f188e0bc07223d61311cc0a5f875086"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SessionInfo.timeout_remaining_secs\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/helpers.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35cfb13e272341f8e6c8d466846cde5ed85f70094cb7625653b3bc525a2702"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SessionInfo.is_shutting_down\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/helpers.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"50211d02cd3c5e931fa0f282a1a572e30a314ed6f152c4307dbdef4c7b0f35c7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.valid_for_min_num_players\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9c2be76a60fe84884977391559677e7aa10c79a25dd8a6227ad9b07292fd24"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.valid_for_max_num_players\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"283efe84b7cf975e64e11c590d3b17dfbdb22e1f7a85f272a8c3be6a275a1d25"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.capture_point_type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c719a422cb6b92a61d38e8fbf88f2ea456a7027771f3ac8b127f54e84b5a96"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.restore_type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b6569327d6ebaebed23940f063e5392bd27864ae7fa80890748b2023499547"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.location_points\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"41265e311039bf6bad1c57717b574a933698987e2c2d5e46adff719d138d9eed"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.database_key\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d465263f3c5d26de61901c052d9408ab67e12c72f6408de65efdb927562bdf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.flag_facing\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33fbc82a69af820d3e3e56b324b3c5be4e3ec71325b27cdb73358b8feb6565d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.destroy_building_on_capture\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c6bf40d0391afb7599d8a68a93e61bd04a75f73bddc10886378bce44c50e19"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.disable_building_abilities_when_no_original_owner\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8ab0be34ac253e2503ee583fe21ca1612c36c2d82b07cb93db15da9672ec1a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.abilities_affect_globally\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e4fb51cb04222225c98ec140db043e3b1e243ce4a3d3dc6747fd45253da501"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.toggle_slots_links\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef71fdb0b6577951dc384d08e85440a716265281dd64fe5911271a5c700e0e5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.ai_hints_links\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8276faf1e60f172c1257f2a33fb8389904164cdd426ee3448b8d16d96430b938"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CaptureLocation.is_time_based\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/capture_location_set/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2236a6fe42d2344fc029c2adcc0d688d967944ce25c4611f43861e20505b3e25"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BoolNode.optimized\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/mod.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb7456b1a4a4b1af8956cf6dd2354af7771f3db22dc29534291a3b838a571c2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060I32Node.optimized\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"345839d2bf3e125cab6a05702b68ae2a743c64144bd55743e93dc6d70fa1c035"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060U32Node.optimized\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0819be5ffc5d77b16f5c94bb1d5686b743138ca45b9bb127ec89b20e6849ed2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060F32Node.optimized\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/mod.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"654ab5de2a843d922c3157a081410b833278234dc49fd57310ac5355a313d2c3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060VecI32Node.optimized\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d70187721679bb347a7bc4f4a44ff2515dce3b7cae4bc995ac0aa7d5197a32"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060VecU32Node.optimized\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/mod.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"beea83267c77e62ac60fdd319be66f69027276e1477d1090dd6029f19a1a7e2e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.first_prop\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67c8dae0d96a19137a649b894235a95b252ad1fbb923417b221d8dc3b44a2b1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.second_prop\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25f9c4a30094ef500dcf619b732d5cc6eb4ecfe8b78d5dfcf599ac4a8271197"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.line_height\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2808b12d1cdff3ac0a231bc8a8944504d33fdb8b3f001301d03be365fbe575"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.fourth_prop\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434db9699d9f29bb323b5bcf05a2007cacc8f3ae4b85a0944faf95017a1938b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.fifth_prop\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed015212f629450f68785a5aa8f1704ae8a1b041e3dffbefcf0231532ab001d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.baseline\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0d14b99aae74cf1eba3302b3e829a97e29fdf4d4294e0bf19d1e58dfbe5829"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.layout_y_offset\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ed0fa0e74db2d969c66b6bed6534bda795fa5a6bc8263427fd1118227bc947"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.space_justify\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec753a28f79b21c3d6bb3ad16218bd1367fee6292ff7bd0f61ccb3c67d2469f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.layout_x_offset\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"458c40bdd6803b721610d3fb9588c797f72736a98477b8f8d210e44cfc305702"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.h_size\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df4155793c6fc7330a8d16a9c396827f5fb9ae718c7ca182957530562ce3af5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CUFProperties.v_size\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a32c86f26a485e8f24dd897c386b2661ebef772fc8e6322155983aa0b549c8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Glyph.character\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41178a557e060e54b966a644fc4d8140e6d47f98ce275f0b31f2858589dd17f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Glyph.kerning\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/font/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"383ee76f2d8e3fa9b379b63788ee38975fda1eb70dee246d2c7358715b42cd12"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.converted_data\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/image/mod.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bc381c7f81bd230dd2191558ac0d89cf413165812d7afa24a2400d3292a4f9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PackNotes.pack_notes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea50157f1de34f3942565ba463fd7d324df21e00515d03ac7b8961e2041b72c9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PackNotes.file_notes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e6d9ae6d298fd81ad6b6f8a225186d4103f47f37b8c6b7754f12a057b5355e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Material.matrix1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a677974ed95f976c5fb55aee2fcb75453aa5138ed98b0acf1587511d578ae4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Material.matrix2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c018676d02cf6ea02008873f928c3d172200ecae5ed9bfe3e5ffe47b13bddf39"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Material.matrix3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f66f2f1f04fcf695f36f68516f4bdc96356cebd4b8e8a8aa539e5b7dd33117"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Material.sz_padding\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/materials/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3757d3a8dd30ec7e73e28fdd03e506f6afc78c640e30cafde6d0fdaca6a103"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mesh.min_bb\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9950bff89fba826757cd46f74e10bc44e4f750fc595f6a46bce68b104cf487"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mesh.max_bb\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"02037f011591bec23bcd67c3d1ff55e795a50ca72a15817364c73d549068116d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mesh.lighting_constants\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/rigidmodel/mod.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d634d88e49fac2f841b365d3cdca0475b5230725bfdc137affdb3b4183996d55"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_0\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"884cb18bb317468bd99488b2b60616d33655b71d6bcc69c89184c1e21b4d3005"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_projectile_fire\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5581177af2a63a55bf7f6098915c1a5b818a234cc71a5a4ae4f6d5e061282546"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcaacdf5f9ab2ecb261ff46cb019ac3d7c9b793492e2503a1ee3e020d39e530"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1455c2db8d10aa58e700c0c2e8a629173a8e9506a60ade7dba343b08f68bd5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2eb956361321dc6825f761293cf95919284453b107968bfa830bf266d96ff11"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_5\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9179dac61b1fe45589b18a7944db69ee131fe7fb9f1210898a5646a530a7045"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_6\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2009e69181bd87dc938708ca9da572d5376d980a162933da8b286d48a2818169"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_7\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"544e1d79c8b0f467f5fd32b25271dd354628dd63f75eb2614ebfc7925dc1b011"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_8\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"826db5843afa9d34a30ce683813ae23803daa813a56a694afa6f7ab0582f5743"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_9\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"15501bfef1de43abee5a40c9e082d8dfbe06b109211b4ad31f52741642460363"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_10\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"71795edc770c69c0cc3a41009b71eed999402341f4a0c6a1a8aa82ff20242439"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_11\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1487e6fddd419cf701c42977af4952330a37cd2560c41f970e2a3f8bf586e656"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_12\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28595aa7a065a786963adf3ae7c4b006bf72d455cf800987c831f939eddc2f9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_13\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"60be399243e6a10728456c857a6ad9eefc4e9a12778bf7028b746d72040d84b2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_14\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef8f7153bb45acbdeb1d225234545b922340e4e0b1ad62423c18d24ea0b8fb1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_15\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6e97edc4302c351fa4dd1494b8a28b366b14a799477b34f3eeab477c2d781e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_16\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e4221c750c3acb9c7b5b2b72d5658a37e3d3647a24d4eaf11e096ccccf359d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_17\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9ffa4f9f71e042b146dec56ca4d6c1213b87edce0675977cf61145255e33fe"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_18\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e3453469eb778fba637551ecaaf1002bacd78f1d3e3347a98b7efb79e1bb4e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_19\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a717539ed487270ecdcbf57c27ba3e333b281bd73156631c031359b3b7dc110"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_20\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1154654332de185aa4bfaf30668754b2c8561c662f4d49f9dcc5b746998e73f0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_21\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"883270be842c6b45535d0bb9297d9cc5ad24af1ae3ca19311a232ff8680b86b4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_22\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4af881c4fd036b4d1666b93ab17d0c1a39de0e870c7fb0d49de66015f1376c6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_23\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e27f4d94056e43d4eac27f94565dc6551c0cedfc66c9e584602adbf5f017ee"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SoundBankDatabase.bank_event_uk_24\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"579906312d72421ff5910e037e452dca3aa42870dd1307850d3587434d9f5a13"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk0.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"868421fb40f164cfdea313b421786096878a7fafedc7467bf8480b040e44c468"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk0.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"65524dd0fb966ae9be6fbeec5843ad1476d510e5b9d9af194497623908f934d6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk0.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac9a56b7789cd001451c9a21d5074da4f22f1c6572c2beffcb7c0949a544aed"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk0.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe4a9ab90412af140a8013a3afc59d2be3d5b3def6f7ffa47bb05f60d016624"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventProjectileFire.gun_types\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"969e8930dd402a43af8718fb2946b95d6cb81e59b3f3944a074ae5bc431e5609"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventProjectileFire.shot_types\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a33c2e67a815f84623ccf856d4ed36c39295e9021fade5e8fd921a240760b9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventProjectileFire.projectile_sizes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be8458a0e5e09f15b0c48dd5f9d2da7902adb764daf66cfce69df8b67913cf8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventProjectileFire.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d780b14ccbbe96a447eae4ec190c2de0156e5e944edd615f48c68e08d922c2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventProjectileFire.unit_indexes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cc981bc0fe67e69f35c78b179d4be620d5e076d06c8c0a977fced99126165a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk2.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b084cd41492af1fdb8667211ffd8fd3307c2ab100a8c85c9626948e4c70d32"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk2.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fc03dab6d138b1d1b9621186f0a4e31112815999f4d70a8486840b993f74ce"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk2.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2511b657b3790da578a8c871ebcae8f6e1b89c0880f9d5e6593633c84c60f5a6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk2.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7e7ead7834079ba79155cd47fc1c1aaa9942232c043ba035183ceae9761943"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk3.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3859c4089e348e56393db4fe9b93089f65f5a3485b591adb3295ac8b2680b5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk3.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f8bea44085dce21fd051a0540ed3a80c3773250159624e5bef12253b785f57"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk3.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d34723db3d661ab7a4d057a61c5f8a6461c0510f3554227013db3836045959"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk4.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8465613df41a649d3fc15ad25ca9aae55526a760e842e50865255f3601d974a0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk4.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9577c8e008bee6a82e692167c514b48076d3ac85c8e0c1076dafa20c5dfc5d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk5.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d44ee631383e8c8b9989ddf56ff5b004a0df0dbb1070b2df9df502b086af039"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk5.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8de12de43f00d24af18cb966843e21586069d448ac538630a472e00c10345e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk5.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bfbf1364aeeb8c3b2cbf20cec5ffa02446831df5c708d625066eb03ed222bb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk5.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96849e1231c13847bb128d4191b31e452551f783d03f27008a74bcafa14f2d2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk6.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd36a099708467d401052c74f911de57aec5bb75ceb0604780b00598fa56d30f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk6.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a62f250788dd59755866d4d677790228debce7c8d80f63dd9cb9c5fefb816e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk6.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce06d83d3c95c0c15f55079cbe7d4b63da27f83ba0c9c9548ca8d384f2bd511"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk6.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8c63754a4b501b4dfd2dc6776001a9a58a337467b8b3698828c80779eb323c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk6.params_5\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1f0c4b93f0a737a97741d78741ef0875b3815c1bf3e45655662c2d7ff399cd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk6.params_6\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d7c650b53ca692b488055ef9c1bd1baab42a51bb972e6d6b5cd51b082977e8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk6.params_7\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdedc598791899a0e64b3aab5b91e19712b187f6df7780689b6447f90a0f7739"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk7.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c630bb0b9c2f97d61abf931d265661dc1d6de3a84821d88c4fc25649efdccd77"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk7.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"99801c0bcbbeb54abab3994d33ef2cc6775ea2e89c99275c5ce396e89ab06631"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk7.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fe06f9372a7254593295d078d696a79d20c70a96b239b62d33ac585a31d0e8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk7.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f8fcef9993c03d2260d28b32dd797eb945c2728eef4b7fb688c7797d45b15"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk7.params_5\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fff0abc0790598cc9576b76ea4c564ff4ab508a46bfee3090ab3b4be9f8407"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk8.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df1e682abc391e44aa9ca47e43e79275b3cd2144286407c614013ff65057bba"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk8.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0026fc62dd505f4a44f49f6e91d58ef49e8c3dfea23bae507beda7c11cd46294"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk8.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"046b77b7548853e839a0d207171c3ab0e6f6ca276afcfabac1dba875f676ab6d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk8.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"686c337089711cd830064785750c9aeb50a09aa0392743de446f69b1fbab4018"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk9.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"456ec698664a5e26ee526fcc201b5df79fb7d52eb4aa507f199d8662aed821e0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk9.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbde7388274395c989da8586357685a4090914ecc6e846545f61e0b964fc659"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk10.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a01e3ee99e7cc2e97d4667f4c7e913374d6ba9913511e878d53100703bf46c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk10.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7f13deca2db947df7bf521b5215267378046c8266272982752c4aa00934d9f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk11.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"273974b98393398c5843a9a60de0db969bb1f5b5fbcac0d82569790d1a822cc9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk12.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"144c95ced4bd5c170a18137d1c04a22f842d30d7ec4619715a53ff5422937703"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk12.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc14c16cb0c5940f5b7fc820ce843e77f8bc930f247c7451d9d77d5b6eeb4d9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk12.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a26b59125a2b7bb4c8c7b59a222d5435d719ce782875222bb1bc5315b08fa4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk12.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee21d4b37e49c10fc9939bf40efcf1133203ad04eca6ff622ee3af211233047"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk12.params_5\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"850f2a2dc2d1bf68dc7f4d2792ab59b53ffdced93a922477e00db515cde0fe09"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk12.params_6\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d775d07eed7417a7f2555d3b1663340b097dbb0db8a18eaa8f1e9776d6a32ef2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk13.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ca91dc0deee9c395990d1536a1148e71ea9c38241382a6081d52593de294a6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk13.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f98949b329a65c081cc9716eecb6bc4c1b3eb57762674d66a8b40f2beac3067"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk13.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35c60b8ccdcac392e555acfda007bc1efdd0143b23206b0cd3512c88bc902d0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk13.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f50bb4b71e90a31f136616964f73f556d41824e93d41743dcaa3dcd4f9e8caa"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk14.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2bbffd4144b6d737dac98a377e3fdbd14943c1571de4f025f18f49ebe9a104"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk14.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa412ee74b446d016f5fd67d95f22026d713e7b00fd451a1fceaa5cb3b8245"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk14.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7afc499bd12c932115db90a2c428c42ec38cc3b1b9ddb39acf04f9a34020340"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk14.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e22e581e7ff133f18bd5f561d20b0c28d4ec80c935ce883542090870eb5cd96"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk15.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b89f6a14bbf28508f072526f5ad8a2528c4d6b10fde495502bb5328e3f70f5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk15.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3589f51e6e46dc14d97f54d9601f2bfd9c9c72d6a06df95575ba65f105f9e8f3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk15.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d70bdacfcbe1ab424b7c3d5c856100935c9962ef61cf9189e4e2ce5a4db518a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk15.params_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eacb045fc3558a186d9394ade64053560ff88b89815bfd971112db23371eb40"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk15.params_5\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df17f25eaab3d16d772803e2385ae19aba363ca090b3c49ec6391b73154c10"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk15.params_6\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8369d47e533d22dcf3e49efabdffbdbd94441276cc600320fbf23d19106e2d4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk16.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0de3e8c59b947d94fb79cdcd406aaa71d906b6bd5678b66ea06334a8bcb146"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk16.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e687221c7db0c72f955a903ab9b23017d70aad28a667d76fc61eda6ffecbbc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk17.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4833ea245fbb58a4c4cab67db6d58670c14951542e7ab66c054145ef2f6d3f4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk17.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2df3088878cfb8be84d837e0974a15128477af55354e4c9a791d380a22c977"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk17.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e947cfe1ad35ef9243c9161e41a8ed843ac2eb1b3eadb8ea01dd00e14eaeae2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk18.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f1d01ce1c44b301c3d9b145de0396e503d7d7c5234795e2afc5119f147eac4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk18.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0337c94bd9920ddcf43b48752db6ea77918345e1b727a1e7f376744f5a3b633"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk18.params_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fdf3cb44dfc329f1f553c359a502062e775a7992b11deb7091d03865c657d5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk19.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ac9a437617d88c3ac5eb3a1761ed7a3c9a291a8dac281ece0c83187af6bdbb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk19.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3a6cf896d8ed52fd240f88b390dd76b949bdb22ec08dedbe5d2f5dfc35b912"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk20.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e39b717e87a5e26db3a64d935516b98693a4536c2b0a3596b6c0bd699666cf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk20.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fb9d772197c2dfea5e672c935ecaf1ec8a7d006c8535394c2f1e3527eb5fc9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk21.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a0365e8125508c7996d1a94f0baa1f7e3c22769b0be03c138983d8e898255c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk21.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f480c4ad7c2e8d2a38d048898db13ee84558d9a703255bc7892cbb24fc51faec"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk22.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5e664507c51a911f33ba895b621a5c6b5fc6aa6b394d3cff89fd556afa1f78"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk22.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99fbb8833d982447451c0151b9db670487b9312381f4ebf99914ce7343d0e69"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk23.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cba6f76358a15669dfdc9f5bc23473791c9b9b541d2650a189c6c4ed18704d2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk23.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cfb503e1471229a819c685d031e77949dc4d70b5683647e896286f8c7a32d4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk24.params_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abb56b750a7a9076a80ef75cbc3a3543a837e33d81eda7dad3146ad7d0c78eb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BankEventUk24.params_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/sound_bank_database/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"820bfcbd630c4a598d361dfe05cdaa45436930f070d09b25c7d64fc04d7e5e58"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060UIC.hierarchy\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a0751dd98832fdbec3897dd0b14b40c1f321d0b75ca85b549c2faf84bdd505"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060UIC.components\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57822519b3e3fcab9953ade2caa563bcf8be330c102539c1c0c89088516e74e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060HierarchyItem.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"57df10d670654f72cc493280e2c9e85b542e9c6972f200d0f9c1897a979784bf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060HierarchyItem.childs\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4515d7ada31f597a8f43ae5d6008d20387981332565f75c2db4dc333dbdcad"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7169c2fefad61f659b5210c63e0d7602289ee5b7be00cd93d2cd991cafbd3be4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.allowhorizontalresize\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecb756a917e82253b345d7d805336c046e5489aee0edd27edd681c6b2e3e487"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.tooltipslocalised\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6eea8fa6fcb8f9b30d2e600cafff5bf46a2415a6e5d5b7df0cd9470bcf26ce"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca29e994f4aa599a9b158e5c65110d7ea279e8fb45ca552afc3abc943236ba2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.update_when_not_visible\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f01037c5a5308baa2b45baf60aafb5d964240e6a88b810683f0cbb41a4de5f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.current_state\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9de85c9ce6a6bb325f7607ab4f45e3d689e43b7bbe07320abba5f77ad14bbf4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.default_state\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9881a6fd57780a35b86ffaaf4ced4490bef8d72f3ac61ef694ae0bb71c8d2655"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.callbackwithcontextlist\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"612e7aa5537fda7fd0b0f0cb7274e391a9a222d268e14d2c43c57b288a1f382c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.componentimages\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a5405d9a406d4f32646c9ccef7f7ae99144a709547bea3ab3e5dd4a0dde4ff"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.animations\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7489c78c3697f0d3ed03473ab96298a86fc428615433dec634185e15dd3fe07a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Component.layout_engine\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75afff7a578c2c600289b0ee525c5f51294e7764838a4173c97a75b9a20186b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CallbackWithContext.callback_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f2cc1018f9663c1871a6d516f659ded4694e883f4da5484fec7963e18a0515"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CallbackWithContext.context_object_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f5985a15f0a427c84a097d8dfa21b7c180ad99f7c16bd2e37ddb7a4586ed7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CallbackWithContext.context_function_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b3538906e6086961e14a55a1a055d91552200a1d7e65b0aa836bdc56a93f0e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CallbackWithContext.child_m_user_properties\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e03721916fb87399f44fd7b75acba09edbd67123668cce786b933c13a94d0a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ComponentImage.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"107f6ac0cdfdb6a27bec7fd112e49cfe31bb53625be75a98e867aef7f92fb5db"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ComponentImage.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"302db8c13d618c4e1313441976daf3457872db5728f1f83c71560d923658e74f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ComponentImage.imagepath\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6725e46dd3a381e3b02d4587749144f946cfb01557f36e72adda7092f0a8e037"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2df11be564b2f57414712fc9489dad0cb7764ad4caf78c89e4922c8af6ef140"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.text_h_align\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6a4c820baafc05f5021fe0b70701de5d9979aa05eb64db3d5ce8ed9640152f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.text_y_offset\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c61a83405890101e060417aa8c1f7fa4923a03e74021dd9a7d48c9050f73a2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.text_h_behaviour\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"489bb815f60641af97cc8763bf5d2b09bd8ee230c5464633e56b8145310e3705"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.text_localised\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31c04da2821c8045dfba51ef79cd133c928b0bc9fa489639f1ad00c19c71cc9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.text_label\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d601f90236e934a756c3cece449bc207c033b251fd9961dff91f1cab24c9fb65"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.font_m_font_name\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0edc82516aa759f6a77f0861295f3d8938e2d0e1f7d5f9ed6ffc0bac4bdc12e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.font_m_size\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c998d875efb1b98ce815ae545b43f66eb248bf2deb377389a9ff18b22f613b5d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.font_m_colour\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce76b79f3bbd5ca55650d372943fc2a0bb4f7fb32c669f7f3fbea8aea80d75f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.font_m_leading\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"af08c8f82f54bcf062e6e7e1ddd39b0c158b44b5a197d45689c24b0f7025ad3f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.fontcat_name\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"068badd913981662326fd3a1205c47c9ffd12afceb4b8e3cfdfc37292710170f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.interactive\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c1d153daefd5ed5f0aeae9cb23fd9a4b24976707e97563afdf6cfaab8ee612"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94dd26ce21ae9889ef4393e4c4e55acc8155ecf4688bd679db6b89f0f20d885"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060State.imagemetrics\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0c45b5704ba32cdb6174401702587c8c949296c731a499e85b782e269f837a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c8bc9925a5c88d68e2cbc5f78011ff909374314ff9ad2123ea67aa88217e9e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5603df56cdc5617692fb45f0c2dd8cd39d58ee9a08810b4ab4d8f88b4614b157"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.componentimage\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"22302af7171a05cf982f31f166e7453feacf4cfea71f0e7237535365179f5468"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.dockpoint\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5e6d76e9da302421b00d6cca0af250913f4cf9b0fbaabc70d78ad4e37a0011"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.dock_offset\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3de54d8e33a2fc0f12b34299e34dd19848f1d622f361175c0a55c79e2d268a2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.canresizeheight\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a46b38c66c62ff6a47b7c7f9543665b09d5ef83aa41d22b34d03d6e163b035"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.canresizewidth\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc00c49bcb64e63abbc956b3ce5e4081e3f952a75eb3dd5381070ae0f7847eb4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Image.ui_colour_preset_type_key\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"815097b4ddc28d04c64a2b0b33b086ea5b3755974432a13047bdc31e99e6b5ae"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Animation.frames\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c746fdbbd7b6b88d289997591918d8c194a0c59394a2d72099f0994a1d08cd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Frame.interpolationtime\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"797239a1644b27f51e54717d36918970f1b3b60979aa3bbeeb7efe7c5e0b4bc5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Frame.interpolationpropertymask\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f300ea0c37675853da46bcab9dfff27765b904ce68dedaba9f873afa8b78703"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Frame.targetmetrics_m_height\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ec57ea1c5e4783b902b12c66d133e34724b5a281edf61012916d4bb1be69c5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Frame.targetmetrics_m_width\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"51577f49eb68044dd050ed7d442394045dfd94921ac5b07ce5ea652fd63abab4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LayoutEngine.type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded6328251ed3463ce9b5377dfca5a2ea3cc2fd66849c0267c4485202051c56d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LayoutEngine.spacing\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f904b95dba8af244b8dd77a1342dfc6f78fa17fee2be912aa2cd66a823c37a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LayoutEngine.sizetocontent\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"64144d38eeacc82726f3d59a05f9efe2fd351e2a237aaeb3b3c48d0ffd3d0a76"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LayoutEngine.margins\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4447535390db0874c4a5382dc16c0acb65c22041792f64160b6ad2e26c4e0893"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LayoutEngine.columnwidths\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"943f6668da9260feacb1915ee566f90d3d36c85e7b7f0ad4afc77c75ed78f958"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlLayout.hierarchy\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ba81285c210379b0a3c0d63c1f9c459114c7ab1282a04921808b149aa12a50"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlLayout.components\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a122fd6d614fa1ff1d7dc9927ef89e90f996ec7a4c2599c3d7d2f0adc5107e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlHierarchyItem.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e24edca9a452165233bd79d6b5ee1edc3ca449739d4383a73cf18070935ae0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlHierarchyItem.childs\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae4eea5c97f4ada0cd6c68bebb1c3533a00fd2d75b1e0c98f7e55493c51329f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2793b9bb4bae0b6500783ddd104a31a8e32d8e5de086b536062d973ec902e24"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.allowhorizontalresize\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a787fdc5b1cc245f36eddb37c312be2ff3025f2d08154a5030e86b0f2776677e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.tooltipslocalised\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e085d1fd443354460b0e24595d497b8b306ebdc38932d795c70049ede884d369"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea3c9a72887a093391f299f05f35d6ef01e781b98ac64fbff71fee201e17cc2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.updatewhennotvisible\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"042e44da01c1039c3fbe0a655c2ba7d0c04d3fb8a9b2b4eb9998844318cf2852"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.currentstate\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce41ae690e8fc8464162b3686c84582393f0f5774aec95fc477539f17338f42d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.defaultstate\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9043da952773828975e9ad633318f39dca26d86d6462641538ed9dbff74a2c61"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.callbackwithcontextlist\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e1be261bd9866f3f2372d1b2c7ef915a270d3fe01d5b9933b3c07b72ac8035"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.componentimages\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553c650c684f03101feaa9f73842a91578735b1402705612259e7f248bcf67e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.animations\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f125da9d74ed14e0597ecaff32057a60f89963ae8448f67cdaceb61dad0629"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponent.layout_engine\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb836451c0f65d97a0b5cd5c878913ad4be8b7b8525ca51d767590f22157a50"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlCallbackWithContext.callback_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"745c25e3cc822ef2c65d9b54d57c93bce26330eaa26211459fa0c08ce98f5dd5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlCallbackWithContext.context_object_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b323146fe1c609136e661e48e6541f8d80d5ff5e6a95d4e1c0a9b1ffbc17f2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlCallbackWithContext.context_function_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fc934cda614ca00513d67f28f15f3935e60d71a832101ce2abce7cb365102b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlCallbackWithContext.child_m_user_properties\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"544243160ed314ab65ce1508cab4436ca0ce35d48f4702883f9c95bf30b3438d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponentImage.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cfa14c844db5cc1f3a350b22ce9df8aae51f8525ea131720be042f2fed9b04"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponentImage.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2efecefedae8f4da0b6bd5904367b84896d27e798e7a6f3f1e146b6b3ab51c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlComponentImage.imagepath\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"14db7145a128fddb604328022e1f418183bb586007c2402448598faf051aa1e5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e54e121230ff319bdd27e3704e8e1528f241ef1a8291341a0fd8e85e400ec3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.texthalign\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3966dbacc2e32b828571aa8a72344a550ec58a77c45bdfd48bf8790b082baf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.textyoffset\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db8228925c0d0c35109b35711210ce94fcf1f29de8845fab516f69045716a4a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.texthbehaviour\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"780e899ba3dab88b190fd8014943326aecaf9036c440ddbdf125f86a23b3bf57"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.textlocalised\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca2db298511dde502db97339d9730ade7b711562f5ef183e52281ca8ab17f17"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.textlabel\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f96b019898341b604879d0122e70a07b1cce0eb934295274a95848bd9f7f24f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.font_m_font_name\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b977cfe39c2cab94cdb629fa9dd061825ba6c941c44d1895bb864e9258191b1a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.font_m_size\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c027269bbb92c2bad4cf9aa6fdb896b9d8d0781411974f094346e9d2d6daa12"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.font_m_colour\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28d4f91dfd688ecc6d43314873cb04c4882d0dad94a40bd0055ba5507b92772"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.font_m_leading\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee62db2fc85aaa471dbc36ba9da71e73aba8e20d815d56a8a82a7de77e53573"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.fontcat_name\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd71c71128eafe192ab05bfafdc36469c10f9cf9650f3e29f511b71a5145300"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.interactive\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"500351525c436845e5ec99e8fa51a964a4dfcac55416f9158ef1bf8c0881c2ba"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8d88946e944b54d705fb0b1c75c1dced2d32a90cf3edb1db85c0300019c8e2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlState.imagemetrics\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6e6b966ae6ced08f727e24c2f7e2d27c0614f193ac80cb79d9a162c874076"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.this\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1351086619b494d1d3c7de23c3ab3bc02500a9130d75b6570086008bd48e964b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.uniqueguid\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3ba00f69042353f00f7679794a1f358605ce63c2fdf887de9fc2a5764139db"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.componentimage\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66b8deffd263304cc02a078316d9a56830c799fa766059bcf551b29c89255d7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.dockpoint\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"271b6e74ac8253b548240c20b113d081acd2ae2ca974b4e40c604cf8d12ff616"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.dock_offset\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eb416e99253b9847ecc439943a77b557854ae37bc371c300e52fa2d35e9ee3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.canresizeheight\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d573b83ce2e6ad1606819f9ba1107738a3a81de20708925951777a09d1a0ca8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.canresizewidth\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e670e54da715444e55ba70e509d254578d63160661c2798b48f69ccaa61552"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlImage.ui_colour_preset_type_key\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4334fee13fc79f3fe71e342fd74a59da1d2b02ea977477cc06cdd0d4c0f6f23"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlAnimation.frames\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d1819022eef7f15da95d85b86684d413fce44e2c740b78b7b7c7b83c1542ff"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlFrame.interpolationtime\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe9208cce9b1d8741332d64db281796ed66fbb6a99c9cec8ec4d9bf175ed7b4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlFrame.interpolationpropertymask\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf03cf76006f0094603db5d8a8341bc63ee35fffcb26c36d11e25c7a7db978f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlFrame.targetmetrics_m_height\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe63cc428deb98eb898e017661399203cf35db933c999315d78ca6d10b5963a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlFrame.targetmetrics_m_width\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be2584634b281364e0b505882551097e6c4a1b063d95dd43b2afc28cfa659a4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlLayoutEngine.layout_type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c313ab68f0231e91a9ea9635965591649e6d0ae5e9fdb3d380a618477d5bee"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlLayoutEngine.spacing\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fea5e6510b55a8ba641ae0eb10d753e58611ee9014b15b5dad8656140b8778"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlLayoutEngine.sizetocontent\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"466d6d52a88ccf529f81a1b4c0a504909ea7959d949a5b45524a4bef770ac9a9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlLayoutEngine.margins\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9c77a2eefca2712f104f53faa259a252d6d46e50931e07a2d42624517d185f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060XmlLayoutEngine.columnwidths\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/uic/xml/v138.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b8d692e21adcf46f95dfb715d286222dd0771aecee1bcaa73627e9a25686d3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ManifestEntry.belongs_to_base_game\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/manifest.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf12b8214d2a9ce65b37a96e28b2acaf6fa8af65eddcc317a2003fc7b78e3e36"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RawField.max_length\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"075f6db8957cf50af13f9e067d5e9ee9a5d800e7e6dd62ce1055b33fccc30c17"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RawField.encyclopaedia_export\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5987416bb2cd54503ea2db67a3b36394da05bb8ef093c5de3011cdcf2569592a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Element.min_occurs\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08f2351b5527e49a53610802a76319b5fd1849cec5660265b6ca6a1f660284b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Element.xsd_simple_type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"651b28f32510c4f73cfaa6812457af1481a1534f503507aa29305ee2ec5dfe5e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SimpleType.xsd_restriction\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2d5af19b12b9e514b51d2359b854763cd2f67adbd1fc678a026c55c3e20668"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Restriction.max_lenght\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee99faf43675f16dfe7cfe90afb19f462fe4635066c99900430e44a85af714d4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Index.primary\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc78c37d8575589f2dcdc93cdf07ca366f92881223aa7b53a6865276110ee70"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Index.unique\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27f1191d73cf204817862e8cc5c91b27cce72f3c107e4b4aef72c9942afa585"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Index.clustered\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"10617d6ea9b13d8b24671bc1097ca0ff699f6c80b6558776235f9186408cbdcb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PullRequest.html_url\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/github/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a978e62d826a88d9d54a4208f5d9d9672fca02a529c1015c7b0c96e529ee64"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DefinitionData._fields_processed\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41e5ec0ba8a852c7750025ec9272150bcf064c9cba652340f3277f404f75f7e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Tools.tools\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/tools/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7354e34d4f6d7209c23560d49a894fbb31cd0adec655d608f51274d2e3f433"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1222 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e827edacfa417d0a05c66f49744f43921e456f68fa3a8e83ad39efc3a76b2f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e0b278055e126a70c464b85e73e8367215e002ee1b59089109de9b089716e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1288 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb0883132027b4426d4792f2501ad63bd09daea715004583f3bb4647fc6dcf1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1322 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef34b6ea45a9c953ab8852b5f1226717306d7ed21e98e779c858d4f26c6fabfd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1632 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e486c51fdfda560d7aedc7a2cb6153c9c4a92ab7756425d90dbbf9307944fd69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1645 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b9577d6fa70be6acf55079660e643b6204b7fba92a7c53c40c69904d7848b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1649 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/ceo_builder.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"911fdec308f3574c4e0edd21e98d88461c9390b03560189f26f0a02e296c822c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 197 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/main.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b4d86e13cc49414f7b9c93819d734c8644230fbcdd10f19ca7177768b548ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 201 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/main.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"300b66774cf25f1132c6f7a51e60e035703968b45f69a88f27e5476f5fb8bdec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 248 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/main.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3033e9f8407fbc971dad770ee926d17abdf863a96a3f60de047f2de1bb4f4931"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 93 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad39a6958860a1fa02cabbba70f2dac92b93cbfd16dfaf925acec13c6803bfd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 115 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d0fc5d2b7dad4e3a46bf95817e094c9783f32f1d0dcfb5d104abafa770d88c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 117 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d052bc9ce24a238568e0b9ac1cdffa277017cbd8d62ea990aebbb3efd6c910b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 183 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb1942a1e7aca462b3ce77b26cabffd10cbfca50e731ce39f06b988980efc05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 207 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"744a6032ff858d795830a7e064b816f8cb31c826c53cab506af491294e7babe0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 213 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"596bbfa81a81b904220a9bfdb5f15c1b5059668c80237ad07978e51b151fe87b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 229 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a698bd97433500c707a91ff18f2aef26d768712fdbf076a1180801192ff72f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 237 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/server_websocket.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2fea09919565d76acf671223636a02e974a41f0f514d38e7356f7c74b9d3fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 213 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe73f7c46e33db929810ef4a4b172f572f2b89c2565b70d061e7050c11e49496"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 215 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedb26f83c20da2ab71914ad012fb4a8cfdbf2b041be369635a88b210fe5d868"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 219 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"282a4abe00609d49922a813a9bdf1e69619c1c60b8599bbc05ba24d75f3395d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 307 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c23b6b28fc5b532db1264caa29cdde20885c6f88f5f252b69e47e25db0af58"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 310 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5050fd3f3b7e848b0e4deeeaa58ac6004a556d74d0b52930511354276510d7f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 382 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9d8626458e95179cbcdb75ae14433ec5b0c417f0d0984bfb8269265efc2e4c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 393 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"445f60e19c4b9b57974d3ca2707070b7770b18507b35e0999b7d1f854f445251"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 536 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d28c79b4b6c7afc0d968520d9137b6f42b1259a5944ba778dead24a8fcd68f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 555 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f252fa681077d5cd66f668212986e5fce5fdf892af8b03e7a91ef4b3422f30b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 583 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcb8ea36e369b33f6687ccf58d11f834b844764f0d82dcf502583ab14a7780f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 615 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8124ef387790495bdc75346257f083a24bba628dd6550ff43920c0a2e5c4c81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 642 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/session.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ddb51d670500dc4562affbaf0270c2eebc3847db303000d642307e5a4df904"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 311 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a41eb4b30d5605bd996ac830b207aae403de7f522c90dc254d2ae006eb26de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 488 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/packs.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f298305c80ffe50b474fc9dd8cee1906f585ac70e00698a0cb8debfc5340d715"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 498 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/packs.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b114f34265feeb52c9973ab2c56f59e80313a7eb60c6ee9ead0a6c23cda8a1b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 248 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84b2019d86a8de69fe5436aac7cf7d1c50498044f2f272116f909d5a61fb5e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 316 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c61d3f1ab1230b87c3e2233c8c949adbbfa9794799d3c41b8d686f7db0048a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 406 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51d4e4a71c4c4ce141fb7fc5687a5f17963735feaf6a6d00730f179f6628352"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 420 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacb04541e701374cd58edfe71d2e48d01361d964c71727defceaa0608dc6550"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 422 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/tools.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb34fad10ea8b724e488e0169e53dcee2d8e0ce075b687a8422c73b1a45b1f0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FluentResource::try_new(String::new())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize_empty\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/locale.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d051c9acfd1365ba3c14011c5df4a71bf916fde43e148d1a4774f9b77598ea0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bundle.add_resource(resource)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060initialize_empty\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/locale.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2bdb98edc5242edf9b50720fec9d7f38124992606d3fcd57e94df75edbf4e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_available_locales\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/locale.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba23adb69f155dab2772a3bcaa02d113d5e4b67071754539cc67cce974abbd2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Ref::from_raw(ptr.load(Ordering::SeqCst))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ref_from_atomic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/utils/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"695aa803062a0609d08e523b052ce1b272e5e5abe751a1fc12ce74d1f3289477"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Ref::from_raw(ptr.load(Ordering::SeqCst))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ref_from_atomic_ref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui_common/src/utils/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f81887a6dfabc955f3a46b7b84dc969de4bbc443ddad886ce86d0e808f8e9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7f20b9df259b69e05ff52e18c92aab47c1b678400995a0c25da7d066730ed7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stderr().write_all(\u0026output.stderr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f0a0ff0c78152b8f4b90b3ef2c3187942dfdfe234590ebfdb35d5f57a50915"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(error.to_string().as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e9d194db3fb12e038f81c6f8a1241d5fcc20964ce2288dfce7fd407b567c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(b\u0022ERROR: You either don\u0027t have nuget installed, it\u0027s not in the path, or there was an error while executing it. Download it from here (https://dist.nuget.org/win-x86-commandline/latest/nuget.exe) and drop it in the root of the repo to continue.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a705d2237087343bbef8e4753e0bcd511aeee991b41fcc0451ad0618457c33fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8befaa171996c2d2dc0ea2106275e9e4829e3f41030343509ba3dcedee59f97"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stderr().write_all(\u0026output.stderr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b522c2e5f41e7c774942eee17798db41768915aea5c2577d6dea6a709db4a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060copy(renderer_path.to_owned()\u002B\u0022x64/Release/ImportExport.lib\u0022,\u0022./../3rdparty/builds/ImportExport.lib\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a823e12aed2d4d8872734c7469c37c6c9a48a228e550b0a1bdaf12326c15a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060copy(renderer_path.to_owned()\u002B\u0022x64/Release/QtRenderingWidget.lib\u0022,\u0022./../3rdparty/builds/QtRenderingWidget.lib\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"92427100273c7e2056796d1190c42b1b7acade5c5a7d38514ba0251d61d32fae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060copy(renderer_path.to_owned()\u002B\u0022x64/Release/Rldx.lib\u0022,\u0022./../3rdparty/builds/Rldx.lib\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1993456fb5bf9516bd0841bcd442ffe633ac0f1e4fbfe82b3ed40b6331dfc93"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::remove_dir_all(\u0026assets_path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2da9382768f50c46a49a0f2db9fb9ac7e852568dbc6a7ade6da4429b56700b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs_extra::dir::copy(renderer_path.to_owned()\u002B\u0022Rldx/Rldx/RenderResources\u0022,\u0022./../\u0022,\u0026copy_options)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d3986199e4ec5bbb12e8792e691e0408cd59a5f55ed7f0171c588d8d295732"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::rename(\u0022./../RenderResources\u0022,assets_path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"941d01c77bdbb98ef0eaf258a77c0bb49bdc6b87ee7287ce7fd1999fff12c60f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(error.to_string().as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"492e882a931b643def49731f4e57ccd6309f4afaaa2cf8971ccbe15740c386ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(b\u0022ERROR: You either don\u0027t have msbuild installed, it\u0027s not in the path, or there was an error while executing it. Fix that before continuing.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca62508a2bb09414071481ca34815e6130cc4a0098d7557584338629f143899c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e67eb9962ef791890d7311091a315628609c4db28b401e44c319f1a104689c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stderr().write_all(\u0026output.stderr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2aef69e1a9b72efe343b2cbf6a7d34c6a2ec516517ecd1dfa1d940ba3aa518"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(error.to_string().as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b749f2e6b0dff4d545c19b675ef3c59f6d1f242df89f8a4400c02261ca49b5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(b\u0022ERROR: You either don\u0027t have nmake installed, it\u0027s not in the path, or there was an error while executing it. Fix that before continuing.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"addd9c2385a56413092ff82bcb21f067c5698c02f1969918a41bf170019fd237"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada2fa89a25b1b9efdc362c6748d2e60bc6529e78446ac47ba4af337d441ef3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stderr().write_all(\u0026output.stderr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a63e751e62dd270ebd0b44afd1795ff6d1b407c5e624f704e83581f44f9744c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(output.stderr.to_vec())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78cacf68b59ef74fc21e1c2a643ff958279d8177753c32784637a6db11b4cd9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(error.to_string().as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b09639f77d6feb07682b0b8941ddf19871bbd44148067ebacaf510c669a22b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(b\u0022ERROR: You either don\u0027t have make installed, it\u0027s not in the path, or there was an error while executing it. Fix that before continuing.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a79473e2763e2a8636a6d85955ffc07198a9f53e0c999993164276891ec59e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8482771c85139b24a8a452276a78a1b62f0a75a4d1754417b99dac1b4d57a0c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stderr().write_all(\u0026output.stderr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9127396261b6b457af54354bcb66ed8dd13152462ac13805a9e903df669aeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(output.stderr.to_vec())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"55908fc88f9436b5126eec4a5b142865d6d890c29b61d0215dc0331243456cbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(error.to_string().as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f527633c8812751397fa90960aca66093e8eb833ca5a9a5635e1e3b632bde6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(b\u0022ERROR: You either don\u0027t have gmake installed, it\u0027s not in the path, or there was an error while executing it. Fix that before continuing.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a9b2a827f88bd38257a66f33067f05ea35c135f5455304b14c3d234c05a7c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060common_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5323466ed5099effb5f7851a59c4bb95fa692c8b260319a53a6ebba9fef3552f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stderr().write_all(\u0026output.stderr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060common_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce5bf76968e3f7333ef0cc665a3c961a357e1ed3dd9590990c765b52c7c9829"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(error.to_string().as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060common_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0931aaa31b738c4505bd3822ed3b20d3169523ad29c808e0f3bd0baf474cce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdout().write_all(b\u0022ERROR: You either don\u0027t have qmake installed, it\u0027s not in the path, or there was an error while executing it. Fix that before continuing.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060common_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/build.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf0e301568b66dd9b4818472f3f61f203edc96dc9ba23ec6e1c231409b8b27d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Runtime::new()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/main.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa78611ba898f18c43ed2b4c6c155f37770000ef3d9d20879188ee3c86f761"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Logger::init(\u0026PathBuf::from(\u0022.\u0022),true,true,release_name!())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/main.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4045ee4ad717c1a531af113f5da3c7f4037e8c07c090edd148a37dfff03bda81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_recent_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/welcome_page_ui/mod.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc0dfbb6e63fec2a8232af6a90268476d0892df0080a515f15d1678ddef371e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_table_view_profiles\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc888856427944e9408f3bff9ce1fbe741d1af84a0cee1c2f0133528551665c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060real_cells.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rewrite_selection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"9231608368f70f1ab557586f685200ea1056e523a6d283a83b95b48f0bd63d62"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060real_cells.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060revert_values\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f17d73a783fe705b4ff7c6a89a2efc0ea0427911d9ff1ffc237111be4befee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060real_cells.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_ids\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"5745494ecf5091b56cd8d2ba88eb273d5f25b8125eb4c8d768d06c769faa718e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_data.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_indexes_as_lua_table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f845a63f32a2dcd0ecc47288903d3f9efff40260dd047e5a491db679828cc236"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060format!(\u0022{:.4}\u0022,item.data_1a(2).to_float_0a()).parse::\u003Cf32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060escape_string_from_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"598435d5e5fb9a1ab2a62a7e4523e064c3e39772443c692e1f7cf4ce94b77256"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060format!(\u0022{:.4}\u0022,item.data_1a(2).to_double_0a()).parse::\u003Cf64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060escape_string_from_index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87c647ebcfc35fb7613de126726a908ebaef825adf0eaa908dce549733c3767"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060real_cells.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060smart_delete\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":2951}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2602938a4933a3bc6807df77bfe7ef510ddc5f7c5d0a2e57ffa286a30a4e0c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.table_definition().fields_processed().get(column_index as usize).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060patch_column\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d372e2674f687c3b8957807ebb8572c9206f905b611b71ae6c8e1e5a1a37a97"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060is_reference_value.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060patch_column\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/mod.rs"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bfc66ef4a66d91dceafaa843610daf9d462979316bbbd31d8cd8c79907292b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060qlist.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dec32bd33af0e246578a90d460a8e9c38ab8a7512ba5284ea9f8fb5fb8397f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data_str.parse::\u003Cf32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_item_from_decoded_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"4440cc026eac3f6673627e26eac0bff2433d97a0dfba32e6557d561bbe390a6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data_str.parse::\u003Cf64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_item_from_decoded_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"72aaa8c822c187915028acb40851af01e52211dae8fe810e13bd2687515c7891"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::Diffuse)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b420e139f638df516192e849c2d514cdb915fd41cd62a18b97b843211b8388c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::Normal)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"7843c335e504a16d55f47ea719af65cb5319c149677669df7c94dbe1e5c58e98"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::Mask)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e515c8af8f0404a4c38d445d9ec2d1c531aecc866d530137a617d95f4e16f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::AmbientOcclusion)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf1da2323d9de2a361f27f0f41f8395766af00eb4dab182face282818224688"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::TilingDirtUV2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ecfa413a7d661e29cde1e8755b4f13a44b636db875521e5ec8ba35275ec3b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::DirtAlphaMask)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f31ffd151b903fae43e6ce431bb3c9af5e3a5bcb7b4f0e2458b8a6f8c1c491b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::SkinMask)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0fc01efcf0b7b8af26b67f4c556edd0bb8ccc5867f9103ac76b1feef5efffd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::Specular)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"93867cf3615cace7045b7a62cf1a089d5e639ed10071a46f1db9249585269117"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::GlossMap)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb89f4587a1ded04f1a99ebc1dc2f90f258aec0fa41fab53a0b1dd12ca21b33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::DecalDirtmap)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e53c5f3657eb3e2b158cb0e13137b1acc25d00a895e73933dd4907ca6c7f5fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::DecalDirtmask)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8872486754889a7761f455b5679314dc71b474b20d79d1d9c20a84ee0951754"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::DecalMask)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2529de4f3bb098c99c66399569b08fe56cce2d3330aa93cfec43dcbc40e40f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::DiffuseDamage)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37b8c2983a1eff1f5c89a45f52d4f6cbc8a9a0c220b7de205c1a98d4ef96a00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::BaseColor)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9172e44a24c20ba149262ae3a5b61f5becef98d7ef172b5f18576fddb7aab2a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(TextureType::MaterialMap)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture_type_strings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc26b7762de055c6462145952d6f43e355f1a65c000e4cf7db6abac6c2a84e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026main_widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,view.data_source.clone(),view.pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_subtable\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"167b673608d72ced565c2773192c5be2ee1ea7efea741e3d674dbeab0e803ff7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.write_u32(table.data().len()as u32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_subtable\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/utils.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eaf57b68be618198dab517af5568a28abd0098a5a26716943263738932e5a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matches_in_filter[0].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_search_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"165dccf1155fc2b0998e35a1d34a6142ba9dceea2a7d3717946d45142d582c65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matches_in_filter[*pos as usize].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_search_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2721b75ef31e191230543957efca0c8e6ac96027f813def9f3cc4aa24391a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matches_in_filter[*pos as usize].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_search_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a7226d1450854497a1bf56c70f5abc1f14e4382e832b5c857f9606aa7b8a0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_search.current_item\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_search_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"719189fd4e9883e95df76fece448d744c65a60c361fff7e446330776c037d987"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_search.current_item\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_search_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c4ec5d66b298dcceb3848d4659bbecce5f310473f4acdfad6704bf49a14578"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_search.current_item\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_search_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ccce10442c45eafe1587cd11bcda049a2ada2b0b0d119364d2bc310a611c45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060model_index.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef60ff9ef85a22b8fdb605e09dd5872e94a1a44af4206cbd3b900bae75ce60e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_str_as_bool(\u0026replaced_text)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d7701a3da85588db71947746dfa56710903af335cef18954a5e00a65b696cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Cf32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"996bb0203aa44dd326b73a364079191170a02a9381a471e1d4f184bae90b5a8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Ci16\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca578339589f1faec85a423961d6a306f4ec39464a73f8a75b79cac1743ea546"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b0f5dbdf4d03d0c0772b110f410d7207898a406873c4d743eec84977008c94"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Ci64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f143899a086bcd58b4249a2601fc31787afcc2f801971e1a01e8d50f2849d99e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matches_in_filter[pos as usize].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_current\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ada52b0d490aaecae222aa14fd31ae8f1d158d0efa0c3889ab185ff2ea30c0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060model_index.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dd8c5238f45695100df8a5cb578f98bbfe8ea206cc97997b83528c24886a65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060model_index.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f277a31900a6b5770f994f50f7de29968a05fe1c9dba20ab80cbda0e7aa0da1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_str_as_bool(replaced_text)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe1ced0e40d1a65b4bdaac7bb033cde866ba387bccc0cfdbb710f198a5cd994"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Cf32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5036b1b5a792c6ef04e311b75804c47187ab9e0d1c929cf5eda6e1c6a6e84a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Ci16\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffd2b8914688bdcc1af226a39ba47ea9bcd7f4426f87a234564b93aefd10e24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28c58b6a33a36d2f472cbd27d8bd66bd9aee4262f9a5e34c7d24baa4cc4780c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced_text.parse::\u003Ci64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060replace_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4ea0bb09620b0fb0c6723571f0cc4ac316af7cc70fe4eb9d31abf82a167d11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pattern.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_in_column\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/views/table/search/mod.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"3610492ec807f22ee507cf1e17459df2045854dddf24ad38f38ab1fff3111f9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/updater_ui/slots.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"047d349eabc9301cf17e7804b09b19bc41b2bc80bae8ae8d2579358b73132985"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SystemCommand::new(exe_path).spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/updater_ui/slots.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9c733329845232f7cfc38eae895983e8d06481298f57d9a137da2879aed5cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060folder_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_offline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6841e8740fde4effa0adfdc8cd1b1cd00530ee4750799bf5f5d7746988b969ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_PHARAOH_DYNASTIES)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"784696ead086c1ac051d9f40daa39b2f4a58fdea553e1bb56dd7a4d8f3c63d39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_PHARAOH)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"274d55cb60605d9ef93e37ddef7547e284f2c8c95aa6f6e06c617e63e89dfbc6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_WARHAMMER_3)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7119796645b9254bb6da522f619ddaf0ec4a813d416e68c6e67e72481df7c1c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_TROY)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f1b12a995cb1849631df61f4ab0b8cbeb3eba52ca2a73644918f28ef025417"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_THREE_KINGDOMS)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9dc75c2e0103d69a629561b31ba7ae4da55cc85a8adff4e333b1ad9bb6fd59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_WARHAMMER_2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1696484f35ad742e564e24ff88c2615a158df2f3f56d05b39047b5cf91ec8157"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_WARHAMMER)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"605debcff8533a700ec8b672b2f97244d9be553b1448b148b341384e6d37b53e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_THRONES_OF_BRITANNIA)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c7fd4d0df081cefb890361921c4ae490fbf5f8800eea5ebea6ce801b3a9af7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_ATTILA)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b94bd44aa1cc43c24f7958cab38a89fa12bb5c0ebd95dd1d1b7ff7783ab1eca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_ROME_2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"192db43cbcaf6780c32338d6f6d08ca98ab9fd8e45981de0ed80cc31562ea5f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_SHOGUN_2_COMPLETE_EDITION)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1414b86cb753fcd100c61cf8b95982c7481ef6d68cd26ef89f9f5c96f71d4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_SHOGUN_2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4963063015b0d4b932a7104a092a56a5fdbabd2a8a841c802b70dbe28aa5a07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_NAPOLEON)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a08add3a0c1cd16f1c91bd95e46e0bf9cbc3a116d17da34b1b4b087244e7e5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_EMPIRE)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"18adc61d468519e96a84e9652a9b067f3aabb0beb0578f255ddf8e1fee63504c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_ARENA)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ui/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2800a37f62afcba67f7d516411b0016415f1f1a103c6d8bf2ea757184a7c42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(definition)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_definition_to_detailed_view_editor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c8473c0eedc39d4e83e4f152b85393d08c7c22ce449cc2d08e1c674eb6edcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(definition)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_definition_from_detailed_view_editor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd0fe49c4b1ccc2bef3414087543ec2dc9b42c84001aa9b3d1d34e22d521ec3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_keys\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/mod.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9e73d3b160b0f6e33c9078b47c2edf39639af8025a7d3ac1de35b4e23abd70"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026self.unit_list_model.data_2a(\u0026self.unit_list_model.index_2a(row,0),UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"724562c0487a0f76ee4bbc28beb808f29a7a0cc238db436b1feefad211dcc1d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7f5ec4160033e89a0a857f73c1575e92185c810ae9aa1d14d4352387001dc4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c3abdd1f47095ce8491ddaf8f78c6bfa61d7996cd292b89c3d487e4228219e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"600966f08a277d4ebeae782a23e00f3063e7140863fc111bdb6bcfa04cac199f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_variant_editor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e702a62b77f3f25a2b40c05327ebe02d75e68d1cdc80f769590839bde7cde9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.tool.main_widget().as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_variant_editor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42eb68f1dd23316b1f519c8942638af9012d3e2b37f95ed00385dec0e466558"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ui.tool.find_widget::\u003CQComboBox\u003E(\u0022main_units_caste_combobox\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/slots.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a337713c33179c22a9f1586d629b1640d3c435c3a105d17f55dbdf6ca988cf17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ad70fb02d835d4f505abb26fd4f7241e8cb5e4d22fca924d90b805779833d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_unit_variants_colours_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f639d00f6d97adf8aeed63a7804e36a396655648a882cfb0137fc7e9a635541f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026unit_variants_colours)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_unit_variants_colours\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c239f4ab3e77fa7624485a6fab70f8ef72a65805e8ddaf8ba1029c9fef85607c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026data.to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e803ebb3506a6148e20818207211af6f719e07468e1b0cba88ece8d69810c25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10b865d925e0efdecd2a05858d39820a34a019e90c88af5f66a0854e547bbe1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"342f03b30d7506fae712dccf087a4d678e34950f911a9b58401c74530eb48b1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_unit_variants_colours\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"180412fe17dc111b1c3e8bdaa9e3b38830a053b7bc87771f9d0af943af014268"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(UNIT_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_unit_variants_colours_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"090318f0506ecb61e78abf72bbb4d55c48f3adf386e9899e43f345b4f043e6ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_unit_variants_colours_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/unit_editor/variant_unit_editor/mod.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3063d8cf07a9da20a1bbc6e09e1b76602365426e787a12171c0de93da4d32de8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item[0].as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ask_google\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/translator/mod.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d611cc597087f0be47f8b658886790fe582ca1beb2fcda186127efeb5c70cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d398bdff6125af6a1694407d597900d5cbbff005db5a1598d93801353bfffe0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026self.faction_list_model.data_2a(\u0026self.faction_list_model.index_2a(row,0),FACTION_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"647eb1a54c4a30e63e5b17d761920db5f669907da0625906934e200bbf5fab04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(FACTION_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5048c4a4d765bab3e146cc49b588adf6b6f157cfe76de2edb6408a78d90276"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(FACTION_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"df21dd03ae95a4ac47886813a7b5c5671d496a97d94014d5bcbbc7187d06b297"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4e1e7b77cd9d401430e001a30565327bfb73543e7dadd13c826470d1a95204"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(FACTION_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060banner_restore_initial_values\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a3fef1bea192c53353279d8502b54fa1173df77780c69ca89c64e43b667bee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(FACTION_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060banner_restore_vanilla_values\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8af2c7b78060475c8a5b11e06c37825dead7b8ab601b8ee8fb6e53848d0df7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(FACTION_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060uniform_restore_initial_values\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de1c304619043419338821c14e2d8bda03b0ecd348fd8ab15c193aa78ccbaf2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(FACTION_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060uniform_restore_vanilla_values\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/tools/faction_painter/mod.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"531cb03aa0234e562ae6100e450ddc1cd07a0e65d7e3eca2cb94561ecb6e0b59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060model_index_filtered.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/references_ui/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"892a5d45bc7566508423b43d15ebefbd91bf06f68c3e7478897cb6dac2d2f6d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060selected_items[0].path_raw().split(\u0027/\u0027).next_back()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_rename_dialog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/mod.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"932fe3ee6871479f023b265dfc62a0e81b3a55ab9c4bc8adab8682cb3af8c9c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060original_path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a534419d8776e5deed155ac6f427c562ce87ad7838613d6535153fb8e4c8db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060open_packedfiles.iter().position(|x|*x.path_read()==*path_before\u0026\u0026x.data_source()==DataSource::PackFile)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f11d1636faa9f69e916093b1558b6dcd854511aa14292df57205a208162b08d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_split_before.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7851bf80e20184cfc2cc1f662779a6b4d13c889fc26d39407e06ba9a1ff07090"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_split_after.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e5fa871a752de47734ca53e1c9ed068b28177513ca0fae193beefbbf6e1754"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Path::new(\u0026mod_name).file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfedda641ae830be67c9d8ec1000aa98c00d3ace210c3b548859a0d6c078493"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(\u0026assets_folder)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0a57937c56471d9e2cd7de45712c27a70de6410848d8da775266c5f645acb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Path::new(\u0026mod_name).file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ab25543df56989375c9949aa23689a5f3b4f8c5b300b58b9c2030f84a007be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files_from_subdir(path,true)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab89931b6892f39ef7bfde2a7784d9439304755c04ee8f4d23fc8634bf967b27"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(\u0026assets_folder)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"99762ac3270a552ad532f36bf86a1d35016e5ec1d65e119edc2354f2dd164a02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060original_path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44fc6bb3377d48caae1a647653c1e9fd647ef3ffed1d7489238d5eff7a0819f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060original_path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a288c029bd7c600944790e615ff792e4f262c1f8302c0d910b14a240f85b12"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060original_path.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec48e66c650a9183e82258a4e123f738da23fb5d5390fc3bd742b8919d177469"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060open_packedfiles.iter().position(|x|*x.path_read()==*path_before\u0026\u0026x.data_source()==DataSource::PackFile)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1870c2e09004e73365a32180120174ea591d6733033cfdd99a68d26ca1576e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_split_before.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a3de8d13d96df9418cec37c9b4882d8395b71c0135ff7541d6d69bfdb80c7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_split_after.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88edcf9b97d66944dde32d9394bf70c086353cc98947bd57ccd42a7bdb69fa3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pack_image_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa2d4d8e678d74d4b2ea99ffd8c7b67f587e40e6039ef399a37a70dd463d531"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7b94f7b4275c3331ab1b54d5f831e7a4fb547247e98dfcbb66ab7a10ce024f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mymod_path.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"e287f7920e78edad1efe1bc4c6c4f2af099bd0b0a3cff9b73a2830675494f87b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Path::new(mod_name).file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packfile_contents_ui/slots.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"76876bfcbde557fd0096777dfbe09fc3d77bad5fa398649b03cc85ee9a8c6bd1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.get_ref_table().table_name().as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a756947f54d4a4fb8457134c4fdc4b81e245b90ebb8ad32a7a687d612ffd24fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.path.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060reload_render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/vmd/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93036859cd6bd36f9c300bcb1ca166974d5171d8b56f1361da9359f9f88b361"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84017c34f517b43b1aa236fcf3642be917924c72eaab51b1fc44c641355fe90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_entry_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5706ab79165bca91830c34b54e12ce627ce20d6c2d4bcdc53d92f498cf9ce4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026variant)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_entry_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c61c5f6be5b69003107257be54439e471c072f67d3925f826a73034f721f8a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_variant_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa92e807450a2f0229d5ee0238850542d81e4cd4492d2b5de2dcec7c88c0ea5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_entry_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f4c3d6a6acf49666719f114ac5a52cff9233750502d7255430de199fedbb1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_entry_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08627d1fe048f8be5ffbcccfd9257de6031801f38479a21d8d9f2f7aa659a55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_entry_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a271d3ca3002b5303efa48421dcb17224a27d6a52370eb226d593d3d5a58a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_variant_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e98079beaf40018c8c70155f9e44229b6a1b6c12e0726dcbe3a8790220727ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_variant_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e9898f7768da917fd5b829f49543c31922575c5149370ef858a6c0f63ebf72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_category\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4f7444015d98ed97ac1e7c3ff688e41a3d3a2fde42a8e03d7e15b8a3ae3163"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_category\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ca6ef0ed6a6342b3f01ae400189498d51dc77b2c263e9e8bfff2d05e1d9820"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_category\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"46997029a3140224ef73ae6bea27fe18e86281f27ffbc888bcc49ec1aa527633"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_variant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abcd714976a7d60f80ea2a7d330258806e511622905294530cc39645a8f037e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_variant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"f129e1c47198a25ce62d3832360ae7278906ef3f8e21ff69e36335e4f3977ebe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_variant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a87e0bff78f00a4e86e0e5c77db79c30e809d154b26817c4d811bbec03583fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.main_list_filter.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f42e1657931cd8b383d5471cb94dc786590d144b46398d2be5a2cbf6aaeefa0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.main_filter_line_edit.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e749ca55650b1d0f969c173588cb4bc77ac480d8605143432ce3d4dde77e6b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.variants_list_filter.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7029ba56569f56c5d3bbcb8dddf728a334baa4df5356c4d5c9a5bbaf88d99e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.variants_filter_line_edit.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b400a2bd1ace8a20f0b80e6334e00816769556224d5c145709099b9bbc4940e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.timer_delayed_updates_main.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"72136ba045ed1a459b5e86a28f67ca6ad323425fcfb92fa852c525ce5ba8aa93"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.timer_delayed_updates_variants.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/unit_variant/slots.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eedbb4929e505c7a89abb078b595e25784c618ed3bea7a92649e16eab633db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060indexes[0].parse::\u003Cusize\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386c45fd9a1ea86986716df0e98ebbb03a55020700783a3e5c5d0ace834bba9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060indexes[1].parse::\u003Cusize\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b659a308d665a63de4119a805abe944db1296206d16c7f824e3d2d0baf3b54"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060index_str.parse::\u003Cusize\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea37beee0b276bad09abab9129cb2c33134eb285c46f82d2a0e92264865d3c03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(t_type)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57070f8ebb06256f651e77ba0cd5ef452d7862d28210a270573a7688cdf4ee3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060indexes[0].parse::\u003Cusize\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"def35a4fb90cdf15d265b3b38ebdd89dd1506014a13425443fdfb86673d26074"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060indexes[1].parse::\u003Cusize\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e48e735f8a8b30411e59031f2f6154129246ee8e44fd440a0990faddeed77d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060index_str.parse::\u003Cusize\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84ccef2d069444dd2aebb80c811f7a63356a5bcf0fe2b42bb4c46c8a7bec98d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026self.textures_table.table_model().static_upcast(),\u0026self.textures_table.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f928061da3d49df5185bcdd3ef3c5fa637bd460a1ca84ca5b254a2a65745e20"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row[0].data_to_string().parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a5752b7f746816a2929850e80de37c0907ba0fa4212d103497ff4b8bd64d5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TextureType::try_from(row[0].data_to_string().parse::\u003Ci32\u003E().unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/rigidmodel/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0726ac7f0d47ff46be0ce02515bba17dc1992eb89a35446918975d24af136562"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"530f6059e4fbd9d6e59f92f30e55cb287e4c98c44505207c31369922064aac46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_entry_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a36c9057102601d79be9c4481fc632927f5b3a755fbb76b6523dc2a778dfe83"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026variant)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_entry_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e0304b9778dfe503f77133eb638b4907e1b83657ae8ff4b18152ea2dc1a7fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_variant_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a63191ccc51a56d1ac01bec1afc8f38a626fba9540f7bf7622061892bccf7ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060byte_array.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_variant_image_to_label\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a60174d548ce24d8e456d139bdf5221258caa933c06b225002c751807ac512"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_entry_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85354b35706700b7885098dfc1ddbba187b1db137bb2f7c66d1e4141fa97e0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_entry_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbb7afe22c0539c5acaa75a47b23f4e3c21cdf83852e4d4de03b1720abe3cda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_entry_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67b5a7f46933b998c30c2b4409be6ec42601d5b1f46c9d226cf43de6d27948d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_variant_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94bbdaf683dfa8ee2f2307eb89deafa699d99ee974b5774ed8af58bbe81ad19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_variant_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d2b69d64130fadaa4f8f75edb4aa5a801199fadcbddefe38f6d8e0444e38ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026new_entry)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"718b6174ee8b3418356be36c03f50ed8e87e530c490eee9cf469b69b7fd7effc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf40cfdfbcc5c7316209e6de51d97bdbcb2bb812d51a749fb1cb78587cf4540"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"670aeac3d7328a0259c956d0b3f748de8fe686c3216c4292566118d599105fb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026new_variant)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_variant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"511141c4d5573ccc1380005dd37cc2a3b500775177050ff97e064d64866bfb68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026index.data_1a(DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_variant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95b60bfc4ac1aa4b80bdfa4ca4e264b030ac17ee1450d1cb2876ca536eb24e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clone_variant\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/mod.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dcd62c06ff048dc9588e52757fe9a49e2b3318e38979f2c9cf382e6146f287"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.main_list_filter.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d23ffa4f6c2965bfe3a0abb6d21f3a81db22b68f62c167ae3396ce656484113"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.main_filter_line_edit.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b45b381ac6776261fe98ec1c32ecbb6a7c5199c1949585956b4acecba97dd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.variants_list_filter.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"89547acff0e191b978d52f6358b1c1053694be1ccfee086bd10ddebd4eabc223"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.variants_filter_line_edit.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"26891132ffc8ece9e4206b6847f909f05a9105d533bd348bbb2787354acc385a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.timer_delayed_updates_main.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d593048ec0dc629926fc027e0b1b5040ce9e4af1bf8477533aefa2f6bfba4acb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.timer_delayed_updates_variants.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6baec9da51e4955da4cc3627217175149d1e8f7774673b6f0fd5edb0f1512f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.timer_delayed_reload_variant_images.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/portrait_settings/slots.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec1075f5d99e57b26c01b33c445b37f33bf1cd7c0f56e6675262afbf409fe47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060byte_array.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/image/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"023169393044093d2e9d05418df5fd925000b52dd528913c356e1b9863f44a1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060byte_array.into_ptr().as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060reload_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/image/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dfd3b81970103475c0cb0fd035fdffbf3e7334a32ee2e0780f70926f9f4007"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(1..).map(|index|format!(\u0022{base}_{index}\u0022)).find(|name|!names.contains(name.as_str()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060unique_formation_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/group_formations/mod.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"01537f318627f750a528d0783fad8c5dd5487c9ab33d55a062a828a115befac9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026esf_data_no_node)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_treeview\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c828f1bf976839ca07848ed0cf587808cd9ceec18d907fb973e5e462b249ab65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026root_node.clone_without_children())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_treeview\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae702dab87b7de3429dd5b1a40d578f325a9b0fee2e64e7dd7921c1aceec622b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026node.children()[0].iter().map(|x|x.clone_without_children()).collect::\u003CVec\u003CNodeType\u003E\u003E())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_treeview\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e93a4157a58549e60a3390119b086498693f02c31a74761f621ee01e61692e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026model.item_1a(0).data_1a(ESF_DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_esf_from_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"470824264fd5f6b3c9bbaa6c2c7341f16bb29e973f3ca0e64d679f593ff130a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026node_group.iter().map(|x|x.clone_without_children()).collect::\u003CVec\u003CNodeType\u003E\u003E())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_node_to_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f741a5680b53ebb5df228bf099c1f156e536a4160d90ab467ea254f8f555a40a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026child.clone_without_children())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_node_to_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"39daca86db3b076c508c37486f1d3386147da71b82649fd6a79e450543744fff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026child.clone_without_children())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_node_to_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c06383b4605bd4de2c3305fe2601eb83f67897ee016178c9a2bb2d03812bcd3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026node.children()[0].iter().map(|x|x.clone_without_children()).collect::\u003CVec\u003CNodeType\u003E\u003E())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_node_to_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bafb4afbbaba1c7ad0dc73d3e19660f44ea852c95065570f5144e72edfc62c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026item.data_1a(CHILDLESS_NODE).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_node_type_from_tree_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esftree/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff76dd26fb1659517fed77fcde6b6d56bace591b88f6ddf568cc6ba2b4ca32c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5242a6acf2cdb30214d8fd71f73c7290a21ffe691deae27dd41c60fd47bfb15"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2234128dfcdd80dda03ad7fe0fe4e3dd8f139c74a016a03ff14cce75ac464f12"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a7978c7fa1fb674499a0e47adbb8aa7a994e76e75c3e2526a786976d13697a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c861bfa1d14cef8b3d24ff3f9ecb99791fdc2a210eb91c7964a03903f888600"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dc01e51498c06c6db71622117b18284fa7e274d070bb0c88e69d11ff003944"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baea071d3f4b1b86ded383d3b780ea4bc5b487e2dec41d1e4db07b2f00cc357"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"2573ef340476f303062d0e75c24136c244a4b0db0644dc428a1cef52c93bd5ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe21c7019cc0bab9ddfb0ffb0bbf7d62b1f5ef1c4375a736c8c6b3c93e09fb1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b67f6e15e8fd60e7806e285e7adb1146d3fe3d618cfb96d28a9c299b7b254a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3bf8a3e79b39ed5a5883cba5875533b4cde79bcc43cf4ca98dcc0026363608"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef095bc1281f43fcb0f257484eb37a8a13493d17065516e175e89b74e5e052a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf9275c47b2f0ea71156499317a6f3b257e705ebcf7108d9281f6b1982f328a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c781749c1c4f7958dc441e53a01487dcbf830cc13a796f58f7f261837129f7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"988b58475a7ac00a811574257921dc39b3b46f9fe3163e6c88488010701aee5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1235b682b8b161730c893fa9fa04591751ab25eee2864c76b9a3d231cf5484cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"181a9cc1411b9178540812b398c8fe0659eed71aae813cc205e140d1c7d71e81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TableView::new_view(\u0026widget,app_ui,global_search_ui,pack_file_contents_ui,diagnostics_ui,dependencies_ui,references_ui,table_data,None,Arc::new(RwLock::new(DataSource::PackFile)),pack_key.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_to_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb409aae6a0994a8a4fbc9b03d12c4178647ee92ee5a4192de82e83b62753f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4182d32cc6b73a1b9babb7abbbde435efa561b587f7cb3e7c7ccedf557f8a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96a2232e3586bf905b67fab3d129e206b0357e0d534f37b2eb83f3278cc0067"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8d79ae96a2244b33ef447029a58d275d6540e9015f21adf30ed1d3cbe39b22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1cbc08197504363ddd9630c8ec27850a145a29511190c66bfa51b815a1dbba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4f7505d9a8bcf33828a7ec02519ca82608efa2774a766c7b0bf35efe531795"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"310a43aee72b6dcc9d1ced5d917ae3e7388661031b24238d9bad8bd43f313055"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e72cd448013bd6ba30f38d7c84c8b617cc2bdcddea328c19a70e29944df53a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a629076d1a3ae1433ec757e1e6f5a79aa3376b629c315787b58f57d4dd71bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"972d5272f704bc7635c10e064de7f88cd281e720d99b22572bc849b70b44ce3b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbaadce6761b37a31f7c6ee43a996c94338fe0d009996bfc3d4d9164521353c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"492382c3d08143eba4eba42b7ad30e2ed4e674af935fbc01bd0153bcb83867ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"16901f069112c76f39531c131f4829263d93f0582b86e512ebbc967743258333"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba4b1817d6b94d42a4cc0961a7f163efaa765058f44eb42acc1b029df8cca61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1884ab8853ca0034ebccddd0baa46a20b4bf00a34869102968bf00b351e895"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"4958a67944d57e1edd5dfdecce8f1d58e81d4834404871c6f6df0de2dbba4f29"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a56d99fdbaf385a88bee53a7baff580696e59c797b18f7cee46fa9159117ade"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a08a28ff609ed768668b8318b061929a3381c7567d90991a838781ce6063662"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_table_from_view(\u0026table_model,\u0026table_view.table_definition())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"8286cc4acdda576b76dd312eb5052e63977fda4de8b8949484a3c3aefaa68157"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026nodes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_from_detailed_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/esf/esf_detailed_view/mod.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"887f17017d42836bfa3e13c9175d49cb5a4ed0db79ab400f09fe03b295796b19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.table_model.item_from_index(model_index.sibling_at_column(11).as_ref()).text().to_std_string().parse::\u003Ci16\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_fields_from_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1687598dbf2505aed23b4d449b41d95df283722f5adceecbdee2d17df98e5baa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.table_model.item_from_index(model_index.sibling_at_column(13).as_ref()).text().to_std_string().parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_fields_from_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"662a3823554d777d06bd97b1732821ab89745dc85cd89782ddc7b7a611808c8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2301ac648e5d0dc998cfeea66adff0b8e5d8a6b68439d5f322247c5ba6a8cfe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_stem().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d808ea018647eba5ee34b66d492865c0324a1d4fbeaaaf3772d724ffcd29b6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition_paths.iter().find(|x|{format!(\u0022{}_tables\u0022,x.file_stem().unwrap().to_str().unwrap().split_at(5).1)==self.table_name})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e23a1040e0f51108432b15bfc0ae7d92467928872fa77f781885c7c4c458c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_bool()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b668995ada2e01beb0271ee9a3478274bb7f701ef9c2e1e5219a6920817757"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_f32()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac91253ab97279c56f4220b6c9ac9d292d4975b8daec519093e5a617938b65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5154d7a032edfbe7f1b51b2da544f1af2aa61dc69ea0633a992a6905784420c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_i32()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16716fb659659d57efbfa70157ba5ad12317a51afeecc6d9bc185daf98de0a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_i64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"225237a43c5c62738ec70476394c984532e5aaa1a44cfcf78e9a1e3e78d8e5a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_string_colour_rgb()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8916ba440a06cd820b5515e1931dd2e6e43c9c78f98aad301e18037feaed6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_sized_string_u8()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f2bbe7e65b96ade204c33190ac239202aad3c94c5b49a929eacd5644009a51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.read_optional_string_u8()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"517e8606b70315d5b781249048359b74cf10c93be6c327068af38ccb822bc166"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition.fields.get(*y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_from_assembly_kit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e1146352ca2cadcddde11ff6531ff7c068c83358fa6ddf8ce21754475dca7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.table_model_old_versions.item_from_index(model_index).text().to_std_string().parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4d84e29edfb8efe55159ba6d05f1741b622171ea7f19e67db639ed033dddc8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060definition_by_table_name_and_version(view.table_name(),version)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b337850993c774c34485213b7be0c1245dd66e5b7d72dcb18c60a50cec25d6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.table_model_old_versions.item_from_index(model_index).text().to_std_string().parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/decoder/slots.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aa914eae8ebdd646e850cd61f8a99629fb5340149c205a1137b009c7e9ca60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060reload_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/packedfile_views/bmd/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf694c46cdcbbdb8dadf4e52171eed52716edd1c8c1d43504c87161856f1a3ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_row_to_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbc98613fabe61d771bd5404675e9b4c2d9061fe82c52048bc8aeac75afdb9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_row_to_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"53eff2b6431faa2f10a4f38095b3aaf98fedb7d0cb360b708cb00cced2e8afa7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_row_to_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb903be57da5e4ae19f8241cfce9a0ad12d1492405a9ded76eb8939c399d2ac5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_path_from_pathbuf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0136a09655ba48bd8aad4459aa0d4f67312dee8eca20ee48ac5933a054f3e47d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files_from_subdir(file_path,true)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_path_from_pathbuf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c641c3ef8e9a635d754cf80c06c0691ebc1ee9784d2048cdee688b2b0ab2a7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.strip_prefix(\u0026useless_prefix)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_path_from_pathbuf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e194fd65833a2c743f97d18f2263753b50b554905b1f4e8b37a88daa75d8729"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_treeview\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ea62f2aaa366b0e720db73588baf28844ec15f927beb23f9e09de432bb87bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OffsetDateTime::from_unix_timestamp(*info.timestamp()as i64)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_pack_file_tooltip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe3c7c1f7fb82be2400ab0e6bcc73e76aa38d520ccfbab9f3c1e113cccc74dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OffsetDateTime::from_unix_timestamp(*info.timestamp()as i64).unwrap().format(\u0026FULL_DATE_FORMAT)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_pack_file_tooltip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edb12eb29f3da54990292fe04d3221293e381672449020384ed16775ea13f1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OffsetDateTime::from_unix_timestamp(*timestamp as i64)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_packed_file_tooltip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fbb6a8a2469adbfb071c05a23841286dfebfe13183eb402239ff091d58110d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OffsetDateTime::from_unix_timestamp(*timestamp as i64).unwrap().format(\u0026FULL_DATE_FORMAT)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_packed_file_tooltip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fb31c53cdc11e3188ac4484ae4a7c7454bc1fdd111b477a20aa17126785489"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item_type_next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_item_in_tree_view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/pack_tree/mod.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa198bb47d4d657e83f6ff7ebf50e2b1726469c6b6f8b4b3ef9c851172add5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060model_index_filtered.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fef71be48139fe00350b4fbb521ed62ea82ba68327f365592f7a26420fbfc27"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.child_2a(model_index.row(),2).text().to_std_string().parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45127a7843e391968719aac4a7fd3f73b7a64c18b0f3dbf86027b3cd55372d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.child_2a(model_index.row(),3).text().to_std_string().parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d6c2a72b4ad67840d47b4141f8231826b5edd2b75ba15ae915edb234fcbb1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.child_2a(model_index.row(),2).text().to_std_string().parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6fe3b2de343d88302d1f9ce5cf3f0550c144327505a51a7bb6c75999688198"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row_number.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/global_search_ui/mod.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e941d3d30dc61ee4519a5e2d5f65cc1e79b71bcd6b2b2d54b3d74ea9ba46a0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060trigger_tableview_filter_safe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"db42475da7ebf7f8f765adf5c5ee8300f85319713396fb75e5704c1043d4e357"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::cpp_core::Ref::from_raw(widget.as_raw_ptr())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060draggable_file_tree_view_drop_signal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa33bc1195156477b1c65d7b61d38f50778a226687a743991e89dacd85c2f2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::cpp_core::Ref::from_raw(header.as_raw_ptr())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060header_funnel_clicked_signal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5d6309bfc36cea83508843af65aa90262c03f1797522f363836cea1f57660e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::cpp_core::Ref::from_raw(canvas.as_raw_ptr())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060group_formation_canvas_blocks_moved_signal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"abec3aeec294efe4e37dec1b69933becf9beb5f1a971936e6793d8657a971b67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::cpp_core::Ref::from_raw(canvas.as_raw_ptr())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060group_formation_canvas_link_requested_signal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2c104e40a54ddb1629bac39abe5e9a82c86b30295fce928a12feb13ca3c9e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::cpp_core::Ref::from_raw(canvas.as_raw_ptr())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060group_formation_canvas_selection_changed_signal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a4fb3dfe7a46d7d02c0fd93bc69a592a236fa1bb8c20d0de4faf3f099e3d1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::cpp_core::Ref::from_raw(widget.as_raw_ptr())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main_window_drop_pack_signal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8310e4bfdcc75355486ad7ec08bbf8655ca7d286f70ea2752ceb94c65d4c1d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::cpp_core::Ref::from_raw(widget.as_raw_ptr())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main_window_theme_changed_signal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"319a754f3e850d24d2061b31f57987f8df24410a0d516d8c9e28503f345b9d67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060missing_files.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060assets_request_callback\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d843a06fc47557ae82be5327b3cf93823d4699ae462cd89460a49f6267b69b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060assets_request_callback\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0105ecc70fdf43a014cc806502afe8f3d6e9d1dd5121092f4c585caca78389f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060skeleton_name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060anim_paths_by_skeleton_callback\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"2024af4cbfd103af181241da19bee7a3d567c8680e215e04ad693aab0c1cb765"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060anim_paths_by_skeleton_callback\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9941b5349f0770066d98bcfa6b5a3e2d920b1f020668dd265b1e6e4fc9656cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060main_window.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_main_window_state\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f15ff16c369111259bc56ebdcb2379dc0ab6c7cf22394af3de51cf49a05e92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_tooltip_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/ffi/mod.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1d9d193edf8a7ccfefcce0c8730cdfc25a060fbf3d9ce15b6df22cbb189124"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_diagnostics_to_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7317a9492f656834d2c701b220223181f82b8b062c10e3803a0bac7d50e49d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result.cells_affected())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_diagnostics_to_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d0c1a12e10a94a7b13ac49c0605405b37609c01ab98c7cc0e3933a782c3d2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result.column_names())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_diagnostics_to_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eb005760259ef484143e9358ef27f03941579d840b2e6227bcf5dbb70dc036"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result.cells_affected())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_diagnostics_to_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fede43ee51157ac81c07d102b3f1ac32a346f5bec88e6412e40e80a2d7917c4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060model_index_filtered.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b606b77ec687576ead9f14b3f067f91dd54792fa30586b57fed12170d88548"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026model.item_2a(model_index.row(),2).text().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d4439b28b0880e03d0bc64fb3f4fc35ce2fe066fed3998f948fa0ec23af825"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026item.text().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5857a70bb6d14dcbaca532b0fa56a09d648eba07033b14f69f8ef46af6e342"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026model.item_2a(model_index.row(),2).text().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46a05ff6a6051feee14b12a4728df555964de0b7ccc621d6eccbd68ca135ed6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026list_model_index.data_1a(crate::packedfile_views::portrait_settings::DATA).to_string().to_std_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"510ca6c3643b9ad8cc6730814d9071cf0a267bb70decfaf4f1628f28f9c5c0bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pos_data[0].parse::\u003Cu64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcf52b5df10ece5366049d0371696a80792d28b46a878e2142f02690a1f002d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pos_data[1].parse::\u003Cu64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"878b39d1d0fd9bdca2012ada319b7a813b56df06e6b82d14432abecabb140d8d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pos_data[2].parse::\u003Cu64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41ec4b18214771e8c7034c74d44554f6a1781f8df6bb7c4c7468b26c08f88b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pos_data[3].parse::\u003Cu64\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_match\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/diagnostics_ui/mod.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"191ce6a75997409d4007104e75fefe3c5264e90510f8f76930ea4b55ba95dd99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026request)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060websocket_loop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/communications/mod.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b92e46ba5ef4715204bc6b60cda2d0f072c50de12b8876031552723757714b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060spawn_server\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/communications/server.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f50c6e8816a340c07c1094c56f8354a421cacb36b6dc33230018157ab3e13b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_PHARAOH_DYNASTIES)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"876264b8fd583834c65f81ef97bb1562dc28addb75f840f1dde759650019ebfe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_PHARAOH)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"3144581affb87009aaa6b8a6cd0971cf0592619b874291872fdafd56ce088487"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_WARHAMMER_3)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"4258aafee4ea24f9d60d9dce7c65628e6e9f977c4861c57fe8fddb39a30a50ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_TROY)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52253dd855b26fdc11d759de11a8069889145d5575abebac1a43a70e91076bf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_THREE_KINGDOMS)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df1a9359355251368607c2d1ca406e5b81004cb06cf1e7c2185cd27ea14c704"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_WARHAMMER_2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"05767d4214130b1457b1359d9fc9c71b340873987ce4e05e438ee6b1b6240cd7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_WARHAMMER)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a5b65985a63505161fdd516affc55d2d8d676f4e9165469ac7735a37e6a19d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_THRONES_OF_BRITANNIA)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37015d673704b8e53f74beb853bc446ac1471d708b6ef0ede2f1ee4112df8a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_ATTILA)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d726f8df2cd46d9d03a0db60c1935c446aa9a5d188987e3269498c4cf9f54ae2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_ROME_2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d797a2855cacaa13a95b92b0b7a0c5d78376737ae22e9d3173bae33154ad7d41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_SHOGUN_2_COMPLETE_EDITION)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39a8016306384bcb6cfc8f32d661b8f54b156095cf1f9e799037939a44243e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_SHOGUN_2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5c46dc61c3ca07c3dc0be24e03c43e927e26f79a9daedd4db3a89eb8456e80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_NAPOLEON)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f74d24affcc9cb489c32554eedf374a009b7564b57fbcccf4095798474bf9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_EMPIRE)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5bc7a03811b42bfcf1c8f79710caf8e9a98a8ce024ed067a055021da627a49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(KEY_ARENA)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafcad9672f6d4fcfba9ced7e925b1234109306a7f6636f7455c2c90ace78ad3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060open_packfile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"252a74a47f113ed3ffda04046c020e9978ac432668befdd5b76bb9bd4639e5f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_packfile_by_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9417a231fecf80e5c00b318dacadaf6167f7bf4c6386614a732029677fadbb8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"db78dc5e2c5300c846a68772905f9a4281e2c17fd32b1fea760e522579cb826a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43a5f761981ab34e751496cf1f28501d75fef37bd9ea80cb6d77ebce292cd2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f30ed73c61ac9b7ff65da93969ae1fbb07ad0c55f278fe1aadc70634ecb8169"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea795c799a32868b37612d30986dd91485d86a93da68264afca6c110943c34a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9b9c0f4acbc9e60c29406078bd104c6f0db0a0bd4fbd59453c5588e2a16f8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebe529db597eabb10eb4d2794265f8d811645f2db176098cebe27d8da2bc6d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ae702da8844f2523f480ee1de9303adbeac9f1d3eb80f92b7fac5df5bd88d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"351449f76b85a4399e1465d21aac81603e3ea22c3101252ec29cb5674777a1c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060date_formatted.format(\u0026FULL_DATE_FORMAT)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_pack_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bdfdeb009b29334b186c079a35a2d51e3b2fba50ade07bf1847e610216b627"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_open_mymod_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c797b7dfba0c41d9fdba20db5d73bf2dcc61bd15f8f6e2729e390b6a5a617"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pack_file.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_open_mymod_submenus\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cf053225136909f63bbded8c3e8f169ef20114d826d64f18e277a4092fd034"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GAME_SELECTED.read().unwrap().portrait_settings_version()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_file_dialog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":3292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd032204ec529ae7a19fd9d4226a36e7cc0354743902ff08ec93340584e8e2fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SUPPORTED_GAMES.game(\u0026new_game_selected)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060change_game_selected\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4089}}}],"partialFingerprints":{"codehealthFindingId/v1":"16487b0e231b254afb196122fe4c241d24f489a625e52523b33c6e9a91da6129"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(\u0026assets_folder)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060import_mymod\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/mod.rs"},"region":{"startLine":4265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5eb3782a79a68ed0bcb209205cc36920d52b77031ee099062c13bec466ae1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_split.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_tab_unpreview\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb278db3d2295d841181e89d9815138a1b22aa594cdc2f256d6acd981115fd17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mymod_pack_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ui/src/app_ui/slots.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05ec703e3989bad86bd4e9721db13af83446c0e58f3d144adfaa1234b6f6aaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060init_config_path()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/main.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6922afc94fdcf9c6b4160535604c6320f6c0e06620daffa82cae4fc0735a2e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Logger::init(\u0026{init_config_path().expect(\u0022Error while trying to initialize config path. We\u0027re fucked.\u0022);error_path().unwrap_or_else(|_|PathBuf::from(\u0022.\u0022))},true,false,release_name!())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/main.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2730ac619ee2e40f25fb5cef56bdfa9f9337d663fcd63312325d7b33698061e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6a215f3144b2a5ec2281df00e5ba0e03d7c78d860a0adde8945c60c2607b2c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_main_program_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/updater.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"646d440d95d2ad55888b3e4cab207340f03ec02acdc29050322d40655739baa8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060updated_file.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_main_program_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/updater.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b640dcd44cf9f167c9d50e147e285b3ed11299b085eddca128ee3f49e1f1b9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060updated_file.file_name().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_main_program_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/updater.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2654b9e01ba43ac939c8822f82cc42e79f5bd8381b33ac56c251b0036c99c3b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060updated_file.strip_prefix(tmp_dir.path())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_main_program_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/updater.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d29f20d7e771a914c484c7bbafbef9360ea53074e3439c4d221158bcfa59d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(first_counter..).map(|counter|format!(\u0022{}{}{}\u0022,base_trimmed,counter,ext)).find(|candidate|!pack.has_file(candidate))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060duplicate_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/files.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e6835f8585241e43f44aced8d64e97673d99a92cef5367bc7c00f310a57cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060supported_games.game(KEY_WARHAMMER_3)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"74348a65650528df1d8f17b67bef92bda2d4abcd271149c17bf416d9aac4c7f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schemas_path()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/mod.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adb1a3279583055c936f9b56c7bc66989ebcc0a6055d5b600411c7045406bd3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_patches_path()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"63272bba98df509b39e5714cea554869d0ece75b083b1fe19a7d9587bcb01190"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(2..).map(|suffix|format!(\u0022{}_{}{}\u0022,DEFAULT_PACK_STEM,suffix,DEFAULT_PACK_EXT)).find(|candidate|!taken(candidate))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060derive_new_pack_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_server/src/state/packs.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fe4b6680b621b51b01709dbe79a083e02bacdcb511d7b126923da39972fd1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.1.is_reference.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060reference_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e18a094f48a0bc0c6da820ec9b9ef685352f1500b622d677d221aef98d56e09"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060name.rfind(\u0027_\u0027)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060original_field_from_processed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3d6be200978ef90c3d7088fe38d9cd0998718e9ef05d18d54716af043e6c18"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.iter().find(|x|*x.name()==name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060original_field_from_processed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6fb3924beed0cbaba4c1e1c005fc28d8d987aed2606bacbb842d300e894a47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition.name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_from_raw_definition\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ac2b4a0cf1ec2c32f178af7a226bcb80de2bc074cd02905976077a1d9ef05f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition.name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_from_raw_localisable_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/schema/mod.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4de9c895b63b142dfb0603d2e565daf27bcdf3776166071b57dacd8305262cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.head()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060checkout_branch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da59891713b762fbbf1bed814fce43b7227f0ad3669c0e676d2dd3166afaf34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060head.target()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060checkout_branch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c5d48d68fd0c27cb5ae0ddf824ea419e8328eeb737111f0c8b2ec2c579ccb4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.head()?.name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"06db6014f39a0611c3448f541c655eb98a50413ca0e3cb67b3b0052065063bb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060repo.head()?.name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_repo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/git.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cba5c085f43bbaae986caa63833683fa61ae3d2d2875ed41f9c066b384bfc4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Url::parse(API_URL)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060api_url\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/github/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2890bdfb833865606a75c5b6c19b0bb3ef30713b99f1f80f28ac53125e85e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url.path_segments_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060api_url\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/github/mod.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8162675d06242c83626151c44f3026e8f7de496fd4a42af961bad85d0b83f268"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_schema_from_raw_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd091473eb4382556b5c0f91fe7bd832d1722a231b03e1bd1278637aff64e3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields_processed.iter().find(|x|x.is_key(Some(definition.patches())))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_schema_from_raw_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae31b7fad49bc528a891f8141e95b5b20c598c322eca68e2a39a8d8770fc61c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_definition_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2304596f8f0e8afa7e450ff31d849d08e9603afbaa2b619d4204e75e444bd439"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_definition_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c40ee5bdd23756f84bdd3c379be80e2f5dffdebad5a03149b9dea83d952a3cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.extension()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_definition_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff3ba71664e26da7b2a631c7452cebec569a598b99d10fe43d679a9bb1ad09b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_data_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c794c9b7fe1d204767c4c3fb01baf753622160ddfbeb58611c8da92ba53a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_data_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17106d54f38ae56b600572d92f74145ffd9d078f599b1ad240bca7032c5528c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_localisable_fields_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8553a30c6425cf6288ecd8e0fbfaccd5046c0d68a42947f512b4e8bbe37d5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_localisable_fields_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6227f95b8687669bfd86b8104b4a6ba8110cfee3fe3a5defaf42cf6258bb8dbf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_extra_relationships_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"1247e82652f2aa4c00c201b1feb78deeb3a169131d9e445a19433104dcb96c1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.file_stem().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_raw_extra_relationships_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"64276dcbcd7f9221be4a3753b680c737e2c2cfe3271000127aa29d066d4873d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition.name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"782cb33f4c91bb3835d5557ec07b49acbbabdf65265182df194fc376921ecfaf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition.name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bf24ea2b2f76203a002a5302c6e89c2c17670abed1a2170a2550123b950b9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition.name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd00ae37fadd44f4d6f0b7be2992ea7fa5f00e7405cbf64e7b12cdb862ec91a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Regex::new(\u0026format!(\u0022\\n\u003C{}\u003E\u0022,field.name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36fcfbf6bfb2f506fb604d92ae0dae13ba8749a6dc1779be5a2d6f5c215d745"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Regex::new(\u0026format!(\u0022\\n\u003C{} .\u002B?\\\u0022\u003E\u0022,field.name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_data.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74109d3ca29d02544d3d2a73bb7cfb723518d6b418ea7c4f5b8e649fec03ed8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb372e59684c4d095404e296f4f723b3d32820a4cd8e4da47fc15a6a08b6a2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"4897af352836b2ec2511c37c20d08aeb7df274fdf805759d158c982fc10eb8d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f89b6e8994140e95ea911d454bbedcc4e53fee60bab20327215813cdb7f6e51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_stem().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c662c175d4bc7b8c5470b1a8ae9d540c25d085b7aaca5532a075010613467fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e520e4c4ed060feaceffc7c672f585fe0fd87fba0c1dacdd24c829c86350ecd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b458b10d7f22db9306ecc8a0660ee205cd9fcbbc59dee910e4e1fd92e8f2004"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_stem()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e3697e77d51a9d113e3d621183f8e72b8ac228f8d9d288e66d0f28b8515b60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_stem().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"458971eb2db24d1209b6f41f1ac22ebe85673dc6a4e2ea659cfa40f9847c52b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b2e8fe84bd7cb7492d553c5099b04658824d35ae89c6f2f49d435ef02735cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060raw_definition_path.file_name().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc35a193d85d1fcc16dc60a332e9eeb5cc959bfa1571f81c2febc1d4b0f206f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.name.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_non_localisable_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/integrations/assembly_kit/table_definition.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cae3446ad2c7daca9d6de5c5ac7bf0d997e7443b8cc5925f237695b9fc62367"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_path_in_manifest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/manifest.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f660bfcd8f3f3986ec6a331b08f1340dce2e9dac1f9de978df1cee4eeeecbfa9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pfh_versions.get(\u0026PFHFileType::Mod)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060pfh_version_by_file_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27d4d5dd2c80fca3095cac1080c599c35a4ca8c50d51ae5554625af60767def"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.install_data.keys().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"5424a43f37c9c1e529d06c5025cd6fe0f0be50caa239f3dccbcb071a331463f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.game(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060games_sorted\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/games/supported_games.rs"},"region":{"startLine":3963}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c49cfcf4628cba2f62b57d1f910a16f0d4e6ab4b3f9c8d49b28fdba2563e283"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tsv_export_to_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3c2fcfdc350e75ed47d8133b0005d9868f332c2375392ec42537123cbe60a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060data_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5153dbbe3e5014ef1e5c97ddd9228d8d619487bfb8d4d6bd3dcfda23416a94"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sanitize_and_create_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/mod.rs"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08160570990692b40e0b2466cceb585c298666428d9a5b8d66f8cf03a470a81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fraction.numer()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_ivf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/video/ivf.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbef5310aec7d3032c4894705c464e89a2772d5da9408ba71c5058400a8aa10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fraction.denom()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_ivf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/video/ivf.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eada82e35ac961332f90c3cda01d235524e479dd221ac2c62f6290c2b4eff8ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields_processed.iter().position(|field|field==field_sorted)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tsv_export\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/local.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a41a63d18c1b1ab33f11480e522a41974d6d1d3a37effa6e2b5c7c8d304fb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields_processed.get(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/table/local.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"602cf4146b7a8a03f7eeddfe83bfa7c046eb65ffc66c6ce626d21b2549057ec0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(\u0026None,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060insert\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"527384fb82a960b840ae4ea6edb2ace576b637b3508288105591a7e98776d3e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(\u0026None,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060insert\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c239c15a507b3684e7fe9abd60f8fa97c02c1b953e725e6380d937e079200f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(\u0026None,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060insert\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c221a7e87541798506a150cf59864dd93738c5f7100da702184e3f1b261f4eb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last_modified_time_from_file(data.get_ref())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_and_merge\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2618e313caf5641644ed5e5e48619db6cb2abb828fbbe1f677cd1ee9c573c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.insert(packed_file)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_missing_loc_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce128b34f3f93bf2c76118327613f434fdde2ab9f3fac7b8e8a5f09c023fe5aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.insert(packed_file)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_missing_loc_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b69aef3fabaaf5f89627ff26635814e5bcceffc1c622f85f955873a2efcee25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_split.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060live_export\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"28285a9226df8046d2a262df43dcaea77f32d3e61140b0cdadd5c7b2dbc33825"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_split.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060live_export\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/mod.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a2ccf42f0651fd65a66328f7dbf93fc33871afd21ee019a314f8ebaccbd6c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_pfh0\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh0.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd18c63a0d8c4dd6c0b860f740c1877088d6a387a2fae9ed1b130b13f16cd6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_pfh2\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh2.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a323ffb58e07da270d93cb7cedf4bf9f40ce5c8ae33fa6d505a42882173edcb1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_pfh3\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh3.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9a53693840685fe4698d36c5872823446d391626634f8a8e56c1035004da5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_pfh4\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh4.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f6a1c14e794de45eafe23e4dd89d309cf99d9a51474c10e54da6cfced4068e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_pfh5\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh5.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee10a165844f647df90c0852f9bc9f381fb984dc59870de396bd566b59202bbf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_pfh6\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/pack/pack_versions/pfh6.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"809dc2ae03268872df243f6178f5deab1c442b5ea80db1f5df05acbede2c6ee5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060blocks[*position].take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sort_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/group_formations/edit.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9406b2398dd5a8d21e8035084556896a339ec8a72a242804e5a0df3ac17553"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack.iter().position(|stacked|*stacked==referenced_position)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060visit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/group_formations/validation.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"038bfb4ee20f33a1e0059d2891859ced62d5043a1ca3f620cf518e36f9549b1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060strings_utf16.iter().position(|x|x==value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa8b04083c9758fb5f4d89f51ba3d379b024a92e737dfe4a3e7a5d3a9e2a03f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060strings_utf8.iter().position(|x|x==value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b43a2892a71237468254d1255f909b13b2e3028c694bc60e822d30e17f57877"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060strings_utf16.iter().position(|x|x==y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"37df7f18971f400b31fb972a43cbfcfcd4feaf8a0e33a775904b655ca41b998c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060strings_utf8.iter().position(|x|x==y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6e44845a582beeb27f6f1f6a55f34dc40918f65cc9f23f2ad241b33141ba4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record_names.iter().position(|x|x==\u0026value.name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2a11054748f789dffa8c713c4d9e820ca2136d5caa78f7ea9a777112d3bf6e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record_names.iter().position(|x|x==\u0026value.name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/esf/utils.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb07f68c91e07ba8e220b0ce2f0516f448ea451804e912d020f918505e5e4d3d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prefab_path_split.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_layer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/prefab_instance_list/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6913603f19eb75c9d940ddb8948eb5fe71b8aa4c944ae78baafb3091e8e873"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prefab_name_split.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_layer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/bmd/prefab_instance_list/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4e5794b707f4acd0f958cd5f7bac4bf5d0d4295a07e6ae421f5bb17701d964"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.encode(extra_data,false,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060encode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/animpack/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ea2c943163145adb5a73922512c71a8655688d1e0c158b6034eeda45459437"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060anim_refs_subtable.set_data(\u0026anim_ref_rows)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/anim_fragment_battle/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e2f76deaaed7432c3d83bf0a155ca30a00c3ce7f185075107a47bfe30cfae6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_u32(anim_ref_rows.len()as u32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/files/anim_fragment_battle/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b00e9877f814f1e6e9a4a34b72f5dddf7f6e72b5e622f90bef08032030dcdea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lzma_compress(\u0026mut src,\u0026mut compressed_data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compress\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/compression/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba457e06868255ee2da0990b1d2263d24e89163cee9f67e2892820af6ac240c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_cauleb128\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_lib/src/binary/writer.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3eeaf408dde6a1d0b59144d286f39cedfec0bb35c98f41e51a00c0cff8e021"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_patches_path()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060init_config_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_ipc/src/settings.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a75353f839e0529fe3fbf11f5df7c6288c124e496f66caf978f3d91b4671e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.groups.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060push_group_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4199f31a73c72fec460630b4d1d890027279359e760e6718f48e8a8be64740df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060old_slots.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060add_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"02195aeb216fa320c22c1057e88fdfe0e585188d26552ef7a3d72d86ac557a49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060old_slots.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060add_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"234b8f319119226cbef972c322f8869d867eceb61b8c26e2beb697c30a8e7f21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060old_slots.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060add_group\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adc2db146da516be3896c2783cfa186bb4a607b13caaeeec93d977a528f2a2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060values.into_iter().max_by(|(text_a,(count_a,_)),(text_b,(count_b,_))|count_a.cmp(count_b).then_with(||text_b.cmp(text_a)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060into_layout\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/startpos/layout.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"9604e5e5311a452501c961f57a29bfcb443b6844a2583e15a9b5e04a55f7e85b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026extra_data,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a26deba00ba14fa07bb2a22b256f6e54e1a17a86b12e193688e23ddf3f76543"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc6dd8189b031d52416cb67311d6a801a7a12d657a342a55a5b5ee602688110"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ff79dfa26fa13802a3e40f9973dbcb216663d445432bee82832d291936c308"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f564630c985ea7ff935d0337e13a7aa4a844813280d2035ebffe1a8e144d02c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a918bc22f1478a9a1c22c1925a48679ef6dd8a78035e8f1fa9cda5dbfbf0cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"908594b972c4ab7814108f369390e36a4f63aeadb8398cd9139d4812a2e19149"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"62607356f4c87dba645000cbf2cb81a21e9883c5c800c1053b7d4c0eb2d89d88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c55cca19ef28d9ab5fbc3eaa8048ef65dd8d7c1e0825239dee2689f99e122d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.decode(\u0026None,false,true).transpose()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/mod.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7653647d82d5ca0fb2ab270b1ecf5f948a393af206fb5f5495f880c41bd82434"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RegexBuilder::new(regex.as_str()).case_insensitive(!case_sensitive).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/unknown.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbc71969d0354d3804e501d3250aa06239e7511f9d20fba18d99da0b96140d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RegexBuilder::new(regex.as_str()).case_insensitive(!case_sensitive).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/search/unknown.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f584c918b351ae0d3289aceb6a1c606e36499d78e11ef5003fd26915ad648cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060group.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060optimize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"232d9b90d6b537f9d609280280a1603be803e24245eefb0716beb6f5bb4f9d65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026json)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060optimize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a075a333d1a28598823ded9c66c086e83de751bd05cf2b65c9932644008807"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026entry_json)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060optimize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/optimizer/mod.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbbf2af031bcf2d2aa80942ab4f1a4b239b7e1b57dd46f1668b8165b7bd957a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060image.decode(\u0026None,false,true)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gltf_from_rigid\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2c5c8cd9ef6bba21f1fbf94ab40c35af639d6b0c7d741677c5e7ffe9e95e75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Document::from_json(root)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gltf_from_rigid\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/gltf/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1857e30b2ade7b58e09e7968117ed592709a34f6795944b773035da20a26c9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.definition.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_asskit_only_db_tables\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"878f2d3eb5c058048f119738c3ba8d99bac4e909bd049bcb33c80a73c73e0e85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.definition.clone().unwrap().name\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_asskit_only_db_tables\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e83578450baecfc799da5063e8cb661310f76c205f1134a0e319c7a3445f2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060handle_3.join()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16b81da89fa9e50f9733e84d224f90df79bb40ffd69404e850c36071e5a0d91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060handle_2.join()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a02f790ac809d7c07b1a2bd3c7e2b6e8d52a9f149436fcabf0615f49ea25dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060handle_1.join()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6472a582297b0aaa20141e4862b6b048d4e13b9f73a5832371105ca97e1ef8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_parent_pack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"f567ad6bffa48a3436a7627fde3dcc0dca7fdc0e941a08752b1afc9e3a2f92ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_parent_pack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"75389224a0bca63f17e3887d85189920afc29dbc2321bee06ca342c89193bd86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_parent_pack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e918afb68db29664a41ae07a6e3ecfcded5a5e843e99fe5572137b0f9bc002"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ak_files.get_mut(table.table_name())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bruteforce_loc_key_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ea19d8e67df61d86636a3936c30d793baae801c7863671f6ea9f5617ba3763"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ak_files.get_mut(table.table_name())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bruteforce_loc_key_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2566074c4112a961e21209c79ef0547232a88192a423863a4174a1618e69d242"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ak_files.get_mut(table.table_name())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bruteforce_loc_key_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cdd4049ffcedbd46b344726cef3cac4676d933b58c925b100a935d4a69a03e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ak_files.get_mut(table.table_name())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bruteforce_loc_key_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e57b40aef4f041cba9799801431f9b3f1bbad8ee74e125c88867cc83145c95"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tile.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_tile_maps_and_tiles\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"196d606ff20ac37c6a46aa9fab526b1d0fa0d26d6259fa685d2152bae94ec344"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pack.insert_file(\u0026tile_database,\u0026tile_database_path,\u0026None)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_tile_maps_and_tiles\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"432120f1866ceb3a30d96814a5b59d94eac8fdfe010886ca59bcadc2d9a69137"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_starpos_post\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3513}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e9a3041221beb66998d31f2170bb8495d0108f1c363c9cf000f74d52e879b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060starpos_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_starpos_post\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cebd14dfd24b5a113f8c12ce30b9375ca5f71e778a5a5d8cc53a069713a07b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_starpos_post\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3584}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e5eef14fc40547589694b66420ba302e6d3155d3b9bcc17341e4e78cc8a092"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_starpos_post\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rpfm_extensions/src/dependencies/mod.rs"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"3398d47878694307c858732ccece103016b2e0b18661247b13c20b6dd8214833"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060husband_factions\u0060 turns every \u0060Err\u0060 into \u0060Ok(HashMap::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":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4dd349f262092ec891b5869d8a20cfd88a39d3abc8f43c57d9218d291b1182"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060widowed\u0060 turns every \u0060Err\u0060 into \u0060Ok(HashSet::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":"rpfm_extensions/src/startpos/world/mod.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a269f4fc034e1fee996f1f0d565a64512a2c6fd2aecfd70c05b52195c679c3da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060references_in_file\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"rpfm_server/src/state/tables.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4b779052046fdb1872a0b2ebf3173615f3218a7cff5aac42705724b10a142f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060decode_data_by_fieldtype\u0060 turns every \u0060Err\u0060 into \u0060\u0022Error\u0022.to_owned()\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":"rpfm_ui/src/packedfile_views/decoder/mod.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c734b01d7b91cc78ae1b0a1cc6820853e7a779fc0f6f2a26b2fd2b0274fb2f3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060key.starts_with(\u0022unit_variants_colours\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060key.starts_with(\u0022unit_variants_colours\u0022)\u0060 also satisfies \u0060key.starts_with(\u0022unit_variants\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":"rpfm_ui/src/tools/unit_editor/mod.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc8fa075ccdc0d11c935c4c5498a1c7ddb69022bc048fd62e92e521292cc9b1"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-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-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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":76,"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."]}]}