1 2 3 4 5 6 7
use super::*; /// Normalize directed acyclic graph such that all children are sorted in memory, /// and no child is stored before its parent. pub(crate) fn fix(nodes: &mut [Node]) { tree_mem_sort::sort(nodes, |n| &mut n.parent, |n| &mut n.children) }