add_scaled(PolynomialSpan< const Fr > other, Fr scaling_factor) & | bb::Polynomial< Fr > | |
allocate_backing_memory(size_t size, size_t virtual_size, size_t start_index) | bb::Polynomial< Fr > | private |
at(size_t index) | bb::Polynomial< Fr > | inline |
at(size_t index) const | bb::Polynomial< Fr > | inline |
clear() | bb::Polynomial< Fr > | inline |
coefficients_ | bb::Polynomial< Fr > | private |
coeffs(size_t offset=0) | bb::Polynomial< Fr > | inline |
coeffs(size_t offset=0) const | bb::Polynomial< Fr > | inline |
compute_barycentric_evaluation(const Fr &z, const EvaluationDomain< Fr > &domain) | bb::Polynomial< Fr > | |
compute_kate_opening_coefficients(const Fr &z) | bb::Polynomial< Fr > | |
copy_vector(const std::vector< T > &vec) | bb::Polynomial< Fr > | inline |
create_non_parallel_zero_init(size_t size, size_t virtual_size) | bb::Polynomial< Fr > | static |
data() | bb::Polynomial< Fr > | inline |
data() const | bb::Polynomial< Fr > | inline |
debug_hash() const | bb::Polynomial< Fr > | inline |
DontZeroMemory enum name | bb::Polynomial< Fr > | |
end_index() const | bb::Polynomial< Fr > | inline |
evaluate(const Fr &z, size_t target_size) const | bb::Polynomial< Fr > | |
evaluate(const Fr &z) const | bb::Polynomial< Fr > | |
evaluate_mle(std::span< const Fr > evaluation_points, bool shift=false) const | bb::Polynomial< Fr > | |
expand(const size_t new_start_index, const size_t new_end_index) const | bb::Polynomial< Fr > | |
factor_roots(const Fr &root) | bb::Polynomial< Fr > | inline |
FF typedef | bb::Polynomial< Fr > | |
full() const | bb::Polynomial< Fr > | |
get(size_t i, size_t virtual_padding=0) const | bb::Polynomial< Fr > | inline |
in_place_operation_viable(size_t domain_size) | bb::Polynomial< Fr > | inlineprivate |
increase_virtual_size(const size_t size_in) | bb::Polynomial< Fr > | inline |
indexed_values() | bb::Polynomial< Fr > | inline |
indexed_values() const | bb::Polynomial< Fr > | inline |
indices() const | bb::Polynomial< Fr > | inline |
is_empty() const | bb::Polynomial< Fr > | inline |
is_valid_set_index(size_t index) const | bb::Polynomial< Fr > | inline |
is_zero() const | bb::Polynomial< Fr > | inline |
mask() | bb::Polynomial< Fr > | inline |
operator PolynomialSpan< const Fr >() const | bb::Polynomial< Fr > | inline |
operator PolynomialSpan< Fr >() | bb::Polynomial< Fr > | inline |
operator*=(Fr scaling_factor) | bb::Polynomial< Fr > | |
operator+=(PolynomialSpan< const Fr > other) | bb::Polynomial< Fr > | |
operator-=(PolynomialSpan< const Fr > other) | bb::Polynomial< Fr > | |
operator=(Polynomial &&other) noexcept=default | bb::Polynomial< Fr > | |
operator=(const Polynomial &other) | bb::Polynomial< Fr > | |
operator==(Polynomial const &rhs) const | bb::Polynomial< Fr > | |
operator[](size_t i) | bb::Polynomial< Fr > | inline |
operator[](size_t i) const | bb::Polynomial< Fr > | inline |
partial_evaluate_mle(std::span< const Fr > evaluation_points) const | bb::Polynomial< Fr > | |
Polynomial(size_t size, size_t virtual_size, size_t start_index=0) | bb::Polynomial< Fr > | |
Polynomial(size_t size) | bb::Polynomial< Fr > | inline |
Polynomial(size_t size, size_t virtual_size, size_t start_index, DontZeroMemory flag) | bb::Polynomial< Fr > | |
Polynomial(size_t size, size_t virtual_size, DontZeroMemory flag) | bb::Polynomial< Fr > | inline |
Polynomial(size_t size, DontZeroMemory flag) | bb::Polynomial< Fr > | inline |
Polynomial(const Polynomial &other) | bb::Polynomial< Fr > | |
Polynomial(const Polynomial &other, size_t target_size) | bb::Polynomial< Fr > | |
Polynomial(Polynomial &&other) noexcept=default | bb::Polynomial< Fr > | |
Polynomial(std::span< const Fr > coefficients, size_t virtual_size) | bb::Polynomial< Fr > | |
Polynomial(std::span< const Fr > coefficients) | bb::Polynomial< Fr > | inline |
Polynomial()=default | bb::Polynomial< Fr > | |
Polynomial(std::span< const Fr > interpolation_points, std::span< const Fr > evaluations, size_t virtual_size) | bb::Polynomial< Fr > | |
random(size_t size, size_t start_index=0) | bb::Polynomial< Fr > | inlinestatic |
random(size_t size, size_t virtual_size, size_t start_index) | bb::Polynomial< Fr > | inlinestatic |
reverse() const | bb::Polynomial< Fr > | |
right_shifted(const size_t magnitude) const | bb::Polynomial< Fr > | |
set_if_valid_index(size_t index, const Fr &value) | bb::Polynomial< Fr > | inline |
share() const | bb::Polynomial< Fr > | |
shiftable(size_t virtual_size) | bb::Polynomial< Fr > | inlinestatic |
shifted() const | bb::Polynomial< Fr > | |
shrink_end_index(const size_t new_end_index) | bb::Polynomial< Fr > | |
size() const | bb::Polynomial< Fr > | inline |
start_index() const | bb::Polynomial< Fr > | inline |
virtual_size() const | bb::Polynomial< Fr > | inline |
~Polynomial()=default | bb::Polynomial< Fr > | |