univariate.hpp File Reference

#include "barretenberg/common/assert.hpp"
#include "barretenberg/common/serialize.hpp"
#include "barretenberg/polynomials/barycentric.hpp"
#include "barretenberg/polynomials/univariate_coefficient_basis.hpp"
#include <span>

Go to the source code of this file.

Classes
class	bb::Univariate< Fr, domain_end, domain_start, skip_count >
	A univariate polynomial represented by its values on {domain_start, domain_start + 1,..., domain_end - 1}. For memory efficiency purposes, we store the evaluations in an array starting from 0 and make the mapping to the right domain under the hood. More...
class	bb::UnivariateView< Fr, domain_end, domain_start, skip_count >
	A view of a univariate, also used to truncate univariates. More...
struct	std::tuple_size< bb::Univariate< T, N > >

Namespaces
namespace	bb
	Entry point for Barretenberg command-line interface.
namespace	std
	STL namespace.

Functions
template<typename B , class Fr , size_t domain_end, size_t domain_start = 0>
void	bb::read (B &it, Univariate< Fr, domain_end, domain_start > &univariate)
template<typename B , class Fr , size_t domain_end, size_t domain_start = 0>
void	bb::write (B &it, Univariate< Fr, domain_end, domain_start > const &univariate)
template<class Fr , size_t domain_end, size_t domain_start = 0, size_t skip_count = 0>
Univariate< Fr, domain_end, domain_start, skip_count >	bb::operator+ (const Fr &ff, const Univariate< Fr, domain_end, domain_start, skip_count > &uv)
template<class Fr , size_t domain_end, size_t domain_start = 0, size_t skip_count = 0>
Univariate< Fr, domain_end, domain_start, skip_count >	bb::operator- (const Fr &ff, const Univariate< Fr, domain_end, domain_start, skip_count > &uv)
template<class Fr , size_t domain_end, size_t domain_start = 0, size_t skip_count = 0>
Univariate< Fr, domain_end, domain_start, skip_count >	bb::operator* (const Fr &ff, const Univariate< Fr, domain_end, domain_start, skip_count > &uv)
template<class Fr , size_t domain_end, size_t domain_start = 0, size_t skip_count = 0>
Univariate< Fr, domain_end, domain_start, skip_count >	bb::operator+ (const Fr &ff, const UnivariateView< Fr, domain_end, domain_start, skip_count > &uv)
template<class Fr , size_t domain_end, size_t domain_start = 0, size_t skip_count = 0>
Univariate< Fr, domain_end, domain_start, skip_count >	bb::operator- (const Fr &ff, const UnivariateView< Fr, domain_end, domain_start, skip_count > &uv)
template<class Fr , size_t domain_end, size_t domain_start = 0, size_t skip_count = 0>
Univariate< Fr, domain_end, domain_start, skip_count >	bb::operator* (const Fr &ff, const UnivariateView< Fr, domain_end, domain_start, skip_count > &uv)
template<typename T , typename U , std::size_t N, std::size_t... Is>
std::array< T, sizeof...(Is)>	bb::array_to_array_aux (const std::array< U, N > &elements, std::index_sequence< Is... >)
	Create a sub-array of elements at the indices given in the template pack Is, converting them to the new type T.
template<typename T , typename U , std::size_t N>
std::array< T, N >	bb::array_to_array (const std::array< U, N > &elements)
	Given an std::array<U,N>, returns an std::array<T,N>, by calling the (explicit) constructor T(U).