Struct Polynomial

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

Implementations

impl<T: Display + One + Zero + PartialEq> Polynomial<T>

pub fn to_display<'a, 'b>( &'b self, variable: &'a str, ) -> DisplayPolynomial<'a, 'b, T>

Examples found in repository

examples/basic.rs (line 10)

fn main() {
	let a = Polynomial::new(coefficients![1f32, 2.0, 3.0, 0.0]);
	let b = Polynomial::new(coefficients![1f32, 0.0, 1.0]);
	let (q, r) = a.div_rem(&b);
	println!(
		"({0}) / ({1}) = ({1}) * ({2}) + {3}",
		a.to_display("ω"),
		b.to_display("ω"),
		q.to_display("ω"),
		r.to_display("ω")
	);

	let x = Complex::new(0f32, 1.0);
	let e = a.eval(x);
	println!("{} = {} for x = {}", a.to_display("x"), e, x);

	let d = a.eval_der(1f32, 2);
	println!("({})'' = {} for z = {}", a.to_display("z"), d, 1f32);
}

impl<T> Polynomial<T>

pub fn order(&self) -> i32

pub fn reverse_coeffs(&self) -> &SmallVec<[T; 8]>

pub fn into_coeffs(self) -> SmallVec<[T; 8]>

pub fn into_reverse_coeffs(self) -> SmallVec<[T; 8]>

pub fn coeffs(&self) -> SmallVec<[T; 8]>

where T: Clone,

pub fn new(coefficients: SmallVec<[T; 8]>) -> Self

where T: Zero,

Examples found in repository

examples/basic.rs (line 5)

fn main() {
	let a = Polynomial::new(coefficients![1f32, 2.0, 3.0, 0.0]);
	let b = Polynomial::new(coefficients![1f32, 0.0, 1.0]);
	let (q, r) = a.div_rem(&b);
	println!(
		"({0}) / ({1}) = ({1}) * ({2}) + {3}",
		a.to_display("ω"),
		b.to_display("ω"),
		q.to_display("ω"),
		r.to_display("ω")
	);

	let x = Complex::new(0f32, 1.0);
	let e = a.eval(x);
	println!("{} = {} for x = {}", a.to_display("x"), e, x);

	let d = a.eval_der(1f32, 2);
	println!("({})'' = {} for z = {}", a.to_display("z"), d, 1f32);
}

pub fn new_reversed(rev_coeffs: SmallVec<[T; 8]>) -> Self

where T: Zero,

pub fn eval<X, Y>(&self, x: X) -> Y

where T: Zero, for<'l, 'r> &'l T: Mul<&'r X, Output = Y>, X: for<'r> MulAssign<&'r X> + One, Y: AddAssign + Zero,

Examples found in repository

examples/basic.rs (line 17)

fn main() {
	let a = Polynomial::new(coefficients![1f32, 2.0, 3.0, 0.0]);
	let b = Polynomial::new(coefficients![1f32, 0.0, 1.0]);
	let (q, r) = a.div_rem(&b);
	println!(
		"({0}) / ({1}) = ({1}) * ({2}) + {3}",
		a.to_display("ω"),
		b.to_display("ω"),
		q.to_display("ω"),
		r.to_display("ω")
	);

	let x = Complex::new(0f32, 1.0);
	let e = a.eval(x);
	println!("{} = {} for x = {}", a.to_display("x"), e, x);

	let d = a.eval_der(1f32, 2);
	println!("({})'' = {} for z = {}", a.to_display("z"), d, 1f32);
}

pub fn eval_precise<X, Y>(&self, x: X) -> Y

where T: Zero + Clone + Into<Y>, for<'l> &'l X: Pow<i32, Output = X>, Y: MulAddAssign<X, Y> + Zero, for<'l> &'l T: Mul<X, Output = Y>,

pub fn eval_der<X, Y>(&self, x: X, n: i32) -> Y

where T: Zero + FromPrimitive + for<'r> Mul<&'r X, Output = Y>, for<'l> &'l T: Mul<T, Output = T>, X: for<'r> MulAssign<&'r X> + One, Y: AddAssign + Zero,

Examples found in repository

examples/basic.rs (line 20)

