public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a[i], 0, scale); } } });
public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a, i * columns, scale); } } });
public void run() { for (long i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a, i * columnsl, scale); } } });
public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a[i], 0, scale); } } });
public void run() { for (int i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a, i * columns, scale); } } });
public void run() { for (long i = firstRow; i < lastRow; i++) { fftColumns.realInverse2(a, i * columnsl, scale); } } });
public void run() { if (icr == 0) { if (isgn == -1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexForward(a, r * columns); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexInverse(a, r * columns, scale); } } } else if (isgn == 1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.realForward(a, r * columns); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.realInverse2(a, r * columns, scale); } } } });
public void run() { if (icr == 0) { if (isgn == -1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexForward(a[r]); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexInverse(a[r], scale); } } } else if (isgn == 1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.realForward(a[r]); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.realInverse2(a[r], 0, scale); } } } });
public void run() { if (icr == 0) { if (isgn == -1) { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.complexForward(a, r * columnsl); } } else { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.complexInverse(a, r * columnsl, scale); } } } else if (isgn == 1) { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.realForward(a, r * columnsl); } } else { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.realInverse2(a, r * columnsl, scale); } } } });
public void run() { if (icr == 0) { if (isgn == -1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexForward(a, r * columns); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexInverse(a, r * columns, scale); } } } else if (isgn == 1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.realForward(a, r * columns); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.realInverse2(a, r * columns, scale); } } } });
public void run() { if (icr == 0) { if (isgn == -1) { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.complexForward(a, r * columnsl); } } else { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.complexInverse(a, r * columnsl, scale); } } } else if (isgn == 1) { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.realForward(a, r * columnsl); } } else { for (long r = n0; r < rowsl; r += nthreads) { fftColumns.realInverse2(a, r * columnsl, scale); } } } });
public void run() { if (icr == 0) { if (isgn == -1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexForward(a[r]); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.complexInverse(a[r], scale); } } } else if (isgn == 1) { for (int r = n0; r < rows; r += nthreads) { fftColumns.realForward(a[r]); } } else { for (int r = n0; r < rows; r += nthreads) { fftColumns.realInverse2(a[r], 0, scale); } } } });
} else { for (int r = 0; r < rows; r++) { fftColumns.realInverse2(a[r], 0, scale);
} else { for (long r = 0; r < rowsl; r++) { fftColumns.realInverse2(a, r * columnsl, scale);
} else { for (long r = 0; r < rowsl; r++) { fftColumns.realInverse2(a, r * columnsl, scale);
} else { for (int r = 0; r < rows; r++) { fftColumns.realInverse2(a[r], 0, scale);
} else { for (int r = 0; r < rows; r++) { fftColumns.realInverse2(a, r * columns, scale);
} else { for (int r = 0; r < rows; r++) { fftColumns.realInverse2(a, r * columns, scale);
protected void realInverse2(float[] a, int offa, boolean scale) realInverse2(new FloatLargeArray(a), offa, scale); } else { if (n == 1) {
realInverse2(a.getData(), (int) offa, scale); } else { throw new IllegalArgumentException("The data array is too big.");