Struct SinglyLinkedList 

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

Bir tomonlama bog’langan ro’yxat.

Option<Box<Node<T>>> — Rustdagi eng tabiiy ko’rinish:

• None — ro’yxat/quyruq tugadi (NULL ning xavfsiz muqobili);
• Box — tugun heapda yashaydi, chunki uning o’lchami rekursiv.

Misol

use rust_algorithms::linked_list::SinglyLinkedList;

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

list.reverse();
assert_eq!(list.to_vec(), vec![3, 2, 1]);
assert_eq!(list.pop_front(), Some(3));
assert_eq!(list.len(), 2);

Implementations

impl<T> SinglyLinkedList<T>

pub fn new() -> Self

Bo’sh ro’yxat.

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

Boshiga qo’shadi — O(1), linked listning asosiy afzalligi.

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

Boshidan oladi — O(1).

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

Oxiriga qo’shadi — O(n), chunki oxirigacha yurish kerak.

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

Oxirgi elementni oladi — O(n).

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

Birinchi qiymatga qaraydi.

pub fn get(&self, index: usize) -> Option<&T>

index -qiymat (0 dan boshlab) — O(n).

pub fn reverse(&mut self)

Ro’yxatni joyida teskari o’giradi — O(n), qo’shimcha xotirasiz.

Klassik “uch ko’rsatkich” usuli: prev, curr, next. Har qadamda joriy tugunning strelkasini orqaga qaratamiz.

 boshida:  1 → 2 → 3 → ✕
 1-qadam:  ✕ ← 1   2 → 3 → ✕
 oxirida:  ✕ ← 1 ← 2 ← 3

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

O’rtadagi element (ikkita “ko’rsatkich” usuli: tez va sekin).

G’oya: sekin ko’rsatkich 1 qadam, tez ko’rsatkich 2 qadam yuradi. Tez ko’rsatkich oxiriga yetganda sekini roppa-rosa o’rtada bo’ladi — ro’yxat uzunligini oldindan bilmasdan, bitta yurishda.

Misol

use rust_algorithms::linked_list::SinglyLinkedList;

let list: SinglyLinkedList<i32> = (1..=5).collect();
assert_eq!(list.middle(), Some(&3));

pub fn len(&self) -> usize

Elementlar soni — O(1) (hisoblab boriladi).

pub fn is_empty(&self) -> bool

Bo’shmi?

pub fn iter(&self) -> Iter<'_, T>

Boshidan oxirigacha iterator.

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

where T: Clone,

Vektorga aylantiradi (nusxa olmasdan — havolalar orqali yig’adi).

impl<T: PartialEq> SinglyLinkedList<T>

pub fn contains(&self, value: &T) -> bool

Qiymat ro’yxatda bormi? — O(n).

Trait Implementations

impl<T: Debug> Debug for SinglyLinkedList<T>

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

Formats the value using the given formatter.

impl<T> Default for SinglyLinkedList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for SinglyLinkedList<T>

Rekursiv Drop stack overflow bermasligi uchun qo’lda bo’shatamiz.

Standart drop millionta tugunli ro’yxatda rekursiv chaqiriladi va stack tugab qoladi. Bu yerda tugunlarni tsikl bilan birma-bir ozod qilamiz.

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 SinglyLinkedList<T>

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

Creates a value from an iterator.