Struct Queue 

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

Halqasimon bufer (ring buffer) asosidagi navbat.

Nega Vec::remove(0) emas? U O(n) — hamma elementni chapga suradi. Bu yerda ikkita ko’rsatkich (head, len) bilan ishlaymiz va bufer oxiriga yetganda “boshiga o’ralib” ketamiz — natijada enqueue/dequeue O(1).

 bufer:  [ _ , C , D , E , _ ]
               ^head      ^ keyingi yozish joyi

Qayerda ishlatiladi: BFS, vazifalar navbati (task queue), printer navbati, tarmoq paketlari buferi.

Misol

use rust_algorithms::data_structures::Queue;

let mut q = Queue::new();
q.enqueue("Ali");
q.enqueue("Vali");
assert_eq!(q.front(), Some(&"Ali"));
assert_eq!(q.dequeue(), Some("Ali"));
assert_eq!(q.dequeue(), Some("Vali"));
assert_eq!(q.dequeue(), None);

Implementations

impl<T> Queue<T>

pub fn new() -> Self

Bo’sh navbat yaratadi.

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

Oxiriga element qo’shadi. O(1) amortizatsiyalangan.

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

Boshidan element oladi. O(1).

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

Navbatning boshidagi elementga qaraydi.

pub fn len(&self) -> usize

Elementlar soni.

pub fn is_empty(&self) -> bool

Bo’shmi?

Trait Implementations

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

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

Formats the value using the given formatter.

impl<T> Default for Queue<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> FromIterator<T> for Queue<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.