Struct CDLL

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

Implementation of a Circular Doubly Linked List.

Trait Implementations

impl<T> Default for CDLL<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> From<Box<DNode<T>>> for CDLL<T>

fn from(node: Box<DNode<T>>) -> Self

Converts to this type from the input type.

impl<T> LL<T> for CDLL<T>

fn len(&self) -> usize

Return the length of the list.

fn head(&self) -> *mut DNode<T>

Returns a pointer to the beginning of the list.

fn tail(&self) -> *mut DNode<T>

Returns a pointer to the end of the list.

fn delete_at_index(&mut self, index: usize) -> Option<T>

Delete the element at the specified index.

fn insert(&mut self, data: T, index: usize)

Inserts data at the specified index from the left of the list.

fn print_addresses(&self)

where T: Debug,

Print the memory address layout of the list.

fn clear(&mut self)

Remove all elements from the list.

fn delete(&mut self, data: &T) -> Option<T>

where T: PartialEq,

Delete the element that matches data from the list.

fn delete_head(&mut self) -> Option<T>

Delete the first element from the list.

fn delete_tail(&mut self) -> Option<T>

Delete the last element from the list.

fn insert_head(&mut self, data: T)

Inserts data at the beginning of the list.

fn insert_sorted(&mut self, data: T)

where T: Default + PartialOrd,

Inserts data in the sorted position of the list, sorting it first it not already sorted.

fn insert_tail(&mut self, data: T)

Inserts data at the end of the list.

fn is_empty(&self) -> bool

Returns true if the list is empty.

fn is_sorted(&self) -> bool

where T: PartialOrd,

Returns true if the list is sorted.

fn iter_once(&self) -> LLIterOnce<'_, T>

Return an iterator that visits once each of the elements of the list.

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

Return an iterator that visits each of the elements of the list by following its internal pointers.

fn print(&self)

where T: Debug + PartialOrd,

Pretty print the list.

fn search(&self, data: &T) -> Option<&T>

where T: PartialEq,

Search data in the list, and returns a reference to it if found, or None.

fn sort(&mut self)

where T: Default + PartialOrd,

Sort the list in-place using insertion-sort.