Struct DoublyLinkedList 

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

Ikki tomonlama bog’langan ro’yxat: har bir tugun oldingi va keyingisini biladi.

 ✕ ⇄ [10] ⇄ [20] ⇄ [30] ⇄ ✕
      ^head            ^tail

Ikkala uchdan ham qo’shish/olish O(1) — shuning uchun u deque sifatida ishlaydi.

Rust darsi: Rc, RefCell, Weak

• Rc<T> — bitta qiymatga bir nechta egalik (havolalar sanoqchisi bilan);
• RefCell<T> — o’zgartirishni ish vaqtida tekshirish (Rc ichida &mut olib bo’lmaydi, RefCell shu cheklovni “ichkariga” ko’chiradi);
• Weak<T> — sanoqchini oshirmaydigan havola; sikllarni oldini oladi.

Bu narx bilan keladi: har murojaatda borrow() tekshiruvi. Shuning uchun Rustda odatda VecDeque afzal.

Misol

use rust_algorithms::linked_list::DoublyLinkedList;

let mut l = DoublyLinkedList::new();
l.push_back(2);
l.push_back(3);
l.push_front(1);
assert_eq!(l.to_vec(), vec![1, 2, 3]);
assert_eq!(l.to_vec_rev(), vec![3, 2, 1]);

assert_eq!(l.pop_back(), Some(3));
assert_eq!(l.pop_front(), Some(1));
assert_eq!(l.len(), 1);

Implementations

impl<T> DoublyLinkedList<T>

pub fn new() -> Self

Bo’sh ro’yxat.

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

Boshiga qo’shadi — O(1).

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

Oxiriga qo’shadi — O(1) (bir tomonlama ro’yxatdan farqi shu!).

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

Boshidan oladi — O(1).

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

Oxiridan oladi — O(1).

pub fn len(&self) -> usize

Elementlar soni.

pub fn is_empty(&self) -> bool

Bo’shmi?

impl<T: Clone> DoublyLinkedList<T>

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

Birinchi qiymatning nusxasi.

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

Oxirgi qiymatning nusxasi.

pub fn to_vec(&self) -> Vec<T>

Boshidan oxirigacha vektor.

pub fn to_vec_rev(&self) -> Vec<T>

Oxiridan boshigacha vektor — prev havolalari ishlayotganini ko’rsatadi.

Trait Implementations

impl<T> Default for DoublyLinkedList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for DoublyLinkedList<T>

Rekursiv Drop dan qochish uchun tugunlarni tsiklda bo’shatamiz.

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<T> FromIterator<T> for DoublyLinkedList<T>

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

Creates a value from an iterator.