fn main() {
	let a = Polynomial::new(coefficients![1f32, 2.0, 3.0, 0.0]);
	let b = Polynomial::new(coefficients![1f32, 0.0, 1.0]);
	let (q, r) = a.div_rem(&b);
	println!(
		"({0}) / ({1}) = ({1}) * ({2}) + {3}",
		a.to_display("ω"),
		b.to_display("ω"),
		q.to_display("ω"),
		r.to_display("ω")
	);

	let x = Complex::new(0f32, 1.0);
	let e = a.eval(x);
	println!("{} = {} for x = {}", a.to_display("x"), e, x);

	let d = a.eval_der(1f32, 2);
	println!("({})'' = {} for z = {}", a.to_display("z"), d, 1f32);
}

pub fn eval_der_precise<X, Y>(&self, x: X, n: i32) -> Y

where T: Zero + FromPrimitive + Into<Y>, for<'l, 'l> &'l T: Mul<T, Output = T> + Mul<X, Output = Y>, for<'l> &'l X: Pow<i32, Output = X>, Y: MulAddAssign<X, Y> + Zero + Clone,

pub fn div_rem(&self, rhs: &Self) -> (Self, Self)

where T: Zero + Clone + for<'r> AddAssign<&'r T> + SubAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T> + Div<&'r T, Output = T>,

Examples found in repository

examples/basic.rs (line 7)

fn main() {
	let a = Polynomial::new(coefficients![1f32, 2.0, 3.0, 0.0]);
	let b = Polynomial::new(coefficients![1f32, 0.0, 1.0]);
	let (q, r) = a.div_rem(&b);
	println!(
		"({0}) / ({1}) = ({1}) * ({2}) + {3}",
		a.to_display("ω"),
		b.to_display("ω"),
		q.to_display("ω"),
		r.to_display("ω")
	);

	let x = Complex::new(0f32, 1.0);
	let e = a.eval(x);
	println!("{} = {} for x = {}", a.to_display("x"), e, x);

	let d = a.eval_der(1f32, 2);
	println!("({})'' = {} for z = {}", a.to_display("z"), d, 1f32);
}

Trait Implementations

impl<T> Add<&Polynomial<T>> for &Polynomial<T>

where T: for<'r> AddAssign<&'r T> + Zero + Clone,

type Output = Polynomial<T>

The resulting type after applying the + operator.

fn add(self, rhs: &Polynomial<T>) -> Polynomial<T>

Performs the + operation.

impl<T> Add<&Polynomial<T>> for Polynomial<T>

where T: for<'r> AddAssign<&'r T> + Zero,

type Output = Polynomial<T>

The resulting type after applying the + operator.

fn add(self, rhs: &Polynomial<T>) -> Polynomial<T>

Performs the + operation.

impl<T> Add<Polynomial<T>> for &Polynomial<T>

where T: for<'r> AddAssign<&'r T> + Zero,

type Output = Polynomial<T>

The resulting type after applying the + operator.

fn add(self, rhs: Polynomial<T>) -> Polynomial<T>

Performs the + operation.

impl<T> Add for Polynomial<T>

where T: for<'r> AddAssign<&'r T> + Zero,

type Output = Polynomial<T>

The resulting type after applying the + operator.

fn add(self, rhs: Polynomial<T>) -> Polynomial<T>

Performs the + operation.

impl<T> AddAssign<&Polynomial<T>> for Polynomial<T>

where T: for<'r> AddAssign<&'r T> + Zero,

fn add_assign(&mut self, rhs: &Polynomial<T>)

Performs the += operation.

impl<T> AddAssign for Polynomial<T>

where T: for<'r> AddAssign<&'r T> + Zero,

fn add_assign(&mut self, rhs: Polynomial<T>)

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 Mul<&Polynomial<BigInt>> for &BigInt

type Output = Polynomial<BigInt>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<BigInt>) -> Polynomial<BigInt>

Performs the * operation.

impl Mul<&Polynomial<BigInt>> for BigInt

type Output = Polynomial<BigInt>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<BigInt>) -> Polynomial<BigInt>

Performs the * operation.

impl Mul<&Polynomial<BigUint>> for &BigUint

type Output = Polynomial<BigUint>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<BigUint>) -> Polynomial<BigUint>

Performs the * operation.

impl Mul<&Polynomial<BigUint>> for BigUint

type Output = Polynomial<BigUint>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<BigUint>) -> Polynomial<BigUint>

