//! Bottom-up sort invariant.
//!
//! The executor processes plans in deepest-first order so that a plan's
//! `original_path` is still valid at execution time (no parent has been
//! renamed yet). At the same depth, files are processed before
//! directories so that within the same parent the dir rename happens
//! last, after its children have already been renamed.
use crateRenamePlan;
use Reverse;
use crateItemKind;
/// Sort a plan vector in-place: deepest first; at equal depth, files
/// before directories.