Struct KaratsubaAlgorithm

pub struct KaratsubaAlgorithm<A: Allocator = Global> { /* private fields */ }

Implementation of convolutions that uses Karatsuba’s algorithm with a threshold defined by KaratsubaHint.

Implementations

impl<A: Allocator> KaratsubaAlgorithm<A>

pub const fn new(allocator: A) -> Self

Availability

This API is marked as unstable and is only available when the unstable-enable crate feature is enabled. This comes with no stability guarantees, and could be changed or removed at any time.

Trait Implementations

impl<A: Clone + Allocator> Clone for KaratsubaAlgorithm<A>

fn clone(&self) -> KaratsubaAlgorithm<A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R: ?Sized + RingBase, A: Allocator> ConvolutionAlgorithm<R> for KaratsubaAlgorithm<A>

fn compute_convolution<S: RingStore<Type = R>, V1: VectorView<<R as RingBase>::Element>, V2: VectorView<<R as RingBase>::Element>>( &self, lhs: V1, rhs: V2, dst: &mut [<R as RingBase>::Element], ring: S, )

Elementwise adds the convolution of lhs and rhs to dst.

fn supports_ring<S: RingStore<Type = R> + Copy>(&self, _ring: S) -> bool

Returns whether this convolution algorithm supports computations of the given ring.

type PreparedConvolutionOperand = ()

Additional data associated to a list of ring elements, which can be used to compute a convolution where this list is one of the operands faster.

fn prepare_convolution_operand<S, V>( &self, _val: V, _length_hint: Option<usize>, _ring: S, ) -> Self::PreparedConvolutionOperand

where S: RingStore<Type = R> + Copy, V: VectorView<R::Element>,

Takes an input list of values and computes an opaque ConvolutionAlgorithm::PreparedConvolutionOperand, which can be used to compute future convolutions with this list of values faster.

fn compute_convolution_prepared<S, V1, V2>( &self, lhs: V1, _lhs_prep: Option<&Self::PreparedConvolutionOperand>, rhs: V2, _rhs_prep: Option<&Self::PreparedConvolutionOperand>, dst: &mut [R::Element], ring: S, )

where S: RingStore<Type = R> + Copy, V1: VectorView<R::Element>, V2: VectorView<R::Element>,

Elementwise adds the convolution of lhs and rhs to dst. If provided, the given prepared convolution operands are used for a faster computation.

fn compute_convolution_sum<'a, S, I, V1, V2>( &self, values: I, dst: &mut [R::Element], ring: S, )

where S: RingStore<Type = R> + Copy, I: ExactSizeIterator<Item = (V1, Option<&'a Self::PreparedConvolutionOperand>, V2, Option<&'a Self::PreparedConvolutionOperand>)>, V1: VectorView<R::Element>, V2: VectorView<R::Element>, Self: 'a, R: 'a,

Computes a convolution for each tuple in the given sequence, and sums the result of each convolution to dst.

impl<A: Debug + Allocator> Debug for KaratsubaAlgorithm<A>

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

Formats the value using the given formatter.

impl<A: Copy + Allocator> Copy for KaratsubaAlgorithm<A>