@@ -40,15 +40,15 @@ The library provides C and Fortran interfaces.
40
40
## Interface
41
41
All transform routines take three arguments:
42
42
43
- * a pointer to input data ` x ` ,
44
- * a pointer to output data ` y ` ,
45
- * a pointer to auxiliary data ` a ` .
43
+ * input data pointer ` x ` ,
44
+ * output data pointer ` y ` ,
45
+ * auxiliary data pointer ` a ` .
46
46
47
47
The transform routines are capable of both in-place and out-of-place
48
48
operation. In the latter case the input is left intact.
49
49
50
50
Auxiliary data contain chains of precomputed constants and temporary
51
- memory buffers, required by a transform routine to do its job. Once
51
+ memory buffers, required for a transform routine to do its job. Once
52
52
prepared, the auxiliary data can be reused as many times as needed.
53
53
Also, the same auxiliary data fit for both forward and inverse
54
54
transforms of the same kind.
@@ -117,8 +117,8 @@ array dimensions must be passed in the reverse order:
117
117
118
118
Auxiliary data makers return NULL if an error occured.
119
119
120
- Our definitions of transforms, and input and output data format of the
121
- transform routines, are fully compatible with FFTW.
120
+ Our definitions of transforms, and formats of input and output data, are
121
+ fully compatible with FFTW.
122
122
123
123
### Complex DFT
124
124
![ ] ( docs/dft.svg )
@@ -256,7 +256,7 @@ void minfft_free_aux (minfft_aux *a);
256
256
257
257
## Memory requirements
258
258
Our library does not try to save memory, and allocates temporary buffers
259
- where it benefits performance.
259
+ wherever it benefits performance.
260
260
261
261
The amounts of memory, allocated for the auxiliary data of the
262
262
one-dimensional transforms, are given below:
0 commit comments