Struct EnumeratedFiniteSetStructure 

pub struct EnumeratedFiniteSetStructure { /* private fields */ }

Implementations

impl EnumeratedFiniteSetStructure

pub fn new(n: usize) -> Self

Trait Implementations

impl Clone for EnumeratedFiniteSetStructure

fn clone(&self) -> EnumeratedFiniteSetStructure

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl CountableSetSignature for EnumeratedFiniteSetStructure

fn generate_all_elements(&self) -> impl Iterator<Item = Self::Set> + Clone

Yield distinct elements of the set such that every element eventually appears. Always yields elements in the same order.

impl Debug for EnumeratedFiniteSetStructure

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

Formats the value using the given formatter.

impl EqSignature for EnumeratedFiniteSetStructure

fn equal(&self, x: &Self::Set, y: &Self::Set) -> bool

impl FiniteSetSignature for EnumeratedFiniteSetStructure

fn size(&self) -> usize

fn list_all_elements(&self) -> Vec<Self::Set>

A list of all elements in the set. Always returns elements in the same order.

fn generate_random_elements( &self, seed: u64, ) -> impl Iterator<Item = Self::Set> + Clone

impl OrdSignature for EnumeratedFiniteSetStructure

fn cmp(&self, x: &Self::Set, y: &Self::Set) -> Ordering

fn max(&self, a: &Self::Set, b: &Self::Set) -> Self::Set

fn min(&self, a: &Self::Set, b: &Self::Set) -> Self::Set

fn is_sorted(&self, a: &[impl Borrow<Self::Set>]) -> bool

fn is_sorted_by_key<X>(&self, a: &[X], key: impl Fn(&X) -> &Self::Set) -> bool

fn is_sorted_and_unique(&self, a: &[impl Borrow<Self::Set>]) -> bool

fn is_sorted_and_unique_by_key<X>( &self, a: &[X], key: impl Fn(&X) -> &Self::Set, ) -> bool

fn binary_search( &self, v: &[impl Borrow<Self::Set>], target: &Self::Set, ) -> bool

fn binary_search_by_key<'x, X>( &self, v: &'x [X], target: &Self::Set, key: impl Fn(&X) -> &Self::Set, ) -> Option<&'x X>

fn merge_sorted<'s, S: Borrow<Self::Set> + 's>( &'s self, a: Vec<S>, b: Vec<S>, ) -> impl Iterator<Item = (MergedSource, S)>

fn merge_sorted_by_key<X>( &self, a: Vec<X>, b: Vec<X>, key: impl Fn(&X) -> &Self::Set, ) -> impl Iterator<Item = (MergedSource, X)>

fn sort<S: Borrow<Self::Set>>(&self, a: Vec<S>) -> Vec<S>

fn sort_by_key<X>(&self, a: Vec<X>, key: &impl Fn(&X) -> &Self::Set) -> Vec<X>

fn sort_by_cached_by<X: 'static>( &self, a: Vec<X>, key: impl Fn(&X) -> Self::Set, ) -> Vec<X>

where Self::Set: 'static,

impl PartialEq for EnumeratedFiniteSetStructure

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialOrdSignature for EnumeratedFiniteSetStructure

fn partial_cmp(&self, x: &Self::Set, y: &Self::Set) -> Option<Ordering>

impl SetSignature for EnumeratedFiniteSetStructure

type Set = usize

fn is_element(&self, x: &Self::Set) -> Result<(), String>

Some instances of Self::Set may not be valid to represent elements of this set. Return true if x is a valid element and false if not.

impl Eq for EnumeratedFiniteSetStructure

impl Signature for EnumeratedFiniteSetStructure

impl StructuralPartialEq for EnumeratedFiniteSetStructure