Package | Description |
---|---|
org.apfloat.internal |
Default implementations of the apfloat Service Provider Interface (SPI).
|
org.apfloat.spi |
The apfloat Service Provider Interface (SPI).
|
Modifier and Type | Interface and Description |
---|---|
interface |
ParallelNTTStrategy
Number Theoretic Transform that can be run using multiple threads in parallel.
|
Modifier and Type | Class and Description |
---|---|
class |
DoubleFactor3NTTStrategy
A transform that implements a 3-point transform on
top of another Number Theoretic Transform that does
transforms of length 2n.
|
class |
DoubleFactor3SixStepNTTStrategy
A transform that implements a 3-point transform on
top of the six-step Number Theoretic Transform that does
transforms of length 2n.
|
class |
DoubleParallelFNTStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
DoubleSixStepFNTStrategy
Fast Number Theoretic Transform that uses a "six-step"
algorithm to calculate a long transform more efficiently on
cache-based memory architectures.
|
class |
DoubleTableFNTStrategy
Fast Number Theoretic Transform that uses lookup tables
for powers of n:th root of unity and permutation indexes.
|
class |
DoubleTwoPassFNTStrategy
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.
|
class |
FloatFactor3NTTStrategy
A transform that implements a 3-point transform on
top of another Number Theoretic Transform that does
transforms of length 2n.
|
class |
FloatFactor3SixStepNTTStrategy
A transform that implements a 3-point transform on
top of the six-step Number Theoretic Transform that does
transforms of length 2n.
|
class |
FloatParallelFNTStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
FloatSixStepFNTStrategy
Fast Number Theoretic Transform that uses a "six-step"
algorithm to calculate a long transform more efficiently on
cache-based memory architectures.
|
class |
FloatTableFNTStrategy
Fast Number Theoretic Transform that uses lookup tables
for powers of n:th root of unity and permutation indexes.
|
class |
FloatTwoPassFNTStrategy
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.
|
class |
IntFactor3NTTStrategy
A transform that implements a 3-point transform on
top of another Number Theoretic Transform that does
transforms of length 2n.
|
class |
IntFactor3SixStepNTTStrategy
A transform that implements a 3-point transform on
top of the six-step Number Theoretic Transform that does
transforms of length 2n.
|
class |
IntParallelFNTStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
IntSixStepFNTStrategy
Fast Number Theoretic Transform that uses a "six-step"
algorithm to calculate a long transform more efficiently on
cache-based memory architectures.
|
class |
IntTableFNTStrategy
Fast Number Theoretic Transform that uses lookup tables
for powers of n:th root of unity and permutation indexes.
|
class |
IntTwoPassFNTStrategy
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.
|
class |
LongFactor3NTTStrategy
A transform that implements a 3-point transform on
top of another Number Theoretic Transform that does
transforms of length 2n.
|
class |
LongFactor3SixStepNTTStrategy
A transform that implements a 3-point transform on
top of the six-step Number Theoretic Transform that does
transforms of length 2n.
|
class |
LongParallelFNTStrategy
Common methods to calculate Fast Number Theoretic Transforms
in parallel using multiple threads.
|
class |
LongSixStepFNTStrategy
Fast Number Theoretic Transform that uses a "six-step"
algorithm to calculate a long transform more efficiently on
cache-based memory architectures.
|
class |
LongTableFNTStrategy
Fast Number Theoretic Transform that uses lookup tables
for powers of n:th root of unity and permutation indexes.
|
class |
LongTwoPassFNTStrategy
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.
|
Modifier and Type | Method and Description |
---|---|
NTTStrategy |
LongNTTBuilder.createNTT(long size) |
NTTStrategy |
IntNTTBuilder.createNTT(long size) |
NTTStrategy |
FloatNTTBuilder.createNTT(long size) |
NTTStrategy |
DoubleNTTBuilder.createNTT(long size) |
Constructor and Description |
---|
Double3NTTConvolutionStrategy(int radix,
NTTStrategy transform)
Creates a new convoluter that uses the specified
transform for transforming the data.
|
DoubleFactor3NTTStrategy(NTTStrategy factor2Strategy)
Creates a new factor-3 transform strategy on top of an existing transform.
|
Float3NTTConvolutionStrategy(int radix,
NTTStrategy transform)
Creates a new convoluter that uses the specified
transform for transforming the data.
|
FloatFactor3NTTStrategy(NTTStrategy factor2Strategy)
Creates a new factor-3 transform strategy on top of an existing transform.
|
Int3NTTConvolutionStrategy(int radix,
NTTStrategy transform)
Creates a new convoluter that uses the specified
transform for transforming the data.
|
IntFactor3NTTStrategy(NTTStrategy factor2Strategy)
Creates a new factor-3 transform strategy on top of an existing transform.
|
Long3NTTConvolutionStrategy(int radix,
NTTStrategy transform)
Creates a new convoluter that uses the specified
transform for transforming the data.
|
LongFactor3NTTStrategy(NTTStrategy factor2Strategy)
Creates a new factor-3 transform strategy on top of an existing transform.
|
Modifier and Type | Method and Description |
---|---|
NTTStrategy |
NTTBuilder.createNTT(long size)
Creates a Number Theoretic Transform of suitable
type for the specified length.
|
Copyright © 2011. All Rights Reserved.