Struct BitArraySet

Source
pub struct BitArraySet<B: BitsIn, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,
{ /* private fields */ }

Implementations§

Source§

impl<B: BitsIn + BitBlock + Default, NBits> BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source

pub fn new() -> Self

Creates a new empty BitArraySet.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let mut s = BitArraySet::<u32, U8>::new();
Source

pub fn from_bit_array(bit_array: BitArray<B, NBits>) -> Self

Creates a new BitArraySet from the given bit array.

§Examples
extern crate typenum;
extern crate bit_array;
extern crate bitarray_set;
use typenum::{Unsigned, U8};
use bit_array::BitArray;
use bitarray_set::BitArraySet;

fn main() {
    let bv = BitArray::<u32, U8>::from_bytes(&[0b01100000]);
    let s = BitArraySet::from_bit_array(bv);

    // Print 1, 2 in arbitrary order
    for x in s.iter() {
        println!("{}", x);
    }
}
Source

pub fn from_bytes(bytes: &[u8]) -> Self

Source

pub fn into_bit_array(self) -> BitArray<B, NBits>

Consumes this set to return the underlying bit array.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let mut s = BitArraySet::<u32, U8>::new();
s.insert(0);
s.insert(3);

let bv = s.into_bit_array();
assert!(bv[0]);
assert!(bv[3]);
Source

pub fn get_ref(&self) -> &BitArray<B, NBits>

Returns a reference to the underlying bit array.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let mut s = BitArraySet::<u32, U8>::new();
s.insert(0);

let bv = s.get_ref();
assert_eq!(bv[0], true);
Source

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

Iterator over each usize stored in the BitArraySet.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let s = BitArraySet::<u32, U8>::from_bytes(&[0b01001010]);

// Print 1, 4, 6 in arbitrary order
for x in s.iter() {
    println!("{}", x);
}
Source

pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, B>

Iterator over each usize stored in self union other. See union_with for an efficient in-place version.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a = BitArraySet::<u32, U8>::from_bytes(&[0b01101000]);
let b = BitArraySet::<u32, U8>::from_bytes(&[0b10100000]);

// Print 0, 1, 2, 4 in arbitrary order
for x in a.union(&b) {
    println!("{}", x);
}
Source

pub fn intersection<'a>(&'a self, other: &'a Self) -> Intersection<'a, B>

Iterator over each usize stored in self intersect other. See intersect_with for an efficient in-place version.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a = BitArraySet::<u32, U8>::from_bytes(&[0b01101000]);
let b = BitArraySet::<u32, U8>::from_bytes(&[0b10100000]);

// Print 2
for x in a.intersection(&b) {
    println!("{}", x);
}
Source

pub fn difference<'a>(&'a self, other: &'a Self) -> Difference<'a, B>

Iterator over each usize stored in the self setminus other. See difference_with for an efficient in-place version.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a = BitArraySet::<u32, U8>::from_bytes(&[0b01101000]);
let b = BitArraySet::<u32, U8>::from_bytes(&[0b10100000]);

// Print 1, 4 in arbitrary order
for x in a.difference(&b) {
    println!("{}", x);
}

// Note that difference is not symmetric,
// and `b - a` means something else.
// This prints 0
for x in b.difference(&a) {
    println!("{}", x);
}
Source

pub fn symmetric_difference<'a>( &'a self, other: &'a Self, ) -> SymmetricDifference<'a, B>

Iterator over each usize stored in the symmetric difference of self and other. See symmetric_difference_with for an efficient in-place version.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a = BitArraySet::<u32, U8>::from_bytes(&[0b01101000]);
let b = BitArraySet::<u32, U8>::from_bytes(&[0b10100000]);

// Print 0, 1, 4 in arbitrary order
for x in a.symmetric_difference(&b) {
    println!("{}", x);
}
Source

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

Unions in-place with the specified other bit array.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a   = 0b01101000;
let b   = 0b10100000;
let res = 0b11101000;

let mut a = BitArraySet::<u32, U8>::from_bytes(&[a]);
let b = BitArraySet::<u32, U8>::from_bytes(&[b]);
let res = BitArraySet::<u32, U8>::from_bytes(&[res]);

a.union_with(&b);
assert_eq!(a, res);
Source

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

Intersects in-place with the specified other bit array.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a   = 0b01101000;
let b   = 0b10100000;
let res = 0b00100000;

let mut a = BitArraySet::<u32, U8>::from_bytes(&[a]);
let b = BitArraySet::<u32, U8>::from_bytes(&[b]);
let res = BitArraySet::<u32, U8>::from_bytes(&[res]);

a.intersect_with(&b);
assert_eq!(a, res);
Source

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

Makes this bit array the difference with the specified other bit array in-place.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a   = 0b01101000;
let b   = 0b10100000;
let a_b = 0b01001000; // a - b
let b_a = 0b10000000; // b - a

let mut bva = BitArraySet::<u32, U8>::from_bytes(&[a]);
let bvb = BitArraySet::<u32, U8>::from_bytes(&[b]);
let bva_b = BitArraySet::<u32, U8>::from_bytes(&[a_b]);
let bvb_a = BitArraySet::<u32, U8>::from_bytes(&[b_a]);

