Package | Description |
---|---|
org.apfloat.internal |
Default implementations of the apfloat Service Provider Interface (SPI).
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractStepFNTStrategy
Abstract superclass for step-based FNT strategies.
|
class |
DoubleFactor3NTTStepStrategy
Steps for the factor-3 NTT.
|
class |
DoubleNTTConvolutionStepStrategy
Steps of a three-NTT convolution for the
double type. |
class |
DoubleNTTStepStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
Factor3NTTStrategy
A transform that implements a 3-point transform on
top of another Number Theoretic Transform that does
transforms of length 2n.
|
class |
FloatFactor3NTTStepStrategy
Steps for the factor-3 NTT.
|
class |
FloatNTTConvolutionStepStrategy
Steps of a three-NTT convolution for the
float type. |
class |
FloatNTTStepStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
IntFactor3NTTStepStrategy
Steps for the factor-3 NTT.
|
class |
IntNTTConvolutionStepStrategy
Steps of a three-NTT convolution for the
int type. |
class |
IntNTTStepStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
LongFactor3NTTStepStrategy
Steps for the factor-3 NTT.
|
class |
LongNTTConvolutionStepStrategy
Steps of a three-NTT convolution for the
long type. |
class |
LongNTTStepStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
SixStepFNTStrategy
Fast Number Theoretic Transform that uses a "six-step"
algorithm to calculate a long transform more efficiently on
cache-based memory architectures.
|
class |
StepCarryCRTStrategy
Class for performing the final step of a three-modulus
Number Theoretic Transform based convolution.
|
class |
TwoPassFNTStrategy
Fast Number Theoretic Transform that uses a "two-pass"
algorithm to calculate a very long transform on data that
resides on a mass storage device.
|
Copyright © 2018. All rights reserved.