Struct Queue

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

A queue data structure with a fixed capacity.

This structure implements a simple queue where elements of type T are enqueued and dequeued according to the First-In-First-Out (FIFO) principle.

Implementations

impl<T> Queue<T>

pub fn new() -> Self

Creates a new, empty Queue.

Examples

use dsa::data_structures::queue::Queue;
let queue: Queue<i32> = Queue::new();
assert!(queue.is_empty());

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

Adds a value to the rear of the Queue.

Examples

use dsa::data_structures::queue::Queue;
let mut queue = Queue::new();
queue.enqueue(10);
queue.enqueue(20);
assert_eq!(queue.peek(), Some(&10));

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

Removes and returns the value at the front of the Queue.

Examples

use dsa::data_structures::queue::Queue;
let mut queue = Queue::new();
queue.enqueue(10);
queue.enqueue(20);
assert_eq!(queue.dequeue(), Some(10));
assert_eq!(queue.dequeue(), Some(20));
assert!(queue.dequeue().is_none());

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

Returns a reference to the value at the front without removing it.

Examples

use dsa::data_structures::queue::Queue;
let mut queue = Queue::new();
queue.enqueue(10);
queue.enqueue(20);
assert_eq!(queue.peek(), Some(&10));

pub fn is_empty(&self) -> bool

Checks if the Queue is empty.

Examples

use dsa::data_structures::queue::Queue;
let mut queue = Queue::new();
assert!(queue.is_empty());
queue.enqueue(10);
assert!(!queue.is_empty());

pub fn size(&self) -> usize

Returns the current size of the Queue.

Examples

use dsa::data_structures::queue::Queue;
let mut queue: Queue<i32> = Queue::new();
queue.enqueue(10);
queue.enqueue(20);
queue.dequeue();
assert_eq!(queue.size(), 1);