bva.difference_with(&bvb);
assert_eq!(bva, bva_b);

let bva = BitArraySet::<u32, U8>::from_bytes(&[a]);
let mut bvb = BitArraySet::<u32, U8>::from_bytes(&[b]);

bvb.difference_with(&bva);
assert_eq!(bvb, bvb_a);
Source

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

Makes this bit array the symmetric difference with the specified other bit array in-place.

§Examples
extern crate typenum;
use typenum::{Unsigned, U8};
use bitarray_set::BitArraySet;

let a   = 0b01101000;
let b   = 0b10100000;
let res = 0b11001000;

let mut a = BitArraySet::<u32, U8>::from_bytes(&[a]);
let b = BitArraySet::<u32, U8>::from_bytes(&[b]);
let res = BitArraySet::<u32, U8>::from_bytes(&[res]);

a.symmetric_difference_with(&b);
assert_eq!(a, res);
Source

pub fn len(&self) -> usize

Returns the number of set bits in this set.

Source

pub fn is_empty(&self) -> bool

Returns whether there are no bits set in this set

Source

pub fn clear(&mut self)

Clears all bits in this set

Source

pub fn contains(&self, value: usize) -> bool

Returns true if this set contains the specified integer.

Source

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

Returns true if the set has no elements in common with other. This is equivalent to checking for an empty intersection.

Source

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

Returns true if the set is a subset of another.

Source

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

Returns true if the set is a superset of another.

Source

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

Adds a value to the set. Returns true if the value was not already present in the set.

Source

pub fn remove(&mut self, value: usize) -> bool

Removes a value from the set. Returns true if the value was present in the set.

Trait Implementations§

Source§

impl<B: BitsIn + BitBlock + Default, NBits> BitAnd for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

type Output = BitArraySet<B, NBits>

The resulting type after applying the & operator.
Source§

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

Performs the & operation. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> BitAndAssign for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn bitand_assign(&mut self, rhs: Self)

Performs the &= operation. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> BitOr for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

type Output = BitArraySet<B, NBits>

The resulting type after applying the | operator.
Source§

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

Performs the | operation. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> BitOrAssign for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn bitor_assign(&mut self, rhs: Self)

Performs the |= operation. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> BitXor for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

type Output = BitArraySet<B, NBits>

The resulting type after applying the ^ operator.
Source§

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

Performs the ^ operation. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> BitXorAssign for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn bitxor_assign(&mut self, rhs: Self)

Performs the ^= operation. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> Clone for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
Source§

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

Performs copy-assignment from source. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> Debug for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> Default for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<B: BitsIn + BitBlock + Default + BitAnd + BitOr, NBits> Extend<usize> for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

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

Extends a collection with the contents of an iterator. Read more
Source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
Source§

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. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> FromIterator<usize> for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

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

Creates a value from an iterator. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> Hash for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl<'a, B: BitsIn + BitBlock + Default, NBits> IntoIterator for &'a BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

type Item = usize

The type of the elements being iterated over.
Source§

type IntoIter = Iter<'a, B>

Which kind of iterator are we turning this into?
Source§

fn into_iter(self) -> Iter<'a, B>

Creates an iterator from a value. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> Not for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

type Output = BitArraySet<B, NBits>

The resulting type after applying the ! operator.
Source§

fn not(self) -> Self::Output

Performs the unary ! operation. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> Ord for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · Source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · Source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · Source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized,

Restrict a value to a certain interval. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> PartialEq for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

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

impl<B: BitsIn + BitBlock + Default, NBits> PartialOrd for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Source§

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · Source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · Source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · Source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · Source§

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

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
Source§

impl<B: BitsIn + BitBlock + Default, NBits> Eq for BitArraySet<B, NBits>
where NBits: Add<<B as BitsIn>::Output> + Unsigned + NonZero, <NBits as Add<<B as BitsIn>::Output>>::Output: Sub<B1>, <<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output: Div<<B as BitsIn>::Output>, <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: ArrayLength<B>,

Auto Trait Implementations§

§

impl<B, NBits> Freeze for BitArraySet<B, NBits>
where <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: Sized, <<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output as ArrayLength<B>>::ArrayType: Freeze,

§

impl<B, NBits> RefUnwindSafe for BitArraySet<B, NBits>
where <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: Sized, <<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output as ArrayLength<B>>::ArrayType: RefUnwindSafe,

§

impl<B, NBits> Send for BitArraySet<B, NBits>
where <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: Sized, <<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output as ArrayLength<B>>::ArrayType: Send,

§

impl<B, NBits> Sync for BitArraySet<B, NBits>
where <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: Sized, <<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output as ArrayLength<B>>::ArrayType: Sync,

§

impl<B, NBits> Unpin for BitArraySet<B, NBits>
where <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: Sized, <<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output as ArrayLength<B>>::ArrayType: Unpin,

§

impl<B, NBits> UnwindSafe for BitArraySet<B, NBits>
where <<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output: Sized, <<<<NBits as Add<<B as BitsIn>::Output>>::Output as Sub<B1>>::Output as Div<<B as BitsIn>::Output>>::Output as ArrayLength<B>>::ArrayType: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.