Struct utote::multiset::Multiset

pub struct Multiset<N, U: MultisetStorage<N>> { /* fields omitted */ }

Multiset! yay

Implementations

impl<N: Copy, U, B> Multiset<N, UInt<U, B>> where
    UInt<U, B>: ArrayLength<N>, 

pub fn map<N2, F>(&self, mut f: F) -> Multiset<N2, UInt<U, B>> where
    N2: Copy,
    F: FnMut(N) -> N2,
    UInt<U, B>: ArrayLength<N2>, 

pub fn fold<Acc, F>(&self, init: Acc, mut f: F) -> Acc where
    F: FnMut(Acc, N) -> Acc, 

pub fn zip_map<N2, N3, F>(
    &self,
    other: &Multiset<N2, UInt<U, B>>,
    mut f: F
) -> Multiset<N3, UInt<U, B>> where
    N2: Copy,
    N3: Copy,
    F: FnMut(N, N2) -> N3,
    UInt<U, B>: ArrayLength<N2> + ArrayLength<N3>, 

impl<U, B> Multiset<u8, U> where
    UInt<U, B>: ArrayLength<u8>, 

pub fn empty() -> Self

Returns a Multiset of the given array size with all elements set to zero.

pub fn repeat(elem: u8) -> Self

Returns a Multiset of the given array size with all elements set to elem.

pub fn from_slice(slice: &[u8]) -> Self

Returns a Multiset from a slice of the given array size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u8

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u8

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u8

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.

pub fn argmax(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

pub fn max(&self) -> u8

Returns the largest member count in the multiset.

pub fn argmin(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

pub fn min(&self) -> u8

Returns the smallest member count in the multiset.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

impl<U, B> Multiset<u16, U> where
    UInt<U, B>: ArrayLength<u16>, 

pub fn empty() -> Self

Returns a Multiset of the given array size with all elements set to zero.

pub fn repeat(elem: u16) -> Self

Returns a Multiset of the given array size with all elements set to elem.

pub fn from_slice(slice: &[u16]) -> Self

Returns a Multiset from a slice of the given array size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u16

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u16

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u16

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.

pub fn argmax(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

pub fn max(&self) -> u16

Returns the largest member count in the multiset.

pub fn argmin(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

pub fn min(&self) -> u16

Returns the smallest member count in the multiset.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

impl<U, B> Multiset<u32, U> where
    UInt<U, B>: ArrayLength<u32>, 

pub fn empty() -> Self

Returns a Multiset of the given array size with all elements set to zero.

pub fn repeat(elem: u32) -> Self

Returns a Multiset of the given array size with all elements set to elem.

pub fn from_slice(slice: &[u32]) -> Self

Returns a Multiset from a slice of the given array size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u32

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.

pub fn argmax(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

pub fn max(&self) -> u32

Returns the largest member count in the multiset.

pub fn argmin(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

pub fn min(&self) -> u32

Returns the smallest member count in the multiset.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

impl<U, B> Multiset<Simd<[u8; 2]>, U> where
    UInt<U, B>: ArrayLength<u8x2>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u8) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u8]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u8

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u8

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u8

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u8; 4]>, U> where
    UInt<U, B>: ArrayLength<u8x4>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u8) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u8]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u8

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u8

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u8

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u8; 8]>, U> where
    UInt<U, B>: ArrayLength<u8x8>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u8) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u8]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u8

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u8

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u8

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u16; 2]>, U> where
    UInt<U, B>: ArrayLength<u16x2>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u16) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u16]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u16

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u16

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u16

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u16; 4]>, U> where
    UInt<U, B>: ArrayLength<u16x4>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u16) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u16]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u16

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u16

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u16

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u16; 8]>, U> where
    UInt<U, B>: ArrayLength<u16x8>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u16) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u16]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u16

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u16

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u16

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u32; 2]>, U> where
    UInt<U, B>: ArrayLength<u32x2>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u32) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u32]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u32

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u32

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u32

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u32; 4]>, U> where
    UInt<U, B>: ArrayLength<u32x4>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u32) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u32]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u32

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u32

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u32

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl<U, B> Multiset<Simd<[u32; 8]>, U> where
    UInt<U, B>: ArrayLength<u32x8>, 