Performs the * operation.

impl Mul<&Polynomial<Complex<f32>>> for &Complex<f32>

type Output = Polynomial<Complex<f32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>

Performs the * operation.

impl Mul<&Polynomial<Complex<f32>>> for Complex<f32>

type Output = Polynomial<Complex<f32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>

Performs the * operation.

impl Mul<&Polynomial<Complex<f64>>> for &Complex<f64>

type Output = Polynomial<Complex<f64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>

Performs the * operation.

impl Mul<&Polynomial<Complex<f64>>> for Complex<f64>

type Output = Polynomial<Complex<f64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i16>>> for &Complex<i16>

type Output = Polynomial<Complex<i16>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i16>>> for Complex<i16>

type Output = Polynomial<Complex<i16>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i32>>> for &Complex<i32>

type Output = Polynomial<Complex<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i32>>> for Complex<i32>

type Output = Polynomial<Complex<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i64>>> for &Complex<i64>

type Output = Polynomial<Complex<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i64>>> for Complex<i64>

type Output = Polynomial<Complex<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i8>>> for &Complex<i8>

type Output = Polynomial<Complex<i8>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>

Performs the * operation.

impl Mul<&Polynomial<Complex<i8>>> for Complex<i8>

type Output = Polynomial<Complex<i8>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>

Performs the * operation.

impl Mul<&Polynomial<Complex<isize>>> for &Complex<isize>

type Output = Polynomial<Complex<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>

Performs the * operation.

impl Mul<&Polynomial<Complex<isize>>> for Complex<isize>

type Output = Polynomial<Complex<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u16>>> for &Complex<u16>

type Output = Polynomial<Complex<u16>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u16>>> for Complex<u16>

type Output = Polynomial<Complex<u16>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u32>>> for &Complex<u32>

type Output = Polynomial<Complex<u32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u32>>> for Complex<u32>

type Output = Polynomial<Complex<u32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u64>>> for &Complex<u64>

type Output = Polynomial<Complex<u64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u64>>> for Complex<u64>

type Output = Polynomial<Complex<u64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u8>>> for &Complex<u8>

type Output = Polynomial<Complex<u8>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>

Performs the * operation.

impl Mul<&Polynomial<Complex<u8>>> for Complex<u8>

type Output = Polynomial<Complex<u8>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>

Performs the * operation.

impl Mul<&Polynomial<Complex<usize>>> for &Complex<usize>

type Output = Polynomial<Complex<usize>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>

Performs the * operation.

impl Mul<&Polynomial<Complex<usize>>> for Complex<usize>

type Output = Polynomial<Complex<usize>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>

Performs the * operation.

impl Mul<&Polynomial<Ratio<BigInt>>> for &BigRational

type Output = Polynomial<Ratio<BigInt>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<BigRational>) -> Polynomial<BigRational>

Performs the * operation.

impl Mul<&Polynomial<Ratio<BigInt>>> for BigRational

type Output = Polynomial<Ratio<BigInt>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<BigRational>) -> Polynomial<BigRational>

Performs the * operation.

impl Mul<&Polynomial<Ratio<i32>>> for &Rational32

type Output = Polynomial<Ratio<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Rational32>) -> Polynomial<Rational32>

Performs the * operation.

impl Mul<&Polynomial<Ratio<i32>>> for Rational32

type Output = Polynomial<Ratio<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Rational32>) -> Polynomial<Rational32>

Performs the * operation.

impl Mul<&Polynomial<Ratio<i64>>> for &Rational64

type Output = Polynomial<Ratio<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Rational64>) -> Polynomial<Rational64>

Performs the * operation.

impl Mul<&Polynomial<Ratio<i64>>> for Rational64

type Output = Polynomial<Ratio<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Rational64>) -> Polynomial<Rational64>

Performs the * operation.

impl Mul<&Polynomial<Ratio<isize>>> for &Rational

type Output = Polynomial<Ratio<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Rational>) -> Polynomial<Rational>

Performs the * operation.

impl Mul<&Polynomial<Ratio<isize>>> for Rational

type Output = Polynomial<Ratio<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<Rational>) -> Polynomial<Rational>

Performs the * operation.

impl<T> Mul<&Polynomial<T>> for &Polynomial<T>

where T: Zero + AddAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<T>) -> Polynomial<T>

