Struct intrusive_collections::linked_list::LinkedList
source · Expand description
An intrusive doubly-linked list.
When this collection is dropped, all elements linked into it will be converted back to owned pointers and dropped.
Implementations
sourceimpl<A: Adapter<Link = Link>> LinkedList<A>
impl<A: Adapter<Link = Link>> LinkedList<A>
sourcepub fn new(adapter: A) -> LinkedList<A>
pub fn new(adapter: A) -> LinkedList<A>
Creates an empty LinkedList
.
sourcepub fn cursor_mut(&mut self) -> CursorMut<'_, A>
pub fn cursor_mut(&mut self) -> CursorMut<'_, A>
Returns a null CursorMut
for this list.
sourcepub unsafe fn cursor_from_ptr(&self, ptr: *const A::Value) -> Cursor<'_, A>
pub unsafe fn cursor_from_ptr(&self, ptr: *const A::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.
sourcepub unsafe fn cursor_mut_from_ptr(
&mut self,
ptr: *const A::Value
) -> CursorMut<'_, A>
pub unsafe fn cursor_mut_from_ptr(
&mut self,
ptr: *const A::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.
sourcepub fn front(&self) -> Cursor<'_, A>
pub fn front(&self) -> Cursor<'_, A>
Returns a Cursor
pointing to the first element of the list. If the
list is empty then a null cursor is returned.
sourcepub fn front_mut(&mut self) -> CursorMut<'_, A>
pub fn front_mut(&mut self) -> CursorMut<'_, A>
Returns a CursorMut
pointing to the first element of the list. If the
the list is empty then a null cursor is returned.
sourcepub fn back(&self) -> Cursor<'_, A>
pub fn back(&self) -> Cursor<'_, A>
Returns a Cursor
pointing to the last element of the list. If the list
is empty then a null cursor is returned.
sourcepub fn back_mut(&mut self) -> CursorMut<'_, A>
pub fn back_mut(&mut self) -> CursorMut<'_, A>
Returns a CursorMut
pointing to the last element of the list. If the
list is empty then a null cursor is returned.
sourcepub fn iter(&self) -> Iter<'_, A>ⓘNotable traits for Iter<'a, A>impl<'a, A: Adapter<Link = Link> + 'a> Iterator for Iter<'a, A> type Item = &'a A::Value;
pub fn iter(&self) -> Iter<'_, A>ⓘNotable traits for Iter<'a, A>impl<'a, A: Adapter<Link = Link> + 'a> Iterator for Iter<'a, A> type Item = &'a A::Value;
Gets an iterator over the objects in the LinkedList
.
sourcepub fn clear(&mut self)
pub fn clear(&mut self)
Removes all elements from the LinkedList
.
This will unlink all object currently in the list, which requires
iterating through all elements in the LinkedList
. Each element is
converted back to an owned pointer and then dropped.
sourcepub fn fast_clear(&mut self)
pub fn fast_clear(&mut self)
Empties the LinkedList
without unlinking or freeing objects in it.
Since this does not unlink any objects, any attempts to link these
objects into another LinkedList
will fail but will not cause any
memory unsafety. To unlink those objects manually, you must call the
force_unlink
function on them.
sourcepub fn take(&mut self) -> LinkedList<A>where
A: Clone,
pub fn take(&mut self) -> LinkedList<A>where
A: Clone,
Takes all the elements out of the LinkedList
, leaving it empty. The
taken elements are returned as a new LinkedList
.
sourcepub fn push_front(&mut self, val: A::Pointer)
pub fn push_front(&mut self, val: A::Pointer)
Inserts a new element at the start of the LinkedList
.
sourcepub fn push_back(&mut self, val: A::Pointer)
pub fn push_back(&mut self, val: A::Pointer)
Inserts a new element at the end of the LinkedList
.