Struct SList

pub struct SList<T>
where
    T: TransparentPtrType,
{ /* private fields */ }

A list of items of type T.

Behaves like an Iterator<Item = T> but allows modifications.

Implementations

impl<T> SList<T>

where T: TransparentPtrType,

pub unsafe fn from_glib_none(list: *const GSList) -> SList<T>

Create a new SList around a list.

pub unsafe fn from_glib_container(list: *mut GSList) -> SList<T>

Create a new SList around a list.

pub unsafe fn from_glib_full(list: *mut GSList) -> SList<T>

Create a new SList around a list.

pub fn new() -> SList<T>

Creates a new empty list.

pub fn iter(&self) -> Iter<'_, T>

Create a non-destructive iterator over the SList.

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Create a non-destructive mutable iterator over the SList.

pub fn is_empty(&self) -> bool

Check if the list is empty.

This operation is O(1).

pub fn len(&self) -> usize

Returns the length of the list.

This operation is O(n).

pub fn front(&self) -> Option<&T>

Returns a reference to the first item of the list, if any.

This operation is O(1).

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).

pub fn pop_front(&mut self) -> Option<T>

Removes the front item from the list, if any.

This operation is O(1).

pub fn push_front(&mut self, item: T)

Prepends the new item to the front of the list.

This operation is O(1).

pub fn back(&self) -> Option<&T>

Returns a reference to the last item of the list, if any.

This operation is O(n).

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).

pub fn pop_back(&mut self) -> Option<T>

Removes the back item from the list, if any.

This operation is O(n).

pub fn push_back(&mut self, item: T)

Appends the new item to the back of the list.

this operation is O(n).

pub fn reverse(&mut self)

Reverse the list.

This operation is O(n).

pub fn sort(&mut self)

where T: Ord,

Sorts the list.

This operation is O(n * log n).

pub fn sort_by<F>(&mut self, f: F)

where F: FnMut(&T, &T) -> Ordering,

Sorts the list.

This operation is O(n * log n).

pub fn clear(&mut self)

Removes all items from the list.

pub fn retain(&mut self, f: impl FnMut(&T) -> bool)

Only keeps the item in the list for which f returns true.

pub fn as_ptr(&self) -> *const GSList

Returns the underlying pointer.

pub fn as_mut_ptr(&mut self) -> *mut GSList

Returns the underlying pointer.

pub fn into_raw(self) -> *mut GSList

Consumes the list and returns the underlying pointer.

Trait Implementations

impl<T> Clone for SList<T>

where T: TransparentPtrType,

fn clone(&self) -> SList<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T> Default for SList<T>

where T: TransparentPtrType,

fn default() -> SList<T>

Returns the “default value” for a type.

impl<T> Drop for SList<T>

where T: TransparentPtrType,

fn drop(&mut self)

Executes the destructor for this type.

impl<T> Extend<T> for SList<T>

where T: TransparentPtrType,

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = T>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> FromGlibContainer<<T as GlibPtrDefault>::GlibType, *const GSList> for SList<T>

where T: TransparentPtrType,

unsafe fn from_glib_none_num(ptr: *const GSList, _num: usize) -> SList<T>

Transfer: none.

unsafe fn from_glib_container_num(_ptr: *const GSList, _num: usize) -> SList<T>

Transfer: container.

unsafe fn from_glib_full_num(_ptr: *const GSList, _num: usize) -> SList<T>

Transfer: full.

impl<T> FromGlibContainer<<T as GlibPtrDefault>::GlibType, *mut GSList> for SList<T>

where T: TransparentPtrType,

unsafe fn from_glib_none_num(ptr: *mut GSList, _num: usize) -> SList<T>

Transfer: none.

unsafe fn from_glib_container_num(ptr: *mut GSList, _num: usize) -> SList<T>

Transfer: container.

unsafe fn from_glib_full_num(ptr: *mut GSList, _num: usize) -> SList<T>

Transfer: full.

impl<T> FromGlibPtrContainer<<T as GlibPtrDefault>::GlibType, *const GSList> for SList<T>

where T: TransparentPtrType,

unsafe fn from_glib_none(ptr: *const GSList) -> SList<T>

Transfer: none.

unsafe fn from_glib_container(_ptr: *const GSList) -> SList<T>

Transfer: container.

unsafe fn from_glib_full(_ptr: *const GSList) -> SList<T>

Transfer: full.

impl<T> FromGlibPtrContainer<<T as GlibPtrDefault>::GlibType, *mut GSList> for SList<T>

where T: TransparentPtrType,

unsafe fn from_glib_none(ptr: *mut GSList) -> SList<T>

Transfer: none.

unsafe fn from_glib_container(ptr: *mut GSList) -> SList<T>

Transfer: container.

unsafe fn from_glib_full(ptr: *mut GSList) -> SList<T>

Transfer: full.

impl<T> FromIterator<T> for SList<T>

where T: TransparentPtrType,

fn from_iter<I>(iter: I) -> SList<T>

where I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<T> IntoGlibPtr<*mut GSList> for SList<T>

where T: TransparentPtrType,

fn into_glib_ptr(self) -> *mut GSList

Transfer: full.

impl<'a, T> IntoIterator for &'a SList<T>

where T: TransparentPtrType,

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a SList<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut SList<T>

where T: TransparentPtrType,

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a mut SList<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for SList<T>

where T: TransparentPtrType,

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <SList<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, T> ToGlibPtr<'a, *const GSList> for SList<T>

where T: TransparentPtrType + 'a,

type Storage = PhantomData<&'a SList<T>>

fn to_glib_none(&'a self) -> Stash<'a, *const GSList, SList<T>>

Transfer: none.

fn to_glib_container(&'a self) -> Stash<'a, P, Self>

Transfer: container.

fn to_glib_full(&self) -> P

Transfer: full.

impl<'a, T> ToGlibPtr<'a, *mut GSList> for SList<T>

where T: TransparentPtrType + 'a,

type Storage = PhantomData<&'a SList<T>>

fn to_glib_none(&'a self) -> Stash<'a, *mut GSList, SList<T>>

Transfer: none.

fn to_glib_container(&'a self) -> Stash<'a, *mut GSList, SList<T>>

Transfer: container.

fn to_glib_full(&self) -> *mut GSList

Transfer: full.

impl<'a, T> ToGlibPtrMut<'a, *mut GSList> for SList<T>

where T: TransparentPtrType + 'a,

type Storage = PhantomData<&'a mut SList<T>>

fn to_glib_none_mut(&'a mut self) -> StashMut<'a, *mut GSList, SList<T>>

Transfer: none.

impl<T> Send for SList<T>

where T: Send + TransparentPtrType,

impl<T> Sync for SList<T>

where T: Sync + TransparentPtrType,