pub struct List<T, P = RcK>where
P: SharedPointerKind,{ /* private fields */ }
Expand description
A persistent list with structural sharing.
Complexity
Let n be the number of elements in the list.
Temporal complexity
Operation | Average | Worst case |
---|---|---|
new() | Θ(1) | Θ(1) |
push_front() | Θ(1) | Θ(1) |
drop_first() | Θ(1) | Θ(1) |
reverse() | Θ(n) | Θ(n) |
first() | Θ(1) | Θ(1) |
last() | Θ(1) | Θ(1) |
len() | Θ(1) | Θ(1) |
clone() | Θ(1) | Θ(1) |
iterator creation | Θ(1) | Θ(1) |
iterator step | Θ(1) | Θ(1) |
iterator full | Θ(n) | Θ(n) |
Implementation details
This is your classic functional list with “cons” and “nil” nodes, with a little extra sauce to make some operations more efficient.
Implementations§
source§impl<T, P> List<T, P>where
P: SharedPointerKind,
impl<T, P> List<T, P>where
P: SharedPointerKind,
pub fn new_with_ptr_kind() -> List<T, P>
pub fn first(&self) -> Option<&T>
pub fn last(&self) -> Option<&T>
pub fn drop_first(&self) -> Option<List<T, P>>
pub fn drop_first_mut(&mut self) -> bool
pub fn push_front(&self, v: T) -> List<T, P>
pub fn push_front_mut(&mut self, v: T)
pub fn reverse(&self) -> List<T, P>
pub fn reverse_mut(&mut self)
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn iter(&self) -> Iter<'_, T, P>
Trait Implementations§
source§impl<T, P> Clone for List<T, P>where
P: SharedPointerKind,
impl<T, P> Clone for List<T, P>where
P: SharedPointerKind,
source§impl<T, P> Default for List<T, P>where
P: SharedPointerKind,
impl<T, P> Default for List<T, P>where
P: SharedPointerKind,
source§impl<'de, T, P> Deserialize<'de> for List<T, P>where
T: Deserialize<'de>,
P: SharedPointerKind,
impl<'de, T, P> Deserialize<'de> for List<T, P>where
T: Deserialize<'de>,
P: SharedPointerKind,
source§fn deserialize<D: Deserializer<'de>>(
deserializer: D
) -> Result<List<T, P>, D::Error>
fn deserialize<D: Deserializer<'de>>( deserializer: D ) -> Result<List<T, P>, D::Error>
Deserialize this value from the given Serde deserializer. Read more
source§impl<T, P> Drop for List<T, P>where
P: SharedPointerKind,
impl<T, P> Drop for List<T, P>where
P: SharedPointerKind,
source§impl<T, P> FromIterator<T> for List<T, P>where
P: SharedPointerKind,
impl<T, P> FromIterator<T> for List<T, P>where
P: SharedPointerKind,
source§impl<'a, T, P> IntoIterator for &'a List<T, P>where
P: SharedPointerKind,
impl<'a, T, P> IntoIterator for &'a List<T, P>where
P: SharedPointerKind,
source§impl<T: Ord, P> Ord for List<T, P>where
P: SharedPointerKind,
impl<T: Ord, P> Ord for List<T, P>where
P: SharedPointerKind,
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<T: PartialEq, P, PO> PartialEq<List<T, PO>> for List<T, P>where
P: SharedPointerKind,
PO: SharedPointerKind,
impl<T: PartialEq, P, PO> PartialEq<List<T, PO>> for List<T, P>where
P: SharedPointerKind,
PO: SharedPointerKind,
source§impl<T: PartialOrd<T>, P, PO> PartialOrd<List<T, PO>> for List<T, P>where
P: SharedPointerKind,
PO: SharedPointerKind,
impl<T: PartialOrd<T>, P, PO> PartialOrd<List<T, PO>> for List<T, P>where
P: SharedPointerKind,
PO: SharedPointerKind,
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl<T: Eq, P> Eq for List<T, P>where
P: SharedPointerKind,
Auto Trait Implementations§
impl<T, P> RefUnwindSafe for List<T, P>where
P: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, P> Send for List<T, P>
impl<T, P> Sync for List<T, P>
impl<T, P> Unpin for List<T, P>
impl<T, P> UnwindSafe for List<T, P>where
P: UnwindSafe,
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more