Struct orx_linked_list::Singly

pub struct Singly<M = MemoryReclaimOnThreshold<2>>
where
    M: MemoryReclaimPolicy,
{ /* private fields */ }

A singly linked list variant such that:

• Each node contains two data elements: the value of the element and a reference to the next node.
• The list keeps track of its front.
• It is possible to iterate from the front to the back of the list.

Trait Implementations

impl<M> Clone for Singly<M>

where M: MemoryReclaimPolicy + Clone,

fn clone(&self) -> Singly<M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<M> Debug for Singly<M>

where M: MemoryReclaimPolicy + Debug,

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

Formats the value using the given formatter.

impl<'a, T, M> Variant<'a, T> for Singly<M>

where T: 'a, M: 'a + MemoryReclaimPolicy,

type Storage = NodeDataLazyClose<T>

The way the data will be stored.

type Prev = NodeRefNone

The way the previous node references will be stored.

type Next = NodeRefSingle<'a, Singly<M>, T>

The way the next node references will be stored.

type Ends = NodeRefsArray<'a, 2, Singly<M>, T>

The way the references to the ends or extremes of the collection will be stored.

type MemoryReclaim = M

The way how memory of closed nodes will be reclaimed:

impl<M> Copy for Singly<M>

where M: MemoryReclaimPolicy + Copy,