pub struct Cursor<'a, T> where T: 'a, { /* fields omitted */ }
A cursor over a LinkedList
.
A Cursor
is like an iterator, except that it can freely seek back-and-forth.
Cursors always rest between two elements in the list, and index in a logically circular way. To accommodate this, there is a "ghost" non-element that yields None
between the head and tail of the list.
When created, cursors start at the front of the list, or the "ghost" non-element if the list is empty.
impl<'a, T> Cursor<'a, T>
[src]
pub fn index(&self) -> Option<usize>
[src]
Returns the cursor position index within the LinkedList
.
This returns None
if the cursor is currently pointing to the "ghost" non-element.
pub fn move_next(&mut self)
[src]
Moves the cursor to the next element of the LinkedList
.
If the cursor is pointing to the "ghost" non-element then this will move it to the first element of the LinkedList
. If it is pointing to the last element of the LinkedList
then this will move it to the "ghost" non-element.
pub fn move_prev(&mut self)
[src]
Moves the cursor to the previous element of the LinkedList
.
If the cursor is pointing to the "ghost" non-element then this will move it to the last element of the LinkedList
. If it is pointing to the first element of the LinkedList
then this will move it to the "ghost" non-element.
pub fn current(&self) -> Option<&'a T>
[src]
Returns a reference to the element that the cursor is currently pointing to.
This returns None
if the cursor is currently pointing to the "ghost" non-element.
pub fn peek_next(&self) -> Option<&'a T>
[src]
Returns a reference to the next element.
If the cursor is pointing to the "ghost" non-element then this returns the first element of the LinkedList
. If it is pointing to the last element of the LinkedList
then this returns None
.
pub fn peek_prev(&self) -> Option<&'a T>
[src]
Returns a reference to the previous element.
If the cursor is pointing to the "ghost" non-element then this returns the last element of the LinkedList
. If it is pointing to the first element of the LinkedList
then this returns None
.
impl<'_, T> Clone for Cursor<'_, T>
[src]
impl<'_, T> Debug for Cursor<'_, T> where
T: Debug,
[src]
impl<'_, T> Send for Cursor<'_, T> where
T: Sync,
[src]
impl<'_, T> Sync for Cursor<'_, T> where
T: Sync,
[src]
impl<'a, T> RefUnwindSafe for Cursor<'a, T> where
T: RefUnwindSafe,
impl<'a, T> Unpin for Cursor<'a, T>
impl<'a, T> UnwindSafe for Cursor<'a, T> where
T: RefUnwindSafe,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
fn borrow(&self) -> &TⓘNotable traits for &'_ mut F
impl<'_, F> Future for &'_ mut F where
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output;
impl<'_, I> Iterator for &'_ mut I where
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item;
impl<R: Read + ?Sized, '_> Read for &'_ mut R
impl<W: Write + ?Sized, '_> Write for &'_ mut W
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
fn borrow_mut(&mut self) -> &mut TⓘNotable traits for &'_ mut F
impl<'_, F> Future for &'_ mut F where
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output;
impl<'_, I> Iterator for &'_ mut I where
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item;
impl<R: Read + ?Sized, '_> Read for &'_ mut R
impl<W: Write + ?Sized, '_> Write for &'_ mut W
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/collections/linked_list/struct.Cursor.html