Enum Order 

pub enum Order {
    Size,
    Path,
    Age,
}

How a level orders its children.

Per level, because a tree and a global sort are not compatible: children have to stay under their parent, so the only ordering a tree can express is a sibling ordering.

Variants

Size

Biggest subtree first — what the tool is for.

Path

By name, which is the only order that does not move while the scan is running.

Age

Stalest first: the subtree nothing has touched for longest, first.

The opposite direction from Size and deliberately so — both put the best candidate for deletion at the top, and “sorted by age” meaning “newest first” would put the one directory you are still building at the top of a cleanup list.

Implementations

impl Order

pub const ALL: [Self; 3]

Every order, in the sequence the sort key cycles through.

pub fn next(self) -> Self

The next one round.

pub fn label(self) -> &'static str

What the header calls it.

pub fn column(self) -> &'static str

What the tree’s column heading calls the column this orders by.

Not Order::label, which is what the footer calls the sort. The column over the names is headed directory, because that is what is under it; the footer says sort (path), because that is the key being cycled.

Trait Implementations

impl Clone for Order

fn clone(&self) -> Order

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Order

impl Debug for Order

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Order

fn default() -> Order

Returns the “default value” for a type.

impl Eq for Order

impl PartialEq for Order

fn eq(&self, other: &Order) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Order