Struct Polynomial

pub struct Polynomial<T> { /* private fields */ }

Polynomial representation

Implementations

impl<T: MonomialValue> Polynomial<T>

pub fn new(mono_vec: Vec<Monomial<T>>) -> Polynomial<T>

Constructs a new Polynomial<T>

Examples

let mono_vec: Vec<Monomial<i32>> = vec![
    Monomial::new(2, 2),
    Monomial::new(-1, 1),
    Monomial::new(10, 0),
];

let poly: Polynomial<i32> = Polynomial::new(mono_vec);

pub fn max_exp(&self) -> Monomial<T>

Returns the monomial with the max exponent

Examples

let poly: Polynomial<i32> = Polynomial::try_from("x^2 - 5x - 100").unwrap();

assert_eq!(poly.max_exp().get_exp(), 2);

pub fn len(&self) -> usize

Returns the number of Monomials in the Polynomial, also referred to as its ‘length’

Examples

let poly: Polynomial<i32> = Polynomial::default();

assert_eq!(poly.len(), 0);

pub fn equation_type(&self) -> EquationType

Returns the equation type

Examples

let poly: Polynomial<i32> = Polynomial::try_from("5x - 100").unwrap();

assert_eq!(poly.equation_type(), EquationType::Linear);

pub fn push(&mut self, mono: Monomial<T>)

Add a monomial

Examples

let mut poly: Polynomial<i32> = Polynomial::try_from("5x - 100").unwrap();
let mono: Monomial<i32> = Monomial::try_from("2x^2").unwrap();

poly.push(mono);

assert_eq!(format!("{poly}"), "2x^2 + 5x - 100");

pub fn find_by_exp(&self, exp: i32) -> Monomial<T>

Find monomial in a polynomial by the exponent if don’t find the monomial returns Monomial::default()

Examples

let poly: Polynomial<i32> = Polynomial::try_from("2x^2 + 5x - 100").unwrap();

assert_eq!(poly.find_by_exp(1), Monomial::new(5, 1));
assert_eq!(poly.find_by_exp(10), Monomial::default());

pub fn div_mono(self, rhs: Monomial<T>) -> Self

Returns a new polynomial as result of dividing a monomial

Examples

let poly: Polynomial<i32> = Polynomial::try_from("10x - 10").unwrap();
let mono: Monomial<i32> = Monomial::try_from("2").unwrap();

let result = poly.div_mono(mono);

assert_eq!(format!("{result}"), "5x - 5");

pub fn mul_mono(self, rhs: Monomial<T>) -> Self

Returns a new polynomial as result of multiplying a monomial

Examples

let poly: Polynomial<i32> = Polynomial::try_from("10x - 10").unwrap();
let mono: Monomial<i32> = Monomial::try_from("2").unwrap();

let result = poly.mul_mono(mono);

assert_eq!(format!("{result}"), "20x - 20");

pub fn roots(&self) -> Option<Vec<T>>

Returns an Option containing the roots of the equation This function uses different strategies based on EquationType

Examples

let poly: Polynomial<i32> = Polynomial::try_from("x - 9").unwrap();

assert_eq!(poly.roots(), Some(vec![9]));

Trait Implementations

impl<T: MonomialValue> Add for Polynomial<T>

type Output = Polynomial<T>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl<T: Clone> Clone for Polynomial<T>

fn clone(&self) -> Polynomial<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Polynomial<T>

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

Formats the value using the given formatter.

impl<T: MonomialValue> Default for Polynomial<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: MonomialValue> Display for Polynomial<T>

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

Formats the value using the given formatter.

impl<T: MonomialValue> Div for Polynomial<T>

type Output = (Polynomial<T>, Polynomial<T>)

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T: MonomialValue> From<Vec<Monomial<T>>> for Polynomial<T>

fn from(value: Vec<Monomial<T>>) -> Self

Converts to this type from the input type.

impl<T: MonomialValue> Index<usize> for Polynomial<T>

type Output = Monomial<T>

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'a, T: MonomialValue> IntoIterator for &'a Polynomial<T>

type Item = &'a Monomial<T>

The type of the elements being iterated over.

type IntoIter = Iter<'a, Monomial<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: MonomialValue> IntoIterator for Polynomial<T>

type Item = Monomial<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<<Polynomial<T> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: MonomialValue> Mul for Polynomial<T>

type Output = Polynomial<T>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T: MonomialValue> Neg for Polynomial<T>

type Output = Polynomial<T>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<T: PartialEq> PartialEq for Polynomial<T>

fn eq(&self, other: &Polynomial<T>) -> 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<T: MonomialValue> TryFrom<&str> for Polynomial<T>

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(value: &str) -> Result<Self, Self::Error>

Performs the conversion.

impl<T: MonomialValue> TryFrom<Vec<T>> for Polynomial<T>

type Error = &'static str

The type returned in the event of a conversion error.

fn try_from(value: Vec<T>) -> Result<Self, Self::Error>

Performs the conversion.

impl<T> StructuralPartialEq for Polynomial<T>