Performs the * operation.

impl<T> Mul<&Polynomial<T>> for Polynomial<T>

where T: Zero + AddAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<T>) -> Polynomial<T>

Performs the * operation.

impl Mul<&Polynomial<f32>> for &f32

type Output = Polynomial<f32>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<f32>) -> Polynomial<f32>

Performs the * operation.

impl Mul<&Polynomial<f32>> for f32

type Output = Polynomial<f32>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<f32>) -> Polynomial<f32>

Performs the * operation.

impl Mul<&Polynomial<f64>> for &f64

type Output = Polynomial<f64>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<f64>) -> Polynomial<f64>

Performs the * operation.

impl Mul<&Polynomial<f64>> for f64

type Output = Polynomial<f64>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<f64>) -> Polynomial<f64>

Performs the * operation.

impl Mul<&Polynomial<i16>> for &i16

type Output = Polynomial<i16>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i16>) -> Polynomial<i16>

Performs the * operation.

impl Mul<&Polynomial<i16>> for i16

type Output = Polynomial<i16>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i16>) -> Polynomial<i16>

Performs the * operation.

impl Mul<&Polynomial<i32>> for &i32

type Output = Polynomial<i32>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i32>) -> Polynomial<i32>

Performs the * operation.

impl Mul<&Polynomial<i32>> for i32

type Output = Polynomial<i32>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i32>) -> Polynomial<i32>

Performs the * operation.

impl Mul<&Polynomial<i64>> for &i64

type Output = Polynomial<i64>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i64>) -> Polynomial<i64>

Performs the * operation.

impl Mul<&Polynomial<i64>> for i64

type Output = Polynomial<i64>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i64>) -> Polynomial<i64>

Performs the * operation.

impl Mul<&Polynomial<i8>> for &i8

type Output = Polynomial<i8>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i8>) -> Polynomial<i8>

Performs the * operation.

impl Mul<&Polynomial<i8>> for i8

type Output = Polynomial<i8>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<i8>) -> Polynomial<i8>

Performs the * operation.

impl Mul<&Polynomial<isize>> for &isize

type Output = Polynomial<isize>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<isize>) -> Polynomial<isize>

Performs the * operation.

impl Mul<&Polynomial<isize>> for isize

type Output = Polynomial<isize>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<isize>) -> Polynomial<isize>

Performs the * operation.

impl Mul<&Polynomial<u16>> for &u16

type Output = Polynomial<u16>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u16>) -> Polynomial<u16>

Performs the * operation.

impl Mul<&Polynomial<u16>> for u16

type Output = Polynomial<u16>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u16>) -> Polynomial<u16>

Performs the * operation.

impl Mul<&Polynomial<u32>> for &u32

type Output = Polynomial<u32>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u32>) -> Polynomial<u32>

Performs the * operation.

impl Mul<&Polynomial<u32>> for u32

type Output = Polynomial<u32>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u32>) -> Polynomial<u32>

Performs the * operation.

impl Mul<&Polynomial<u64>> for &u64

type Output = Polynomial<u64>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u64>) -> Polynomial<u64>

Performs the * operation.

impl Mul<&Polynomial<u64>> for u64

type Output = Polynomial<u64>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u64>) -> Polynomial<u64>

Performs the * operation.

impl Mul<&Polynomial<u8>> for &u8

type Output = Polynomial<u8>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u8>) -> Polynomial<u8>

Performs the * operation.

impl Mul<&Polynomial<u8>> for u8

type Output = Polynomial<u8>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<u8>) -> Polynomial<u8>

Performs the * operation.

impl Mul<&Polynomial<usize>> for &usize

type Output = Polynomial<usize>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<usize>) -> Polynomial<usize>

Performs the * operation.

impl Mul<&Polynomial<usize>> for usize

type Output = Polynomial<usize>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<usize>) -> Polynomial<usize>

Performs the * operation.

impl<T> Mul<&T> for &Polynomial<T>

where T: Zero, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &T) -> Polynomial<T>

Performs the * operation.

impl<T> Mul<&T> for Polynomial<T>

where T: for<'r> Mul<&'r T, Output = T> + Zero,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &T) -> Polynomial<T>

Performs the * operation.

impl Mul<Polynomial<BigInt>> for &BigInt

