[−][src]Trait rustnomial::Derivable
Required methods
pub fn derivative(&self) -> Self
[src]
Implementors
impl<N> Derivable<N> for LinearBinomial<N> where
N: Zero + One + Copy + Mul<Output = N> + TryFromUsizeExact,
[src]
N: Zero + One + Copy + Mul<Output = N> + TryFromUsizeExact,
pub fn derivative(&self) -> LinearBinomial<N>
[src]
Returns the derivative of the LinearBinomial
.
Example
use rustnomial::{LinearBinomial, Derivable}; let binomial = LinearBinomial::new([3.0, 1.0]); assert_eq!(LinearBinomial::new([0., 3.0]), binomial.derivative());
impl<N> Derivable<N> for Monomial<N> where
N: Zero + Copy + Mul<Output = N> + TryFromUsizeExact,
[src]
N: Zero + Copy + Mul<Output = N> + TryFromUsizeExact,
pub fn derivative(&self) -> Monomial<N>
[src]
impl<N> Derivable<N> for Polynomial<N> where
N: Zero + One + TryFromUsizeContinuous + Copy + MulAssign + SubAssign,
[src]
N: Zero + One + TryFromUsizeContinuous + Copy + MulAssign + SubAssign,
pub fn derivative(&self) -> Polynomial<N>
[src]
impl<N> Derivable<N> for QuadraticTrinomial<N> where
N: Zero + One + Copy + Mul<Output = N> + TryFromUsizeExact,
[src]
N: Zero + One + Copy + Mul<Output = N> + TryFromUsizeExact,
pub fn derivative(&self) -> QuadraticTrinomial<N>
[src]
Returns the derivative of the QuadraticTrinomial
.
Example
use rustnomial::{QuadraticTrinomial, Derivable}; let binomial = QuadraticTrinomial::new([3.0, 2.0, 1.0]); assert_eq!(QuadraticTrinomial::new([0.0, 6.0, 2.0]), binomial.derivative());
impl<N> Derivable<N> for SparsePolynomial<N> where
N: Zero + TryFromUsizeExact + Copy + Mul<Output = N>,
[src]
N: Zero + TryFromUsizeExact + Copy + Mul<Output = N>,
pub fn derivative(&self) -> SparsePolynomial<N>
[src]
Returns the derivative of the SparsePolynomial
.
Example
use rustnomial::{SparsePolynomial, Derivable}; let polynomial = SparsePolynomial::from(vec![4, 1, 5]); assert_eq!(SparsePolynomial::from(vec![8, 1]), polynomial.derivative());
Errors
Will panic if a term has a degree which does not have a lossless
representation in N
.