pub fn empty() -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to zero.

pub fn repeat(elem: u32) -> Self

Returns a Multiset of the given array * SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u32]) -> Self

Returns a Multiset from a slice of the given array * SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying array.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u32

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn max(&self) -> u32

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn argmin(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn min(&self) -> u32

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vectors.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vectors.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u8; 2]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u8) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u8]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u8

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u8

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u8

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u8; 4]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u8) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u8]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u8

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u8

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u8

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u8; 8]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u8) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u8]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u8

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u8

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u8)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u8

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u16; 2]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u16) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u16]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u16

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u16

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u16

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u16; 4]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u16) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u16]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u16

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u16

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u16

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u16; 8]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u16) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u16]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u16

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u16

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u16)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u16

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u32; 2]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u32) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u32]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u32

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u32

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u32

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u32; 4]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u32) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u32]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u32

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u32

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u32

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

impl Multiset<Simd<[u32; 8]>, UTerm>

pub const fn empty() -> Self

Returns a Multiset of the given SIMD vector size with all elements set to zero.

pub const fn repeat(elem: u32) -> Self

Returns a Multiset of the given SIMD vector size with all elements set to elem.

pub fn from_slice(slice: &[u32]) -> Self

Returns a Multiset from a slice of the given SIMD vector size.

pub const fn len() -> usize

The number of elements in the multiset.

pub fn clear(&mut self)

Sets all element counts in the multiset to zero.

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

Checks that a given element has at least one member in the multiset.

pub unsafe fn contains_unchecked(self, elem: usize) -> bool

Checks that a given element has at least one member in the multiset without bounds checks.

Safety

Does not do bounds check on whether this element is an index in the underlying SIMD vector.

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

Returns a multiset which is the intersection of self and other.

The Intersection of two multisets A & B is defined as the multiset C where C[0] == min(A[0], B[0]).

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

Returns a multiset which is the union of self and other.

The union of two multisets A & B is defined as the multiset C where C[0] == max(A[0], B[0]).

pub fn count_zero(&self) -> u32

Return the number of elements whose member count is zero.

pub fn count_non_zero(&self) -> u32

Return the number of elements whose member count is non-zero.

pub fn is_empty(&self) -> bool

Check whether all elements have zero members.

pub fn is_singleton(&self) -> bool

Check whether only one element has one or more members.

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

Check whether self is a subset of other.

Multisets A is a subset of B if A[i] <= B[i] for all i in A.

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

Check whether self is a superset of other.

Multisets A is a superset of B if A[i] >= B[i] for all i in A.

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

Check whether self is a proper subset of other.

Multisets A is a proper subset of B if A[i] <= B[i] for all i in A and there exists j such that A[j] < B[j].

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

Check whether self is a proper superset of other.

Multisets A is a proper superset of B if A[i] >= B[i] for all i in A and there exists j such that A[j] > B[j].

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

Check whether any element of self is less than an element of other.

True if the exists some i such that A[i] < B[i].

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

Check whether any element of self is greater than an element of other.

True if the exists some i such that A[i] > B[i].

pub fn total(&self) -> u32

The total or cardinality of a multiset is the sum of all its elements member counts.

Notes:

• This may overflow.
• The implementation uses a horizontal operation on SIMD vectors.