type Output = Polynomial<BigInt>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<BigInt>) -> Polynomial<BigInt>

Performs the * operation.

impl Mul<Polynomial<BigInt>> for BigInt

type Output = Polynomial<BigInt>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<BigInt>) -> Polynomial<BigInt>

Performs the * operation.

impl Mul<Polynomial<BigUint>> for &BigUint

type Output = Polynomial<BigUint>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<BigUint>) -> Polynomial<BigUint>

Performs the * operation.

impl Mul<Polynomial<BigUint>> for BigUint

type Output = Polynomial<BigUint>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<BigUint>) -> Polynomial<BigUint>

Performs the * operation.

impl Mul<Polynomial<Complex<f32>>> for &Complex<f32>

type Output = Polynomial<Complex<f32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>

Performs the * operation.

impl Mul<Polynomial<Complex<f32>>> for Complex<f32>

type Output = Polynomial<Complex<f32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>

Performs the * operation.

impl Mul<Polynomial<Complex<f64>>> for &Complex<f64>

type Output = Polynomial<Complex<f64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>

Performs the * operation.

impl Mul<Polynomial<Complex<f64>>> for Complex<f64>

type Output = Polynomial<Complex<f64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>

Performs the * operation.

impl Mul<Polynomial<Complex<i16>>> for &Complex<i16>

type Output = Polynomial<Complex<i16>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>

Performs the * operation.

impl Mul<Polynomial<Complex<i16>>> for Complex<i16>

type Output = Polynomial<Complex<i16>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>

Performs the * operation.

impl Mul<Polynomial<Complex<i32>>> for &Complex<i32>

type Output = Polynomial<Complex<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>

Performs the * operation.

impl Mul<Polynomial<Complex<i32>>> for Complex<i32>

type Output = Polynomial<Complex<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>

Performs the * operation.

impl Mul<Polynomial<Complex<i64>>> for &Complex<i64>

type Output = Polynomial<Complex<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>

Performs the * operation.

impl Mul<Polynomial<Complex<i64>>> for Complex<i64>

type Output = Polynomial<Complex<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>

Performs the * operation.

impl Mul<Polynomial<Complex<i8>>> for &Complex<i8>

type Output = Polynomial<Complex<i8>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>

Performs the * operation.

impl Mul<Polynomial<Complex<i8>>> for Complex<i8>

type Output = Polynomial<Complex<i8>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>

Performs the * operation.

impl Mul<Polynomial<Complex<isize>>> for &Complex<isize>

type Output = Polynomial<Complex<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>

Performs the * operation.

impl Mul<Polynomial<Complex<isize>>> for Complex<isize>

type Output = Polynomial<Complex<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>

Performs the * operation.

impl Mul<Polynomial<Complex<u16>>> for &Complex<u16>

type Output = Polynomial<Complex<u16>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>

Performs the * operation.

impl Mul<Polynomial<Complex<u16>>> for Complex<u16>

type Output = Polynomial<Complex<u16>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>

Performs the * operation.

impl Mul<Polynomial<Complex<u32>>> for &Complex<u32>

type Output = Polynomial<Complex<u32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>

Performs the * operation.

impl Mul<Polynomial<Complex<u32>>> for Complex<u32>

type Output = Polynomial<Complex<u32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>

Performs the * operation.

impl Mul<Polynomial<Complex<u64>>> for &Complex<u64>

type Output = Polynomial<Complex<u64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>

Performs the * operation.

impl Mul<Polynomial<Complex<u64>>> for Complex<u64>

type Output = Polynomial<Complex<u64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>

Performs the * operation.

impl Mul<Polynomial<Complex<u8>>> for &Complex<u8>

type Output = Polynomial<Complex<u8>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>

Performs the * operation.

impl Mul<Polynomial<Complex<u8>>> for Complex<u8>

type Output = Polynomial<Complex<u8>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>

Performs the * operation.

impl Mul<Polynomial<Complex<usize>>> for &Complex<usize>

type Output = Polynomial<Complex<usize>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>

Performs the * operation.

impl Mul<Polynomial<Complex<usize>>> for Complex<usize>

type Output = Polynomial<Complex<usize>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>

Performs the * operation.

impl Mul<Polynomial<Ratio<BigInt>>> for &BigRational

type Output = Polynomial<Ratio<BigInt>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<BigRational>) -> Polynomial<BigRational>

