[−][src]Struct intrusive_collections::singly_linked_list::SinglyLinkedList
An intrusive singly-linked list.
When this collection is dropped, all elements linked into it will be converted back to owned pointers and dropped.
Implementations
impl<A: Adapter> SinglyLinkedList<A> where
A::LinkOps: SinglyLinkedListOps,
[src]
A::LinkOps: SinglyLinkedListOps,
pub const fn new(adapter: A) -> SinglyLinkedList<A>
[src]
Creates an empty SinglyLinkedList
.
pub fn is_empty(&self) -> bool
[src]
Returns true
if the SinglyLinkedList
is empty.
pub fn cursor(&self) -> Cursor<A>
[src]
Returns a null Cursor
for this list.
pub fn cursor_mut(&mut self) -> CursorMut<A>
[src]
Returns a null CursorMut
for this list.
pub unsafe fn cursor_from_ptr(
&self,
ptr: *const <A::PointerOps as PointerOps>::Value
) -> Cursor<A>
[src]
&self,
ptr: *const <A::PointerOps as PointerOps>::Value
) -> Cursor<A>
Creates a Cursor
from a pointer to an element.
Safety
ptr
must be a pointer to an object that is part of this list.
pub unsafe fn cursor_mut_from_ptr(
&mut self,
ptr: *const <A::PointerOps as PointerOps>::Value
) -> CursorMut<A>
[src]
&mut self,
ptr: *const <A::PointerOps as PointerOps>::Value
) -> CursorMut<A>
Creates a CursorMut
from a pointer to an element.
Safety
ptr
must be a pointer to an object that is part of this list.
pub fn front(&self) -> Cursor<A>
[src]
Returns a Cursor
pointing to the first element of the list. If the
list is empty then a null cursor is returned.
pub fn front_mut(&mut self) -> CursorMut<A>
[src]
Returns a CursorMut
pointing to the first element of the list. If the
the list is empty then a null cursor is returned.
pub fn iter(&self) -> Iter<A>
[src]
Gets an iterator over the objects in the SinglyLinkedList
.
pub fn clear(&mut self)
[src]
Removes all elements from the SinglyLinkedList
.
This will unlink all object currently in the list, which requires
iterating through all elements in the SinglyLinkedList
. Each element is
converted back to an owned pointer and then dropped.
pub fn fast_clear(&mut self)
[src]
Empties the SinglyLinkedList
without unlinking or freeing objects in it.
Since this does not unlink any objects, any attempts to link these
objects into another SinglyLinkedList
will fail but will not cause any
memory unsafety. To unlink those objects manually, you must call the
force_unlink
function on them.
pub fn take(&mut self) -> SinglyLinkedList<A> where
A: Clone,
[src]
A: Clone,
Takes all the elements out of the SinglyLinkedList
, leaving it empty.
The taken elements are returned as a new SinglyLinkedList
.
pub fn push_front(&mut self, val: <A::PointerOps as PointerOps>::Pointer)
[src]
Inserts a new element at the start of the SinglyLinkedList
.
pub fn pop_front(&mut self) -> Option<<A::PointerOps as PointerOps>::Pointer>
[src]
Removes the first element of the SinglyLinkedList
.
This returns None
if the SinglyLinkedList
is empty.
Trait Implementations
impl<A: Adapter> Debug for SinglyLinkedList<A> where
A::LinkOps: SinglyLinkedListOps,
<A::PointerOps as PointerOps>::Value: Debug,
[src]
A::LinkOps: SinglyLinkedListOps,
<A::PointerOps as PointerOps>::Value: Debug,
impl<A: Adapter + Default> Default for SinglyLinkedList<A> where
A::LinkOps: SinglyLinkedListOps,
[src]
A::LinkOps: SinglyLinkedListOps,
fn default() -> SinglyLinkedList<A>
[src]
impl<A: Adapter> Drop for SinglyLinkedList<A> where
A::LinkOps: SinglyLinkedListOps,
[src]
A::LinkOps: SinglyLinkedListOps,
impl<A: Adapter> IntoIterator for SinglyLinkedList<A> where
A::LinkOps: SinglyLinkedListOps,
[src]
A::LinkOps: SinglyLinkedListOps,
type Item = <A::PointerOps as PointerOps>::Pointer
The type of the elements being iterated over.
type IntoIter = IntoIter<A>
Which kind of iterator are we turning this into?
fn into_iter(self) -> IntoIter<A>
[src]
impl<'a, A: Adapter + 'a> IntoIterator for &'a SinglyLinkedList<A> where
A::LinkOps: SinglyLinkedListOps,
[src]
A::LinkOps: SinglyLinkedListOps,
type Item = &'a <A::PointerOps as PointerOps>::Value
The type of the elements being iterated over.
type IntoIter = Iter<'a, A>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Iter<'a, A>
[src]
impl<A: Adapter + Send> Send for SinglyLinkedList<A> where
<A::PointerOps as PointerOps>::Pointer: Send,
A::LinkOps: SinglyLinkedListOps,
[src]
<A::PointerOps as PointerOps>::Pointer: Send,
A::LinkOps: SinglyLinkedListOps,
impl<A: Adapter + Sync> Sync for SinglyLinkedList<A> where
<A::PointerOps as PointerOps>::Value: Sync,
A::LinkOps: SinglyLinkedListOps,
[src]
<A::PointerOps as PointerOps>::Value: Sync,
A::LinkOps: SinglyLinkedListOps,
Auto Trait Implementations
impl<A> Unpin for SinglyLinkedList<A> where
A: Unpin,
<<A as Adapter>::LinkOps as LinkOps>::LinkPtr: Unpin,
A: Unpin,
<<A as Adapter>::LinkOps as LinkOps>::LinkPtr: Unpin,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
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,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
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]
U: TryFrom<T>,