Struct CircleDomain 

pub struct CircleDomain<F> { /* private fields */ }

A twin-coset of the circle group on F. It has a power-of-two size and an arbitrary shift.

X is generator, O is the first coset, goes counterclockwise

  O X .
 .     .
.       O <- start = shift
.   .   - (1,0)
O       .
 .     .
  . . O

For ordering reasons, the other half will start at gen / shift:

  . X O  <- start = gen/shift
 .     .
O       .
.   .   - (1,0)
.       O
 .     .
  O . .

The full domain is the interleaving of these two cosets

Implementations

impl<F: ComplexExtendable> CircleDomain<F>

pub const fn new(log_n: usize, shift: Point<F>) -> Self

pub fn standard(log_n: usize) -> Self

Trait Implementations

impl<F: Clone> Clone for CircleDomain<F>

fn clone(&self) -> CircleDomain<F>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<F: Debug> Debug for CircleDomain<F>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<F: PartialEq> PartialEq for CircleDomain<F>

fn eq(&self, other: &CircleDomain<F>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<F: ComplexExtendable> PolynomialSpace for CircleDomain<F>

fn split_domains(&self, num_chunks: usize) -> Vec<Self>

Decompose a domain into disjoint twin-cosets.

type Val = F

The base field F.

fn size(&self) -> usize

The number of elements of the space.

fn first_point(&self) -> Self::Val

The first point in the space.

fn next_point<Ext: ExtensionField<Self::Val>>(&self, x: Ext) -> Option<Ext>

An algebraic function which takes the i’th element of the space and returns the (i+1)’th evaluated on the given point.

fn create_disjoint_domain(&self, min_size: usize) -> Self

Return another PolynomialSpace with size at least min_size disjoint from this space.

fn split_evals( &self, num_chunks: usize, evals: RowMajorMatrix<Self::Val>, ) -> Vec<RowMajorMatrix<Self::Val>>

Split a set of polynomial evaluations over this PolynomialSpace into a vector of polynomial evaluations over each PolynomialSpace generated from split_domains.

fn vanishing_poly_at_point<Ext: ExtensionField<Self::Val>>( &self, point: Ext, ) -> Ext

Compute the vanishing polynomial of the space, evaluated at the given point.

fn selectors_at_point<Ext: ExtensionField<Self::Val>>( &self, point: Ext, ) -> LagrangeSelectors<Ext>

Compute several Lagrange selectors at a given point.

fn selectors_on_coset(&self, coset: Self) -> LagrangeSelectors<Vec<Self::Val>>

Compute several Lagrange selectors at all points of the given disjoint PolynomialSpace.

impl<F: Copy> Copy for CircleDomain<F>

impl<F: Eq> Eq for CircleDomain<F>

impl<F> StructuralPartialEq for CircleDomain<F>