Performs the * operation.

impl Mul<Polynomial<Ratio<BigInt>>> for BigRational

type Output = Polynomial<Ratio<BigInt>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<BigRational>) -> Polynomial<BigRational>

Performs the * operation.

impl Mul<Polynomial<Ratio<i32>>> for &Rational32

type Output = Polynomial<Ratio<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Rational32>) -> Polynomial<Rational32>

Performs the * operation.

impl Mul<Polynomial<Ratio<i32>>> for Rational32

type Output = Polynomial<Ratio<i32>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Rational32>) -> Polynomial<Rational32>

Performs the * operation.

impl Mul<Polynomial<Ratio<i64>>> for &Rational64

type Output = Polynomial<Ratio<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Rational64>) -> Polynomial<Rational64>

Performs the * operation.

impl Mul<Polynomial<Ratio<i64>>> for Rational64

type Output = Polynomial<Ratio<i64>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Rational64>) -> Polynomial<Rational64>

Performs the * operation.

impl Mul<Polynomial<Ratio<isize>>> for &Rational

type Output = Polynomial<Ratio<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Rational>) -> Polynomial<Rational>

Performs the * operation.

impl Mul<Polynomial<Ratio<isize>>> for Rational

type Output = Polynomial<Ratio<isize>>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<Rational>) -> Polynomial<Rational>

Performs the * operation.

impl<T> Mul<Polynomial<T>> for &Polynomial<T>

where T: Zero + AddAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<T>) -> Polynomial<T>

Performs the * operation.

impl Mul<Polynomial<f32>> for &f32

type Output = Polynomial<f32>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<f32>) -> Polynomial<f32>

Performs the * operation.

impl Mul<Polynomial<f32>> for f32

type Output = Polynomial<f32>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<f32>) -> Polynomial<f32>

Performs the * operation.

impl Mul<Polynomial<f64>> for &f64

type Output = Polynomial<f64>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<f64>) -> Polynomial<f64>

Performs the * operation.

impl Mul<Polynomial<f64>> for f64

type Output = Polynomial<f64>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<f64>) -> Polynomial<f64>

Performs the * operation.

impl Mul<Polynomial<i16>> for &i16

type Output = Polynomial<i16>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i16>) -> Polynomial<i16>

Performs the * operation.

impl Mul<Polynomial<i16>> for i16

type Output = Polynomial<i16>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i16>) -> Polynomial<i16>

Performs the * operation.

impl Mul<Polynomial<i32>> for &i32

type Output = Polynomial<i32>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i32>) -> Polynomial<i32>

Performs the * operation.

impl Mul<Polynomial<i32>> for i32

type Output = Polynomial<i32>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i32>) -> Polynomial<i32>

Performs the * operation.

impl Mul<Polynomial<i64>> for &i64

type Output = Polynomial<i64>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i64>) -> Polynomial<i64>

Performs the * operation.

impl Mul<Polynomial<i64>> for i64

type Output = Polynomial<i64>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i64>) -> Polynomial<i64>

Performs the * operation.

impl Mul<Polynomial<i8>> for &i8

type Output = Polynomial<i8>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i8>) -> Polynomial<i8>

Performs the * operation.

impl Mul<Polynomial<i8>> for i8

type Output = Polynomial<i8>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<i8>) -> Polynomial<i8>

Performs the * operation.

impl Mul<Polynomial<isize>> for &isize

type Output = Polynomial<isize>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<isize>) -> Polynomial<isize>

Performs the * operation.

impl Mul<Polynomial<isize>> for isize

type Output = Polynomial<isize>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<isize>) -> Polynomial<isize>

Performs the * operation.

impl Mul<Polynomial<u16>> for &u16

type Output = Polynomial<u16>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u16>) -> Polynomial<u16>

Performs the * operation.

impl Mul<Polynomial<u16>> for u16

type Output = Polynomial<u16>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u16>) -> Polynomial<u16>

Performs the * operation.

impl Mul<Polynomial<u32>> for &u32

type Output = Polynomial<u32>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u32>) -> Polynomial<u32>

Performs the * operation.

impl Mul<Polynomial<u32>> for u32

type Output = Polynomial<u32>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u32>) -> Polynomial<u32>

Performs the * operation.

