Struct algorithms_rs::queue::Queue

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

Queue data structure

Implementations

impl<T: Clone + Default> Queue<T>

pub fn new(length: usize) -> Self

Create an empty queue of fixed size

use algorithms_rs::Queue;

let empty_queue = Queue::<i32>::new(1);

assert_eq!(empty_queue.is_empty(), true);

pub fn is_empty(&self) -> bool

Determine if queue is empty

use algorithms_rs::Queue;

let empty_queue = Queue::<i32>::new(1);

assert_eq!(empty_queue.is_empty(), true);

Examples found in repository

src/queue.rs (line 101)

    pub fn de_queue(&mut self) -> anyhow::Result<T> {
        if self.is_empty() {
            return Err(anyhow::anyhow!("underflow"));
        }
        let element = self.data.get(self.head);
        if self.head == (self.len - 1) {
            self.head = 0;
        } else {
            self.head += 1;
        }
        Ok(element.unwrap().clone())
    }

pub fn en_queue(&mut self, element: T) -> Result<()>

Enter the queue from the end of the queue

use algorithms_rs::Queue;

let mut queue = Queue::<i32>::new(3);

queue.en_queue(1);
queue.en_queue(2);

assert_eq!(queue.is_empty(), false);

pub fn de_queue(&mut self) -> Result<T>

From the head of the queue Out of the queue

use algorithms_rs::Queue;

let mut queue = Queue::<i32>::new(3);

queue.en_queue(1);
queue.en_queue(2);

queue.de_queue();
queue.de_queue();

assert_eq!(queue.is_empty(), true);

Trait Implementations

impl<T: Debug> Debug for Queue<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.