Trait BitDisjoint

Source
pub trait BitDisjoint<Rhs = Self> {
    // Required method
    fn is_disjoint(&self, rhs: &Rhs) -> bool;
}
Expand description

Tests any of the following equivalent properties:

  • two bit-sets are disjoint.
  • all bits that are set in one bit-set are unset in another and vice versa.
  • their intersection is empty.

Required Methods§

Source

fn is_disjoint(&self, rhs: &Rhs) -> bool

Returns true if self is disjoint with rhs.

Implementations on Foreign Types§

Source§

impl BitDisjoint for bool

Source§

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

Source§

impl BitDisjoint for u8

Source§

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

Source§

impl BitDisjoint for u16

Source§

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

Source§

impl BitDisjoint for u32

Source§

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

Source§

impl BitDisjoint for u64

Source§

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

Source§

impl BitDisjoint for u128

Source§

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

Source§

impl BitDisjoint<Complement<bool>> for bool

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl BitDisjoint<Complement<u8>> for u8

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl BitDisjoint<Complement<u16>> for u16

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl BitDisjoint<Complement<u32>> for u32

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl BitDisjoint<Complement<u64>> for u64

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl BitDisjoint<Complement<u128>> for u128

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl<T, U> BitDisjoint<U> for Option<T>
where T: BitDisjoint<U>,

Source§

fn is_disjoint(&self, rhs: &U) -> bool

Source§

impl<T, U> BitDisjoint<U> for &T
where T: BitDisjoint<U>,

Source§

fn is_disjoint(&self, rhs: &U) -> bool

Source§

impl<T, U> BitDisjoint<U> for &mut T
where T: BitDisjoint<U>,

Source§

fn is_disjoint(&self, rhs: &U) -> bool

Source§

impl<T, U> BitDisjoint<U> for Box<T>
where T: BitDisjoint<U>,

Source§

fn is_disjoint(&self, rhs: &U) -> bool

Source§

impl<const N: usize> BitDisjoint for [u8; N]

Source§

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

Source§

impl<const N: usize> BitDisjoint for [u16; N]

Source§

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

Source§

impl<const N: usize> BitDisjoint for [u32; N]

Source§

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

Source§

impl<const N: usize> BitDisjoint for [u64; N]

Source§

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

Source§

impl<const N: usize> BitDisjoint for [u128; N]

Source§

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

Source§

impl<const N: usize> BitDisjoint<Complement<[u8; N]>> for [u8; N]

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl<const N: usize> BitDisjoint<Complement<[u16; N]>> for [u16; N]

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl<const N: usize> BitDisjoint<Complement<[u32; N]>> for [u32; N]

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl<const N: usize> BitDisjoint<Complement<[u64; N]>> for [u64; N]

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Source§

impl<const N: usize> BitDisjoint<Complement<[u128; N]>> for [u128; N]

Source§

fn is_disjoint(&self, rhs: &Complement<Self>) -> bool

Implementors§

Source§

impl<T, U> BitDisjoint<U> for Complement<T>
where U: BitSubset<T>,