Struct orx_linked_list::MemoryReclaimNever

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

A do-nothing MemoryReclaimPolicy which would never reclaim the memory of the closed nodes, leaving them as holes in the underlying storage.

This approach has the advantage that a NodeIndex is never invalidated due to an automatic memory reorganization.

Furthermore, node utilization can still be maximized by manually calling reclaim_closed_nodes method.

Trait Implementations

impl Clone for MemoryReclaimNever

fn clone(&self) -> MemoryReclaimNever

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Default for MemoryReclaimNever

fn default() -> MemoryReclaimNever

Returns the “default value” for a type.

impl MemoryReclaimPolicy for MemoryReclaimNever

fn reclaim_closed_nodes<'rf, 'a, V, T, P>( _: &mut SelfRefColMut<'rf, 'a, V, T, P>, )

where T: 'a, V: Variant<'a, T, Storage = NodeDataLazyClose<T>>, P: PinnedVec<Node<'a, V, T>> + 'a, SelfRefColMut<'rf, 'a, V, T, P>: Reclaim<<V as Variant<'a, T>>::Prev, <V as Variant<'a, T>>::Next>,

Manually attempts to reclaim closed nodes.

fn at_the_same_state_as(&self, collection: &MemoryReclaimNever) -> bool

Returns whether or not two self referential collections are the same memory state or not. This method is used internally to check validity of NodeIndexes.

fn successor_state(&self) -> MemoryReclaimNever

Provides the state succeeding the current memory state.

impl Copy for MemoryReclaimNever