Uses of Class
org.apfloat.spi.ArrayAccess
Packages that use ArrayAccess
Package
Description
Default implementations of the apfloat Service Provider Interface (SPI).
The apfloat Service Provider Interface (SPI).
-
Uses of ArrayAccess in org.apfloat.internal
Subclasses of ArrayAccess in org.apfloat.internalModifier and TypeClassDescriptionprivate classprivate classprivate classclassArray access class based on adouble[].private classprivate classprivate classclassArray access class based on afloat[].private classprivate classprivate classclassArray access class based on aint[].private classprivate classprivate classclassArray access class based on along[].Fields in org.apfloat.internal declared as ArrayAccessModifier and TypeFieldDescriptionprivate ArrayAccessDoubleDiskDataStorage.BlockIterator.arrayAccessprivate ArrayAccessDoubleNTTStepStrategy.MultiplyRunnable.arrayAccessprivate ArrayAccessDoubleNTTStepStrategy.TableFNTRunnable.arrayAccessprivate ArrayAccessFloatDiskDataStorage.BlockIterator.arrayAccessprivate ArrayAccessFloatNTTStepStrategy.MultiplyRunnable.arrayAccessprivate ArrayAccessFloatNTTStepStrategy.TableFNTRunnable.arrayAccessprivate ArrayAccessIntDiskDataStorage.BlockIterator.arrayAccessprivate ArrayAccessIntNTTStepStrategy.MultiplyRunnable.arrayAccessprivate ArrayAccessIntNTTStepStrategy.TableFNTRunnable.arrayAccessprivate ArrayAccessLongDiskDataStorage.BlockIterator.arrayAccessprivate ArrayAccessLongNTTStepStrategy.MultiplyRunnable.arrayAccessprivate ArrayAccessLongNTTStepStrategy.TableFNTRunnable.arrayAccessMethods in org.apfloat.internal that return ArrayAccessModifier and TypeMethodDescriptionprotected abstract ArrayAccessDiskDataStorage.createArrayAccess(int mode, int startColumn, int columns, int rows) Create an empty ArrayAccess.protected ArrayAccessDoubleDiskDataStorage.createArrayAccess(int mode, int startColumn, int columns, int rows) protected ArrayAccessFloatDiskDataStorage.createArrayAccess(int mode, int startColumn, int columns, int rows) protected ArrayAccessIntDiskDataStorage.createArrayAccess(int mode, int startColumn, int columns, int rows) protected ArrayAccessLongDiskDataStorage.createArrayAccess(int mode, int startColumn, int columns, int rows) protected abstract ArrayAccessDiskDataStorage.createTransposedArrayAccess(int mode, int startColumn, int columns, int rows) Create an empty transposed ArrayAccess.protected ArrayAccessDoubleDiskDataStorage.createTransposedArrayAccess(int mode, int startColumn, int columns, int rows) protected ArrayAccessFloatDiskDataStorage.createTransposedArrayAccess(int mode, int startColumn, int columns, int rows) protected ArrayAccessIntDiskDataStorage.createTransposedArrayAccess(int mode, int startColumn, int columns, int rows) protected ArrayAccessLongDiskDataStorage.createTransposedArrayAccess(int mode, int startColumn, int columns, int rows) protected ArrayAccessTwoPassFNTStrategy.getColumns(DataStorage dataStorage, int startColumn, int columns, int rows) Get a block of column data.protected ArrayAccessTwoPassFNTStrategy.getRows(DataStorage dataStorage, int startRow, int rows, int columns) Get a block of row data.protected ArrayAccessDiskDataStorage.implGetArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessDoubleDiskDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessDoubleMemoryDataStorage.implGetArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessDoubleMemoryDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessFloatDiskDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessFloatMemoryDataStorage.implGetArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessFloatMemoryDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessIntDiskDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessIntMemoryDataStorage.implGetArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessIntMemoryDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessLongDiskDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessLongMemoryDataStorage.implGetArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessLongMemoryDataStorage.implGetArray(int mode, long offset, int length) protected ArrayAccessDiskDataStorage.implGetTransposedArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessDoubleMemoryDataStorage.implGetTransposedArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessFloatMemoryDataStorage.implGetTransposedArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessIntMemoryDataStorage.implGetTransposedArray(int mode, int startColumn, int columns, int rows) protected ArrayAccessLongMemoryDataStorage.implGetTransposedArray(int mode, int startColumn, int columns, int rows) DoubleMemoryArrayAccess.subsequence(int offset, int length) FloatMemoryArrayAccess.subsequence(int offset, int length) IntMemoryArrayAccess.subsequence(int offset, int length) LongMemoryArrayAccess.subsequence(int offset, int length) Methods in org.apfloat.internal with parameters of type ArrayAccessModifier and TypeMethodDescriptionprotected ParallelRunnableDoubleNTTStepStrategy.createMultiplyElementsParallelRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) Create a ParallelRunnable object for multiplying the elements of the matrix.protected ParallelRunnableFloatNTTStepStrategy.createMultiplyElementsParallelRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) Create a ParallelRunnable object for multiplying the elements of the matrix.protected ParallelRunnableIntNTTStepStrategy.createMultiplyElementsParallelRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) Create a ParallelRunnable object for multiplying the elements of the matrix.protected ParallelRunnableLongNTTStepStrategy.createMultiplyElementsParallelRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) Create a ParallelRunnable object for multiplying the elements of the matrix.protected ParallelRunnableDoubleNTTStepStrategy.createTransformRowsParallelRunnable(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) Create a ParallelRunnable object for transforming the rows of the matrix.protected ParallelRunnableFloatNTTStepStrategy.createTransformRowsParallelRunnable(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) Create a ParallelRunnable object for transforming the rows of the matrix.protected ParallelRunnableIntNTTStepStrategy.createTransformRowsParallelRunnable(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) Create a ParallelRunnable object for transforming the rows of the matrix.protected ParallelRunnableLongNTTStepStrategy.createTransformRowsParallelRunnable(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) Create a ParallelRunnable object for transforming the rows of the matrix.private voidDoubleTableFNTStrategy.divideElements(ArrayAccess arrayAccess, double divisor) private voidFloatTableFNTStrategy.divideElements(ArrayAccess arrayAccess, float divisor) private voidIntTableFNTStrategy.divideElements(ArrayAccess arrayAccess, int divisor) private voidLongTableFNTStrategy.divideElements(ArrayAccess arrayAccess, long divisor) voidDoubleTableFNT.inverseTableFNT(ArrayAccess arrayAccess, double[] wTable, int[] permutationTable) Inverse (Cooley-Tukey) fast Number Theoretic Transform.voidFloatTableFNT.inverseTableFNT(ArrayAccess arrayAccess, float[] wTable, int[] permutationTable) Inverse (Cooley-Tukey) fast Number Theoretic Transform.voidIntTableFNT.inverseTableFNT(ArrayAccess arrayAccess, int[] wTable, int[] permutationTable) Inverse (Cooley-Tukey) fast Number Theoretic Transform.voidLongTableFNT.inverseTableFNT(ArrayAccess arrayAccess, long[] wTable, int[] permutationTable) Inverse (Cooley-Tukey) fast Number Theoretic Transform.voidDoubleNTTStepStrategy.multiplyElements(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) voidFloatNTTStepStrategy.multiplyElements(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) voidIntNTTStepStrategy.multiplyElements(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) voidLongNTTStepStrategy.multiplyElements(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) protected voidSixStepFNTStrategy.multiplyElements(ArrayAccess arrayAccess, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) Multiply each matrix element by a power of the n:th root of unity.protected voidTwoPassFNTStrategy.multiplyElements(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) Multiply each matrix element(i, j)bywi * j / totalTransformLength.voidDoubleMatrixStrategy.permuteToDoubleWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a n1/2 x 2*n2 matrix.voidFloatMatrixStrategy.permuteToDoubleWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a n1/2 x 2*n2 matrix.voidIntMatrixStrategy.permuteToDoubleWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a n1/2 x 2*n2 matrix.voidLongMatrixStrategy.permuteToDoubleWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a n1/2 x 2*n2 matrix.voidDoubleMatrixStrategy.permuteToHalfWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a 2*n1 x n2/2 matrix.voidFloatMatrixStrategy.permuteToHalfWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a 2*n1 x n2/2 matrix.voidIntMatrixStrategy.permuteToHalfWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a 2*n1 x n2/2 matrix.voidLongMatrixStrategy.permuteToHalfWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a 2*n1 x n2/2 matrix.protected voidSixStepFNTStrategy.postTransform(ArrayAccess arrayAccess) Finish processing the data after the (inverse) transform.protected voidSixStepFNTStrategy.preTransform(ArrayAccess arrayAccess) Prepare the data for the (inverse) transform.private voidDiskDataStorage.readToArray(long readPosition, ArrayAccess arrayAccess, int writePosition, int length) protected voidDiskDataStorage.setArray(ArrayAccess arrayAccess, int startColumn, int columns, int rows) Write the data back to the same location in the file that was retrieved withDiskDataStorage.implGetArray(int,int,int,int).protected voidDiskDataStorage.setTransposedArray(ArrayAccess arrayAccess, int startColumn, int columns, int rows) Write the data back to the same location in the file that was retrieved withDiskDataStorage.implGetTransposedArray(int,int,int,int).voidDoubleTableFNT.tableFNT(ArrayAccess arrayAccess, double[] wTable, int[] permutationTable) Forward (Sande-Tukey) fast Number Theoretic Transform.voidFloatTableFNT.tableFNT(ArrayAccess arrayAccess, float[] wTable, int[] permutationTable) Forward (Sande-Tukey) fast Number Theoretic Transform.voidIntTableFNT.tableFNT(ArrayAccess arrayAccess, int[] wTable, int[] permutationTable) Forward (Sande-Tukey) fast Number Theoretic Transform.voidLongTableFNT.tableFNT(ArrayAccess arrayAccess, long[] wTable, int[] permutationTable) Forward (Sande-Tukey) fast Number Theoretic Transform.protected voidTwoPassFNTStrategy.transformColumns(ArrayAccess arrayAccess, int length, int count, boolean isInverse, int modulus) Transform the columns of the data matrix.protected voidSixStepFNTStrategy.transformFirst(ArrayAccess arrayAccess, int length, int count, boolean isInverse, int modulus) The first transform of the rows (or columns) of the data matrix.voidDoubleNTTStepStrategy.transformRows(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) voidFloatNTTStepStrategy.transformRows(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) voidIntNTTStepStrategy.transformRows(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) voidLongNTTStepStrategy.transformRows(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) protected voidTwoPassFNTStrategy.transformRows(ArrayAccess arrayAccess, int length, int count, boolean isInverse, int modulus) Transform the rows of the data matrix.protected voidSixStepFNTStrategy.transformSecond(ArrayAccess arrayAccess, int length, int count, boolean isInverse, int modulus) The second transform of the rows (or columns) of the data matrix.voidDoubleMatrixStrategy.transpose(ArrayAccess arrayAccess, int n1, int n2) Transpose a n1 x n2 matrix.voidFloatMatrixStrategy.transpose(ArrayAccess arrayAccess, int n1, int n2) Transpose a n1 x n2 matrix.voidIntMatrixStrategy.transpose(ArrayAccess arrayAccess, int n1, int n2) Transpose a n1 x n2 matrix.voidLongMatrixStrategy.transpose(ArrayAccess arrayAccess, int n1, int n2) Transpose a n1 x n2 matrix.protected voidSixStepFNTStrategy.transposeFinal(ArrayAccess arrayAccess, int n1, int n2, boolean isInverse) The final transpose of the forward transform, or the initial transpose of the inverse transform.protected voidSixStepFNTStrategy.transposeInitial(ArrayAccess arrayAccess, int n1, int n2, boolean isInverse) The initial transpose of the forward transform, or the final transpose of the inverse transform, to transpose the columns of the matrix to be rows.protected voidSixStepFNTStrategy.transposeMiddle(ArrayAccess arrayAccess, int n1, int n2, boolean isInverse) The second transpose of either the forward or inverse transform.voidDoubleMatrixStrategy.transposeSquare(ArrayAccess arrayAccess, int n1, int n2) Transpose a square n1 x n1 block of n1 x n2 matrix.voidFloatMatrixStrategy.transposeSquare(ArrayAccess arrayAccess, int n1, int n2) Transpose a square n1 x n1 block of n1 x n2 matrix.voidIntMatrixStrategy.transposeSquare(ArrayAccess arrayAccess, int n1, int n2) Transpose a square n1 x n1 block of n1 x n2 matrix.voidLongMatrixStrategy.transposeSquare(ArrayAccess arrayAccess, int n1, int n2) Transpose a square n1 x n1 block of n1 x n2 matrix.private voidDiskDataStorage.writeFromArray(ArrayAccess arrayAccess, int readPosition, long writePosition, int length) Constructors in org.apfloat.internal with parameters of type ArrayAccessModifierConstructorDescriptionMultiplyRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, double w, double scaleFactor) MultiplyRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, float w, float scaleFactor) MultiplyRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, int w, int scaleFactor) MultiplyRunnable(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long w, long scaleFactor) TableFNTRunnable(int length, boolean isInverse, ArrayAccess arrayAccess, double[] wTable, int[] permutationTable) TableFNTRunnable(int length, boolean isInverse, ArrayAccess arrayAccess, float[] wTable, int[] permutationTable) TableFNTRunnable(int length, boolean isInverse, ArrayAccess arrayAccess, int[] wTable, int[] permutationTable) TableFNTRunnable(int length, boolean isInverse, ArrayAccess arrayAccess, long[] wTable, int[] permutationTable) -
Uses of ArrayAccess in org.apfloat.spi
Methods in org.apfloat.spi that return ArrayAccessModifier and TypeMethodDescriptionfinal ArrayAccessDataStorage.getArray(int mode, int startColumn, int columns, int rows) Maps a block of data to a memory array when the data is treated as a matrix.final ArrayAccessDataStorage.getArray(int mode, long offset, int length) Gets an array access to the data of this data storage when the data is treated as a linear block.final ArrayAccessDataStorage.getTransposedArray(int mode, int startColumn, int columns, int rows) Maps a transposed block of data to a memory array when the data is treated as a matrix.protected abstract ArrayAccessDataStorage.implGetArray(int mode, int startColumn, int columns, int rows) Maps a block of data to a memory array when the data is treated as a matrix.protected abstract ArrayAccessDataStorage.implGetArray(int mode, long offset, int length) Gets an array access to the data of this data storage when it is treated as a linear block.protected abstract ArrayAccessDataStorage.implGetTransposedArray(int mode, int startColumn, int columns, int rows) Maps a transposed block of data to a memory array when the data is treated as a matrix.abstract ArrayAccessArrayAccess.subsequence(int offset, int length) Create a sub-sequence view of this array access.Methods in org.apfloat.spi with parameters of type ArrayAccessModifier and TypeMethodDescriptionvoidNTTStepStrategy.multiplyElements(ArrayAccess arrayAccess, int startRow, int startColumn, int rows, int columns, long length, long totalTransformLength, boolean isInverse, int modulus) Multiply each matrix element(i, j)bywi * j / totalTransformLength.voidMatrixStrategy.permuteToDoubleWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a n1/2 x 2*n2 matrix.voidMatrixStrategy.permuteToHalfWidth(ArrayAccess arrayAccess, int n1, int n2) Permute the rows of the n1 x n2 matrix so that it is shaped like a 2*n1 x n2/2 matrix.voidNTTStepStrategy.transformRows(ArrayAccess arrayAccess, int length, int count, boolean isInverse, boolean permute, int modulus) Transform the rows of the data matrix.voidMatrixStrategy.transpose(ArrayAccess arrayAccess, int n1, int n2) Transpose a n1 x n2 matrix.voidMatrixStrategy.transposeSquare(ArrayAccess arrayAccess, int n1, int n2) Transpose a square n1 x n1 block of n1 x n2 matrix.