Struct rust_algorithm_club::collections::Queue

source · [−]

pub struct Queue<T> { /* private fields */ }

Expand description

A queue-like data structure implement through std::vec::Vec.

This is a naive implementation whose insertion time complexity is O(n), which can be improved trivially by using a Deque or SinglyLinkedList.

References:

Queue (abstract data type)

Implementations

source

impl<T> Queue<T>

source

pub fn new() -> Self

Initialize a queue with empty vector

source

pub fn enqueue(&mut self, item: T)

Adds an element into queue.

Complexity

Constant.

source

pub fn dequeue(&mut self) -> Option<T>

Removes the oldest added element in queue.

Complexity

Linear in the size of the container.

source

pub fn peek(&self) -> Option<&T>

Retrieves the least recently added element without dequeuing.

Complexity

Constant.

source

pub fn size(&self) -> usize

Retrieves the size of the queue.

Complexity

Constant.

Auto Trait Implementations

impl<T> RefUnwindSafe for Queue<T> where
T: RefUnwindSafe,

impl<T> Send for Queue<T> where
T: Send,

impl<T> Sync for Queue<T> where
T: Sync,

impl<T> Unpin for Queue<T> where
T: Unpin,

impl<T> UnwindSafe for Queue<T> where
T: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

pub fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

pub fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct rust_algorithm_club::collections::Queue

Implementations

impl<T> Queue<T>

pub fn new() -> Self

pub fn enqueue(&mut self, item: T)

Complexity

pub fn dequeue(&mut self) -> Option<T>

Complexity

pub fn peek(&self) -> Option<&T>

Complexity

pub fn size(&self) -> usize

Complexity

Auto Trait Implementations

impl<T> RefUnwindSafe for Queue<T> where
T: RefUnwindSafe,

impl<T> Send for Queue<T> where
T: Send,

impl<T> Sync for Queue<T> where
T: Sync,

impl<T> Unpin for Queue<T> where
T: Unpin,

impl<T> UnwindSafe for Queue<T> where
T: UnwindSafe,

Blanket Implementations

impl<T> Any for T where
T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where
T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where
T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where
U: From<T>,

pub fn into(self) -> U

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct rust_algorithm_club::collections::Queue

Implementations

impl<T> Queue<T>

pub fn new() -> Self

pub fn enqueue(&mut self, item: T)

pub fn dequeue(&mut self) -> Option<T>

pub fn peek(&self) -> Option<&T>

pub fn size(&self) -> usize

Auto Trait Implementations

impl<T> RefUnwindSafe for Queue<T> where T: RefUnwindSafe,

impl<T> Send for Queue<T> where T: Send,

impl<T> Sync for Queue<T> where T: Sync,

impl<T> Unpin for Queue<T> where T: Unpin,

impl<T> UnwindSafe for Queue<T> where T: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> RefUnwindSafe for Queue<T> where
T: RefUnwindSafe,

impl<T> Send for Queue<T> where
T: Send,

impl<T> Sync for Queue<T> where
T: Sync,

impl<T> Unpin for Queue<T> where
T: Unpin,

impl<T> UnwindSafe for Queue<T> where
T: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,