pub fn argmax(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding largest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imax(&self) -> usize

Returns the element corresponding to the largest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn max(&self) -> u32

Returns the largest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn argmin(&self) -> (usize, u32)

Returns a tuple containing the (element, corresponding smallest member count) in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn imin(&self) -> usize

Returns the element corresponding to the smallest member count in the multiset.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn min(&self) -> u32

Returns the smallest member count in the multiset.

Notes:

• The implementation uses a horizontal operation on the underlying SIMD vector.

pub fn choose(&mut self, elem: usize)

Set all elements member counts, except for the given elem, to zero.

pub fn choose_random(&mut self, rng: &mut StdRng)

Set all elements member counts, except for a random one, to zero.

Notes:

• The implementation extracts values from the underlying SIMD vector.

pub fn collision_entropy(&self) -> f64

Calculate the collision entropy of the multiset.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

pub fn shannon_entropy(&self) -> f64

Calculate the shannon entropy of the multiset. Uses ln rather than log2.

Notes:

• The implementation uses a horizontal operation on SIMD vectors.

Trait Implementations

impl<N, U, B> AddAssign<Multiset<N, UInt<U, B>>> for Multiset<N, UInt<U, B>> where
    N: AddAssign + Copy,
    UInt<U, B>: ArrayLength<N>, 

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<N> AddAssign<Multiset<N, UTerm>> for Multiset<N, U0> where
    N: AddAssign, 

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<N: Clone, U: Clone + MultisetStorage<N>> Clone for Multiset<N, U> where
    U::Storage: Clone, 

fn clone(&self) -> Multiset<N, U>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Copy, U: Copy + MultisetStorage<N>> Copy for Multiset<N, U> where
    U::Storage: Copy, 

impl<N: Debug, U: Debug + MultisetStorage<N>> Debug for Multiset<N, U> where
    U::Storage: Debug, 

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

Formats the value using the given formatter.

impl<N, U, B> DivAssign<Multiset<N, UInt<U, B>>> for Multiset<N, UInt<U, B>> where
    N: DivAssign + Copy,
    UInt<U, B>: ArrayLength<N>, 

fn div_assign(&mut self, rhs: Self)

Performs the /= operation.

impl<N> DivAssign<Multiset<N, UTerm>> for Multiset<N, U0> where
    N: DivAssign, 

fn div_assign(&mut self, rhs: Self)

Performs the /= operation.

impl<N, U, B> MulAssign<Multiset<N, UInt<U, B>>> for Multiset<N, UInt<U, B>> where
    N: MulAssign + Copy,
    UInt<U, B>: ArrayLength<N>, 

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<N> MulAssign<Multiset<N, UTerm>> for Multiset<N, U0> where
    N: MulAssign, 

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<N, U: MultisetStorage<N>> PartialEq<Multiset<N, U>> for Multiset<N, U> where
    <U as MultisetStorage<N>>::Storage: PartialEq, 

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<U, B> PartialOrd<Multiset<Simd<[u16; 2]>, UInt<U, B>>> for MSu16x2<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u16x2>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u16; 2]>, UTerm>> for MS0u16x2

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u16; 4]>, UInt<U, B>>> for MSu16x4<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u16x4>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u16; 4]>, UTerm>> for MS0u16x4

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u16; 8]>, UInt<U, B>>> for MSu16x8<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u16x8>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u16; 8]>, UTerm>> for MS0u16x8

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u32; 2]>, UInt<U, B>>> for MSu32x2<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u32x2>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u32; 2]>, UTerm>> for MS0u32x2

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u32; 4]>, UInt<U, B>>> for MSu32x4<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u32x4>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u32; 4]>, UTerm>> for MS0u32x4

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u32; 8]>, UInt<U, B>>> for MSu32x8<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u32x8>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u32; 8]>, UTerm>> for MS0u32x8

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u8; 2]>, UInt<U, B>>> for MSu8x2<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u8x2>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u8; 2]>, UTerm>> for MS0u8x2

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u8; 4]>, UInt<U, B>>> for MSu8x4<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u8x4>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u8; 4]>, UTerm>> for MS0u8x4

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<Simd<[u8; 8]>, UInt<U, B>>> for MSu8x8<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u8x8>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialOrd<Multiset<Simd<[u8; 8]>, UTerm>> for MS0u8x8

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<u16, UInt<U, B>>> for MSu16<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u16>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<u32, UInt<U, B>>> for MSu32<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u32>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<U, B> PartialOrd<Multiset<u8, UInt<U, B>>> for MSu8<UInt<U, B>> where
    UInt<U, B>: ArrayLength<u8>, 

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<N, U, B> SubAssign<Multiset<N, UInt<U, B>>> for Multiset<N, UInt<U, B>> where
    N: SubAssign + Copy,
    UInt<U, B>: ArrayLength<N>, 

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<N> SubAssign<Multiset<N, UTerm>> for Multiset<N, U0> where
    N: SubAssign, 

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.