Trinity Qt initial conversion

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

1 files changed, 5 insertions, 5 deletions

diff --git a/kbabel/common/stringdistance.cpp b/kbabel/common/stringdistance.cpp
index 32cb9b96..8de11c98 100644
--- a/kbabel/common/stringdistance.cpp
+++ b/kbabel/common/stringdistance.cpp
@@ -46,7 +46,7 @@ const int LevenshteinDistance::editCost_insert = 1;
 const int LevenshteinDistance::editCost_delete = 1;
 
 
-double relativeDistance(double distance, const QString& left_string, const QString& right_string)
+double relativeDistance(double distance, const TQString& left_string, const TQString& right_string)
 {
 	double maxsize=0;
 	double compsize=0;
@@ -63,7 +63,7 @@ double relativeDistance(double distance, const QString& left_string, const QStri
   * This function sums all the distances between all trees.
   * For the calculation of the distance between two trees, it calls the function calculate.
   */
-double Distance::operator()(const QString& left_string, const QString& right_string)
+double Distance::operator()(const TQString& left_string, const TQString& right_string)
 {
 	m_distance = 0.00;
 	if (left_string == right_string)
@@ -86,7 +86,7 @@ double Distance::operator()(const QString& left_string, const QString& right_str
 /** This function calculates the distance between two nodes.
   * For the calculation you can specify two variables gap & distance.
   */
-int Distance::nodeDistance(const QString& left_letter, const QString& right_letter)
+int Distance::nodeDistance(const TQString& left_letter, const TQString& right_letter)
 {
 	if ( left_letter == right_letter )
 	{
@@ -105,7 +105,7 @@ int Distance::nodeDistance(const QString& left_letter, const QString& right_lett
   * This function sums all the distances between all nodes.
   * For the calculation you can specify the distance between two nodes in variable distance
   */
-double HammingDistance::calculate(const QString& left_string, const QString& right_string)
+double HammingDistance::calculate(const TQString& left_string, const TQString& right_string)
 {
 	double hammingDistance = 0.00;
 //	if (debug > 0)
@@ -135,7 +135,7 @@ double HammingDistance::calculate(const QString& left_string, const QString& rig
   * A matrice D is generated which represent the distribution of distances between two trees.
   * The last element represent the Levenshtein-distance.
   */
-double LevenshteinDistance::calculate(const QString&  left_string, const QString& right_string)
+double LevenshteinDistance::calculate(const TQString&  left_string, const TQString& right_string)
 {
 //	if (debug > 0)
 //		cout << left_string.length() << " " << right_string.length() << "\t";