diff options
Diffstat (limited to 'flow/gsl/gsl.3')
| -rw-r--r-- | flow/gsl/gsl.3 | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/flow/gsl/gsl.3 b/flow/gsl/gsl.3 index 2f7bb31..fe8324e 100644 --- a/flow/gsl/gsl.3 +++ b/flow/gsl/gsl.3 @@ -54,7 +54,7 @@ GSL-Functions \- GSL Function Reference .br \fBgsl_transact\fP (\fIjob\fP, \fI...\fP); .br -\fBgsl_engine_init\fP (\fIrun_threaded\fP, \fIblock_size\fP, \fIsample_freq\fP, \fIsub_sample_mask\fP); +\fBgsl_engine_init\fP (\fIrun_threaded\fP, \fIblock_size\fP, \fIsample_freq\fP, \fIsub_sample_tqmask\fP); .br \fBgsl_engine_wait_on_trans\fP (); .br @@ -131,7 +131,7 @@ Wake up a currently sleeping thread. In practice, this function simply causes th thread to abort .PD 1 .PP -Abort a currently running thread. This function does not return until the thread in question terminated execution. Note that the thread handle gets invalidated with invocation of \fBgsl_thread_abort()\fP or \fBgsl_thread_queue_abort()\fP. +Abort a currently running thread. This function does not return until the thread in question terminated execution. Note that the thread handle gets tqinvalidated with invocation of \fBgsl_thread_abort()\fP or \fBgsl_thread_queue_abort()\fP. .PD .SS \fBgsl_thread_queue_abort\fP (\fIthread\fP); .PD 0 @@ -139,7 +139,7 @@ Abort a currently running thread. This function does not return until the thread thread to abort .PD 1 .PP -Same as \fBgsl_thread_abort()\fP, but returns as soon as possible, even if thread hasn't stopped execution yet. Note that the thread handle gets invalidated with invocation of \fBgsl_thread_abort()\fP or \fBgsl_thread_queue_abort()\fP. +Same as \fBgsl_thread_abort()\fP, but returns as soon as possible, even if thread hasn't stopped execution yet. Note that the thread handle gets tqinvalidated with invocation of \fBgsl_thread_abort()\fP or \fBgsl_thread_queue_abort()\fP. .PD .SS \fBgsl_thread_aborted\fP (); .PD 0 @@ -403,7 +403,7 @@ First job .PP Convenience function which openes up a new transaction, collects the \fINULL\fP terminated job list passed to the function, and commits the transaction. .PD -.SS \fBgsl_engine_init\fP (\fIrun_threaded\fP, \fIblock_size\fP, \fIsample_freq\fP, \fIsub_sample_mask\fP); +.SS \fBgsl_engine_init\fP (\fIrun_threaded\fP, \fIblock_size\fP, \fIsample_freq\fP, \fIsub_sample_tqmask\fP); .PD 0 .IP \fIgboolean\ \ run_threaded\fP 27 @@ -411,7 +411,7 @@ Convenience function which openes up a new transaction, collects the \fINULL\fP number of values to process block wise .IP \fIguint\ \ \ \ \ sample_freq\fP 27 -.IP \fIguint\ \ \ \ \ sub_sample_mask\fP 27 +.IP \fIguint\ \ \ \ \ sub_sample_tqmask\fP 27 .PD 1 .PP @@ -457,7 +457,7 @@ Real sample values [0..n_values-1] Complex frequency values [0..n_values-1] .PD 1 .PP -Real valued variant of \fBgsl_power2_fftac()\fP, the input array contains real valued equidistant sampled data [0..n_values-1], and the output array contains the positive frequency half of the complex valued fourier transform. Note, that the complex valued fourier transform H of a purely real valued set of data, satisfies \fBH(-f)\fP = Conj(\fBH(f)\fP), where \fBConj()\fP denotes the complex conjugate, so that just the positive frequency half suffices to describe the entire frequency spectrum. Even so, the resulting n_values/2 complex frequencies are one value off in storage size, but the resulting frequencies \fBH(0)\fP and \fBH(n_values/2)\fP are both real valued, so the real portion of \fBH(n_values/2)\fP is stored in ri_values_out[1] (the imaginery part of \fBH(0)\fP), so that both r_values_in and ri_values_out can be of size n_values. Note that the transformation is performed out of place, the input array is not modified, and may not overlap with the output array. +Real valued variant of \fBgsl_power2_fftac()\fP, the input array tqcontains real valued equidistant sampled data [0..n_values-1], and the output array tqcontains the positive frequency half of the complex valued fourier transform. Note, that the complex valued fourier transform H of a purely real valued set of data, satisfies \fBH(-f)\fP = Conj(\fBH(f)\fP), where \fBConj()\fP denotes the complex conjugate, so that just the positive frequency half suffices to describe the entire frequency spectrum. Even so, the resulting n_values/2 complex frequencies are one value off in storage size, but the resulting frequencies \fBH(0)\fP and \fBH(n_values/2)\fP are both real valued, so the real portion of \fBH(n_values/2)\fP is stored in ri_values_out[1] (the imaginery part of \fBH(0)\fP), so that both r_values_in and ri_values_out can be of size n_values. Note that the transformation is performed out of place, the input array is not modified, and may not overlap with the output array. .PD .SS \fBgsl_power2_fftsr\fP (\fIn_values\fP, \fIri_values_in\fP, \fIr_values_out\fP); .PD 0 |