[−][src]Trait rustnomial::FreeSizePolynomial

pub trait FreeSizePolynomial<N> where
    N: Zero + Copy + AddAssign, {
    fn from_terms(terms: Vec<(N, usize)>) -> Self;

    fn add_term(&mut self, term: N, degree: usize);
}

Required methods

fn from_terms(terms: Vec<(N, usize)>) -> Self

fn add_term(&mut self, term: N, degree: usize)

Loading content...

Implementors

impl<N> FreeSizePolynomial<N> for Polynomial<N> where
    N: Zero + Copy + AddAssign, [src]

fn from_terms(terms: Vec<(N, usize)>) -> Self[src]

Returns a Polynomial with the corresponding terms, in order of ax^n + bx^(n-1) + ... + cx + d

Arguments

  • terms - A vector of constants, in decreasing order of degree.

Example

use rustnomial::Polynomial;
// Corresponds to 1.0x^2 + 4.0x + 4.0
let polynomial = Polynomial::new(vec![1.0, 4.0, 4.0]);

impl<N> FreeSizePolynomial<N> for SparsePolynomial<N> where
    N: Zero + Copy + AddAssign, [src]

fn from_terms(terms: Vec<(N, usize)>) -> Self[src]

Returns a SparsePolynomial with the corresponding terms.

Arguments

  • terms - A hashmap, where keys correspond to degrees and values correspond to coefficients.

Example

use rustnomial::SparsePolynomial;
// Corresponds to 1.0x^2 + 4.0x + 4.0
let polynomial = SparsePolynomial::from_vec(vec![1.0, 4.0, 4.0]);
Loading content...