Go to the source code of this file.
|
| template<typename Fr > |
| Fr | bb::polynomial_arithmetic::evaluate (const Fr *coeffs, const Fr &z, const size_t n) |
| |
| template<typename Fr > |
| Fr | bb::polynomial_arithmetic::evaluate (std::span< const Fr > coeffs, const Fr &z, const size_t n) |
| |
| template<typename Fr > |
| Fr | bb::polynomial_arithmetic::evaluate (std::span< const Fr > coeffs, const Fr &z) |
| |
| template<typename Fr > |
| Fr | bb::polynomial_arithmetic::evaluate (const std::vector< Fr * > coeffs, const Fr &z, const size_t large_n) |
| |
template<typename Fr >
requires SupportsFFT<Fr> |
| void | bb::polynomial_arithmetic::fft_inner_parallel (Fr *coeffs, Fr *target, const EvaluationDomain< Fr > &domain, const Fr &, const std::vector< Fr * > &root_table) |
| |
template<typename Fr >
requires SupportsFFT<Fr> |
| void | bb::polynomial_arithmetic::ifft (Fr *coeffs, Fr *target, const EvaluationDomain< Fr > &domain) |
| |
| template<typename Fr > |
| Fr | bb::polynomial_arithmetic::compute_sum (const Fr *src, const size_t n) |
| |
| template<typename Fr > |
| void | bb::polynomial_arithmetic::compute_linear_polynomial_product (const Fr *roots, Fr *dest, const size_t n) |
| |
| template<typename Fr > |
| void | bb::polynomial_arithmetic::compute_efficient_interpolation (const Fr *src, Fr *dest, const Fr *evaluation_points, const size_t n) |
| |
| template<typename Fr > |
| void | bb::polynomial_arithmetic::factor_roots (std::span< Fr > polynomial, const Fr &root) |
| | Divides p(X) by (X-r) in-place.
|
| |