CPD Results
The following document contains the results of PMD's CPD 6.55.0.
Duplications
File | Line |
---|---|
org/hipparchus/transform/FastFourierTransformer.java | 250 |
org/hipparchus/transform/FastFourierTransformer.java | 279 |
if (type == TransformType.INVERSE) { for (int i0 = 0; i0 < n; i0 += 4) { final int i1 = i0 + 1; final int i2 = i0 + 2; final int i3 = i0 + 3; final double srcR0 = dataR[i0]; final double srcI0 = dataI[i0]; final double srcR1 = dataR[i2]; final double srcI1 = dataI[i2]; final double srcR2 = dataR[i1]; final double srcI2 = dataI[i1]; final double srcR3 = dataR[i3]; final double srcI3 = dataI[i3]; // 4-term DFT // X_0 = x_0 + x_1 + x_2 + x_3 dataR[i0] = srcR0 + srcR1 + srcR2 + srcR3; dataI[i0] = srcI0 + srcI1 + srcI2 + srcI3; // X_1 = x_0 - x_2 + j * (x_3 - x_1) dataR[i1] = srcR0 - srcR2 + (srcI3 - srcI1); |