Uses of Package
org.apfloat.internal
Packages that use org.apfloat.internal
Package
Description
Transforms for using a GPU via the aparapi library.
Default implementations of the apfloat Service Provider Interface (SPI).
-
Classes in org.apfloat.internal used by org.apfloat.aparapiClassDescriptionAbstract base class for creating Number Theoretic Transforms suitable for the specified length, based on available memory configured in the
ApfloatContext.Abstract superclass for step-based FNT strategies.NTT strategy that can be decorated with a decorator.A transform that implements a 3-point transform on top of another Number Theoretic Transform that does transforms of length 2n.Factory class for getting instances of the various builder classes needed to build anApfloatImplwith theintdata element type.Elementary modulo arithmetic functions forintdata.Steps for the factor-3 NTT.Modulo arithmetic functions forintdata.Creates Number Theoretic Transforms for theinttype.Common methods to calculate Fast Number Theoretic Transforms in parallel using multiple threads.Fast Number Theoretic Transform that uses lookup tables for powers of n:th root of unity and permutation indexes.Factory class for getting instances of the various builder classes needed to build anApfloatImplwith thelongdata element type.Elementary modulo arithmetic functions forlongdata.Steps for the factor-3 NTT.Modulo arithmetic functions forlongdata.Creates Number Theoretic Transforms for thelongtype.Common methods to calculate Fast Number Theoretic Transforms in parallel using multiple threads.Fast Number Theoretic Transform that uses lookup tables for powers of n:th root of unity and permutation indexes.Decorator to perform pre- and post-processing on an NTTStrategy.Any task that can use aParallelRunnerto execute operations in parallel.Fast Number Theoretic Transform that uses a "six-step" algorithm to calculate a long transform more efficiently on cache-based memory architectures.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. -
Classes in org.apfloat.internal used by org.apfloat.internalClassDescriptionAbstract base class for creating convolutions of suitable type for the specified length.Abstract base class for a data storage creation strategy.Abstract base class for creating Number Theoretic Transforms suitable for the specified length, based on available memory configured in the
ApfloatContext.Abstract superclass for step-based FNT strategies.Exception indicating some unexpected apfloat implementation specific error situation.NTT strategy that can be decorated with a decorator.Abstract base class for disk-based data storage, containing the common functionality independent of the element type.Mathematical operations on numbers in a base.Basic arithmetic for calculating the Chinese Remainder Theorem.Disk-based data storage for thedoubleelement type.Elementary modulo arithmetic functions fordoubledata.Medium-length convolution strategy.Memory based data storage implementation for thedoubleelement type.Modulo arithmetic functions fordoubledata.Fast Number Theoretic Transform that uses lookup tables for powers of n:th root of unity and permutation indexes.Mathematical operations on numbers in a base.Basic arithmetic for calculating the Chinese Remainder Theorem.Disk-based data storage for thefloatelement type.Elementary modulo arithmetic functions forfloatdata.Medium-length convolution strategy.Memory based data storage implementation for thefloatelement type.Modulo arithmetic functions forfloatdata.Fast Number Theoretic Transform that uses lookup tables for powers of n:th root of unity and permutation indexes.Mathematical operations on numbers in a base.Basic arithmetic for calculating the Chinese Remainder Theorem.Disk-based data storage for theintelement type.Elementary modulo arithmetic functions forintdata.Medium-length convolution strategy.Memory based data storage implementation for theintelement type.Modulo arithmetic functions forintdata.Fast Number Theoretic Transform that uses lookup tables for powers of n:th root of unity and permutation indexes.Mathematical operations on numbers in a base.Basic arithmetic for calculating the Chinese Remainder Theorem.Disk-based data storage for thelongelement type.Elementary modulo arithmetic functions forlongdata.Medium-length convolution strategy.Memory based data storage implementation for thelongelement type.Modulo arithmetic functions forlongdata.Fast Number Theoretic Transform that uses lookup tables for powers of n:th root of unity and permutation indexes.Any task that can use aParallelRunnerto execute operations in parallel.Abstract class for aRunnablethat can be run in parallel by multiple threads.Convolution using three Number Theoretic Transforms and the Chinese Remainder Theorem to get the final result.