Struct orx_linked_list::MemoryReclaimOnThreshold

pub struct MemoryReclaimOnThreshold<const D: usize>(/* private fields */);

A MemoryReclaimPolicy which reclaims all closed nodes whenever the utilization falls below a threshold.

The threshold is a function of the constant generic parameter D. Specifically, memory of closed nodes will be reclaimed whenever the ratio of closed nodes to all nodes exceeds one over 2^D.

• when D = 0: memory will be reclaimed when utilization is below 0.00% (equivalent to never).
• when D = 1: memory will be reclaimed when utilization is below 50.00%.
• when D = 2: memory will be reclaimed when utilization is below 75.00%.
• when D = 3: memory will be reclaimed when utilization is below 87.50%.
• when D = 4: memory will be reclaimed when utilization is below 93.75%.
• …

Trait Implementations

impl<const D: usize> Clone for MemoryReclaimOnThreshold<D>

fn clone(&self) -> MemoryReclaimOnThreshold<D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<const D: usize> Default for MemoryReclaimOnThreshold<D>

fn default() -> MemoryReclaimOnThreshold<D>

Returns the “default value” for a type.

impl<const D: usize> MemoryReclaimPolicy for MemoryReclaimOnThreshold<D>

fn reclaim_closed_nodes<'rf, 'a, V, T, P>( vec_mut: &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: &MemoryReclaimOnThreshold<D>) -> 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) -> MemoryReclaimOnThreshold<D>

Provides the state succeeding the current memory state.

impl<const D: usize> Copy for MemoryReclaimOnThreshold<D>