Struct abstalg::ModularInts

pub struct ModularInts<E> where
    E: PrimInt + Signed + WrappingAdd + WrappingMul + WrappingSub + Debug + From<i8>,  { /* fields omitted */ }

The ring of signed integers modulo 2^n whose elements are stored in a primitive signed integer type. The ring operations on these sets wrap around. This structure is equivalent to the quotient ring of the set of integers modulo 2^n, but its implementation is more efficient.

Trait Implementations

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

type Elem = E

The type of the elements of this domain.

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.

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

fn zero(&self) -> Self::Elem

The additive identity element of the ring.

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

Checks if the given element is the additive identity of the ring.

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

The additive inverse of the given element.

fn add(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem

The additive sum of the given elements

fn one(&self) -> Self::Elem

The multiplicative identity element of the ring.

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

Checks if the given element is the multiplicative identity of the ring.

fn mul(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem

The multiplicative product of the given elements.

fn sub(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem

The difference of the given elements.