pub(super) struct Queue<N> {
indices: Option<Indices>,
_p: PhantomData<N>,
}
Fields§
§indices: Option<Indices>
§_p: PhantomData<N>
Implementations§
source§impl<N> Queue<N>where
N: Next,
impl<N> Queue<N>where
N: Next,
pub fn new() -> Self
pub fn take(&mut self) -> Self
sourcepub fn push(&mut self, stream: &mut Ptr<'_>) -> bool
pub fn push(&mut self, stream: &mut Ptr<'_>) -> bool
Queue the stream.
If the stream is already contained by the list, return false
.
sourcepub fn push_front(&mut self, stream: &mut Ptr<'_>) -> bool
pub fn push_front(&mut self, stream: &mut Ptr<'_>) -> bool
Queue the stream
If the stream is already contained by the list, return false
.
pub fn pop<'a, R>(&mut self, store: &'a mut R) -> Option<Ptr<'a>>where
R: Resolve,
pub fn is_empty(&self) -> bool
pub fn pop_if<'a, R, F>(&mut self, store: &'a mut R, f: F) -> Option<Ptr<'a>>
Trait Implementations§
Auto Trait Implementations§
impl<N> Freeze for Queue<N>
impl<N> RefUnwindSafe for Queue<N>where
N: RefUnwindSafe,
impl<N> Send for Queue<N>where
N: Send,
impl<N> Sync for Queue<N>where
N: Sync,
impl<N> Unpin for Queue<N>where
N: Unpin,
impl<N> UnwindSafe for Queue<N>where
N: UnwindSafe,
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