Struct igraph_bitset_t 

pub struct igraph_bitset_t { /* private fields */ }

Implementations

impl igraph_bitset_t

pub fn new(len: usize) -> Self

Creates a bitset of len bits, all zero (igraph_bitset_init).

pub fn from_bools(bits: &[bool]) -> Self

Creates a bitset from a slice of booleans (bits[i] is bit i).

pub fn from_ones(len: usize, ones: impl IntoIterator<Item = usize>) -> Self

Creates a bitset of len bits where exactly the listed positions are set.

Panics

If a position is >= len.

pub fn len(&self) -> usize

Number of bits (igraph_bitset_size).

pub fn is_empty(&self) -> bool

Whether the bitset has no bits at all (not whether all bits are zero: see none).

pub fn capacity(&self) -> usize

Number of bits that fit in the allocated storage (igraph_bitset_capacity).

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

Reserves storage for at least capacity bits in total (igraph_bitset_reserve).

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

Changes the number of bits; new bits are zero (igraph_bitset_resize).

pub fn get(&self, i: usize) -> bool

The value of bit i (IGRAPH_BIT_TEST).

Panics

If i >= len.

pub fn set(&mut self, i: usize, value: bool)

Sets bit i to value (IGRAPH_BIT_SET / IGRAPH_BIT_CLEAR).

Panics

If i >= len.

pub fn toggle(&mut self, i: usize) -> bool

Flips bit i and returns its new value.

Panics

If i >= len.

pub fn insert(&mut self, i: usize) -> bool

Sets bit i and returns whether it was not set before (like HashSet::insert).

Panics

If i >= len.

pub fn push(&mut self, value: bool)

Appends a bit at the end, growing the bitset by one.

pub fn count_ones(&self) -> usize

Number of set bits (the population count) (igraph_bitset_popcount).

pub fn count_zeros(&self) -> usize

Number of zero bits.

pub fn leading_zeros(&self) -> usize

Number of zeros before the first one, starting from the most significant bit (len if all zero) (igraph_bitset_countl_zero).

pub fn leading_ones(&self) -> usize

Number of ones before the first zero, starting from the most significant bit (igraph_bitset_countl_one).

pub fn trailing_zeros(&self) -> usize

Number of zeros before the first one, starting from bit 0 (len if all zero); i.e. the index of the first set bit (igraph_bitset_countr_zero).

pub fn trailing_ones(&self) -> usize

Number of ones before the first zero, starting from bit 0 (igraph_bitset_countr_one).

pub fn all(&self) -> bool

Whether all bits are one (true for an empty bitset) (igraph_bitset_is_all_one).

pub fn any(&self) -> bool

Whether some bit is one (igraph_bitset_is_any_one).

pub fn none(&self) -> bool

Whether all bits are zero (true for an empty bitset) (igraph_bitset_is_all_zero).

pub fn not_all(&self) -> bool

Whether some bit is zero (igraph_bitset_is_any_zero).

pub fn fill(&mut self, value: bool)

Sets every bit to value (igraph_bitset_fill).

pub fn clear(&mut self)

Sets every bit to zero, keeping the length (igraph_bitset_null).

pub fn iter(&self) -> impl Iterator<Item = bool> + '_

Iterates over all the bits, from bit 0.

pub fn iter_ones(&self) -> impl Iterator<Item = usize> + '_

Iterates over the positions of the set bits, in increasing order, skipping whole zero words.

pub fn to_vec(&self) -> Vec<bool>

The bits as a Vec<bool>.

pub fn and(&self, other: &Self) -> Self

Bitwise AND (igraph_bitset_and).

Panics

If the lengths differ.

pub fn or(&self, other: &Self) -> Self

Bitwise OR (igraph_bitset_or).

Panics

If the lengths differ.

pub fn xor(&self, other: &Self) -> Self

Bitwise XOR (igraph_bitset_xor).

Panics

If the lengths differ.

pub fn complement(&self) -> Self

Bitwise complement (igraph_bitset_not).

pub fn update(&mut self, other: &Self)

Replaces the content with a copy of other, reusing the storage when possible (igraph_bitset_update).

Trait Implementations

impl BitAnd for &igraph_bitset_t

fn bitand(self, rhs: Self) -> igraph_bitset_t

Panics

If the lengths differ.

type Output = igraph_bitset_t

The resulting type after applying the & operator.

impl BitAndAssign<&igraph_bitset_t> for igraph_bitset_t

fn bitand_assign(&mut self, rhs: &igraph_bitset_t)

Panics

If the lengths differ.

impl BitOr for &igraph_bitset_t

fn bitor(self, rhs: Self) -> igraph_bitset_t

Panics

If the lengths differ.

type Output = igraph_bitset_t

The resulting type after applying the | operator.

impl BitOrAssign<&igraph_bitset_t> for igraph_bitset_t

fn bitor_assign(&mut self, rhs: &igraph_bitset_t)

Panics

If the lengths differ.

impl BitXor for &igraph_bitset_t

fn bitxor(self, rhs: Self) -> igraph_bitset_t

Panics

If the lengths differ.

type Output = igraph_bitset_t

The resulting type after applying the ^ operator.

impl BitXorAssign<&igraph_bitset_t> for igraph_bitset_t

fn bitxor_assign(&mut self, rhs: &igraph_bitset_t)

Panics

If the lengths differ.

impl Clone for igraph_bitset_t

fn clone(&self) -> Self

Deep copy with igraph_bitset_init_copy.

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

Performs copy-assignment from source.

impl Debug for igraph_bitset_t

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

Formats the value using the given formatter.

impl Default for igraph_bitset_t

fn default() -> Self

An empty bitset.

impl Display for igraph_bitset_t

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

Writes the bits as 0/1 characters, most significant (highest index) first, like igraph_bitset_print.

impl Drop for igraph_bitset_t

fn drop(&mut self)

Frees the storage with igraph_bitset_destroy.

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 Eq for igraph_bitset_t

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<&[bool]> for igraph_bitset_t

fn from(bits: &[bool]) -> Self

Converts to this type from the input type.

impl From<&igraph_bitset_t> for Vec<bool>

fn from(b: &igraph_bitset_t) -> Self

Converts to this type from the input type.

impl FromIterator<bool> for igraph_bitset_t

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

Creates a value from an iterator.

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 Not for &igraph_bitset_t

type Output = igraph_bitset_t

The resulting type after applying the ! operator.

fn not(self) -> igraph_bitset_t

Performs the unary ! operation.

impl PartialEq for igraph_bitset_t

fn eq(&self, other: &Self) -> bool

Two bitsets are equal when they have the same length and bits (the unused padding bits of the last word are ignored).

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Send for igraph_bitset_t

impl Sync for igraph_bitset_t