/**
 * Find all real roots of a univariate polynomial that lie inside the closed
 * interval [lo, hi]. Roots are written to `out[out_offset ..]` in ascending
 * order; the count of roots written is returned.
 *
 * @param {Float64Array|number[]} coeffs ascending power order: coeffs[i] is the coefficient of x^i
 * @param {number} degree polynomial degree (coeffs must have at least `degree + 1` entries)
 * @param {number} lo
 * @param {number} hi
 * @param {Float64Array|number[]} out
 * @param {number} out_offset
 * @param {number} [aberth_max_iterations] optional outer-iteration cap for the
 *   Aberth root finder used at degree ≥ 3. Defaults to the routine's own
 *   internal cap (80). Lower the cap when the caller knows the polynomial is
 *   well-conditioned and convergence is typically quick — e.g. degree-5
 *   well-behaved polys converge in 15-25 iterations.
 * @returns {number} number of roots written
 */
export function polynomial_real_roots_in_interval(coeffs: Float64Array | number[], degree: number, lo: number, hi: number, out: Float64Array | number[], out_offset: number, aberth_max_iterations?: number): number;
//# sourceMappingURL=polynomial_real_roots_in_interval.d.ts.map