🥮 mooncakes.io
    Sign in

    luna-poly

    A generic polynomial lib, a part of LunaFlow.

    polynomial
    symbolic-methods
    numerical-methods
    math
    Download zip
    Author
    Version
    0.1.1-beta-1
    License
    MIT
    Repository
    Last updated
    last year
    Downloads
    144

    #luna-poly

    This is a polynomial library written using MoonBit, aiming to fill the gap in scientific computing applications in the MoonBit ecosystem.

    HomomorphismNat

    source
    trait HomomorphismNat

    ExpVec

    source
    type ExpVec

    ExpVec::length

    source
    fn ExpVec::length(self : ExpVec) -> Int

    ExpVec::new

    source
    fn ExpVec::new() -> ExpVec

    ExpVec::op_get

    source
    fn ExpVec::op_get(self : ExpVec, i : Int) -> UInt

    ExpVec::op_set

    source
    fn ExpVec::op_set(self : ExpVec, i : Int, val : UInt) -> Unit

    MultiPoly

    source
    type MultiPoly[A]

    MultiPoly::coefficients

    source
    fn[A] MultiPoly::coefficients(self : MultiPoly[A]) -> Array[A]

    MultiPoly::from_array

    source

    MultiPoly::from_terms_array

    source

    MultiPoly::scale

    source

    Polynomial

    source
    type Polynomial[V]
    A dense polynomial implementation.
    impl Compare for Polynomial[V]
    impl Eq for Polynomial[V]

    Polynomial::derivative

    source
    Get the derivative of the polynomial.

    Polynomial::empty

    source
    Return the zero polynomial.

    Polynomial::eval

    source
    Evaluate the polynomial at a given point.

    Polynomial::fold

    source
    fn[A, B] Polynomial::fold(self : Polynomial[A], f : (B, A) -> B, init~ : B) -> B
    Fold over the polynomial.

    Polynomial::karatsuba

    source
    Multiply two polynomials using the Karatsuba algorithm.

    Polynomial::leading_coefficient

    source
    fn[A] Polynomial::leading_coefficient(self : Polynomial[A]) -> A?
    Return the leading coefficient of the polynomial.

    Polynomial::leading_term

    source
    fn[A] Polynomial::leading_term(self : Polynomial[A]) -> (Int, A)?
    Return the leading term of the polynomial.

    Polynomial::length

    source
    fn[A] Polynomial::length(self : Polynomial[A]) -> Int
    Return the length of the polynomial.

    Polynomial::scale

    source
    Multiply a polynomial by a monomial

    Polynomial::substitute

    source

    Polynomial::substitute_poly

    source
    Substitute a polynomial's variable with another polynomial.

    SparsePolynomial

    source
    type SparsePolynomial[V]

    impl Add for SparsePolynomial[V]
    impl Eq for SparsePolynomial[V]
    impl Mul for SparsePolynomial[A]

    SparsePolynomial::add

    source

    this is inplace version of op_add

    SparsePolynomial::add_term

    source

    SparsePolynomial::add_term_inplace

    source
    fn[V : Eq + 
    AddMonoid     + Add + 
    Zero    ] SparsePolynomial::add_term_inplace(self : SparsePolynomial[V], exp_vec : ExpVec, coefficient : V) -> Unit

    SparsePolynomial::clear

    source
    fn[V] SparsePolynomial::clear(self : SparsePolynomial[V]) -> Unit

    SparsePolynomial::contains

    source
    fn[V] SparsePolynomial::contains(self : SparsePolynomial[V], exp_vec : ExpVec) -> Bool

    SparsePolynomial::copy

    source

    SparsePolynomial::each

    source
    fn[V] SparsePolynomial::each(self : SparsePolynomial[V], f : (ExpVec, V) -> Unit) -> Unit

    SparsePolynomial::eachi

    source
    fn[V] SparsePolynomial::eachi(self : SparsePolynomial[V], f : (Int, ExpVec, V) -> Unit) -> Unit

    SparsePolynomial::eval

    source

    SparsePolynomial::eval_at

    source

    SparsePolynomial::eval_at_many

    source

    SparsePolynomial::from_array

    source

    SparsePolynomial::from_iter

    source

    SparsePolynomial::get

    source
    fn[V] SparsePolynomial::get(self : SparsePolynomial[V], exp_vec : ExpVec) -> V?

    SparsePolynomial::is_empty

    source
    fn[V] SparsePolynomial::is_empty(self : SparsePolynomial[V]) -> Bool

    SparsePolynomial::iter

    source
    fn[V] SparsePolynomial::iter(self : SparsePolynomial[V]) -> Iter[(ExpVec, V)]

    SparsePolynomial::iter2

    source
    fn[V] SparsePolynomial::iter2(self : SparsePolynomial[V]) -> Iter2[ExpVec, V]

    SparsePolynomial::keys

    source
    fn[V] SparsePolynomial::keys(self : SparsePolynomial[V]) -> Array[ExpVec]

    SparsePolynomial::mul_term

    source

    SparsePolynomial::mul_term_inplace

    source

    SparsePolynomial::new

    source

    SparsePolynomial::op_get

    source
    fn[V] SparsePolynomial::op_get(self : SparsePolynomial[V], exp_vec : ExpVec) -> V?

    SparsePolynomial::op_set

    source
    fn[V] SparsePolynomial::op_set(self : SparsePolynomial[V], exp_vec : ExpVec, coefficient : V) -> Unit

    SparsePolynomial::pow

    source

    SparsePolynomial::range

    source
    fn[V] SparsePolynomial::range(self : SparsePolynomial[V], low : ExpVec, hight : ExpVec) -> Iter2[ExpVec, V]

    SparsePolynomial::remove

    source
    fn[V] SparsePolynomial::remove(self : SparsePolynomial[V], exp_vec : ExpVec) -> Unit

    SparsePolynomial::replace_const

    source

    SparsePolynomial::replace_poly

    source

    SparsePolynomial::replace_term

    source

    SparsePolynomial::replace_variable

    source

    use index2 replace index1

    SparsePolynomial::size

    source
    fn[V] SparsePolynomial::size(self : SparsePolynomial[V]) -> Int

    SparsePolynomial::to_array

    source
    fn[V] SparsePolynomial::to_array(self : SparsePolynomial[V]) -> Array[(ExpVec, V)]

    SparsePolynomial::values

    source
    fn[V] SparsePolynomial::values(self : SparsePolynomial[V]) -> Array[V]

    coe

    source
    Coefficient n.

    is_zero

    source

    monomial

    source
    Create a monomial from a power and a coefficient.

    normalize

    source

    to_poly

    source
    Convert an array to a polynomial.

    vari

    source
    Variable x.

    Source Files

    Powered by MoonBit

    Site sourceReport issuePackagesBuild queueSkillsStatistics

    © 2026 mooncakes.io