summaryrefslogtreecommitdiffstats
path: root/kompare/libdiff2/levenshteintable.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'kompare/libdiff2/levenshteintable.cpp')
-rw-r--r--kompare/libdiff2/levenshteintable.cpp18
1 files changed, 9 insertions, 9 deletions
diff --git a/kompare/libdiff2/levenshteintable.cpp b/kompare/libdiff2/levenshteintable.cpp
index 54525aef..7e4ddbbe 100644
--- a/kompare/libdiff2/levenshteintable.cpp
+++ b/kompare/libdiff2/levenshteintable.cpp
@@ -18,7 +18,7 @@
#include <iostream>
-#include <qstring.h>
+#include <tqstring.h>
#include <kdebug.h>
#include <kglobal.h>
@@ -107,14 +107,14 @@ unsigned int LevenshteinTable::createTable( DifferenceString* source, Difference
m_source = source;
m_destination = destination;
- QString s = ' ' + source->string(); // Optimization, so i dont have to subtract 1 from the indexes every
- QString d = ' ' + destination->string(); // single time and add 1 to the width and height of the table
+ TQString s = ' ' + source->string(); // Optimization, so i dont have to subtract 1 from the indexes every
+ TQString d = ' ' + destination->string(); // single time and add 1 to the width and height of the table
unsigned int m = s.length();
unsigned int n = d.length();
- const QChar* sq = s.unicode();
- const QChar* dq = d.unicode();
+ const TQChar* sq = s.unicode();
+ const TQChar* dq = d.unicode();
if ( m == 1 )
return --n;
@@ -201,7 +201,7 @@ void LevenshteinTable::createListsOfMarkers()
{
case 0: // north
// kdDebug(8101) << "Picking north" << endl;
-// kdDebug(8101) << "Source[" << ( x - 1 ) << "] = " << QString( source[ x-1 ] ) << ", destination[" << ( y - 1 ) << "] = " << QString( destination[ y-1 ] ) << endl;
+// kdDebug(8101) << "Source[" << ( x - 1 ) << "] = " << TQString( source[ x-1 ] ) << ", destination[" << ( y - 1 ) << "] = " << TQString( destination[ y-1 ] ) << endl;
if ( !m_destination->markerList().isEmpty() )
c = m_destination->markerList().first();
@@ -226,7 +226,7 @@ void LevenshteinTable::createListsOfMarkers()
break;
case 1: // northwest
// kdDebug(8101) << "Picking northwest" << endl;
-// kdDebug(8101) << "Source[" << ( x - 1 ) << "] = " << QString( source[ x-1 ] ) << ", destination[" << ( y - 1 ) << "] = " << QString( destination[ y-1 ] ) << endl;
+// kdDebug(8101) << "Source[" << ( x - 1 ) << "] = " << TQString( source[ x-1 ] ) << ", destination[" << ( y - 1 ) << "] = " << TQString( destination[ y-1 ] ) << endl;
if ( !m_destination->markerList().isEmpty() )
c = m_destination->markerList().first();
@@ -271,7 +271,7 @@ void LevenshteinTable::createListsOfMarkers()
break;
case 2: // west
// kdDebug(8101) << "Picking west" << endl;
-// kdDebug(8101) << "Source[" << ( x - 1 ) << "] = " << QString( source[ x-1 ] ) << ", destination[" << ( y - 1 ) << "] = " << QString( destination[ y-1 ] ) << endl;
+// kdDebug(8101) << "Source[" << ( x - 1 ) << "] = " << TQString( source[ x-1 ] ) << ", destination[" << ( y - 1 ) << "] = " << TQString( destination[ y-1 ] ) << endl;
if ( !m_source->markerList().isEmpty() )
c = m_source->markerList().first();
@@ -299,7 +299,7 @@ void LevenshteinTable::createListsOfMarkers()
// kdDebug(8101) << "Source string: " << m_source->string() << endl;
// c = m_source->markerList()->first();
-// QStringList list;
+// TQStringList list;
// unsigned int prevValue = 0;
// for ( ; c; c = m_source->markerList()->next() )
// {