move fft_* to header

git-svn-id: https://svn.r-project.org/R/trunk@87857 00db46b3-68df-0310-9c12-caf00c1e9a41

Author: ripley

src/library/stats/src/fft.c

@@ -1,6 +1,6 @@
 /*
  *  R : A Computer Language for Statistical Data Analysis
- *  Copyright (C) 1998--2019  The R Core Team
+ *  Copyright (C) 1998--2025  The R Core Team
  *  Copyright (C) 1995, 1996, 1997  Robert Gentleman and Ross Ihaka
  *
  *  This program is free software; you can redistribute it and/or modify
@@ -845,7 +845,7 @@ void fft_factor(int n, int *pmaxf, int *pmaxp)
 }
 
 
-Rboolean fft_work(double *a, double *b, int nseg, int n, int nspn, int isn,
+bool fft_work(double *a, double *b, int nseg, int n, int nspn, int isn,
 		  double *work, int *iwork)
 {
 	/* check that factorization was successful */

src/library/stats/src/fourier.c

@@ -27,12 +27,9 @@
 #include <Rinternals.h>
 #include "statsErr.h"
 
-// workhorse routines from fft.c
-void fft_factor(int n, int *pmaxf, int *pmaxp);
-Rboolean fft_work(double *a, double *b, int nseg, int n, int nspn,
-		  int isn, double *work, int *iwork);
 
 #include "statsR.h"
+#include "stats.h"
 
 /* Fourier Transform for Univariate Spatial and Time Series */
 
@@ -180,22 +177,22 @@ SEXP mvfft(SEXP z, SEXP inverse)
     return z;
 }
 
-static Rboolean ok_n(int n, const int f[], int nf)
+static bool ok_n(int n, const int f[], int nf)
 {
     for (int i = 0; i < nf; i++) {
 	while(n % f[i] == 0) {
 	    if ((n = n / f[i]) == 1)
-		return TRUE;
+		return true;
 	}
     }
     return n == 1;
 }
-static Rboolean ok_n_64(uint64_t n, const int f[], int nf)
+static bool ok_n_64(uint64_t n, const int f[], int nf)
 {
     for (int i = 0; i < nf; i++) {
 	while(n % f[i] == 0) {
 	    if ((n = n / f[i]) == 1)
-		return TRUE;
+		return true;
 	}
     }
     return n == 1;
@@ -240,7 +237,7 @@ SEXP nextn(SEXP n, SEXP f)
 	if (f_[i] == NA_INTEGER || f_[i] <= 1)
 	    error(_("invalid factors"));
 
-    Rboolean use_int = TYPEOF(n) == INTSXP;
+    bool use_int = TYPEOF(n) == INTSXP;
     if(!use_int && TYPEOF(n) != REALSXP)
 	error(_("'n' must have typeof(.) \"integer\" or \"double\""));
     R_xlen_t nn = XLENGTH(n);
@@ -250,7 +247,7 @@ SEXP nextn(SEXP n, SEXP f)
 	    if (!ISNAN(d_n[i]) && d_n[i] > n_max) n_max = d_n[i];
 	}
 	if(n_max <= INT_MAX / f_[0]) { // maximal n[] should not be too large to find "next n"
-	    use_int = TRUE;
+	    use_int = true;
 	    n = PROTECT(n = coerceVector(n, INTSXP)); nprot++;
 	}
     }

src/library/stats/src/stats.h

@@ -1,6 +1,6 @@
 /*
  *  R : A Computer Language for Statistical Data Analysis
- *  Copyright (C) 2005-2024  The R Core Team
+ *  Copyright (C) 2005-2025  The R Core Team
  *
  *  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
@@ -55,5 +55,10 @@ double R_zeroin2(double ax, double bx, double fa, double fb,
 		 double (*f)(double x, void *info), void *info, 
 		 double *Tol, int *Maxit);
 
+/* from fft.c, formerly in fourier.c */
+void fft_factor(int n, int *pmaxf, int *pmaxp);
+bool fft_work(double *a, double *b, int nseg, int n, int nspn,
+	      int isn, double *work, int *iwork);
+
 
 #endif