Struct Node

pub struct Node<T> {
    pub v: T,
    /* private fields */
}

Fields

v: T

Implementations

impl<T> Node<T>

pub fn new(v: T) -> Rc<RefCell<Node<T>>>

pub fn splay(node: &Rc<RefCell<Node<T>>>)

pub fn get(root: Rc<RefCell<Node<T>>>, i: usize) -> Rc<RefCell<Node<T>>>

pub fn merge( l: Option<Rc<RefCell<Node<T>>>>, r: Option<Rc<RefCell<Node<T>>>>, ) -> Option<Rc<RefCell<Node<T>>>>

pub fn split( root: Option<Rc<RefCell<Node<T>>>>, i: usize, ) -> (Option<Rc<RefCell<Node<T>>>>, Option<Rc<RefCell<Node<T>>>>)

pub fn insert( root: Option<Rc<RefCell<Node<T>>>>, i: usize, node: Option<Rc<RefCell<Node<T>>>>, ) -> Option<Rc<RefCell<Node<T>>>>

pub fn pop( root: Rc<RefCell<Node<T>>>, i: usize, ) -> (Rc<RefCell<Node<T>>>, Option<Rc<RefCell<Node<T>>>>)

pub fn binary_search<F>(f: F, root: Option<&'_ Rc<RefCell<Node<T>>>>) -> usize

where F: Fn(&T) -> bool,