Struct Vector 

pub struct Vector<F: Field, K: ArraySize>(pub Array<Polynomial<F>, K>);

A Vector is a vector of polynomials from R_q of length K. Vectors can be added, subtracted, negated, and multiplied by field elements.

Tuple Fields

0: Array<Polynomial<F>, K>

Implementations

impl<F: Field, K: ArraySize> Vector<F, K>

pub const fn new(x: Array<Polynomial<F>, K>) -> Self

Trait Implementations

impl<F: Field, K: ArraySize> Add<&Vector<F, K>> for &Vector<F, K>

type Output = Vector<F, K>

The resulting type after applying the + operator.

fn add(self, rhs: &Vector<F, K>) -> Vector<F, K>

Performs the + operation.

impl<K: ArraySize> AlgebraExt for Vector<BaseField, K>

fn mod_plus_minus<M: Unsigned>(&self) -> Self

fn infinity_norm(&self) -> u32

fn power2round(&self) -> (Self, Self)

fn high_bits<TwoGamma2: Unsigned>(&self) -> Self

fn low_bits<TwoGamma2: Unsigned>(&self) -> Self

impl<K, A, B> BitPack<A, B> for Vector<BaseField, K>

where K: ArraySize, (A, B): RangeEncodingSize, <(A, B) as RangeEncodingSize>::EncodingSize: VectorEncodingSize<K>,

type PackedSize = <<(A, B) as RangeEncodingSize>::EncodingSize as VectorEncodingSize<K>>::EncodedVectorSize

fn pack( &self, ) -> Array<u8, <<(A, B) as RangeEncodingSize>::EncodingSize as VectorEncodingSize<K>>::EncodedVectorSize>

fn unpack( enc: &Array<u8, <<(A, B) as RangeEncodingSize>::EncodingSize as VectorEncodingSize<K>>::EncodedVectorSize>, ) -> Self

impl<F: Clone + Field, K: Clone + ArraySize> Clone for Vector<F, K>

fn clone(&self) -> Vector<F, K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug + Field, K: Debug + ArraySize> Debug for Vector<F, K>

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

Formats the value using the given formatter.

impl<F: Default + Field, K: Default + ArraySize> Default for Vector<F, K>

fn default() -> Vector<F, K>

Returns the “default value” for a type.

impl<F, D, K> Encode<D> for Vector<F, K>

where F: Field, K: ArraySize, D: VectorEncodingSize<K>,

type EncodedSize = <D as VectorEncodingSize<K>>::EncodedVectorSize

fn encode(&self) -> Array<u8, Self::EncodedSize>

fn decode(enc: &Array<u8, Self::EncodedSize>) -> Self

impl<F: Field, K: ArraySize> Mul<&Vector<F, K>> for Elem<F>

type Output = Vector<F, K>

The resulting type after applying the * operator.

fn mul(self, rhs: &Vector<F, K>) -> Vector<F, K>

Performs the * operation.

impl<F: Field, K: ArraySize> Neg for &Vector<F, K>

type Output = Vector<F, K>

The resulting type after applying the - operator.

fn neg(self) -> Vector<F, K>

Performs the unary - operation.

impl<K: ArraySize> Ntt for Vector<BaseField, K>

type Output = NttVector<BaseField, K>

fn ntt(&self) -> Self::Output

impl<F: PartialEq + Field, K: PartialEq + ArraySize> PartialEq for Vector<F, K>

fn eq(&self, other: &Vector<F, K>) -> 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: Field, K: ArraySize> Sub<&Vector<F, K>> for &Vector<F, K>

type Output = Vector<F, K>

The resulting type after applying the - operator.

fn sub(self, rhs: &Vector<F, K>) -> Vector<F, K>

Performs the - operation.

impl<F: Field, K: ArraySize> StructuralPartialEq for Vector<F, K>