summaryrefslogtreecommitdiffstats
path: root/src/tools/qregexp.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/tools/qregexp.cpp')
-rw-r--r--src/tools/qregexp.cpp52
1 files changed, 26 insertions, 26 deletions
diff --git a/src/tools/qregexp.cpp b/src/tools/qregexp.cpp
index 5b990f8..7d4946d 100644
--- a/src/tools/qregexp.cpp
+++ b/src/tools/qregexp.cpp
@@ -1516,49 +1516,49 @@ void QRegExpEngine::heuristicallyChooseHeuristic()
void QRegExpEngine::dump() const
{
int i, j;
- qDebug( "Case %ssensitive engine", cs ? "" : "in" );
- qDebug( " States" );
+ tqDebug( "Case %ssensitive engine", cs ? "" : "in" );
+ tqDebug( " States" );
for ( i = 0; i < ns; i++ ) {
- qDebug( " %d%s", i,
+ tqDebug( " %d%s", i,
i == InitialState ? " (initial)" :
i == FinalState ? " (final)" : "" );
#ifndef QT_NO_REGEXP_CAPTURE
- qDebug( " in atom %d", s[i]->atom );
+ tqDebug( " in atom %d", s[i]->atom );
#endif
int m = s[i]->match;
if ( (m & CharClassBit) != 0 ) {
- qDebug( " match character class %d", m ^ CharClassBit );
+ tqDebug( " match character class %d", m ^ CharClassBit );
#ifndef QT_NO_REGEXP_CCLASS
cl[m ^ CharClassBit]->dump();
#else
- qDebug( " negative character class" );
+ tqDebug( " negative character class" );
#endif
} else if ( (m & BackRefBit) != 0 ) {
- qDebug( " match back-reference %d", m ^ BackRefBit );
+ tqDebug( " match back-reference %d", m ^ BackRefBit );
} else if ( m >= 0x20 && m <= 0x7e ) {
- qDebug( " match 0x%.4x (%c)", m, m );
+ tqDebug( " match 0x%.4x (%c)", m, m );
} else {
- qDebug( " match 0x%.4x", m );
+ tqDebug( " match 0x%.4x", m );
}
for ( j = 0; j < (int) s[i]->outs.size(); j++ ) {
int next = s[i]->outs[j];
- qDebug( " -> %d", next );
+ tqDebug( " -> %d", next );
if ( s[i]->reenter != 0 && s[i]->reenter->contains(next) )
- qDebug( " [reenter %d]", (*s[i]->reenter)[next] );
+ tqDebug( " [reenter %d]", (*s[i]->reenter)[next] );
if ( s[i]->anchors != 0 && at(*s[i]->anchors, next) != 0 )
- qDebug( " [anchors 0x%.8x]", (*s[i]->anchors)[next] );
+ tqDebug( " [anchors 0x%.8x]", (*s[i]->anchors)[next] );
}
}
#ifndef QT_NO_REGEXP_CAPTURE
if ( nf > 0 ) {
- qDebug( " Atom Parent Capture" );
+ tqDebug( " Atom Parent Capture" );
for ( i = 0; i < nf; i++ )
- qDebug( " %6d %6d %6d", i, f[i].parent, f[i].capture );
+ tqDebug( " %6d %6d %6d", i, f[i].parent, f[i].capture );
}
#endif
#ifndef QT_NO_REGEXP_ANCHOR_ALT
for ( i = 0; i < (int) aa.size(); i++ )
- qDebug( " Anchor alternation 0x%.8x: 0x%.8x 0x%.9x", i, aa[i].a,
+ tqDebug( " Anchor alternation 0x%.8x: 0x%.8x 0x%.9x", i, aa[i].a,
aa[i].b );
#endif
}
@@ -2290,13 +2290,13 @@ bool QRegExpEngine::CharClass::in( QChar ch ) const
void QRegExpEngine::CharClass::dump() const
{
int i;
- qDebug( " %stive character class", n ? "nega" : "posi" );
+ tqDebug( " %stive character class", n ? "nega" : "posi" );
#ifndef QT_NO_REGEXP_CCLASS
if ( c != 0 )
- qDebug( " categories 0x%.8x", c );
+ tqDebug( " categories 0x%.8x", c );
#endif
for ( i = 0; i < (int) r.size(); i++ )
- qDebug( " 0x%.4x through 0x%.4x", r[i].from, r[i].to );
+ tqDebug( " 0x%.4x through 0x%.4x", r[i].from, r[i].to );
}
#endif
#endif
@@ -2559,22 +2559,22 @@ void QRegExpEngine::Box::setupHeuristics()
void QRegExpEngine::Box::dump() const
{
int i;
- qDebug( "Box of at least %d character%s", minl, minl == 1 ? "" : "s" );
- qDebug( " Left states:" );
+ tqDebug( "Box of at least %d character%s", minl, minl == 1 ? "" : "s" );
+ tqDebug( " Left states:" );
for ( i = 0; i < (int) ls.size(); i++ ) {
if ( at(lanchors, ls[i]) == 0 )
- qDebug( " %d", ls[i] );
+ tqDebug( " %d", ls[i] );
else
- qDebug( " %d [anchors 0x%.8x]", ls[i], lanchors[ls[i]] );
+ tqDebug( " %d [anchors 0x%.8x]", ls[i], lanchors[ls[i]] );
}
- qDebug( " Right states:" );
+ tqDebug( " Right states:" );
for ( i = 0; i < (int) rs.size(); i++ ) {
if ( at(ranchors, rs[i]) == 0 )
- qDebug( " %d", rs[i] );
+ tqDebug( " %d", rs[i] );
else
- qDebug( " %d [anchors 0x%.8x]", rs[i], ranchors[rs[i]] );
+ tqDebug( " %d [anchors 0x%.8x]", rs[i], ranchors[rs[i]] );
}
- qDebug( " Skip anchors: 0x%.8x", skipanchors );
+ tqDebug( " Skip anchors: 0x%.8x", skipanchors );
}
#endif