Struct DequeueImpl 

pub struct DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>(/* private fields */)
where
    Key: Clone + PartialEq,
    Error: DequeueError,
    HVS: ValueStorage<Value = Key>,
    TVS: ValueStorage<Value = Key>,
    MS: MapStorage<Key = Key, Value = LinkedNode<Key, Value>>,
    Callbacks: DequeueCallbacks<Value = Value>;

Dequeue implementation based on MapStorage and ValueStorages.

Generic parameters Key and Value specify data and keys for storing. Generic parameter Error requires DequeueError implementation. Generic parameter Callbacks presents actions for success operations over dequeue.

Trait Implementations

impl<Key, Value, Error, HVS, TVS, MS, Callbacks> Counted for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>

where Key: Clone + PartialEq, Error: DequeueError, HVS: ValueStorage<Value = Key>, TVS: ValueStorage<Value = Key>, MS: MapStorage<Key = Key, Value = LinkedNode<Key, Value>> + Counted, Callbacks: DequeueCallbacks<Value = Value>,

type Length = <MS as Counted>::Length

Returning length type.

fn len() -> Self::Length

Returns current Self’s amount of elements as Length type.

fn is_empty() -> bool

Returns bool, defining if Self doesn’t contain elements.

impl<Key, Value, Error, HVS, TVS, MS, Callbacks> Dequeue for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>

where Key: Clone + PartialEq, Error: DequeueError, HVS: ValueStorage<Value = Key>, TVS: ValueStorage<Value = Key>, MS: MapStorage<Key = Key, Value = LinkedNode<Key, Value>>, Callbacks: DequeueCallbacks<Value = Value>,

fn pop_back() -> Result<Option<Self::Value>, Self::Error>

Very expensive operation! Use dequeue based on double linked list instead!

type Key = Key

Dequeue’s elements stored key.

type Value = Value

Dequeue’s elements stored value.

type Error = Error

Dequeue error type.

fn mutate_values<F: FnMut(Self::Value) -> Self::Value>(f: F)

Mutates all stored value with given function.

fn pop_front() -> Result<Option<Self::Value>, Self::Error>

Removes and returns head value of the dequeue, if present.

fn push_back(key: Self::Key, value: Self::Value) -> Result<(), Self::Error>

Inserts value to the end of dequeue with given key.

fn push_front(key: Self::Key, value: Self::Value) -> Result<(), Self::Error>

Inserts value to the beginning of dequeue with given key.

fn clear()

Removes all values.

impl<Key, Value, Error, HVS, TVS, MS, Callbacks> IterableMap<Result<Value, Error>> for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>

where Key: Clone + PartialEq, Error: DequeueError, HVS: ValueStorage<Value = Key>, TVS: ValueStorage<Value = Key>, MS: MapStorage<Key = Key, Value = LinkedNode<Key, Value>>, Callbacks: DequeueCallbacks<Value = Value>,

type DrainIter = DequeueDrainIter<Key, Value, Error, HVS, TVS, MS, Callbacks>

Removal iterator type.

type Iter = DequeueIter<Key, Value, Error, HVS, TVS, MS>

Getting iterator type.

fn drain() -> Self::DrainIter

Creates the removal iterator over map Items.

fn iter() -> Self::Iter

Creates the getting iterator over map Items.