pub struct List<T> { /* private fields */ }Expand description
A singly linked list. See the crate-level documentation for more.
Implementations§
source§impl<T> List<T>
impl<T> List<T>
sourcepub fn push(&mut self, element: T)
pub fn push(&mut self, element: T)
Prepends an element to the beginning of the List.
Examples
use cons_rs::List;
let mut list = List::new();
list.push(1);
assert_eq!(list.peek(), Some(&1));
list.push(2);
assert_eq!(list.peek(), Some(&2));sourcepub fn pop(&mut self) -> Option<T>
pub fn pop(&mut self) -> Option<T>
Removes the element at the front of the List,
and returns it.
Examples
use cons_rs::List;
let mut list = List::new();
assert_eq!(list.pop(), None);
list.push(1);
assert_eq!(list.pop(), Some(1));
assert_eq!(list.pop(), None);sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Checks if the List is empty.
Examples
use cons_rs::List;
let mut list = List::new();
assert!(list.is_empty());
list.push(1);
assert!(!list.is_empty());sourcepub fn peek(&self) -> Option<&T>
pub fn peek(&self) -> Option<&T>
Returns an immutable reference to the value
at the head of the List, if it exists.
Examples
use cons_rs::List;
let mut list = List::new();
assert_eq!(list.peek(), None);
list.push(1);
assert_eq!(list.peek(), Some(&1));sourcepub fn peek_mut(&mut self) -> Option<&mut T>
pub fn peek_mut(&mut self) -> Option<&mut T>
Returns a mutable reference to the value
at the head of the List, if it exists.
Examples
use cons_rs::List;
let mut list = List::new();
assert_eq!(list.peek_mut(), None);
list.push(1);
assert_eq!(list.peek_mut(), Some(&mut 1));
*list.peek_mut().unwrap() = 50;
assert_eq!(list.peek_mut(), Some(&mut 50));sourcepub fn iter(&self) -> Iter<'_, T> ⓘ
pub fn iter(&self) -> Iter<'_, T> ⓘ
Creates an iterator that yields immutable references
to all the elements in the List.
To get mutable references, see iter_mut.
Examples
use cons_rs::List;
let mut list = List::new();
list.push(1);
list.push(2);
let mut iter = list.iter();
assert_eq!(iter.next(), Some(&2));
assert_eq!(iter.next(), Some(&1));
assert_eq!(iter.next(), None);sourcepub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ
pub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ
Creates an iterator that yields mutable references
to all the elements in the List.
To get immutable references, see iter.
Examples
use cons_rs::List;
let mut list = List::new();
list.push(1);
list.push(2);
for elem in list.iter_mut() {
*elem += 10;
}
assert_eq!(list.pop(), Some(12));
assert_eq!(list.pop(), Some(11));
assert_eq!(list.pop(), None);Trait Implementations§
source§impl<T> FromIterator<T> for List<T>
impl<T> FromIterator<T> for List<T>
source§fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self
Creates a value from an iterator. Read more
Auto Trait Implementations§
impl<T> RefUnwindSafe for List<T>where T: RefUnwindSafe,
impl<T> Send for List<T>where T: Send,
impl<T> Sync for List<T>where T: Sync,
impl<T> Unpin for List<T>
impl<T> UnwindSafe for List<T>where 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