1 files changed, 0 insertions, 51 deletions
diff --git a/src/fftw3/dft/zero.c b/src/fftw3/dft/zero.c
deleted file mode 100644
index df34e0e..0000000
--- a/src/fftw3/dft/zero.c
+++ /dev/null
@@ -1,51 +0,0 @@
-/*
- * Copyright (c) 2003 Matteo Frigo
- * Copyright (c) 2003 Massachusetts Institute of Technology
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- *
- */
-
-/* $Id: zero.c,v 1.1 2008/10/17 06:11:08 scuri Exp $ */
-
-#include "dft.h"
-
-/* fill a complex array with zeros. */
-static void recur(const iodim *dims, int rnk, R *ri, R *ii)
-{
-     if (rnk == RNK_MINFTY)
-          return;
-     else if (rnk == 0)
-          ri[0] = ii[0] = K(0.0);
-     else if (rnk > 0) {
-          int i, n = dims[0].n;
-          int is = dims[0].is;
-
-	  if (rnk == 1) {
-	       /* this case is redundant but faster */
-	       for (i = 0; i < n; ++i)
-		    ri[i * is] = ii[i * is] = K(0.0);
-	  } else {
-	       for (i = 0; i < n; ++i)
-		    recur(dims + 1, rnk - 1, ri + i * is, ii + i * is);
-	  }
-     }
-}
-
-
-void X(dft_zerotens)(tensor *sz, R *ri, R *ii)
-{
-     recur(sz->dims, sz->rnk, ri, ii);
-}