Struct gear_common::storage::DequeueImpl
source · 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>;
Expand description
Dequeue
implementation based on MapStorage
and ValueStorage
s.
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§
source§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>,
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>,
source§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>,
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>,
source§fn pop_back() -> Result<Option<Self::Value>, Self::Error>
fn pop_back() -> Result<Option<Self::Value>, Self::Error>
Very expensive operation! Use dequeue based on double linked list instead!
source§fn mutate_values<F: FnMut(Self::Value) -> Self::Value>(f: F)
fn mutate_values<F: FnMut(Self::Value) -> Self::Value>(f: F)
Mutates all stored value with given function.
source§fn pop_front() -> Result<Option<Self::Value>, Self::Error>
fn pop_front() -> Result<Option<Self::Value>, Self::Error>
Removes and returns head value of the dequeue, if present.
source§fn push_back(key: Self::Key, value: Self::Value) -> Result<(), Self::Error>
fn push_back(key: Self::Key, value: Self::Value) -> Result<(), Self::Error>
Inserts value to the end of dequeue with given key.
source§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>,
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>
type DrainIter = DequeueDrainIter<Key, Value, Error, HVS, TVS, MS, Callbacks>
Removal iterator type.
§type Iter = DequeueIter<Key, Value, Error, HVS, TVS, MS>
type Iter = DequeueIter<Key, Value, Error, HVS, TVS, MS>
Getting iterator type.
Auto Trait Implementations§
impl<Key, Value, Error, HVS, TVS, MS, Callbacks> Freeze for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>
impl<Key, Value, Error, HVS, TVS, MS, Callbacks> RefUnwindSafe for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>where
Error: RefUnwindSafe,
HVS: RefUnwindSafe,
TVS: RefUnwindSafe,
MS: RefUnwindSafe,
Callbacks: RefUnwindSafe,
impl<Key, Value, Error, HVS, TVS, MS, Callbacks> Send for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>
impl<Key, Value, Error, HVS, TVS, MS, Callbacks> Sync for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>
impl<Key, Value, Error, HVS, TVS, MS, Callbacks> Unpin for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>
impl<Key, Value, Error, HVS, TVS, MS, Callbacks> UnwindSafe for DequeueImpl<Key, Value, Error, HVS, TVS, MS, Callbacks>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
Formats each item in a sequence. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
into the pipe function.§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of
T
. Read more§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.