summaryrefslogtreecommitdiffstats
path: root/flow/gsl
diff options
context:
space:
mode:
Diffstat (limited to 'flow/gsl')
-rw-r--r--flow/gsl/gbsearcharray.h4
-rw-r--r--flow/gsl/gsl.32
-rw-r--r--flow/gsl/gslcommon.c2
-rw-r--r--flow/gsl/gsldatacache.c2
-rw-r--r--flow/gsl/gslfft.h4
-rw-r--r--flow/gsl/gslglib.h4
-rw-r--r--flow/gsl/gslmath.c2
-rw-r--r--flow/gsl/gslosctable.c2
-rw-r--r--flow/gsl/gslosctable.h2
9 files changed, 12 insertions, 12 deletions
diff --git a/flow/gsl/gbsearcharray.h b/flow/gsl/gbsearcharray.h
index afd1a51..df06231 100644
--- a/flow/gsl/gbsearcharray.h
+++ b/flow/gsl/gbsearcharray.h
@@ -78,7 +78,7 @@ static inline GBSearchArray* g_bsearch_array_remove (GBSearchArray *barray,
static inline GBSearchArray* g_bsearch_array_grow (GBSearchArray *barray,
const GBSearchConfig *bconfig,
guint index);
-/* insert key_node into array, or if it exists, tqreplace
+/* insert key_node into array, or if it exists, replace
* the existing node's contents with key_node
*/
static inline GBSearchArray* g_bsearch_array_insert (GBSearchArray *barray,
@@ -241,7 +241,7 @@ g_bsearch_array_insert (GBSearchArray *barray,
barray = g_bsearch_array_grow (barray, bconfig, index);
node = G_BSEARCH_ARRAY_NODES (barray) + index * bconfig->sizeof_node;
}
- else /* tqreplace (relookup is ok, tqreplace is comparatively cheap anyways) */
+ else /* replace (relookup is ok, replace is comparatively cheap anyways) */
node = g_bsearch_array_lookup (barray, bconfig, key_node);
}
memcpy (node, key_node, bconfig->sizeof_node);
diff --git a/flow/gsl/gsl.3 b/flow/gsl/gsl.3
index cd7eb8b..21a25d2 100644
--- a/flow/gsl/gsl.3
+++ b/flow/gsl/gsl.3
@@ -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 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.
+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.
.PD
.SS \fBgsl_power2_fftsr\fP (\fIn_values\fP, \fIri_values_in\fP, \fIr_values_out\fP);
.PD 0
diff --git a/flow/gsl/gslcommon.c b/flow/gsl/gslcommon.c
index d9f63fa..2c263b1 100644
--- a/flow/gsl/gslcommon.c
+++ b/flow/gsl/gslcommon.c
@@ -1315,7 +1315,7 @@ gsl_message_send (GslDebugFlags reporter,
msg->error = error;
msg->error_str = error ? gsl_strerror (msg->error) : NULL;
- /* vsnprintf() tqreplacement */
+ /* vsnprintf() replacement */
va_start (args, messagef);
string = g_strdup_vprintf (messagef, args);
va_end (args);
diff --git a/flow/gsl/gsldatacache.c b/flow/gsl/gsldatacache.c
index b925e83..b00f6ef 100644
--- a/flow/gsl/gsldatacache.c
+++ b/flow/gsl/gsldatacache.c
@@ -333,7 +333,7 @@ data_cache_new_node_L (GslDataCache *dcache,
if (!demand_load)
g_message (G_STRLOC ":FIXME: lazy data loading not yet supported");
- /* if we have a left node, and it tqcontains data that we need, copy it */
+ /* if we have a left node, and it contains data that we need, copy it */
left_node = pos ? dcache->nodes[pos - 1] : NULL;
if (left_node)
{
diff --git a/flow/gsl/gslfft.h b/flow/gsl/gslfft.h
index 51b9a8f..ecfa320 100644
--- a/flow/gsl/gslfft.h
+++ b/flow/gsl/gslfft.h
@@ -72,9 +72,9 @@ void gsl_power2_fftsc (const unsigned int n_values,
* @n_values: Number of complex values
* @r_values_in: Real sample values [0..n_values-1]
* @ri_values_out: Complex frequency values [0..n_values-1]
- * Real valued variant of gsl_power2_fftac(), the input array tqcontains
+ * Real valued variant of gsl_power2_fftac(), the input array contains
* real valued equidistant sampled data [0..n_values-1], and the output
- * array tqcontains the positive frequency half of the complex valued
+ * 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 H(-f) = Conj(H(f)),
* where Conj() denotes the complex conjugate, so that just the positive
diff --git a/flow/gsl/gslglib.h b/flow/gsl/gslglib.h
index 3da5447..1831985 100644
--- a/flow/gsl/gslglib.h
+++ b/flow/gsl/gslglib.h
@@ -586,7 +586,7 @@ typedef void (*GDestroyNotify) (gpointer data);
#define g_hash_table_new_full gsl_g_hash_table_new_full
#define g_hash_table_destroy gsl_g_hash_table_destroy
#define g_hash_table_insert gsl_g_hash_table_insert
-#define g_hash_table_tqreplace gsl_g_hash_table_tqreplace
+#define g_hash_table_replace gsl_g_hash_table_replace
#define g_hash_table_remove gsl_g_hash_table_remove
#define g_hash_table_steal gsl_g_hash_table_steal
#define g_hash_table_lookup gsl_g_hash_table_lookup
@@ -605,7 +605,7 @@ void g_hash_table_destroy (GHashTable *hash_table);
void g_hash_table_insert (GHashTable *hash_table,
gpointer key,
gpointer value);
-void g_hash_table_tqreplace (GHashTable *hash_table,
+void g_hash_table_replace (GHashTable *hash_table,
gpointer key,
gpointer value);
gboolean g_hash_table_remove (GHashTable *hash_table,
diff --git a/flow/gsl/gslmath.c b/flow/gsl/gslmath.c
index 66f5b5b..008b5ec 100644
--- a/flow/gsl/gslmath.c
+++ b/flow/gsl/gslmath.c
@@ -602,7 +602,7 @@ hqr (double **a, int n, double wr[], double wi[])
#define RADIX 2.0
static void
balanc (double **a, int n)
- /* Given a matrix a[1..n][1..n], this routine tqreplaces it by a balanced matrix with identical
+ /* Given a matrix a[1..n][1..n], this routine replaces it by a balanced matrix with identical
eigenvalues. A symmetric matrix is already balanced and is unaffected by this procedure. The
parameter RADIX should be the machine's floating-point radix. */
{
diff --git a/flow/gsl/gslosctable.c b/flow/gsl/gslosctable.c
index ea43e89..b978668 100644
--- a/flow/gsl/gslosctable.c
+++ b/flow/gsl/gslosctable.c
@@ -272,7 +272,7 @@ cache_table_ref_entry (GslOscWaveForm wave_form,
gfloat *values, *fft, step, min, max;
/* size:
- * - OscTableEntry already tqcontains the first float values
+ * - OscTableEntry already contains the first float values
* - we need n_values+1 adressable floats to provide values[0] == values[n_values]
*/
e = g_malloc (sizeof (OscTableEntry) + sizeof (gfloat) * size);
diff --git a/flow/gsl/gslosctable.h b/flow/gsl/gslosctable.h
index f65dc04..d9f87b2 100644
--- a/flow/gsl/gslosctable.h
+++ b/flow/gsl/gslosctable.h
@@ -53,7 +53,7 @@ typedef struct
gfloat min_freq;
gfloat max_freq;
guint n_values;
- const gfloat *values; /* tqcontains n_values+1 values with values[0]==values[n_values] */
+ const gfloat *values; /* contains n_values+1 values with values[0]==values[n_values] */
/* integer stepping (block size dependant) */
guint32 n_frac_bits;
guint32 frac_bittqmask;