[clfft] 03/16: Index calculation in 2D and 3D examples fixed.

[Ghislain Vaillant]

This is an automated email from the git hooks/post-receive script.

ghisvail-guest pushed a commit to branch master
in repository clfft.

commit 521eea03b8a432ed79769ffb00d512bf49f23863
Author: Matthias Werner <Matthias.Werner1 at tu-dresden.de>
Date:   Wed Aug 3 09:39:01 2016 +0200

    Index calculation in 2D and 3D examples fixed.
---
 src/examples/fft2d.c | 6 +++---
 src/examples/fft3d.c | 4 ++--
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/examples/fft2d.c b/src/examples/fft2d.c
index 2b901a9..b8172a4 100644
--- a/src/examples/fft2d.c
+++ b/src/examples/fft2d.c
@@ -75,13 +75,13 @@ int main( void )
     /* print input array just using the
      * indices to fill the array with data */
     printf("\nPerforming fft on an two dimensional array of size N0 x N1 : %u x %u\n", (unsigned long)N0, (unsigned long)N1);
-	size_t i, j;
+    size_t i, j;
     i = j = 0;
     for (i=0; i<N0; ++i) {
         for (j=0; j<N1; ++j) {
             float x = 0.5f;
             float y = 0.5f;
-			size_t idx = 2*(j+i*N0);
+            size_t idx = 2*(j+i*N1);
             X[idx] = x;
             X[idx+1] = y;
             printf("(%f, %f) ", x, y);
@@ -119,7 +119,7 @@ int main( void )
     i = j = 0;
     for (i=0; i<N0; ++i) {
         for (j=0; j<N1; ++j) {
-			size_t idx = 2*(j+i*N0);
+            size_t idx = 2*(j+i*N1);
             printf("(%f, %f) ", X[idx], X[idx+1]);
         }
         printf("\n");
diff --git a/src/examples/fft3d.c b/src/examples/fft3d.c
index 56732b1..6ad4f93 100644
--- a/src/examples/fft3d.c
+++ b/src/examples/fft3d.c
@@ -85,7 +85,7 @@ int main( void )
                 if (i==0 && j==0 && k==0) {
                     x = y = 0.5f;
                 }
-				size_t idx = 2*(k+j*N1+i*N0*N1);
+                size_t idx = 2*(k+j*N2+i*N1*N2);
                 X[idx] = x;
                 X[idx+1] = y;
                 printf("(%f, %f) ", X[idx], X[idx+1]);
@@ -126,7 +126,7 @@ int main( void )
     for (i=0; i<N0; ++i) {
         for (j=0; j<N1; ++j) {
             for (k=0; k<N2; ++k) {
-				size_t idx = 2*(k+j*N1+i*N0*N1);
+                size_t idx = 2*(k+j*N2+i*N1*N2);
                 printf("(%f, %f) ", X[idx], X[idx+1]);
             }
             printf("\n");

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/clfft.git