Struct orx_selfref_col::NodeRefNone

pub struct NodeRefNone(/* private fields */);

An empty single node, used to represent cases where the node does not hold any reference.

The following are some example references which can be expressed by NodeRefNone:

• previous node in a singly linked list;
• parent of a node in a tree where bottom up traversal is not necessary.

Trait Implementations

impl Clone for NodeRefNone

fn clone(&self) -> NodeRefNone

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeRefNone

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

Formats the value using the given formatter.

impl Default for NodeRefNone

fn default() -> NodeRefNone

Returns the “default value” for a type.

impl<'a, V, T> NodeRefs<'a, V, T> for NodeRefNone

where V: Variant<'a, T>,

type References = ()

Type of the underlying references.

fn new(_: Self::References) -> Self

Creates a new node references for the given references.

fn get(&self) -> &Self::References

Returns a reference to the underlying references.

fn get_mut(&mut self) -> &mut Self::References

Returns a mutable reference to the underlying references.

fn update_reference(&mut self, _: &'a Node<'a, V, T>, _: &'a Node<'a, V, T>)

Updates this reference so that all internal references to the prior_reference are updated as new_reference. Does nothing if this NodeRefs does not hold a reference to the prior_reference.

fn referenced_nodes(&self) -> impl Iterator<Item = &'a Node<'a, V, T>>

where V: 'a, T: 'a,

Returns an iterator to the referenced nodes.

fn empty() -> Self

Creates empty references.

impl<'rf, 'a, V, T, P> Reclaim<NodeRefNone, NodeRefSingle<'a, V, T>> for SelfRefColMut<'rf, 'a, V, T, P>

where T: 'a, V: Variant<'a, T, Storage = NodeDataLazyClose<T>, Prev = NodeRefNone, Next = NodeRefSingle<'a, V, T>>, P: PinnedVec<Node<'a, V, T>> + 'a,

fn reclaim(&mut self)

Reclaims holes due to removals from the collection; i.e., not utilized memory.

impl<'rf, 'a, const N: usize, V, T, P> Reclaim<NodeRefNone, NodeRefsArray<'a, N, V, T>> for SelfRefColMut<'rf, 'a, V, T, P>

where T: 'a, V: Variant<'a, T, Storage = NodeDataLazyClose<T>, Prev = NodeRefNone, Next = NodeRefsArray<'a, N, V, T>>, P: PinnedVec<Node<'a, V, T>> + 'a,

fn reclaim(&mut self)

Reclaims holes due to removals from the collection; i.e., not utilized memory.

impl<'rf, 'a, V, T, P> Reclaim<NodeRefNone, NodeRefsVec<'a, V, T>> for SelfRefColMut<'rf, 'a, V, T, P>

where T: 'a, V: Variant<'a, T, Storage = NodeDataLazyClose<T>, Prev = NodeRefNone, Next = NodeRefsVec<'a, V, T>>, P: PinnedVec<Node<'a, V, T>> + 'a,

fn reclaim(&mut self)

Reclaims holes due to removals from the collection; i.e., not utilized memory.

impl<'rf, 'a, V, T, P> Reclaim<NodeRefSingle<'a, V, T>, NodeRefNone> for SelfRefColMut<'rf, 'a, V, T, P>

where T: 'a, V: Variant<'a, T, Storage = NodeDataLazyClose<T>, Prev = NodeRefSingle<'a, V, T>, Next = NodeRefNone>, P: PinnedVec<Node<'a, V, T>> + 'a,

fn reclaim(&mut self)

Reclaims holes due to removals from the collection; i.e., not utilized memory.

impl<'rf, 'a, const N: usize, V, T, P> Reclaim<NodeRefsArray<'a, N, V, T>, NodeRefNone> for SelfRefColMut<'rf, 'a, V, T, P>

where T: 'a, V: Variant<'a, T, Storage = NodeDataLazyClose<T>, Prev = NodeRefsArray<'a, N, V, T>, Next = NodeRefNone>, P: PinnedVec<Node<'a, V, T>> + 'a,

fn reclaim(&mut self)

Reclaims holes due to removals from the collection; i.e., not utilized memory.

impl<'rf, 'a, V, T, P> Reclaim<NodeRefsVec<'a, V, T>, NodeRefNone> for SelfRefColMut<'rf, 'a, V, T, P>

where T: 'a, V: Variant<'a, T, Storage = NodeDataLazyClose<T>, Prev = NodeRefsVec<'a, V, T>, Next = NodeRefNone>, P: PinnedVec<Node<'a, V, T>> + 'a,

fn reclaim(&mut self)

Reclaims holes due to removals from the collection; i.e., not utilized memory.