Struct TreeMove 

pub struct TreeMove {
    pub key: String,
    pub parent: Option<String>,
    pub from: usize,
    pub to: usize,
}

A move of one node among its siblings that a reorderable tree asks for. The tree never changes the application’s nodes; apply does the bookkeeping on the application’s own list of siblings.

Fields

key: String

The key of the node that moves.

parent: Option<String>

The key of its parent, None for a top-level node. The node keeps this parent.

from: usize

The node’s position among its siblings before the move, counted from 0.

to: usize

Its position after the move.

Implementations

impl TreeMove

pub fn apply<T>(&self, siblings: &mut Vec<T>)

Moves the sibling at from so that its position becomes to, the list the application keeps for parent’s children (or its top-level nodes). Positions out of range are ignored.

Trait Implementations

impl Clone for TreeMove

fn clone(&self) -> TreeMove

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeMove

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

Formats the value using the given formatter.

impl Eq for TreeMove

impl PartialEq for TreeMove

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TreeMove