1.0.0[−][src]Struct nom::lib::std::collections::linked_list::LinkedList
A doubly-linked list with owned nodes.
The LinkedList
allows pushing and popping elements at either end
in constant time.
Almost always it is better to use Vec
or VecDeque
instead of
LinkedList
. In general, array-based containers are faster,
more memory efficient and make better use of CPU cache.
Methods
impl<T> LinkedList<T>
[src][−]
pub fn new() -> LinkedList<T>
[src][−]
Creates an empty LinkedList
.
Examples
use std::collections::LinkedList; let list: LinkedList<u32> = LinkedList::new();
pub fn append(&mut self, other: &mut LinkedList<T>)
[src][−]
Moves all elements from other
to the end of the list.
This reuses all the nodes from other
and moves them into self
. After
this operation, other
becomes empty.
This operation should compute in O(1) time and O(1) memory.
Examples
use std::collections::LinkedList; let mut list1 = LinkedList::new(); list1.push_back('a'); let mut list2 = LinkedList::new(); list2.push_back('b'); list2.push_back('c'); list1.append(&mut list2); let mut iter = list1.iter(); assert_eq!(iter.next(), Some(&'a')); assert_eq!(iter.next(), Some(&'b')); assert_eq!(iter.next(), Some(&'c')); assert!(iter.next().is_none()); assert!(list2.is_empty());
ⓘImportant traits for Iter<'a, T>pub fn iter(&self) -> Iter<T>
[src][−]
Provides a forward iterator.
Examples
use std::collections::LinkedList; let mut list: LinkedList<u32> = LinkedList::new(); list.push_back(0); list.push_back(1); list.push_back(2); let mut iter = list.iter(); assert_eq!(iter.next(), Some(&0)); assert_eq!(iter.next(), Some(&1)); assert_eq!(iter.next(), Some(&2)); assert_eq!(iter.next(), None);
ⓘImportant traits for IterMut<'a, T>pub fn iter_mut(&mut self) -> IterMut<T>
[src][−]
Provides a forward iterator with mutable references.
Examples
use std::collections::LinkedList; let mut list: LinkedList<u32> = LinkedList::new(); list.push_back(0); list.push_back(1); list.push_back(2); for element in list.iter_mut() { *element += 10; } let mut iter = list.iter(); assert_eq!(iter.next(), Some(&10)); assert_eq!(iter.next(), Some(&11)); assert_eq!(iter.next(), Some(&12)); assert_eq!(iter.next(), None);
pub fn is_empty(&self) -> bool
[src][−]
Returns true
if the LinkedList
is empty.
This operation should compute in O(1) time.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); assert!(dl.is_empty()); dl.push_front("foo"); assert!(!dl.is_empty());
pub fn len(&self) -> usize
[src][−]
Returns the length of the LinkedList
.
This operation should compute in O(1) time.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); dl.push_front(2); assert_eq!(dl.len(), 1); dl.push_front(1); assert_eq!(dl.len(), 2); dl.push_back(3); assert_eq!(dl.len(), 3);
pub fn clear(&mut self)
[src][−]
Removes all elements from the LinkedList
.
This operation should compute in O(n) time.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); dl.push_front(2); dl.push_front(1); assert_eq!(dl.len(), 2); assert_eq!(dl.front(), Some(&1)); dl.clear(); assert_eq!(dl.len(), 0); assert_eq!(dl.front(), None);
pub fn contains(&self, x: &T) -> bool where
T: PartialEq<T>,
1.12.0[src][−]
T: PartialEq<T>,
Returns true
if the LinkedList
contains an element equal to the
given value.
Examples
use std::collections::LinkedList; let mut list: LinkedList<u32> = LinkedList::new(); list.push_back(0); list.push_back(1); list.push_back(2); assert_eq!(list.contains(&0), true); assert_eq!(list.contains(&10), false);
pub fn front(&self) -> Option<&T>
[src][−]
Provides a reference to the front element, or None
if the list is
empty.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); assert_eq!(dl.front(), None); dl.push_front(1); assert_eq!(dl.front(), Some(&1));
pub fn front_mut(&mut self) -> Option<&mut T>
[src][−]
Provides a mutable reference to the front element, or None
if the list
is empty.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); assert_eq!(dl.front(), None); dl.push_front(1); assert_eq!(dl.front(), Some(&1)); match dl.front_mut() { None => {}, Some(x) => *x = 5, } assert_eq!(dl.front(), Some(&5));
pub fn back(&self) -> Option<&T>
[src][−]
Provides a reference to the back element, or None
if the list is
empty.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); assert_eq!(dl.back(), None); dl.push_back(1); assert_eq!(dl.back(), Some(&1));
pub fn back_mut(&mut self) -> Option<&mut T>
[src][−]
Provides a mutable reference to the back element, or None
if the list
is empty.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); assert_eq!(dl.back(), None); dl.push_back(1); assert_eq!(dl.back(), Some(&1)); match dl.back_mut() { None => {}, Some(x) => *x = 5, } assert_eq!(dl.back(), Some(&5));
pub fn push_front(&mut self, elt: T)
[src][−]
Adds an element first in the list.
This operation should compute in O(1) time.
Examples
use std::collections::LinkedList; let mut dl = LinkedList::new(); dl.push_front(2); assert_eq!(dl.front().unwrap(), &2); dl.push_front(1); assert_eq!(dl.front().unwrap(), &1);
pub fn pop_front(&mut self) -> Option<T>
[src][−]
Removes the first element and returns it, or None
if the list is
empty.
This operation should compute in O(1) time.
Examples
use std::collections::LinkedList; let mut d = LinkedList::new(); assert_eq!(d.pop_front(), None); d.push_front(1); d.push_front(3); assert_eq!(d.pop_front(), Some(3)); assert_eq!(d.pop_front(), Some(1)); assert_eq!(d.pop_front(), None);
pub fn push_back(&mut self, elt: T)
[src][−]
Appends an element to the back of a list.
This operation should compute in O(1) time.
Examples
use std::collections::LinkedList; let mut d = LinkedList::new(); d.push_back(1); d.push_back(3); assert_eq!(3, *d.back().unwrap());
pub fn pop_back(&mut self) -> Option<T>
[src][−]
Removes the last element from a list and returns it, or None
if
it is empty.
This operation should compute in O(1) time.
Examples
use std::collections::LinkedList; let mut d = LinkedList::new(); assert_eq!(d.pop_back(), None); d.push_back(1); d.push_back(3); assert_eq!(d.pop_back(), Some(3));
pub fn split_off(&mut self, at: usize) -> LinkedList<T>
[src][−]
Splits the list into two at the given index. Returns everything after the given index, including the index.
This operation should compute in O(n) time.
Panics
Panics if at > len
.
Examples
use std::collections::LinkedList; let mut d = LinkedList::new(); d.push_front(1); d.push_front(2); d.push_front(3); let mut splitted = d.split_off(2); assert_eq!(splitted.pop_front(), Some(1)); assert_eq!(splitted.pop_front(), None);
ⓘImportant traits for DrainFilter<'_, T, F>pub fn drain_filter<F>(&mut self, filter: F) -> DrainFilter<T, F> where
F: FnMut(&mut T) -> bool,
[src][−]
F: FnMut(&mut T) -> bool,
🔬 This is a nightly-only experimental API. (drain_filter
)
recently added
Creates an iterator which uses a closure to determine if an element should be removed.
If the closure returns true, then the element is removed and yielded. If the closure returns false, the element will remain in the list and will not be yielded by the iterator.
Note that drain_filter
lets you mutate every element in the filter closure, regardless of
whether you choose to keep or remove it.
Examples
Splitting a list into evens and odds, reusing the original list:
#![feature(drain_filter)] use std::collections::LinkedList; let mut numbers: LinkedList<u32> = LinkedList::new(); numbers.extend(&[1, 2, 3, 4, 5, 6, 8, 9, 11, 13, 14, 15]); let evens = numbers.drain_filter(|x| *x % 2 == 0).collect::<LinkedList<_>>(); let odds = numbers; assert_eq!(evens.into_iter().collect::<Vec<_>>(), vec![2, 4, 6, 8, 14]); assert_eq!(odds.into_iter().collect::<Vec<_>>(), vec![1, 3, 5, 9, 11, 13, 15]);
Trait Implementations
impl<T> Eq for LinkedList<T> where
T: Eq,
[src]
T: Eq,
impl<T> Hash for LinkedList<T> where
T: Hash,
[src][+]
T: Hash,
impl<T> FromIterator<T> for LinkedList<T>
[src][+]
impl<T> Default for LinkedList<T>
[src][+]
impl<T> IntoIterator for LinkedList<T>
[src][+]
impl<'a, T> IntoIterator for &'a LinkedList<T>
[src][+]
impl<'a, T> IntoIterator for &'a mut LinkedList<T>
[src][+]
impl<T> PartialEq<LinkedList<T>> for LinkedList<T> where
T: PartialEq<T>,
[src][+]
T: PartialEq<T>,
impl<T> Sync for LinkedList<T> where
T: Sync,
[src]
T: Sync,
impl<T> Clone for LinkedList<T> where
T: Clone,
[src][+]
T: Clone,
impl<T> Ord for LinkedList<T> where
T: Ord,
[src][+]
T: Ord,
impl<'a, T> Extend<&'a T> for LinkedList<T> where
T: 'a + Copy,
1.2.0[src][+]
T: 'a + Copy,
impl<T> Extend<T> for LinkedList<T>
[src][+]
impl<T> Drop for LinkedList<T>
[src][+]
impl<T> Send for LinkedList<T> where
T: Send,
[src]
T: Send,
impl<T> Debug for LinkedList<T> where
T: Debug,
[src][+]
T: Debug,
impl<T> PartialOrd<LinkedList<T>> for LinkedList<T> where
T: PartialOrd<T>,
[src][+]
T: PartialOrd<T>,
Auto Trait Implementations
impl<T> Unpin for LinkedList<T>
impl<T> UnwindSafe for LinkedList<T> where
T: RefUnwindSafe + UnwindSafe,
T: RefUnwindSafe + UnwindSafe,
impl<T> RefUnwindSafe for LinkedList<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
impl<T> From<T> for T
[src][+]
impl<T, U> Into<U> for T where
U: From<T>,
[src][+]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src][+]
I: Iterator,
impl<T> ToOwned for T where
T: Clone,
[src][+]
T: Clone,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src][+]
U: Into<T>,
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src][+]
U: TryFrom<T>,
impl<T> Borrow<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src][+]
T: 'static + ?Sized,