dsp/fourier/internal/fftpack: fix formatting
MODIFY
dsp/fourier/internal/fftpack/cfft.go
dsp/fourier/internal/fftpack/cfft.go
@@ -18,7 +18,7 @@ import (
// tabulation of the trigonometric functions are computed and
// stored in work.
//
-// input parameter
+// Input parameter:
//
// n The length of the sequence to be transformed.
//

MODIFY
dsp/fourier/internal/fftpack/cosq.go
dsp/fourier/internal/fftpack/cosq.go
@@ -15,12 +15,12 @@ import "math"
// tabulation of the trigonometric functions are computed and
// stored in work.
//
-// Input parameter
+// Input parameter:
//
// n The length of the sequence to be transformed. the method
// is most efficient when n+1 is a product of small primes.
//
-// Output parameters
+// Output parameters:
//
// work A work array which must be dimensioned at least 3*n.
// The same work array can be used for both Cosqf and Cosqb
@@ -55,7 +55,7 @@ func Cosqi(n int, work []float64, ifac []int) {
// The array work which is used by subroutine Cosqf must be
// initialized by calling subroutine Cosqi(n,work).
//
-// Input parameters
+// Input parameters:
//
// n The length of the array x to be transformed. The method
// is most efficient when n is a product of small primes.
@@ -72,7 +72,7 @@ func Cosqi(n int, work []float64, ifac []int) {
//
// ifac An integer work array of length at least 15.
//
-// Output parameters
+// Output parameters:
//
// x for i=0, ..., n-1
// x[i] = x[i] + the sum from k=0 to k=n-2 of
@@ -142,8 +142,7 @@ func cosqf1(n int, x, w, xh []float64, ifac []int) {
// The array work which is used by subroutine Cosqb must be
// initialized by calling subroutine Cosqi(n,work).
//
-//
-// Input parameters
+// Input parameters:
//
// n The length of the array x to be transformed. The method
// is most efficient when n is a product of small primes.
@@ -160,7 +159,7 @@ func cosqf1(n int, x, w, xh []float64, ifac []int) {
//
// ifac An integer work array of length at least 15.
//
-// Output parameters
+// Output parameters:
//
// x for i=0, ..., n-1
// x[i]= the sum from k=0 to k=n-1 of

MODIFY
dsp/fourier/internal/fftpack/cost.go
dsp/fourier/internal/fftpack/cost.go
@@ -14,12 +14,12 @@ import "math"
// Cost. The prime factorization of n together with a tabulation
// of the trigonometric functions are computed and stored in work.
//
-// Input parameter
+// Input parameter:
//
// n The length of the sequence to be transformed. The method
// is most efficient when n-1 is a product of small primes.
//
-// Output parameters
+// Output parameters:
//
// work A work array which must be dimensioned at least 3*n.
// Different work arrays are required for different values
@@ -56,7 +56,7 @@ func Costi(n int, work []float64, ifac []int) {
// The array work which is used by subroutine Cost must be
// initialized by calling subroutine Costi(n,work).
//
-// Input parameters
+// Input parameters:
//
// n The length of the sequence x. n must be greater than 1.
// The method is most efficient when n-1 is a product of
@@ -74,7 +74,7 @@ func Costi(n int, work []float64, ifac []int) {
//
// ifac An integer work array of length at least 15.
//
-// Output parameters
+// Output parameters:
//
// x for i=1,...,n
// x(i) = x(1)+(-1)**(i-1)*x(n)

MODIFY
dsp/fourier/internal/fftpack/sinq.go
dsp/fourier/internal/fftpack/sinq.go
@@ -14,12 +14,12 @@ import "math"
// Sinqb. The prime factorization of n together with a tabulation
// of the trigonometric functions are computed and stored in work.
//
-// Input parameter
+// Input parameter:
//
// n The length of the sequence to be transformed. The method
// is most efficient when n+1 is a product of small primes.
//
-// Output parameter
+// Output parameter:
//
// work A work array which must be dimensioned at least 3*n.
// The same work array can be used for both Sinqf and Sinqb
@@ -54,7 +54,7 @@ func Sinqi(n int, work []float64, ifac []int) {
// The array work which is used by subroutine Sinqf must be
// initialized by calling subroutine Sinqi(n,work).
//
-// Input parameters
+// Input parameters:
//
// n The length of the array x to be transformed. The method
// is most efficient when n is a product of small primes.
@@ -71,7 +71,7 @@ func Sinqi(n int, work []float64, ifac []int) {
//
// ifac An integer work array of length at least 15.
//
-// Output parameters
+// Output parameters:
//
// x for i=0, ..., n-1
// x[i] = (-1)^(i)*x[n-1]
@@ -120,7 +120,7 @@ func Sinqf(n int, x, work []float64, ifac []int) {
// The array work which is used by subroutine Sinqb must be
// initialized by calling subroutine Sinqi(n,work).
//
-// Input parameters
+// Input parameters:
//
// n The length of the array x to be transformed. The method
// is most efficient when n is a product of small primes.
@@ -137,7 +137,7 @@ func Sinqf(n int, x, work []float64, ifac []int) {
//
// ifac An integer work array of length at least 15.
//
-// Output parameters
+// Output parameters:
//
// x for i=0, ..., n-1
// x[i]= the sum from k=0 to k=n-1 of

MODIFY
dsp/fourier/internal/fftpack/sint.go
dsp/fourier/internal/fftpack/sint.go
@@ -14,12 +14,12 @@ import "math"
// The prime factorization of n together with a tabulation of the
// trigonometric functions are computed and stored in work.
//
-// Input parameter
+// Input parameter:
//
// n The length of the sequence to be transformed. The method
// is most efficient when n+1 is a product of small primes.
//
-// Output parameter
+// Output parameter:
//
// work A work array with at least ceil(2.5*n) locations.
// Different work arrays are required for different values
@@ -54,7 +54,7 @@ func Sinti(n int, work []float64, ifac []int) {
// The array work which is used by subroutine Sint must be
// initialized by calling subroutine Sinti(n,work).
//
-// Input parameters
+// Input parameters:
//
// n The length of the sequence to be transformed. The method
// is most efficient when n+1 is the product of small primes.
@@ -72,7 +72,7 @@ func Sinti(n int, work []float64, ifac []int) {
//
// ifac An integer work array of length at least 15.
//
-// Output parameters
+// Output parameters:
//
// x for i=1,...,n
// x(i)= the sum from k=1 to k=n

dsp/fourier/internal/fftpack: fix formatting