diff options
author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-03-02 02:11:59 -0600 |
---|---|---|
committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2012-03-02 02:11:59 -0600 |
commit | 9a75b154bf0732aa3a501b6e31e566e06c5f8a31 (patch) | |
tree | df1e10cc7504665622d096f9ba80dc9e56f3afb8 /src/tools/qgcache.cpp | |
parent | a830bf10b7d4ed2c83ffe68c0b22d7c4ba9860b0 (diff) | |
download | qt3-9a75b154bf0732aa3a501b6e31e566e06c5f8a31.tar.gz qt3-9a75b154bf0732aa3a501b6e31e566e06c5f8a31.zip |
Undo prior accidental commit
Diffstat (limited to 'src/tools/qgcache.cpp')
-rw-r--r-- | src/tools/qgcache.cpp | 28 |
1 files changed, 14 insertions, 14 deletions
diff --git a/src/tools/qgcache.cpp b/src/tools/qgcache.cpp index 2e6294b..3c70d9f 100644 --- a/src/tools/qgcache.cpp +++ b/src/tools/qgcache.cpp @@ -283,7 +283,7 @@ QGCache::QGCache( const QGCache & ) : QPtrCollection() { #if defined(QT_CHECK_NULL) - tqFatal( "QGCache::QGCache(QGCache &): Cannot copy a cache" ); + qFatal( "QGCache::QGCache(QGCache &): Cannot copy a cache" ); #endif } @@ -305,7 +305,7 @@ QGCache::~QGCache() QGCache &QGCache::operator=( const QGCache & ) { #if defined(QT_CHECK_NULL) - tqFatal( "QGCache::operator=: Cannot copy a cache" ); + qFatal( "QGCache::operator=: Cannot copy a cache" ); #endif return *this; } @@ -413,7 +413,7 @@ bool QGCache::insert_other( const char *key, QPtrCollection::Item data, lruList->insertCosts += cost; #endif if ( keytype == AsciiKey && copyk ) - key = tqstrdup( key ); + key = qstrdup( key ); if ( priority < -32768 ) priority = -32768; else if ( priority > 32767 ) @@ -641,28 +641,28 @@ void QGCache::statistics() const #if defined(QT_DEBUG) QString line; line.fill( '*', 80 ); - tqDebug( "%s", line.ascii() ); - tqDebug( "CACHE STATISTICS:" ); - tqDebug( "cache contains %d item%s, with a total cost of %d", + qDebug( "%s", line.ascii() ); + qDebug( "CACHE STATISTICS:" ); + qDebug( "cache contains %d item%s, with a total cost of %d", count(), count() != 1 ? "s" : "", tCost ); - tqDebug( "maximum cost is %d, cache is %d%% full.", + qDebug( "maximum cost is %d, cache is %d%% full.", mCost, (200*tCost + mCost) / (mCost*2) ); - tqDebug( "find() has been called %d time%s", + qDebug( "find() has been called %d time%s", lruList->finds, lruList->finds != 1 ? "s" : "" ); - tqDebug( "%d of these were hits, items found had a total cost of %d.", + qDebug( "%d of these were hits, items found had a total cost of %d.", lruList->hits,lruList->hitCosts ); - tqDebug( "%d item%s %s been inserted with a total cost of %d.", + qDebug( "%d item%s %s been inserted with a total cost of %d.", lruList->inserts,lruList->inserts != 1 ? "s" : "", lruList->inserts != 1 ? "have" : "has", lruList->insertCosts ); - tqDebug( "%d item%s %s too large or had too low priority to be inserted.", + qDebug( "%d item%s %s too large or had too low priority to be inserted.", lruList->insertMisses, lruList->insertMisses != 1 ? "s" : "", lruList->insertMisses != 1 ? "were" : "was" ); - tqDebug( "%d item%s %s been thrown away with a total cost of %d.", + qDebug( "%d item%s %s been thrown away with a total cost of %d.", lruList->dumps, lruList->dumps != 1 ? "s" : "", lruList->dumps != 1 ? "have" : "has", lruList->dumpCosts ); - tqDebug( "Statistics from internal dictionary class:" ); + qDebug( "Statistics from internal dictionary class:" ); dict->statistics(); - tqDebug( "%s", line.ascii() ); + qDebug( "%s", line.ascii() ); #endif } |