Trait bitsetium::BitUnion

pub trait BitUnion<Rhs = Self> {
    type Output;
    fn union(self, rhs: Rhs) -> Self::Output;
}

Union of bit-sets.

Associated Types

type Output

Required methods

fn union(self, rhs: Rhs) -> Self::Output

Returns bit-set with bits set for each index that has bit set in both of two arguments.

Implementations on Foreign Types

impl<T, U> BitUnion<U> for &T

type Output = Union<Self, U>

fn union(self, rhs: U) -> Union<Self, U>

impl<T, U> BitUnion<U> for &mut T

type Output = Union<Self, U>

fn union(self, rhs: U) -> Union<Self, U>

impl<T, U> BitUnion<U> for Box<T>

type Output = Union<Self, U>

fn union(self, rhs: U) -> Union<Self, U>

impl<T, U> BitUnion<U> for Option<T> where
    T: BitUnion<U>,
    U: Into<T::Output>, 

type Output = T::Output

fn union(self, rhs: U) -> T::Output

impl BitUnion<u8> for u8

type Output = Self

fn union(self, rhs: Self) -> Self

impl BitUnion<Complement<u8>> for u8

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

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

type Output = Self

fn union(self, rhs: Self) -> Self

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

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

impl BitUnion<u16> for u16

type Output = Self

fn union(self, rhs: Self) -> Self

impl BitUnion<Complement<u16>> for u16

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

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

type Output = Self

fn union(self, rhs: Self) -> Self

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

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

impl BitUnion<u32> for u32

type Output = Self

fn union(self, rhs: Self) -> Self

impl BitUnion<Complement<u32>> for u32

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

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

type Output = Self

fn union(self, rhs: Self) -> Self

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

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

impl BitUnion<u64> for u64

type Output = Self

fn union(self, rhs: Self) -> Self

impl BitUnion<Complement<u64>> for u64

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

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

type Output = Self

fn union(self, rhs: Self) -> Self

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

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

impl BitUnion<u128> for u128

type Output = Self

fn union(self, rhs: Self) -> Self

impl BitUnion<Complement<u128>> for u128

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

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

type Output = Self

fn union(self, rhs: Self) -> Self

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

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

impl BitUnion<bool> for bool

type Output = Self

fn union(self, rhs: Self) -> Self

impl BitUnion<Complement<bool>> for bool

type Output = Complement<Self>

fn union(self, rhs: Complement<Self>) -> Complement<Self>

Implementors

impl<T, B, U, const N: usize> BitUnion<U> for Layered<T, B, N>

type Output = Union<Self, U>

impl<T, U> BitUnion<U> for Complement<T> where
    T: BitDifference<U>, 

type Output = Complement<<T as BitDifference<U>>::Output>

impl<T, U, Y> BitUnion<Y> for Difference<T, U>

type Output = Union<Difference<T, U>, Y>

impl<T, U, Y> BitUnion<Y> for Intersection<T, U> where
    T: BitUnion<Y>,
    U: BitUnion<Y>,
    Y: Copy, 

type Output = Intersection<T::Output, U::Output>

impl<T, U, Y> BitUnion<Y> for Union<T, U> where
    T: BitUnion<Y>, 

type Output = Union<T::Output, U>