Module poly

Module poly 

Source
Expand description

Generic univariate polynomial over any ring

Poly<T> stores coefficients of type T for maximum performance and flexibility. This bypasses the Expression tree for 20-100x speedup on polynomial operations.

§Type Aliases

use mathhook_core::core::polynomial::poly::{Poly, IntPoly, RationalPoly};
use num_rational::Ratio;

// IntPoly is an alias for Poly<i64>
let p: IntPoly = IntPoly::from_coeffs(vec![1, 2, 3]);
let q: Poly<i64> = Poly::from_coeffs(vec![1, 2, 3]);
assert_eq!(p, q);

// RationalPoly is an alias for Poly<Ratio<i64>>
let r: RationalPoly = RationalPoly::from_coeffs(vec![
    Ratio::new(1, 2),
    Ratio::new(3, 4),
]);

Structs§

Poly
Generic univariate polynomial with coefficients of type T

Type Aliases§

IntPoly
Type alias for integer polynomials (backward compatibility)
RationalPoly
Type alias for rational coefficient polynomials