This project is a JavaScript library for evaluating polynomials, implementing Horner's rule for efficient computation. It accepts coefficients in descending degree order and can evaluate polynomials at single or multiple points, with options for memory optimization and object array support. The library is intended for developers working on mathematical computations in Node.js or browser environments who need a reliable polynomial evaluation tool.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of compute-io/polynomial
Validates if a value is an array.
Validates if a value is a boolean primitive.
Validates if a value is a function.
Validates if a value is a number primitive, excluding NaN.
Validates if a value is an array of primitive numbers, excluding NaN.
Validates if a value is a JavaScript object.
BDD/TDD assertion library for node.js and the browser. Test framework agnostic.
takes json-cov output into stdin and POSTs to coveralls.io
Yet another JS code coverage tool that computes statement, line, function and branch coverage with module loader hooks to transparently add coverage when running tests. Supports all JS coverage use ca
Static analysis tool for JavaScript
simple, flexible, fun test framework
Support the repos that depend on this repository
Top contributors
kgryte
10 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
