Struct Monomial 

pub struct Monomial {
    pub map: BTreeMap<Symbol, NonZeroI32>,
}

Uniquely reduced form of a symbolic monomial expression.

A primitive Laurent monomial $M_m$ is realized as the product of Symbols $S_s$ with individual non-zero exponents $E_s$.

M_m \equiv \prod_s S_s^{E_s}

All operators (e.g., Add, Mul) implemented for Monomial reduce an arbitrary expression into this unique form.

Fields

map: BTreeMap<Symbol, NonZeroI32>

Symbolic storage.

Implementations

impl Monomial

pub fn one() -> Self

The one.

pub fn is_zero(&self) -> bool

Whether this monomial is zero.

pub fn is_one(&self) -> bool

Whether this monomial is one.

pub fn alt(self) -> Self

Extends the symbol space.

pub fn cdm(self, mark: char) -> Self

Appends combining diacritical mark to all symbols.

pub fn swp(self) -> Self

Swaps lowercase and uppercase symbols.

Trait Implementations

impl Clone for Monomial

fn clone(&self) -> Monomial

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Monomial

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

Formats the value using the given formatter.

impl Default for Monomial

fn default() -> Monomial

Returns the “default value” for a type.

impl Div for Monomial

type Output = Monomial

The resulting type after applying the / operator.

fn div(self, other: Self) -> Self::Output

Performs the / operation.

impl DivAssign for Monomial

fn div_assign(&mut self, other: Self)

Performs the /= operation.

impl From<Monomial> for Tree

fn from(m: Monomial) -> Self

Converts to this type from the input type.

impl<S> FromIterator<S> for Monomial

where S: Into<Symbol>,

fn from_iter<M: IntoIterator<Item = S>>(iter: M) -> Self

Creates a value from an iterator.

impl Mul for Monomial

type Output = Monomial

The resulting type after applying the * operator.

fn mul(self, other: Self) -> Self::Output

Performs the * operation.

impl MulAssign for Monomial

fn mul_assign(&mut self, other: Self)

Performs the *= operation.

impl Ord for Monomial

fn cmp(&self, other: &Monomial) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Monomial

fn eq(&self, other: &Monomial) -> 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 PartialOrd for Monomial

fn partial_cmp(&self, other: &Monomial) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for Monomial

impl StructuralPartialEq for Monomial