pub struct Cursor<'a, T, A = Global>where
T: 'a,
A: Allocator,{ /* private fields */ }
linked_list_cursors
)std
only.Expand description
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.
Implementations§
Source§impl<'a, T, A> Cursor<'a, T, A>where
A: Allocator,
impl<'a, T, A> Cursor<'a, T, A>where
A: Allocator,
Sourcepub fn index(&self) -> Option<usize> ⓘ
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn index(&self) -> Option<usize> ⓘ
linked_list_cursors
)alloc
only.Returns the cursor position index within the LinkedList
.
This returns None
if the cursor is currently pointing to the
“ghost” non-element.
Sourcepub fn move_next(&mut self)
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn move_next(&mut self)
linked_list_cursors
)alloc
only.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.
Sourcepub fn move_prev(&mut self)
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn move_prev(&mut self)
linked_list_cursors
)alloc
only.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.
Sourcepub fn current(&self) -> Option<&'a T> ⓘ
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn current(&self) -> Option<&'a T> ⓘ
linked_list_cursors
)alloc
only.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.
Sourcepub fn peek_next(&self) -> Option<&'a T> ⓘ
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn peek_next(&self) -> Option<&'a T> ⓘ
linked_list_cursors
)alloc
only.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
.
Sourcepub fn peek_prev(&self) -> Option<&'a T> ⓘ
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn peek_prev(&self) -> Option<&'a T> ⓘ
linked_list_cursors
)alloc
only.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
.
Sourcepub fn front(&self) -> Option<&'a T> ⓘ
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn front(&self) -> Option<&'a T> ⓘ
linked_list_cursors
)alloc
only.Provides a reference to the front element of the cursor’s parent list, or None if the list is empty.
Sourcepub fn back(&self) -> Option<&'a T> ⓘ
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn back(&self) -> Option<&'a T> ⓘ
linked_list_cursors
)alloc
only.Provides a reference to the back element of the cursor’s parent list, or None if the list is empty.
Sourcepub fn as_list(&self) -> &'a LinkedList<T, A>
🔬This is a nightly-only experimental API. (linked_list_cursors
)Available on crate feature alloc
only.
pub fn as_list(&self) -> &'a LinkedList<T, A>
linked_list_cursors
)alloc
only.Provides a reference to the cursor’s parent list.
Trait Implementations§
impl<T, A> Send for Cursor<'_, T, A>
impl<T, A> Sync for Cursor<'_, T, A>
Auto Trait Implementations§
impl<'a, T, A> Freeze for Cursor<'a, T, A>
impl<'a, T, A> RefUnwindSafe for Cursor<'a, T, A>where
A: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, T, A> Unpin for Cursor<'a, T, A>
impl<'a, T, A> UnwindSafe for Cursor<'a, T, A>where
A: RefUnwindSafe,
T: RefUnwindSafe,
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.