Trait abstalg::Domain

pub trait Domain {
    type Elem: Clone + PartialEq + Debug;
    fn contains(&self, _elem: &Self::Elem) -> bool { ... }
}

An arbitrary set of elements where not all representable elements are members of the set, but every member is uniquely represented, thus they can be compered using the == operator.

Associated Types

type Elem: Clone + PartialEq + Debug

The type of the elements of this domain.

Loading content...

Provided methods

fn contains(&self, _elem: &Self::Elem) -> bool

Checks if the given element is a member of the domain. Not all possible objects need to be elements of the set.

Loading content...

Implementors

impl Domain for Integers

type Elem = BigInt

impl<E> Domain for ApproxFloats<E> where
    E: Float + Debug + Zero + One, 

type Elem = E

fn contains(&self, elem: &Self::Elem) -> bool

impl<E> Domain for CheckedInts<E> where
    E: PrimInt + Signed + Debug + From<i8>, 

type Elem = E

impl<E> Domain for ModularInts<E> where
    E: PrimInt + Signed + WrappingAdd + WrappingMul + WrappingSub + Debug + From<i8>, 

type Elem = E

impl<R> Domain for Polynomials<R> where
    R: UnitaryRing, 

type Elem = Vec<R::Elem>

fn contains(&self, elem: &Self::Elem) -> bool

impl<R: EuclideanDomain> Domain for DivisibilityLattice<R>

type Elem = R::Elem

fn contains(&self, elem: &Self::Elem) -> bool

impl<R: EuclideanDomain> Domain for QuotientField<R>

type Elem = R::Elem

fn contains(&self, elem: &Self::Elem) -> bool

impl<R: EuclideanDomain> Domain for QuotientRing<R>

type Elem = R::Elem

fn contains(&self, elem: &Self::Elem) -> bool

Loading content...