pub trait Union<Rhs, N, B> where
    Rhs: ContainerRead<B, Slot = N>,
    N: Number,
    B: BitAccess
{ fn union_in<Dst>(&self, rhs: &Rhs, dst: &mut Dst)
    where
        Dst: ContainerWrite<B, Slot = N>
; fn try_union_in<Dst>(
        &self,
        rhs: &Rhs,
        dst: &mut Dst
    ) -> Result<(), UnionError>
    where
        Dst: ContainerWrite<B, Slot = N>
; fn union<Dst>(&self, rhs: &Rhs) -> Dst
    where
        Dst: ContainerWrite<B, Slot = N> + TryWithSlots
; fn try_union<Dst>(&self, rhs: &Rhs) -> Result<Dst, UnionError>
    where
        Dst: ContainerWrite<B, Slot = N> + TryWithSlots
; fn union_len(&self, rhs: &Rhs) -> usize; }
Expand description

Union operator (a | b).

Required Methods

Calculates union in-place. Result will be stored in dst.

Panic

Panics if dst cannot fit the entire result. See non-panic function try_union_in.

Calculates union in-place. Result will be stored in dst.

Returns Err(_) if dst cannot fit the entire result.

Calculates union. Result container will be created with try_with_slots function.

Panic

Panics if Dst cannot fit the entire result. See non-panic function try_union.

Calculates union. Result container will be created with try_with_slots function.

Returns Err(_) if Dst cannot fit the entire result.

Calculates union length - ones count. It doesn’t allocate for storing union result.

Useful if you need to create some storage that relies on the number of bits presented in the bitmap.

Implementors