loot/libloot
0
0
Fork 0
mirror of https://github.com/loot/libloot.git synced 2026-07-27 14:16:01 -07:00
Code Issues Packages Projects Releases Wiki Activity

Fix another translation bug

Browse Source
This commit is contained in:
Oliver Hamlet
2025-03-25 20:56:12 +00:00
parent e19f4bc45d
commit 597ae75c3c
1 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/sorting/plugins.rs
+6 -3
View File
@@ -691,11 +691,14 @@ impl<'a, T: SortingPlugin> PluginsGraph<'a, T> {
.map_err(|e| SortingError::CycleInvolving(self[e.node_id()].name().to_string()))
}
fn is_hamiltonian_path(&mut self, path: &[NodeIndex]) -> Option<(NodeIndex, NodeIndex)> {
/// Returns the first pair of consecutive nodes that don't have an edge joining them.
fn check_path_is_hamiltonian(&mut self, path: &[NodeIndex]) -> Option<(NodeIndex, NodeIndex)> {
use std::ops::Not;
logging::trace!("Checking uniqueness of path through plugin graph...");
path.windows(2).find_map(|slice| match slice {
[a, b] => self.inner.contains_edge(*a, *b).then_some((*a, *b)),
[a, b] => self.inner.contains_edge(*a, *b).not().then_some((*a, *b)),
_ => None,
})
}
@@ -848,7 +851,7 @@ fn sort_plugins_partition<T: SortingPlugin>(
let sorted_nodes = graph.topological_sort()?;
if let Some((first, second)) = graph.is_hamiltonian_path(&sorted_nodes) {
if let Some((first, second)) = graph.check_path_is_hamiltonian(&sorted_nodes) {
logging::error!(
"The path is not unique. No edge exists between {} and {}",
graph[first].name(),