rename the following methods:

tqfind find
tqreplace replace
tqcontains contains


git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/dependencies/arts@1246075 283d02a7-25f6-0310-bc7c-ecb5cbfe19da

13 files changed, 17 insertions, 17 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;
diff --git a/flow/gslpp/datahandle.h b/flow/gslpp/datahandle.h
index 1c106ed..26d8c33 100644
--- a/flow/gslpp/datahandle.h
+++ b/flow/gslpp/datahandle.h
@@ -93,7 +93,7 @@ namespace GSL
 							 GslLong cutValueCount);
 
 		/**
-		 * Create a new data handle which tqcontains the same values as
+		 * Create a new data handle which contains the same values as
 		 * this one but in reversed order.
 		 */
 		DataHandle createReversed();
diff --git a/flow/pipebuffer.cc b/flow/pipebuffer.cc
index 532e58f..5fb81fb 100644
--- a/flow/pipebuffer.cc
+++ b/flow/pipebuffer.cc
@@ -97,7 +97,7 @@ void PipeBuffer::skip(long size)
 	{
 		PipeSegment *first = *segments.begin();
 
-		// if we have less data to skip than the first segment tqcontains
+		// if we have less data to skip than the first segment contains
 		if(size < first->remaining())
 		{
 			// skip the data inside the segment
diff --git a/flow/synth_play_wav_impl.cc b/flow/synth_play_wav_impl.cc
index d6eebba..dec68f0 100644
--- a/flow/synth_play_wav_impl.cc
+++ b/flow/synth_play_wav_impl.cc
@@ -38,7 +38,7 @@ extern "C" {
  * so you you may need that extra one.
  *
  * Other versions of libaudiofile seem to have two closing "}" in aupvlist.h,
- * so if you can't compile, this, check that /usr/include/aupvlist.h tqcontains
+ * so if you can't compile, this, check that /usr/include/aupvlist.h contains
  * something like that
  *
  * #ifdef __cplusplus
diff --git a/flow/virtualports.cc b/flow/virtualports.cc
index 0e74606..b733256 100644
--- a/flow/virtualports.cc
+++ b/flow/virtualports.cc
@@ -82,7 +82,7 @@ to delegate the services of a port to another module onto another port.
 The implementation:
 
 Virtualization is implemented here, inside the flow system, using a fairly
-complex forwarding strategy, which will have a graph which tqcontains
+complex forwarding strategy, which will have a graph which contains
 
 - "user-made" connections (made with connect())
 - "virtualize-made" connections, which can be either forwarding
@@ -105,7 +105,7 @@ real connections will be removed, but only these that could possibly be
 affected by this change, and then not all real connections are created new,
 but only those that could possibly be created by this virtual connection.
 
-Every VPort tqcontains a pointer to the "real" port, to let the flow system
+Every VPort contains a pointer to the "real" port, to let the flow system
 know where the "real" connections where real data will flow must be made.
 
 */