Struct WeakNode 

pub struct WeakNode<T: Debug + Clone> {
    pub inner: Weak<HedelCell<NodeInner<T>>>,
}

Rc is a strong pointer meaning it increment a reference counter. Weak is a weak pointer meaning it doesn’t increment the reference counter, letting you access the value if it still exists in memory, modify it as its pointing to HedelCell, but without holding it in memory any longer. Necessary to avoid memory leaking.

Fields

inner: Weak<HedelCell<NodeInner<T>>>

Implementations

impl<T: Debug + Clone> WeakNode<T>

pub fn upgrade(&self) -> Option<Node<T>>

upgrade WeakNode to Node if the NodeInner is still alive.

Trait Implementations

impl<T: Clone + Debug + Clone> Clone for WeakNode<T>

fn clone(&self) -> WeakNode<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Debug + Clone> Debug for WeakNode<T>

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

Formats the value using the given formatter.