[−][src]Struct rustnomial::LinearBinomial
Fields
coefficients: [N; 2]
Implementations
impl<N: Sized> LinearBinomial<N>
[src]
pub fn new(coefficients: [N; 2]) -> LinearBinomial<N>
[src]
Create a LinearBinomial
with the given terms.
Example
use rustnomial::{SizedPolynomial, LinearBinomial, Degree}; let binomial = LinearBinomial::new([3, 2]); assert_eq!(Degree::Num(1), binomial.degree());
impl<N> LinearBinomial<N> where
N: Copy + Neg<Output = N> + Div<Output = N> + Zero,
[src]
N: Copy + Neg<Output = N> + Div<Output = N> + Zero,
pub fn root(&self) -> Roots<N>
[src]
Return the root of LinearBinomial
.
Example
use rustnomial::{LinearBinomial, Roots, SizedPolynomial}; let binomial = LinearBinomial::new([1.0, 2.0]); assert_eq!(Roots::OneRealRoot(-2.0), binomial.root()); let zero = LinearBinomial::<i32>::zero(); assert_eq!(Roots::InfiniteRoots, zero.root()); let constant = LinearBinomial::new([0, 1]); assert_eq!(Roots::NoRoots, constant.root());
Trait Implementations
impl<N> Add<LinearBinomial<N>> for LinearBinomial<N> where
N: Add<Output = N> + Copy,
[src]
N: Add<Output = N> + Copy,
type Output = LinearBinomial<N>
The resulting type after applying the +
operator.
pub fn add(self, _rhs: LinearBinomial<N>) -> LinearBinomial<N>
[src]
impl<N: Copy + AddAssign> AddAssign<LinearBinomial<N>> for LinearBinomial<N>
[src]
pub fn add_assign(&mut self, _rhs: LinearBinomial<N>)
[src]
impl<N: Clone> Clone for LinearBinomial<N>
[src]
pub fn clone(&self) -> LinearBinomial<N>
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<N: Debug> Debug for LinearBinomial<N>
[src]
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> Display for LinearBinomial<N> where
N: Zero + One + IsPositive + PartialEq + Abs + Copy + IsNegativeOne + Display,
[src]
N: Zero + One + IsPositive + PartialEq + Abs + Copy + IsNegativeOne + Display,
impl<N: Div<Output = N> + Copy> Div<N> for LinearBinomial<N>
[src]
type Output = LinearBinomial<N>
The resulting type after applying the /
operator.
pub fn div(self, _rhs: N) -> LinearBinomial<N>
[src]
impl<N: DivAssign + Copy> DivAssign<N> for LinearBinomial<N>
[src]
pub fn div_assign(&mut self, _rhs: N)
[src]
impl<N> Evaluable<N> for LinearBinomial<N> where
N: Add<Output = N> + Mul<Output = N> + Copy,
[src]
N: Add<Output = N> + Mul<Output = N> + Copy,
pub fn eval(&self, point: N) -> N
[src]
Returns the value of the LinearBinomial
at the given point.
Example
use rustnomial::{LinearBinomial, Evaluable}; let binomial = LinearBinomial::new([1, 2]); assert_eq!(7, binomial.eval(5)); assert_eq!(2, binomial.eval(0));
impl From<LinearBinomial<f32>> for LinearBinomial<f64>
[src]
pub fn from(item: LinearBinomial<f32>) -> Self
[src]
impl From<LinearBinomial<i16>> for LinearBinomial<i32>
[src]
pub fn from(item: LinearBinomial<i16>) -> Self
[src]
impl From<LinearBinomial<i16>> for LinearBinomial<i64>
[src]
pub fn from(item: LinearBinomial<i16>) -> Self
[src]
impl From<LinearBinomial<i16>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<i16>) -> Self
[src]
impl From<LinearBinomial<i16>> for LinearBinomial<f32>
[src]
pub fn from(item: LinearBinomial<i16>) -> Self
[src]
impl From<LinearBinomial<i16>> for LinearBinomial<f64>
[src]
pub fn from(item: LinearBinomial<i16>) -> Self
[src]
impl From<LinearBinomial<i32>> for LinearBinomial<i64>
[src]
pub fn from(item: LinearBinomial<i32>) -> Self
[src]
impl From<LinearBinomial<i32>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<i32>) -> Self
[src]
impl From<LinearBinomial<i32>> for LinearBinomial<f64>
[src]
pub fn from(item: LinearBinomial<i32>) -> Self
[src]
impl From<LinearBinomial<i64>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<i64>) -> Self
[src]
impl From<LinearBinomial<i8>> for LinearBinomial<i16>
[src]
pub fn from(item: LinearBinomial<i8>) -> Self
[src]
impl From<LinearBinomial<i8>> for LinearBinomial<i32>
[src]
pub fn from(item: LinearBinomial<i8>) -> Self
[src]
impl From<LinearBinomial<i8>> for LinearBinomial<i64>
[src]
pub fn from(item: LinearBinomial<i8>) -> Self
[src]
impl From<LinearBinomial<i8>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<i8>) -> Self
[src]
impl From<LinearBinomial<i8>> for LinearBinomial<f32>
[src]
pub fn from(item: LinearBinomial<i8>) -> Self
[src]
impl From<LinearBinomial<i8>> for LinearBinomial<f64>
[src]
pub fn from(item: LinearBinomial<i8>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<u32>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<u64>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<u128>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<i32>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<i64>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<f32>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u16>> for LinearBinomial<f64>
[src]
pub fn from(item: LinearBinomial<u16>) -> Self
[src]
impl From<LinearBinomial<u32>> for LinearBinomial<u64>
[src]
pub fn from(item: LinearBinomial<u32>) -> Self
[src]
impl From<LinearBinomial<u32>> for LinearBinomial<u128>
[src]
pub fn from(item: LinearBinomial<u32>) -> Self
[src]
impl From<LinearBinomial<u32>> for LinearBinomial<i64>
[src]
pub fn from(item: LinearBinomial<u32>) -> Self
[src]
impl From<LinearBinomial<u32>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<u32>) -> Self
[src]
impl From<LinearBinomial<u32>> for LinearBinomial<f64>
[src]
pub fn from(item: LinearBinomial<u32>) -> Self
[src]
impl From<LinearBinomial<u64>> for LinearBinomial<u128>
[src]
pub fn from(item: LinearBinomial<u64>) -> Self
[src]
impl From<LinearBinomial<u64>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<u64>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<u16>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<u32>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<u64>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<u128>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<i16>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<i32>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<i64>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<i128>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<f32>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl From<LinearBinomial<u8>> for LinearBinomial<f64>
[src]
pub fn from(item: LinearBinomial<u8>) -> Self
[src]
impl<N> FromStr for LinearBinomial<N> where
N: Zero + One + Copy + SubAssign + AddAssign + FromStr + CanNegate,
[src]
N: Zero + One + Copy + SubAssign + AddAssign + FromStr + CanNegate,
type Err = PolynomialFromStringError
The associated error which can be returned from parsing.
pub fn from_str(s: &str) -> Result<Self, Self::Err>
[src]
impl<N> Integrable<N, Polynomial<N>> for LinearBinomial<N> where
N: Zero + Copy + DivAssign + Mul<Output = N> + MulAssign + AddAssign + Div<Output = N> + TryFromUsizeContinuous,
[src]
N: Zero + Copy + DivAssign + Mul<Output = N> + MulAssign + AddAssign + Div<Output = N> + TryFromUsizeContinuous,
pub fn integral(&self) -> Integral<N, Polynomial<N>>
[src]
Returns the integral of the LinearBinomial
.
Example
use rustnomial::{LinearBinomial, Integrable, Polynomial}; let binomial = LinearBinomial::new([2.0, 0.]); let integral = binomial.integral(); assert_eq!(&Polynomial::new(vec![1.0, 0.0, 0.0]), integral.inner());
Will panic if N
can not losslessly represent 2usize
.
impl<N: Mul<Output = N> + Copy> Mul<N> for LinearBinomial<N>
[src]
type Output = LinearBinomial<N>
The resulting type after applying the *
operator.
pub fn mul(self, _rhs: N) -> LinearBinomial<N>
[src]
impl<N: MulAssign + Copy> MulAssign<N> for LinearBinomial<N>
[src]
pub fn mul_assign(&mut self, _rhs: N)
[src]
impl<N> MutablePolynomial<N> for LinearBinomial<N> where
N: Zero + SubAssign + AddAssign + Copy,
[src]
N: Zero + SubAssign + AddAssign + Copy,
pub fn try_add_term(
&mut self,
coeff: N,
degree: usize
) -> Result<(), TryAddError>
[src]
&mut self,
coeff: N,
degree: usize
) -> Result<(), TryAddError>
pub fn try_sub_term(
&mut self,
coeff: N,
degree: usize
) -> Result<(), TryAddError>
[src]
&mut self,
coeff: N,
degree: usize
) -> Result<(), TryAddError>
impl<N: Copy + Neg<Output = N>> Neg for LinearBinomial<N>
[src]
type Output = LinearBinomial<N>
The resulting type after applying the -
operator.
pub fn neg(self) -> LinearBinomial<N>
[src]
impl<N> PartialEq<LinearBinomial<N>> for LinearBinomial<N> where
N: Zero + PartialEq + Copy,
[src]
N: Zero + PartialEq + Copy,
pub fn eq(&self, other: &Self) -> bool
[src]
Returns true if this LinearBinomial
and other are equal.
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<N: Zero + Copy> Shr<u32> for LinearBinomial<N>
[src]
type Output = LinearBinomial<N>
The resulting type after applying the >>
operator.
pub fn shr(self, _rhs: u32) -> LinearBinomial<N>
[src]
impl<N: Zero + Copy> ShrAssign<u32> for LinearBinomial<N>
[src]
pub fn shr_assign(&mut self, _rhs: u32)
[src]
impl<N: Copy + Zero> SizedPolynomial<N> for LinearBinomial<N>
[src]
pub fn len(&self) -> usize
[src]
Return the length of LinearBinomial
. Not equal to the number of terms.
Example
use rustnomial::{LinearBinomial, SizedPolynomial}; let binomial = LinearBinomial::new([3.0, 2.0]); assert_eq!(2, binomial.len()); assert_eq!(0, LinearBinomial::<i32>::zero().len());
pub fn term_with_degree(&self, degree: usize) -> Term<N>
[src]
Returns the term with the given degree
of the LinearBinomial
.
Example
use rustnomial::{LinearBinomial, SizedPolynomial, Term}; let binomial = LinearBinomial::new([5, 0]); assert_eq!(Term::Term(5, 1), binomial.term_with_degree(1)); assert_eq!(Term::ZeroTerm, binomial.term_with_degree(0));
pub fn degree(&self) -> Degree
[src]
Returns the degree of the LinearBinomial
.
Example
use rustnomial::{SizedPolynomial, LinearBinomial, Degree}; let binomial = LinearBinomial::new([3.0, 2.0]); assert_eq!(Degree::Num(1), binomial.degree()); let monomial = LinearBinomial::new([0.0, 1.0]); assert_eq!(Degree::Num(0), monomial.degree()); let zero = LinearBinomial::<i32>::zero(); assert_eq!(Degree::NegInf, zero.degree());
pub fn zero() -> Self
[src]
Returns a LinearBinomial
with no terms.
Example
use rustnomial::{SizedPolynomial, LinearBinomial}; let zero = LinearBinomial::<i32>::zero(); assert!(zero.is_zero()); assert!(zero.term_iter().next().is_none());
pub fn set_to_zero(&mut self)
[src]
Sets self to zero.
Example
use rustnomial::{SizedPolynomial, LinearBinomial}; let mut non_zero = LinearBinomial::new([1, 1]); assert!(!non_zero.is_zero()); non_zero.set_to_zero(); assert!(non_zero.is_zero());
pub fn term_iter(&self) -> TermIterator<'_, N> where
Self: Sized,
[src]
Self: Sized,
pub fn is_zero(&self) -> bool
[src]
impl<N> Sub<LinearBinomial<N>> for LinearBinomial<N> where
N: Copy + Sub<Output = N>,
[src]
N: Copy + Sub<Output = N>,
type Output = LinearBinomial<N>
The resulting type after applying the -
operator.
pub fn sub(self, _rhs: LinearBinomial<N>) -> LinearBinomial<N>
[src]
impl<N> SubAssign<LinearBinomial<N>> for LinearBinomial<N> where
N: SubAssign + Copy,
[src]
N: SubAssign + Copy,
pub fn sub_assign(&mut self, _rhs: LinearBinomial<N>)
[src]
Auto Trait Implementations
impl<N> RefUnwindSafe for LinearBinomial<N> where
N: RefUnwindSafe,
[src]
N: RefUnwindSafe,
impl<N> Send for LinearBinomial<N> where
N: Send,
[src]
N: Send,
impl<N> Sync for LinearBinomial<N> where
N: Sync,
[src]
N: Sync,
impl<N> Unpin for LinearBinomial<N> where
N: Unpin,
[src]
N: Unpin,
impl<N> UnwindSafe for LinearBinomial<N> where
N: UnwindSafe,
[src]
N: 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,
pub 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> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
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.
pub 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>,