Struct LazyList

pub struct LazyList<T: Clone> { /* private fields */ }

lazy-cogs implementation of a LinkedList. It’s a collection meant to be used when you need to work with the whole data, not it’s elements

Cloning a LazyList is always O(1). Modifing or getting piecies of data is O(n). Actually, pushing and popping into/from the front or back of the list may be O(1) is the list is mutable

Implementations

impl<T: Clone> LazyList<T>

pub fn new() -> Self

Creates a new empty LazyList

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

Obtains a reference to a specific value in the list

If the index is out of range it returns None

This operation is always O(n)

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

Obtains a mutable reference to a specific value in the list

If the index is out of range it returns None

This operation is protected, it means, that the other clones aren’t affected

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

Obtains a lazy clone to a specific value in the list

pub fn set(&mut self, index: usize, value: T) -> Result<(), ()>

Changes the value at a given position of the list

Returns Ok(()) if the index is in-bounds and Err(()) if not

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

Pushes a new element at the end of the list

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

Pushes a new element at the beginning of the list

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

Pops an element from the end of the list and returns the lazy clone to the value

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

Pops an element from the beginning of the list and returns the lazy clone to the value

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

Pops an element from the end of the list and returns the lazy clone to the value

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

Pops an element from the beginning of the list and returns the lazy clone to the value

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

Returns a reference to the first element of the list

Return None if the list is empty

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

Returns a mutable reference to the first element of the list

Return None if the list is empty

This operation is protected, it means, that the other clones aren’t affected

pub fn front_lazy(&self) -> Option<Lc<T>>

Returns a lazy clone to the first element of the list

Returns None if the list is empty

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

Returns a reference to the last element of the list

Return None if the list is empty

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

Returns a mutable reference to the last element of the list

Return None if the list is empty

This operation is protected, it means, that the other clones aren’t affected

pub fn back_lazy(&self) -> Option<Lc<T>>

Returns a lazy clone to the last element of the list

Returns None if the list is empty

pub fn iter(&self) -> impl Iterator<Item = &T>

Produces an iterator over the elements of the list

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut T>

Produces a mutable iterator over the elements of the list

Trait Implementations

impl<T: Debug + Clone> Debug for LazyList<T>

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

Formats the value using the given formatter.

impl<T: Clone> From<&[T]> for LazyList<T>

fn from(value: &[T]) -> Self

Converts to this type from the input type.

impl<T: Clone> From<LinkedList<Lc<T>>> for LazyList<T>

fn from(value: LinkedList<Lc<T>>) -> Self

Converts to this type from the input type.

impl<T: Clone> From<LinkedList<T>> for LazyList<T>

fn from(value: LinkedList<T>) -> Self

Converts to this type from the input type.

impl<T: Clone> From<Vec<Lc<T>>> for LazyList<T>

fn from(value: Vec<Lc<T>>) -> Self

Converts to this type from the input type.

impl<T: Clone> From<Vec<T>> for LazyList<T>

fn from(value: Vec<T>) -> Self

Converts to this type from the input type.

impl<T: Clone> FromIterator<T> for LazyList<T>

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

Creates a value from an iterator.

impl<T: Clone> Into<LinkedList<Lc<T>>> for LazyList<T>

fn into(self) -> LinkedList<Lc<T>>

Converts this type into the (usually inferred) input type.

impl<T: Clone> Into<LinkedList<T>> for LazyList<T>

fn into(self) -> LinkedList<T>

Converts this type into the (usually inferred) input type.

impl<T: Clone> IntoIterator for LazyList<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Clone> LazyClone for LazyList<T>

fn lazy(&self) -> Self

The O(1) lazy-clone method. Useful for cloning data that doesn’t necessarily need to be mutated.

fn eager(&self) -> Self

A non-lazy cloning method. Useful for cloning data that is known to modified

fn is_mutable(&self) -> bool

Checks if the structure can be mutated with no side effects