[−][src]Struct algorithms_edu::data_structures::queue::FixedCapacityQueue
A custom implementation of a circular queue which is extremely quick and lightweight. However, the downside is you need to know an upper bound on the number of elements that will be inside the queue at any given time for this queue to work.
Implementations
impl<T: Clone> FixedCapacityQueue<T>
[src]
pub fn with_capacity(capacity: usize) -> Self
[src]
Initialize a queue where a maximum of max_sz
elements can be
in the queue at any given time
pub fn peek(&self) -> Option<&T>
[src]
Trait Implementations
impl<T: Clone> Queue<T> for FixedCapacityQueue<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for FixedCapacityQueue<T> where
T: RefUnwindSafe,
[src]
T: RefUnwindSafe,
impl<T> Send for FixedCapacityQueue<T> where
T: Send,
[src]
T: Send,
impl<T> Sync for FixedCapacityQueue<T> where
T: Sync,
[src]
T: Sync,
impl<T> Unpin for FixedCapacityQueue<T>
[src]
impl<T> UnwindSafe for FixedCapacityQueue<T> where
T: UnwindSafe,
[src]
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,