Struct igraph_bitset_list_t 

pub struct igraph_bitset_list_t { /* private fields */ }

Implementations

impl igraph_bitset_list_t

pub fn new() -> Self

Creates an empty list (igraph_*_list_init).

pub fn len(&self) -> usize

Number of items.

pub fn is_empty(&self) -> bool

Whether the list is empty.

pub fn as_slice(&self) -> &[igraph_bitset_t]

The items as a slice of the C item type.

pub fn as_mut_slice(&mut self) -> &mut [igraph_bitset_t]

The items as a mutable slice of the C item type.

pub fn get(&self, index: usize) -> Option<&igraph_bitset_t>

The item at index, if any.

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

Iterates over the items by reference.

pub fn push(&mut self, item: igraph_bitset_t)

Appends an item, transferring its ownership to the list (igraph_*_list_push_back).

pub fn pop(&mut self) -> Option<igraph_bitset_t>

Removes and returns the last item, if any; the caller owns it (igraph_*_list_pop_back).

pub fn remove(&mut self, index: usize) -> igraph_bitset_t

Removes the item at index, shifting the following ones, and returns it (ownership is transferred back to the caller) (igraph_*_list_remove).

Panics

If index >= len.

pub fn into_vec(self) -> Vec<igraph_bitset_t>

Converts into a Vec of owned items, without copying them.

impl igraph_bitset_list_t

pub fn insert(&mut self, pos: usize, item: igraph_bitset_t)

Inserts item at position pos, shifting the following items; the list takes ownership of it (igraph_*_list_insert).

Panics

If pos > len.

pub fn replace(&mut self, pos: usize, item: igraph_bitset_t) -> igraph_bitset_t

Replaces the item at pos with item, returning the old one (igraph_*_list_replace).

Panics

If pos >= len.

pub fn swap_remove(&mut self, pos: usize) -> igraph_bitset_t

Removes the item at pos in O(1), moving the last item into its place, and returns it (igraph_*_list_remove_fast).

Panics

If pos >= len.

pub fn clear(&mut self)

Destroys all the items, keeping the storage (igraph_*_list_clear).

pub fn truncate(&mut self, len: usize)

Keeps the first len items, destroying the others.

pub fn reverse(&mut self)

Reverses the order of the items (igraph_*_list_reverse, undocumented in igraph_vector_list.h).

pub fn swap(&mut self, i: usize, j: usize)

Swaps the items at positions i and j (igraph_*_list_swap_elements).

Panics

If an index is out of bounds.

pub fn permute(&mut self, index: &[igraph_int_t]) -> Result<()>

Reorders the items so that the item at index[i] moves to position i (igraph_*_list_permute).

Errors

ErrorKind::InvalidValue unless index is a permutation of 0..len (igraph 1.0.0 and 1.0.1 do not check it, and would leak or double free items with an invalid one).

pub fn sort_by( &mut self, compare: impl FnMut(&igraph_bitset_t, &igraph_bitset_t) -> Ordering, )

Sorts the items with a comparator, like slice::sort_by (stable; the items are moved, never copied).

pub fn sort_by_key<K: Ord>(&mut self, key: impl FnMut(&igraph_bitset_t) -> K)

Sorts the items by a key, like slice::sort_by_key.

pub fn capacity(&self) -> usize

Number of items the list can hold without reallocating (igraph_*_list_capacity).

pub fn reserve(&mut self, capacity: usize)

Reserves storage for at least capacity items in total (igraph_*_list_reserve).

pub fn push_copy(&mut self, item: &igraph_bitset_t)

Appends a deep copy of item (igraph_*_list_push_back_copy).

pub fn get_mut(&mut self, index: usize) -> Option<&mut igraph_bitset_t>

The item at index, mutably, if any.

pub fn first(&self) -> Option<&igraph_bitset_t>

The first item, if any.

pub fn last(&self) -> Option<&igraph_bitset_t>

The last item, if any.

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

Iterates over the items mutably.

Trait Implementations

impl Clone for igraph_bitset_list_t

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for igraph_bitset_list_t

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for igraph_bitset_list_t

fn default() -> Self

Returns the “default value” for a type.

impl Drop for igraph_bitset_list_t

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

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

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl Extend<igraph_bitset_t> for igraph_bitset_list_t

fn extend<I: IntoIterator<Item = igraph_bitset_t>>(&mut self, iter: I)

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 From<Vec<igraph_bitset_t>> for igraph_bitset_list_t

fn from(items: Vec<igraph_bitset_t>) -> Self

Converts to this type from the input type.

impl FromIterator<igraph_bitset_t> for igraph_bitset_list_t

fn from_iter<I: IntoIterator<Item = igraph_bitset_t>>(iter: I) -> Self

Creates a value from an iterator.

impl Index<usize> for igraph_bitset_list_t

type Output = igraph_bitset_t

The returned type after indexing.

fn index(&self, index: usize) -> &igraph_bitset_t

Performs the indexing (container[index]) operation.

impl IndexMut<usize> for igraph_bitset_list_t

fn index_mut(&mut self, index: usize) -> &mut igraph_bitset_t

Performs the mutable indexing (container[index]) operation.

impl<'a> IntoIterator for &'a igraph_bitset_list_t

type Item = &'a igraph_bitset_t

The type of the elements being iterated over.

type IntoIter = Iter<'a, igraph_bitset_t>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for igraph_bitset_list_t

type Item = igraph_bitset_t

The type of the elements being iterated over.

type IntoIter = IntoIter<igraph_bitset_t>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a> IntoIterator for &'a mut igraph_bitset_list_t

type Item = &'a mut igraph_bitset_t

The type of the elements being iterated over.

type IntoIter = IterMut<'a, igraph_bitset_t>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Send for igraph_bitset_list_t

impl Sync for igraph_bitset_list_t