Struct tree_cursor::cursor::TreeCursorMut

pub struct TreeCursorMut<'n, N: 'n> { /* fields omitted */ }

Methods

impl<'n, N: 'n + DownMut> TreeCursorMut<'n, N>

pub fn new(root: &'n mut N) -> Self

pub fn down_map<F>(&mut self, f: F) -> bool where
    F: Fn(&mut N, usize) -> Option<&mut N>, 

pub fn down_map_new<F>(&mut self, f: F) -> Option<Self> where
    F: Fn(&mut N, usize) -> Option<&mut N>, 

Trait Implementations

impl<'n, N: Debug + 'n> Debug for TreeCursorMut<'n, N>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'n, N: Eq + 'n> Eq for TreeCursorMut<'n, N>

impl<'n, N: Hash + 'n> Hash for TreeCursorMut<'n, N>

fn hash<__HN: Hasher>(&self, __arg_0: &mut __HN)

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

impl<'n, N: PartialEq + 'n> PartialEq for TreeCursorMut<'n, N>

fn eq(&self, __arg_0: &TreeCursorMut<'n, N>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &TreeCursorMut<'n, N>) -> bool

This method tests for !=.

impl<'n, N: 'n + DownMut> OpaqueVerticalCursor for TreeCursorMut<'n, N>

fn zero(&mut self)

fn down(&mut self) -> bool

fn up(&mut self) -> bool

impl<'n, N: 'n + DownMut> VerticalCursor for TreeCursorMut<'n, N>

type Item = N

fn get(&self) -> &N

fn down_new(&mut self) -> Option<Self>

impl<'n, N: 'n + DownMut> VerticalCursorMut for TreeCursorMut<'n, N>

fn get_mut(&mut self) -> &mut N