impl Mul<Polynomial<u64>> for &u64

type Output = Polynomial<u64>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u64>) -> Polynomial<u64>

Performs the * operation.

impl Mul<Polynomial<u64>> for u64

type Output = Polynomial<u64>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u64>) -> Polynomial<u64>

Performs the * operation.

impl Mul<Polynomial<u8>> for &u8

type Output = Polynomial<u8>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u8>) -> Polynomial<u8>

Performs the * operation.

impl Mul<Polynomial<u8>> for u8

type Output = Polynomial<u8>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<u8>) -> Polynomial<u8>

Performs the * operation.

impl Mul<Polynomial<usize>> for &usize

type Output = Polynomial<usize>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<usize>) -> Polynomial<usize>

Performs the * operation.

impl Mul<Polynomial<usize>> for usize

type Output = Polynomial<usize>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<usize>) -> Polynomial<usize>

Performs the * operation.

impl<T> Mul<T> for &Polynomial<T>

where T: Zero, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: T) -> Polynomial<T>

Performs the * operation.

impl<T> Mul<T> for Polynomial<T>

where T: for<'r> Mul<&'r T, Output = T> + Zero,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: T) -> Polynomial<T>

Performs the * operation.

impl<T> Mul for Polynomial<T>

where T: Zero + AddAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

type Output = Polynomial<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial<T>) -> Polynomial<T>

Performs the * operation.

impl<T> MulAssign<&Polynomial<T>> for Polynomial<T>

where T: Zero + AddAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

fn mul_assign(&mut self, rhs: &Polynomial<T>)

Performs the *= operation.

impl<T> MulAssign for Polynomial<T>

where T: Zero + AddAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

fn mul_assign(&mut self, rhs: Polynomial<T>)

Performs the *= operation.

impl<T> Neg for &Polynomial<T>

where T: Zero, for<'l> &'l T: Neg<Output = T>,

type Output = Polynomial<T>

The resulting type after applying the - operator.

fn neg(self) -> Polynomial<T>

Performs the unary - operation.

impl<T> Neg for Polynomial<T>

where T: Zero, for<'l> &'l T: Neg<Output = T>,

type Output = Polynomial<T>

The resulting type after applying the - operator.

fn neg(self) -> Polynomial<T>

Performs the unary - operation.

impl<T> One for Polynomial<T>

where T: One + Zero + AddAssign, for<'l, 'r> &'l T: Mul<&'r T, Output = T>,

fn one() -> Self

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<T: Ord> Ord for Polynomial<T>

fn cmp(&self, other: &Polynomial<T>) -> 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<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: PartialOrd> PartialOrd for Polynomial<T>

fn partial_cmp(&self, other: &Polynomial<T>) -> 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<T> Sub<&Polynomial<T>> for &Polynomial<T>

where T: for<'r> SubAssign<&'r T> + Zero + Clone,

type Output = Polynomial<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &Polynomial<T>) -> Polynomial<T>

Performs the - operation.

impl<T> Sub<&Polynomial<T>> for Polynomial<T>

where T: for<'r> SubAssign<&'r T> + Zero,

type Output = Polynomial<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &Polynomial<T>) -> Polynomial<T>

Performs the - operation.

impl<T> Sub<Polynomial<T>> for &Polynomial<T>

where T: for<'r> SubAssign<&'r T> + Zero + Clone,

type Output = Polynomial<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Polynomial<T>) -> Polynomial<T>

Performs the - operation.

impl<T> Sub for Polynomial<T>

where T: for<'r> SubAssign<&'r T> + Zero,

type Output = Polynomial<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Polynomial<T>) -> Polynomial<T>

Performs the - operation.

impl<T> SubAssign<&Polynomial<T>> for Polynomial<T>

where T: for<'r> SubAssign<&'r T> + Zero,

fn sub_assign(&mut self, rhs: &Polynomial<T>)

Performs the -= operation.

impl<T> SubAssign for Polynomial<T>

where T: for<'r> SubAssign<&'r T> + Zero,

fn sub_assign(&mut self, rhs: Polynomial<T>)

Performs the -= operation.

impl<T> Zero for Polynomial<T>

where T: for<'r> AddAssign<&'r T> + Zero,

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl<T: Eq> Eq for Polynomial<T>

impl<T> StructuralPartialEq for Polynomial<T>