Enum TreeMove 

pub enum TreeMove {
    Indent,
    Outdent,
}

A move that changes an item’s parent rather than its position among its siblings.

The tree views’ row drag can do two things a flat list’s cannot: drop between siblings (which is OrderedMove) and drop into another row, which reparents. Both are the same drag; only the second needs its own vocabulary, because “one place earlier” says nothing about depth.

The two directions are the outliner convention every editor ships: indenting makes the row a child of the sibling above it, outdenting makes it the next sibling of its own parent.

Variants

Indent

Become a child of the previous sibling.

Outdent

Become the next sibling of the current parent.

Implementations

impl TreeMove

pub const ALL: [TreeMove; 2]

Both directions, in the order they are offered.

pub fn label(self) -> LocalizedString

What this move is called.

pub fn from_key(key: Key, modifiers: Modifiers, rtl: bool) -> Option<Self>

Decode the keyboard chord for the platform this build targets.

Trait Implementations

impl Clone for TreeMove

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for TreeMove

impl Debug for TreeMove

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

Formats the value using the given formatter.

impl Eq for TreeMove

impl Hash for TreeMove

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for TreeMove

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TreeMove