[−][src]Struct poly::Polynomial
Implementations
impl<T: Display + One + Zero + PartialEq> Polynomial<T>
[src]
pub fn to_display<'a, 'b>(
&'b self,
variable: &'a str
) -> DisplayPolynomial<'a, 'b, T>
[src]
&'b self,
variable: &'a str
) -> DisplayPolynomial<'a, 'b, T>
impl<T> Polynomial<T>
[src]
pub fn order(&self) -> i32
[src]
pub fn reverse_coeffs(&self) -> &SmallVec<[T; 8]>
[src]
pub fn into_coeffs(self) -> SmallVec<[T; 8]>
[src]
pub fn into_reverse_coeffs(self) -> SmallVec<[T; 8]>
[src]
pub fn coeffs(&self) -> SmallVec<[T; 8]> where
T: Clone,
[src]
T: Clone,
pub fn new(coefficients: SmallVec<[T; 8]>) -> Self where
T: Zero,
[src]
T: Zero,
pub fn new_reversed(rev_coeffs: SmallVec<[T; 8]>) -> Self where
T: Zero,
[src]
T: Zero,
pub fn eval<X, Y>(&self, x: X) -> Y where
T: Zero,
&'l T: Mul<&'r X, Output = Y>,
X: for<'r> MulAssign<&'r X> + One,
Y: AddAssign + Zero,
[src]
T: Zero,
&'l T: Mul<&'r X, Output = Y>,
X: for<'r> MulAssign<&'r X> + One,
Y: AddAssign + Zero,
pub fn eval_precise<X, Y>(&self, x: X) -> Y where
T: Zero + Clone + Into<Y>,
&'l X: Pow<i32, Output = X>,
Y: MulAddAssign<X, Y> + Zero,
&'l T: Mul<X, Output = Y>,
[src]
T: Zero + Clone + Into<Y>,
&'l X: Pow<i32, Output = X>,
Y: MulAddAssign<X, Y> + Zero,
&'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>,
&'l T: Mul<T, Output = T>,
X: for<'r> MulAssign<&'r X> + One,
Y: AddAssign + Zero,
[src]
T: Zero + FromPrimitive + for<'r> Mul<&'r X, Output = Y>,
&'l T: Mul<T, Output = T>,
X: for<'r> MulAssign<&'r X> + One,
Y: AddAssign + Zero,
pub fn eval_der_precise<X, Y>(&self, x: X, n: i32) -> Y where
T: Zero + FromPrimitive + Into<Y>,
&'l T: Mul<T, Output = T>,
&'l X: Pow<i32, Output = X>,
Y: MulAddAssign<X, Y> + Zero + Clone,
&'l T: Mul<X, Output = Y>,
[src]
T: Zero + FromPrimitive + Into<Y>,
&'l T: Mul<T, Output = T>,
&'l X: Pow<i32, Output = X>,
Y: MulAddAssign<X, Y> + Zero + Clone,
&'l T: Mul<X, Output = Y>,
pub fn div_rem(&self, rhs: &Self) -> (Self, Self) where
T: Zero + Clone + for<'r> AddAssign<&'r T> + SubAssign,
&'l T: Mul<&'r T, Output = T> + Div<&'r T, Output = T>,
[src]
T: Zero + Clone + for<'r> AddAssign<&'r T> + SubAssign,
&'l T: Mul<&'r T, Output = T> + Div<&'r T, Output = T>,
Trait Implementations
impl<'_, T> Add<&'_ Polynomial<T>> for Polynomial<T> where
T: for<'r> AddAssign<&'r T> + Zero,
[src]
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>
[src]
impl<'_, '_, T> Add<&'_ Polynomial<T>> for &'_ Polynomial<T> where
T: for<'r> AddAssign<&'r T> + Zero + Clone,
[src]
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>
[src]
impl<T> Add<Polynomial<T>> for Polynomial<T> where
T: for<'r> AddAssign<&'r T> + Zero,
[src]
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>
[src]
impl<'_, T> Add<Polynomial<T>> for &'_ Polynomial<T> where
T: for<'r> AddAssign<&'r T> + Zero,
[src]
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>
[src]
impl<'_, T> AddAssign<&'_ Polynomial<T>> for Polynomial<T> where
T: for<'r> AddAssign<&'r T> + Zero,
[src]
T: for<'r> AddAssign<&'r T> + Zero,
fn add_assign(&mut self, rhs: &Polynomial<T>)
[src]
impl<T> AddAssign<Polynomial<T>> for Polynomial<T> where
T: for<'r> AddAssign<&'r T> + Zero,
[src]
T: for<'r> AddAssign<&'r T> + Zero,
fn add_assign(&mut self, rhs: Polynomial<T>)
[src]
impl<T: Clone> Clone for Polynomial<T>
[src]
fn clone(&self) -> Polynomial<T>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T: Debug> Debug for Polynomial<T>
[src]
impl<T: Eq> Eq for Polynomial<T>
[src]
impl<'_> Mul<&'_ Polynomial<BigInt>> for BigInt
[src]
type Output = Polynomial<BigInt>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<BigInt>) -> Polynomial<BigInt>
[src]
impl<'_, '_> Mul<&'_ Polynomial<BigInt>> for &'_ BigInt
[src]
type Output = Polynomial<BigInt>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<BigInt>) -> Polynomial<BigInt>
[src]
impl<'_> Mul<&'_ Polynomial<BigUint>> for BigUint
[src]
type Output = Polynomial<BigUint>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<BigUint>) -> Polynomial<BigUint>
[src]
impl<'_, '_> Mul<&'_ Polynomial<BigUint>> for &'_ BigUint
[src]
type Output = Polynomial<BigUint>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<BigUint>) -> Polynomial<BigUint>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<f32>>> for Complex<f32>
[src]
type Output = Polynomial<Complex<f32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<f32>>> for &'_ Complex<f32>
[src]
type Output = Polynomial<Complex<f32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<f64>>> for Complex<f64>
[src]
type Output = Polynomial<Complex<f64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<f64>>> for &'_ Complex<f64>
[src]
type Output = Polynomial<Complex<f64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<i16>>> for Complex<i16>
[src]
type Output = Polynomial<Complex<i16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<i16>>> for &'_ Complex<i16>
[src]
type Output = Polynomial<Complex<i16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<i32>>> for Complex<i32>
[src]
type Output = Polynomial<Complex<i32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<i32>>> for &'_ Complex<i32>
[src]
type Output = Polynomial<Complex<i32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<i64>>> for Complex<i64>
[src]
type Output = Polynomial<Complex<i64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<i64>>> for &'_ Complex<i64>
[src]
type Output = Polynomial<Complex<i64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<i8>>> for Complex<i8>
[src]
type Output = Polynomial<Complex<i8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<i8>>> for &'_ Complex<i8>
[src]
type Output = Polynomial<Complex<i8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<isize>>> for Complex<isize>
[src]
type Output = Polynomial<Complex<isize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<isize>>> for &'_ Complex<isize>
[src]
type Output = Polynomial<Complex<isize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<u16>>> for Complex<u16>
[src]
type Output = Polynomial<Complex<u16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<u16>>> for &'_ Complex<u16>
[src]
type Output = Polynomial<Complex<u16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<u32>>> for Complex<u32>
[src]
type Output = Polynomial<Complex<u32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<u32>>> for &'_ Complex<u32>
[src]
type Output = Polynomial<Complex<u32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<u64>>> for Complex<u64>
[src]
type Output = Polynomial<Complex<u64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<u64>>> for &'_ Complex<u64>
[src]
type Output = Polynomial<Complex<u64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<u8>>> for Complex<u8>
[src]
type Output = Polynomial<Complex<u8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<u8>>> for &'_ Complex<u8>
[src]
type Output = Polynomial<Complex<u8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>
[src]
impl<'_> Mul<&'_ Polynomial<Complex<usize>>> for Complex<usize>
[src]
type Output = Polynomial<Complex<usize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Complex<usize>>> for &'_ Complex<usize>
[src]
type Output = Polynomial<Complex<usize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>
[src]
impl<'_> Mul<&'_ Polynomial<Ratio<BigInt>>> for BigRational
[src]
type Output = Polynomial<BigRational>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<BigRational>) -> Polynomial<BigRational>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Ratio<BigInt>>> for &'_ BigRational
[src]
type Output = Polynomial<BigRational>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<BigRational>) -> Polynomial<BigRational>
[src]
impl<'_> Mul<&'_ Polynomial<Ratio<i32>>> for Rational32
[src]
type Output = Polynomial<Rational32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Rational32>) -> Polynomial<Rational32>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Ratio<i32>>> for &'_ Rational32
[src]
type Output = Polynomial<Rational32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Rational32>) -> Polynomial<Rational32>
[src]
impl<'_> Mul<&'_ Polynomial<Ratio<i64>>> for Rational64
[src]
type Output = Polynomial<Rational64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Rational64>) -> Polynomial<Rational64>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Ratio<i64>>> for &'_ Rational64
[src]
type Output = Polynomial<Rational64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Rational64>) -> Polynomial<Rational64>
[src]
impl<'_> Mul<&'_ Polynomial<Ratio<isize>>> for Rational
[src]
type Output = Polynomial<Rational>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Rational>) -> Polynomial<Rational>
[src]
impl<'_, '_> Mul<&'_ Polynomial<Ratio<isize>>> for &'_ Rational
[src]
type Output = Polynomial<Rational>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<Rational>) -> Polynomial<Rational>
[src]
impl<'_, '_, T> Mul<&'_ Polynomial<T>> for &'_ Polynomial<T> where
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero + AddAssign,
&'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>
[src]
impl<'_, T> Mul<&'_ Polynomial<T>> for Polynomial<T> where
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero + AddAssign,
&'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>
[src]
impl<'_> Mul<&'_ Polynomial<f32>> for f32
[src]
type Output = Polynomial<f32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<f32>) -> Polynomial<f32>
[src]
impl<'_, '_> Mul<&'_ Polynomial<f32>> for &'_ f32
[src]
type Output = Polynomial<f32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<f32>) -> Polynomial<f32>
[src]
impl<'_> Mul<&'_ Polynomial<f64>> for f64
[src]
type Output = Polynomial<f64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<f64>) -> Polynomial<f64>
[src]
impl<'_, '_> Mul<&'_ Polynomial<f64>> for &'_ f64
[src]
type Output = Polynomial<f64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<f64>) -> Polynomial<f64>
[src]
impl<'_> Mul<&'_ Polynomial<i16>> for i16
[src]
type Output = Polynomial<i16>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i16>) -> Polynomial<i16>
[src]
impl<'_, '_> Mul<&'_ Polynomial<i16>> for &'_ i16
[src]
type Output = Polynomial<i16>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i16>) -> Polynomial<i16>
[src]
impl<'_> Mul<&'_ Polynomial<i32>> for i32
[src]
type Output = Polynomial<i32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i32>) -> Polynomial<i32>
[src]
impl<'_, '_> Mul<&'_ Polynomial<i32>> for &'_ i32
[src]
type Output = Polynomial<i32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i32>) -> Polynomial<i32>
[src]
impl<'_> Mul<&'_ Polynomial<i64>> for i64
[src]
type Output = Polynomial<i64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i64>) -> Polynomial<i64>
[src]
impl<'_, '_> Mul<&'_ Polynomial<i64>> for &'_ i64
[src]
type Output = Polynomial<i64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i64>) -> Polynomial<i64>
[src]
impl<'_> Mul<&'_ Polynomial<i8>> for i8
[src]
type Output = Polynomial<i8>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i8>) -> Polynomial<i8>
[src]
impl<'_, '_> Mul<&'_ Polynomial<i8>> for &'_ i8
[src]
type Output = Polynomial<i8>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<i8>) -> Polynomial<i8>
[src]
impl<'_> Mul<&'_ Polynomial<isize>> for isize
[src]
type Output = Polynomial<isize>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<isize>) -> Polynomial<isize>
[src]
impl<'_, '_> Mul<&'_ Polynomial<isize>> for &'_ isize
[src]
type Output = Polynomial<isize>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<isize>) -> Polynomial<isize>
[src]
impl<'_> Mul<&'_ Polynomial<u16>> for u16
[src]
type Output = Polynomial<u16>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u16>) -> Polynomial<u16>
[src]
impl<'_, '_> Mul<&'_ Polynomial<u16>> for &'_ u16
[src]
type Output = Polynomial<u16>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u16>) -> Polynomial<u16>
[src]
impl<'_> Mul<&'_ Polynomial<u32>> for u32
[src]
type Output = Polynomial<u32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u32>) -> Polynomial<u32>
[src]
impl<'_, '_> Mul<&'_ Polynomial<u32>> for &'_ u32
[src]
type Output = Polynomial<u32>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u32>) -> Polynomial<u32>
[src]
impl<'_> Mul<&'_ Polynomial<u64>> for u64
[src]
type Output = Polynomial<u64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u64>) -> Polynomial<u64>
[src]
impl<'_, '_> Mul<&'_ Polynomial<u64>> for &'_ u64
[src]
type Output = Polynomial<u64>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u64>) -> Polynomial<u64>
[src]
impl<'_> Mul<&'_ Polynomial<u8>> for u8
[src]
type Output = Polynomial<u8>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u8>) -> Polynomial<u8>
[src]
impl<'_, '_> Mul<&'_ Polynomial<u8>> for &'_ u8
[src]
type Output = Polynomial<u8>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<u8>) -> Polynomial<u8>
[src]
impl<'_> Mul<&'_ Polynomial<usize>> for usize
[src]
type Output = Polynomial<usize>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<usize>) -> Polynomial<usize>
[src]
impl<'_, '_> Mul<&'_ Polynomial<usize>> for &'_ usize
[src]
type Output = Polynomial<usize>
The resulting type after applying the *
operator.
fn mul(self, rhs: &Polynomial<usize>) -> Polynomial<usize>
[src]
impl<'_, T> Mul<&'_ T> for Polynomial<T> where
T: for<'r> Mul<&'r T, Output = T> + Zero,
[src]
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>
[src]
impl<'_, '_, T> Mul<&'_ T> for &'_ Polynomial<T> where
T: Zero,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero,
&'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>
[src]
impl Mul<Polynomial<BigInt>> for BigInt
[src]
type Output = Polynomial<BigInt>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<BigInt>) -> Polynomial<BigInt>
[src]
impl<'_> Mul<Polynomial<BigInt>> for &'_ BigInt
[src]
type Output = Polynomial<BigInt>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<BigInt>) -> Polynomial<BigInt>
[src]
impl Mul<Polynomial<BigUint>> for BigUint
[src]
type Output = Polynomial<BigUint>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<BigUint>) -> Polynomial<BigUint>
[src]
impl<'_> Mul<Polynomial<BigUint>> for &'_ BigUint
[src]
type Output = Polynomial<BigUint>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<BigUint>) -> Polynomial<BigUint>
[src]
impl Mul<Polynomial<Complex<f32>>> for Complex<f32>
[src]
type Output = Polynomial<Complex<f32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>
[src]
impl<'_> Mul<Polynomial<Complex<f32>>> for &'_ Complex<f32>
[src]
type Output = Polynomial<Complex<f32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<f32>>) -> Polynomial<Complex<f32>>
[src]
impl Mul<Polynomial<Complex<f64>>> for Complex<f64>
[src]
type Output = Polynomial<Complex<f64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>
[src]
impl<'_> Mul<Polynomial<Complex<f64>>> for &'_ Complex<f64>
[src]
type Output = Polynomial<Complex<f64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<f64>>) -> Polynomial<Complex<f64>>
[src]
impl Mul<Polynomial<Complex<i16>>> for Complex<i16>
[src]
type Output = Polynomial<Complex<i16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>
[src]
impl<'_> Mul<Polynomial<Complex<i16>>> for &'_ Complex<i16>
[src]
type Output = Polynomial<Complex<i16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i16>>) -> Polynomial<Complex<i16>>
[src]
impl Mul<Polynomial<Complex<i32>>> for Complex<i32>
[src]
type Output = Polynomial<Complex<i32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>
[src]
impl<'_> Mul<Polynomial<Complex<i32>>> for &'_ Complex<i32>
[src]
type Output = Polynomial<Complex<i32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i32>>) -> Polynomial<Complex<i32>>
[src]
impl Mul<Polynomial<Complex<i64>>> for Complex<i64>
[src]
type Output = Polynomial<Complex<i64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>
[src]
impl<'_> Mul<Polynomial<Complex<i64>>> for &'_ Complex<i64>
[src]
type Output = Polynomial<Complex<i64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i64>>) -> Polynomial<Complex<i64>>
[src]
impl Mul<Polynomial<Complex<i8>>> for Complex<i8>
[src]
type Output = Polynomial<Complex<i8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>
[src]
impl<'_> Mul<Polynomial<Complex<i8>>> for &'_ Complex<i8>
[src]
type Output = Polynomial<Complex<i8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<i8>>) -> Polynomial<Complex<i8>>
[src]
impl Mul<Polynomial<Complex<isize>>> for Complex<isize>
[src]
type Output = Polynomial<Complex<isize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>
[src]
impl<'_> Mul<Polynomial<Complex<isize>>> for &'_ Complex<isize>
[src]
type Output = Polynomial<Complex<isize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<isize>>) -> Polynomial<Complex<isize>>
[src]
impl Mul<Polynomial<Complex<u16>>> for Complex<u16>
[src]
type Output = Polynomial<Complex<u16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>
[src]
impl<'_> Mul<Polynomial<Complex<u16>>> for &'_ Complex<u16>
[src]
type Output = Polynomial<Complex<u16>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u16>>) -> Polynomial<Complex<u16>>
[src]
impl Mul<Polynomial<Complex<u32>>> for Complex<u32>
[src]
type Output = Polynomial<Complex<u32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>
[src]
impl<'_> Mul<Polynomial<Complex<u32>>> for &'_ Complex<u32>
[src]
type Output = Polynomial<Complex<u32>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u32>>) -> Polynomial<Complex<u32>>
[src]
impl Mul<Polynomial<Complex<u64>>> for Complex<u64>
[src]
type Output = Polynomial<Complex<u64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>
[src]
impl<'_> Mul<Polynomial<Complex<u64>>> for &'_ Complex<u64>
[src]
type Output = Polynomial<Complex<u64>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u64>>) -> Polynomial<Complex<u64>>
[src]
impl Mul<Polynomial<Complex<u8>>> for Complex<u8>
[src]
type Output = Polynomial<Complex<u8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>
[src]
impl<'_> Mul<Polynomial<Complex<u8>>> for &'_ Complex<u8>
[src]
type Output = Polynomial<Complex<u8>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<u8>>) -> Polynomial<Complex<u8>>
[src]
impl Mul<Polynomial<Complex<usize>>> for Complex<usize>
[src]
type Output = Polynomial<Complex<usize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>
[src]
impl<'_> Mul<Polynomial<Complex<usize>>> for &'_ Complex<usize>
[src]
type Output = Polynomial<Complex<usize>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Complex<usize>>) -> Polynomial<Complex<usize>>
[src]
impl Mul<Polynomial<Ratio<BigInt>>> for BigRational
[src]
type Output = Polynomial<BigRational>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<BigRational>) -> Polynomial<BigRational>
[src]
impl<'_> Mul<Polynomial<Ratio<BigInt>>> for &'_ BigRational
[src]
type Output = Polynomial<BigRational>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<BigRational>) -> Polynomial<BigRational>
[src]
impl Mul<Polynomial<Ratio<i32>>> for Rational32
[src]
type Output = Polynomial<Rational32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Rational32>) -> Polynomial<Rational32>
[src]
impl<'_> Mul<Polynomial<Ratio<i32>>> for &'_ Rational32
[src]
type Output = Polynomial<Rational32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Rational32>) -> Polynomial<Rational32>
[src]
impl Mul<Polynomial<Ratio<i64>>> for Rational64
[src]
type Output = Polynomial<Rational64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Rational64>) -> Polynomial<Rational64>
[src]
impl<'_> Mul<Polynomial<Ratio<i64>>> for &'_ Rational64
[src]
type Output = Polynomial<Rational64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Rational64>) -> Polynomial<Rational64>
[src]
impl Mul<Polynomial<Ratio<isize>>> for Rational
[src]
type Output = Polynomial<Rational>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Rational>) -> Polynomial<Rational>
[src]
impl<'_> Mul<Polynomial<Ratio<isize>>> for &'_ Rational
[src]
type Output = Polynomial<Rational>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<Rational>) -> Polynomial<Rational>
[src]
impl<'_, T> Mul<Polynomial<T>> for &'_ Polynomial<T> where
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero + AddAssign,
&'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>
[src]
impl<T> Mul<Polynomial<T>> for Polynomial<T> where
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero + AddAssign,
&'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>
[src]
impl Mul<Polynomial<f32>> for f32
[src]
type Output = Polynomial<f32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<f32>) -> Polynomial<f32>
[src]
impl<'_> Mul<Polynomial<f32>> for &'_ f32
[src]
type Output = Polynomial<f32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<f32>) -> Polynomial<f32>
[src]
impl Mul<Polynomial<f64>> for f64
[src]
type Output = Polynomial<f64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<f64>) -> Polynomial<f64>
[src]
impl<'_> Mul<Polynomial<f64>> for &'_ f64
[src]
type Output = Polynomial<f64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<f64>) -> Polynomial<f64>
[src]
impl Mul<Polynomial<i16>> for i16
[src]
type Output = Polynomial<i16>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i16>) -> Polynomial<i16>
[src]
impl<'_> Mul<Polynomial<i16>> for &'_ i16
[src]
type Output = Polynomial<i16>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i16>) -> Polynomial<i16>
[src]
impl Mul<Polynomial<i32>> for i32
[src]
type Output = Polynomial<i32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i32>) -> Polynomial<i32>
[src]
impl<'_> Mul<Polynomial<i32>> for &'_ i32
[src]
type Output = Polynomial<i32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i32>) -> Polynomial<i32>
[src]
impl Mul<Polynomial<i64>> for i64
[src]
type Output = Polynomial<i64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i64>) -> Polynomial<i64>
[src]
impl<'_> Mul<Polynomial<i64>> for &'_ i64
[src]
type Output = Polynomial<i64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i64>) -> Polynomial<i64>
[src]
impl Mul<Polynomial<i8>> for i8
[src]
type Output = Polynomial<i8>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i8>) -> Polynomial<i8>
[src]
impl<'_> Mul<Polynomial<i8>> for &'_ i8
[src]
type Output = Polynomial<i8>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<i8>) -> Polynomial<i8>
[src]
impl Mul<Polynomial<isize>> for isize
[src]
type Output = Polynomial<isize>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<isize>) -> Polynomial<isize>
[src]
impl<'_> Mul<Polynomial<isize>> for &'_ isize
[src]
type Output = Polynomial<isize>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<isize>) -> Polynomial<isize>
[src]
impl Mul<Polynomial<u16>> for u16
[src]
type Output = Polynomial<u16>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u16>) -> Polynomial<u16>
[src]
impl<'_> Mul<Polynomial<u16>> for &'_ u16
[src]
type Output = Polynomial<u16>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u16>) -> Polynomial<u16>
[src]
impl Mul<Polynomial<u32>> for u32
[src]
type Output = Polynomial<u32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u32>) -> Polynomial<u32>
[src]
impl<'_> Mul<Polynomial<u32>> for &'_ u32
[src]
type Output = Polynomial<u32>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u32>) -> Polynomial<u32>
[src]
impl Mul<Polynomial<u64>> for u64
[src]
type Output = Polynomial<u64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u64>) -> Polynomial<u64>
[src]
impl<'_> Mul<Polynomial<u64>> for &'_ u64
[src]
type Output = Polynomial<u64>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u64>) -> Polynomial<u64>
[src]
impl Mul<Polynomial<u8>> for u8
[src]
type Output = Polynomial<u8>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u8>) -> Polynomial<u8>
[src]
impl<'_> Mul<Polynomial<u8>> for &'_ u8
[src]
type Output = Polynomial<u8>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<u8>) -> Polynomial<u8>
[src]
impl Mul<Polynomial<usize>> for usize
[src]
type Output = Polynomial<usize>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<usize>) -> Polynomial<usize>
[src]
impl<'_> Mul<Polynomial<usize>> for &'_ usize
[src]
type Output = Polynomial<usize>
The resulting type after applying the *
operator.
fn mul(self, rhs: Polynomial<usize>) -> Polynomial<usize>
[src]
impl<T> Mul<T> for Polynomial<T> where
T: for<'r> Mul<&'r T, Output = T> + Zero,
[src]
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>
[src]
impl<'_, T> Mul<T> for &'_ Polynomial<T> where
T: Zero,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero,
&'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>
[src]
impl<'_, T> MulAssign<&'_ Polynomial<T>> for Polynomial<T> where
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
fn mul_assign(&mut self, rhs: &Polynomial<T>)
[src]
impl<T> MulAssign<Polynomial<T>> for Polynomial<T> where
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
[src]
T: Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
fn mul_assign(&mut self, rhs: Polynomial<T>)
[src]
impl<T> Neg for Polynomial<T> where
T: Zero,
&'l T: Neg<Output = T>,
[src]
T: Zero,
&'l T: Neg<Output = T>,
type Output = Polynomial<T>
The resulting type after applying the -
operator.
fn neg(self) -> Polynomial<T>
[src]
impl<'_, T> Neg for &'_ Polynomial<T> where
T: Zero,
&'l T: Neg<Output = T>,
[src]
T: Zero,
&'l T: Neg<Output = T>,
type Output = Polynomial<T>
The resulting type after applying the -
operator.
fn neg(self) -> Polynomial<T>
[src]
impl<T> One for Polynomial<T> where
T: One + Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
[src]
T: One + Zero + AddAssign,
&'l T: Mul<&'r T, Output = T>,
fn one() -> Self
[src]
fn set_one(&mut self)
[src]
fn is_one(&self) -> bool where
Self: PartialEq<Self>,
[src]
Self: PartialEq<Self>,
impl<T: Ord> Ord for Polynomial<T>
[src]
fn cmp(&self, other: &Polynomial<T>) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<T: PartialEq> PartialEq<Polynomial<T>> for Polynomial<T>
[src]
fn eq(&self, other: &Polynomial<T>) -> bool
[src]
fn ne(&self, other: &Polynomial<T>) -> bool
[src]
impl<T: PartialOrd> PartialOrd<Polynomial<T>> for Polynomial<T>
[src]
fn partial_cmp(&self, other: &Polynomial<T>) -> Option<Ordering>
[src]
fn lt(&self, other: &Polynomial<T>) -> bool
[src]
fn le(&self, other: &Polynomial<T>) -> bool
[src]
fn gt(&self, other: &Polynomial<T>) -> bool
[src]
fn ge(&self, other: &Polynomial<T>) -> bool
[src]
impl<T> StructuralEq for Polynomial<T>
[src]
impl<T> StructuralPartialEq for Polynomial<T>
[src]
impl<'_, T> Sub<&'_ Polynomial<T>> for Polynomial<T> where
T: for<'r> SubAssign<&'r T> + Zero,
[src]
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>
[src]
impl<'_, '_, T> Sub<&'_ Polynomial<T>> for &'_ Polynomial<T> where
T: for<'r> SubAssign<&'r T> + Zero + Clone,
[src]
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>
[src]
impl<T> Sub<Polynomial<T>> for Polynomial<T> where
T: for<'r> SubAssign<&'r T> + Zero,
[src]
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>
[src]
impl<'_, T> Sub<Polynomial<T>> for &'_ Polynomial<T> where
T: for<'r> SubAssign<&'r T> + Zero + Clone,
[src]
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>
[src]
impl<'_, T> SubAssign<&'_ Polynomial<T>> for Polynomial<T> where
T: for<'r> SubAssign<&'r T> + Zero,
[src]
T: for<'r> SubAssign<&'r T> + Zero,
fn sub_assign(&mut self, rhs: &Polynomial<T>)
[src]
impl<T> SubAssign<Polynomial<T>> for Polynomial<T> where
T: for<'r> SubAssign<&'r T> + Zero,
[src]
T: for<'r> SubAssign<&'r T> + Zero,
fn sub_assign(&mut self, rhs: Polynomial<T>)
[src]
impl<T> Zero for Polynomial<T> where
T: for<'r> AddAssign<&'r T> + Zero,
[src]
T: for<'r> AddAssign<&'r T> + Zero,
Auto Trait Implementations
impl<T> RefUnwindSafe for Polynomial<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for Polynomial<T> where
T: Send,
T: Send,
impl<T> Sync for Polynomial<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Polynomial<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for Polynomial<T> where
T: RefUnwindSafe + UnwindSafe,
T: RefUnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, Rhs> NumAssignOps<Rhs> for T where
T: AddAssign<Rhs> + SubAssign<Rhs> + MulAssign<Rhs> + DivAssign<Rhs> + RemAssign<Rhs>,
[src]
T: AddAssign<Rhs> + SubAssign<Rhs> + MulAssign<Rhs> + DivAssign<Rhs> + RemAssign<Rhs>,
impl<T, Rhs, Output> NumOps<Rhs, Output> for T where
T: Sub<Rhs, Output = Output> + Mul<Rhs, Output = Output> + Div<Rhs, Output = Output> + Add<Rhs, Output = Output> + Rem<Rhs, Output = Output>,
[src]
T: Sub<Rhs, Output = Output> + Mul<Rhs, Output = Output> + Div<Rhs, Output = Output> + Add<Rhs, Output = Output> + Rem<Rhs, Output = Output>,
impl<T, Base> RefNum<Base> for T where
T: NumOps<Base, Base> + for<'r> NumOps<&'r Base, Base>,
[src]
T: NumOps<Base, Base> + for<'r> NumOps<&'r Base, Base>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,