pub struct TimelyStackQueue<T: Columnation> { /* private fields */ }
Expand description
TODO
Trait Implementations§
Source§impl<D: Ord + Columnation, T: Ord + Columnation, R: Columnation> ContainerQueue<TimelyStack<(D, T, R)>> for TimelyStackQueue<(D, T, R)>
impl<D: Ord + Columnation, T: Ord + Columnation, R: Columnation> ContainerQueue<TimelyStack<(D, T, R)>> for TimelyStackQueue<(D, T, R)>
Source§fn next_or_alloc(&mut self) -> Result<&(D, T, R), TimelyStack<(D, T, R)>>
fn next_or_alloc(&mut self) -> Result<&(D, T, R), TimelyStack<(D, T, R)>>
Returns either the next item in the container, or the container itself.
Source§fn is_empty(&self) -> bool
fn is_empty(&self) -> bool
Indicates whether
next_or_alloc
will return Ok
, and whether peek
will return Some
.Source§fn cmp_heads(&self, other: &Self) -> Ordering
fn cmp_heads(&self, other: &Self) -> Ordering
Compare the heads of two queues, where empty queues come last.
Source§fn from(list: TimelyStack<(D, T, R)>) -> Self
fn from(list: TimelyStack<(D, T, R)>) -> Self
Create a new queue from an existing container.
Auto Trait Implementations§
impl<T> Freeze for TimelyStackQueue<T>
impl<T> RefUnwindSafe for TimelyStackQueue<T>
impl<T> Send for TimelyStackQueue<T>
impl<T> Sync for TimelyStackQueue<T>
impl<T> Unpin for TimelyStackQueue<T>
impl<T> UnwindSafe for TimelyStackQueue<T>
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
Source§impl<'a, S, T> Semigroup<&'a S> for Twhere
T: Semigroup<S>,
impl<'a, S, T> Semigroup<&'a S> for Twhere
T: Semigroup<S>,
Source§fn plus_equals(&mut self, rhs: &&'a S)
fn plus_equals(&mut self, rhs: &&'a S)
The method of
std::ops::AddAssign
, for types that do not implement AddAssign
.