pub struct List<T: TransparentPtrType> { /* private fields */ }
Expand description
A list of items of type T
.
Behaves like an Iterator<Item = T>
but allows modifications.
Implementations§
Source§impl<T: TransparentPtrType> List<T>
impl<T: TransparentPtrType> List<T>
Sourcepub unsafe fn from_glib_none(list: *const GList) -> List<T>
pub unsafe fn from_glib_none(list: *const GList) -> List<T>
Create a new List
around a list.
Sourcepub unsafe fn from_glib_container(list: *mut GList) -> List<T>
pub unsafe fn from_glib_container(list: *mut GList) -> List<T>
Create a new List
around a list.
Sourcepub unsafe fn from_glib_full(list: *mut GList) -> List<T>
pub unsafe fn from_glib_full(list: *mut GList) -> List<T>
Create a new List
around a list.
Sourcepub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ
pub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ
Create a non-destructive mutable iterator over the List
.
Sourcepub fn front(&self) -> Option<&T>
pub fn front(&self) -> Option<&T>
Returns a reference to the first item of the list, if any.
This operation is O(1)
.
Sourcepub fn front_mut(&mut self) -> Option<&mut T>
pub fn front_mut(&mut self) -> Option<&mut T>
Returns a mutable reference to the first item of the list, if any.
This operation is O(1)
.
Sourcepub fn pop_front(&mut self) -> Option<T>
pub fn pop_front(&mut self) -> Option<T>
Removes the front item from the list, if any.
This operation is O(1)
.
Sourcepub fn push_front(&mut self, item: T)
pub fn push_front(&mut self, item: T)
Prepends the new item to the front of the list.
This operation is O(1)
.
Sourcepub fn back(&self) -> Option<&T>
pub fn back(&self) -> Option<&T>
Returns a reference to the last item of the list, if any.
This operation is O(n)
.
Sourcepub fn back_mut(&mut self) -> Option<&mut T>
pub fn back_mut(&mut self) -> Option<&mut T>
Returns a mutable reference to the last item of the list, if any.
This operation is O(n)
.
Sourcepub fn pop_back(&mut self) -> Option<T>
pub fn pop_back(&mut self) -> Option<T>
Removes the back item from the list, if any.
This operation is O(n)
.
Sourcepub fn push_back(&mut self, item: T)
pub fn push_back(&mut self, item: T)
Appends the new item to the back of the list.
this operation is O(n)
.
Sourcepub fn sort_by<F: FnMut(&T, &T) -> Ordering>(&mut self, f: F)
pub fn sort_by<F: FnMut(&T, &T) -> Ordering>(&mut self, f: F)
Sorts the list.
This operation is O(n * log n)
.
Sourcepub fn retain(&mut self, f: impl FnMut(&T) -> bool)
pub fn retain(&mut self, f: impl FnMut(&T) -> bool)
Only keeps the item in the list for which f
returns true
.
Sourcepub fn as_mut_ptr(&mut self) -> *mut GList
pub fn as_mut_ptr(&mut self) -> *mut GList
Returns the underlying pointer.
Trait Implementations§
Source§impl<T: TransparentPtrType> Clone for List<T>
impl<T: TransparentPtrType> Clone for List<T>
Source§impl<T: TransparentPtrType> Default for List<T>
impl<T: TransparentPtrType> Default for List<T>
Source§impl<T: TransparentPtrType> Drop for List<T>
impl<T: TransparentPtrType> Drop for List<T>
Source§impl<T: TransparentPtrType> Extend<T> for List<T>
impl<T: TransparentPtrType> Extend<T> for List<T>
Source§fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)