Remove additional unneeded tq method conversions

pull/1/head
Timothy Pearson 13 years ago
parent 56e137ce23
commit 3a828bee4c

@ -166,11 +166,11 @@ KCleanup::confirmation( KFileInfo * item )
if ( item->isDir() || item->isDotEntry() ) if ( item->isDir() || item->isDotEntry() )
{ {
msg = i18n( "%1\nin directory %2" ).tqarg( cleanTitle() ).tqarg( item->url() ); msg = i18n( "%1\nin directory %2" ).arg( cleanTitle() ).arg( item->url() );
} }
else else
{ {
msg = i18n( "%1\nfor file %2" ).tqarg( cleanTitle() ).tqarg( item->url() ); msg = i18n( "%1\nfor file %2" ).arg( cleanTitle() ).arg( item->url() );
} }
if ( KMessageBox::warningContinueCancel( 0, // parentWidget if ( KMessageBox::warningContinueCancel( 0, // parentWidget
@ -252,7 +252,7 @@ KCleanup::executeRecursive( KFileInfo *item )
{ {
/** /**
* Recursively execute in this subdirectory, but only if it * Recursively execute in this subdirectory, but only if it
* really is a directory: File tqchildren might have been * really is a directory: File children might have been
* reparented to the directory (normally, they reside in * reparented to the directory (normally, they reside in
* the dot entry) if there are no real subdirectories on * the dot entry) if there are no real subdirectories on
* this directory level. * this directory level.

@ -228,10 +228,10 @@ KCleanupCollection::addUserCleanups( int number )
if ( _nextUserCleanupNo <= 9 ) if ( _nextUserCleanupNo <= 9 )
// Provide a keyboard shortcut for cleanup #0..#9 // Provide a keyboard shortcut for cleanup #0..#9
title=i18n( "User Defined Cleanup #&%1" ).tqarg(_nextUserCleanupNo); title=i18n( "User Defined Cleanup #&%1" ).arg(_nextUserCleanupNo);
else else
// No keyboard shortcuts for cleanups #10.. - they would be duplicates // No keyboard shortcuts for cleanups #10.. - they would be duplicates
title=i18n( "User Defined Cleanup #%1" ).tqarg(_nextUserCleanupNo); title=i18n( "User Defined Cleanup #%1" ).arg(_nextUserCleanupNo);
_nextUserCleanupNo++; _nextUserCleanupNo++;

@ -824,7 +824,7 @@ KDirStatApp::createTreemapView()
_activityTracker, TQT_SLOT ( trackActivity( int ) ) ); _activityTracker, TQT_SLOT ( trackActivity( int ) ) );
} }
_treemapView->show(); // TQSplitter needs explicit show() for new tqchildren _treemapView->show(); // TQSplitter needs explicit show() for new children
updateActions(); updateActions();
} }

@ -44,17 +44,17 @@ KSettingsDialog::KSettingsDialog( KDirStatApp *mainWin )
{ {
/** /**
* This may seem like overkill, but I didn't find any other way to get * This may seem like overkill, but I didn't find any other way to get
* tqgeometry management right with KDialogBase, yet maintain a modular and * geometry management right with KDialogBase, yet maintain a modular and
* object-oriented design: * object-oriented design:
* *
* Each individual settings page is added with 'addVBoxPage()' to get some * Each individual settings page is added with 'addVBoxPage()' to get some
* initial tqgeometry management. Only then can some generic widget be added * initial geometry management. Only then can some generic widget be added
* into this - and I WANT my settings pages to be generic widgets. I want * into this - and I WANT my settings pages to be generic widgets. I want
* them to be self-sufficient - no monolithic mess of widget creation in my * them to be self-sufficient - no monolithic mess of widget creation in my
* code, intermixed with all kinds of tqlayout objects. * code, intermixed with all kinds of tqlayout objects.
* *
* The ordinary KDialogBase::addPage() just creates a TQFrame which is too * The ordinary KDialogBase::addPage() just creates a TQFrame which is too
* dumb for any kind of tqgeometry management - it cannot even handle one * dumb for any kind of geometry management - it cannot even handle one
* single child right. So, let's have KDialogBase create something more * single child right. So, let's have KDialogBase create something more
* intelligent: A TQVBox (which is derived from TQFrame anyway). This TQVBox * intelligent: A TQVBox (which is derived from TQFrame anyway). This TQVBox
* gets only one child - the KSettingsPage. This KSettingsPage handles its * gets only one child - the KSettingsPage. This KSettingsPage handles its
@ -190,7 +190,7 @@ KTreeColorsPage::KTreeColorsPage( KSettingsDialog * dialog,
{ {
TQString labelText; TQString labelText;
labelText=i18n( "Tree Level %1" ).tqarg(i+1); labelText=i18n( "Tree Level %1" ).arg(i+1);
_colorLabel[i] = new TQLabel( labelText, this ); _colorLabel[i] = new TQLabel( labelText, this );
grid->addWidget( _colorLabel [i], i, 0 ); grid->addWidget( _colorLabel [i], i, 0 );
@ -302,13 +302,13 @@ KCleanupPage::KCleanupPage( KSettingsDialog * dialog,
this, TQT_SLOT ( changeCleanup( KCleanup * ) ) ); this, TQT_SLOT ( changeCleanup( KCleanup * ) ) );
// Fill list box so it can determine a reasonable startup tqgeometry - that // Fill list box so it can determine a reasonable startup geometry - that
// doesn't work if it happens only later. // doesn't work if it happens only later.
setup(); setup();
// Now that _listBox will (hopefully) have determined a reasonable // Now that _listBox will (hopefully) have determined a reasonable
// default tqgeometry, add the widgets to the tqlayout. // default geometry, add the widgets to the tqlayout.
tqlayout->addWidget( _listBox, 0 ); tqlayout->addWidget( _listBox, 0 );
tqlayout->addWidget( _props , 1 ); tqlayout->addWidget( _props , 1 );

@ -396,9 +396,9 @@ namespace KDirStat
* *
* This is meant as a substitute for a tabbed dialog inside the tabbed * This is meant as a substitute for a tabbed dialog inside the tabbed
* dialog which would be much too wide and possibly confusing. Plus, this * dialog which would be much too wide and possibly confusing. Plus, this
* list box is supposed to take care of its own tqgeometry - the normal * list box is supposed to take care of its own geometry - the normal
* dumbass list box obviously cannot do that. It just uses some random * dumbass list box obviously cannot do that. It just uses some random
* tqgeometry, relying on scroll bars for everything else. But in this * geometry, relying on scroll bars for everything else. But in this
* special case we want all items to be visible at all times without scroll * special case we want all items to be visible at all times without scroll
* bars. * bars.
* *

@ -151,7 +151,7 @@ KFileInfo::~KFileInfo()
/** /**
* The destructor should also take care about unlinking this object from * The destructor should also take care about unlinking this object from
* its parent's tqchildren list, but regrettably that just doesn't work: At * its parent's children list, but regrettably that just doesn't work: At
* this point (within the destructor) parts of the object are already * this point (within the destructor) parts of the object are already
* destroyed, e.g., the virtual table - virtual methods don't work any * destroyed, e.g., the virtual table - virtual methods don't work any
* more. Thus, somebody from outside must call deletingChild() just prior * more. Thus, somebody from outside must call deletingChild() just prior
@ -296,11 +296,11 @@ KFileInfo::locate( TQString url, bool findDotEntries )
{ {
if ( _name.right(1) != "/" && // and this is not the root directory if ( _name.right(1) != "/" && // and this is not the root directory
! isDotEntry() ) // or a dot entry: ! isDotEntry() ) // or a dot entry:
return 0; // This can't be any of our tqchildren. return 0; // This can't be any of our children.
} }
// Search all tqchildren // Search all children
KFileInfo *child = firstChild(); KFileInfo *child = firstChild();
@ -323,8 +323,8 @@ KFileInfo::locate( TQString url, bool findDotEntries )
// Search the dot entry if there is one - but only if there is no more // Search the dot entry if there is one - but only if there is no more
// path delimiter left in the URL. The dot entry contains files only, // path delimiter left in the URL. The dot entry contains files only,
// and their names may not contain the path delimiter, nor can they // and their names may not contain the path delimiter, nor can they
// have tqchildren. This check is not strictly necessary, but it may // have children. This check is not strictly necessary, but it may
// speed up things a bit if we don't search the non-directory tqchildren // speed up things a bit if we don't search the non-directory children
// if the rest of the URL consists of several pathname components. // if the rest of the URL consists of several pathname components.
if ( dotEntry() && if ( dotEntry() &&
@ -415,7 +415,7 @@ KDirInfo::~KDirInfo()
KFileInfo *child = _firstChild; KFileInfo *child = _firstChild;
// Recursively delete all tqchildren. // Recursively delete all children.
while ( child ) while ( child )
{ {
@ -585,7 +585,7 @@ KDirInfo::insertChild( KFileInfo *newChild )
* unless something went terribly wrong, e.g. there is no dot entry to use. * unless something went terribly wrong, e.g. there is no dot entry to use.
* If this is a dot entry, store everything it gets directly within it. * If this is a dot entry, store everything it gets directly within it.
* *
* In any of those cases, insert the new child in the tqchildren list. * In any of those cases, insert the new child in the children list.
* *
* We don't bother with this list's order - it's explicitly declared to * We don't bother with this list's order - it's explicitly declared to
* be unordered, so be warned! We simply insert this new child at the * be unordered, so be warned! We simply insert this new child at the
@ -652,7 +652,7 @@ void
KDirInfo::deletingChild( KFileInfo *deletedChild ) KDirInfo::deletingChild( KFileInfo *deletedChild )
{ {
/** /**
* When tqchildren are deleted, things go downhill: Marking the summary * When children are deleted, things go downhill: Marking the summary
* fields as dirty (i.e. outdated) is the only thing that can be done here. * fields as dirty (i.e. outdated) is the only thing that can be done here.
* *
* The accumulated sizes could be updated (by subtracting this deleted * The accumulated sizes could be updated (by subtracting this deleted
@ -672,9 +672,9 @@ KDirInfo::deletingChild( KFileInfo *deletedChild )
if ( ! _beingDestroyed && deletedChild->parent() == this ) if ( ! _beingDestroyed && deletedChild->parent() == this )
{ {
/** /**
* Unlink the child from the tqchildren's list - but only if this doesn't * Unlink the child from the children's list - but only if this doesn't
* happen recursively in the destructor of this object: No use * happen recursively in the destructor of this object: No use
* bothering about the validity of the tqchildren's list if this will all * bothering about the validity of the children's list if this will all
* be history anyway in a moment. * be history anyway in a moment.
**/ **/
@ -689,7 +689,7 @@ KDirInfo::unlinkChild( KFileInfo *deletedChild )
if ( deletedChild->parent() != this ) if ( deletedChild->parent() != this )
{ {
kdError() << deletedChild << " is not a child of " << this kdError() << deletedChild << " is not a child of " << this
<< " - cannot unlink from tqchildren list!" << endl; << " - cannot unlink from children list!" << endl;
return; return;
} }
@ -716,7 +716,7 @@ KDirInfo::unlinkChild( KFileInfo *deletedChild )
} }
kdError() << "Couldn't unlink " << deletedChild << " from " kdError() << "Couldn't unlink " << deletedChild << " from "
<< this << " tqchildren list" << endl; << this << " children list" << endl;
} }
@ -773,14 +773,14 @@ KDirInfo::cleanupDotEntries()
if ( ! _dotEntry || _isDotEntry ) if ( ! _dotEntry || _isDotEntry )
return; return;
// Reparent dot entry tqchildren if there are no subdirectories on this level // Reparent dot entry children if there are no subdirectories on this level
if ( ! _firstChild ) if ( ! _firstChild )
{ {
// kdDebug() << "Removing solo dot entry " << this << " " << endl; // kdDebug() << "Removing solo dot entry " << this << " " << endl;
KFileInfo *child = _dotEntry->firstChild(); KFileInfo *child = _dotEntry->firstChild();
_firstChild = child; // Move the entire tqchildren chain here. _firstChild = child; // Move the entire children chain here.
_dotEntry->setFirstChild( 0 ); // _dotEntry will be deleted below. _dotEntry->setFirstChild( 0 ); // _dotEntry will be deleted below.
while ( child ) while ( child )
@ -791,7 +791,7 @@ KDirInfo::cleanupDotEntries()
} }
// Delete dot entries without any tqchildren // Delete dot entries without any children
if ( ! _dotEntry->firstChild() ) if ( ! _dotEntry->firstChild() )
{ {
@ -1301,7 +1301,7 @@ KDirTree::refresh( KFileInfo *subtree )
/** /**
* This may sound stupid, but the parent must be told to unlink its * This may sound stupid, but the parent must be told to unlink its
* child from the tqchildren list. The child cannot simply do this by * child from the children list. The child cannot simply do this by
* itself in its destructor since at this point important parts of the * itself in its destructor since at this point important parts of the
* object may already be destroyed, e.g., the virtual table - * object may already be destroyed, e.g., the virtual table -
* i.e. virtual methods won't work any more. * i.e. virtual methods won't work any more.
@ -1449,7 +1449,7 @@ KDirTree::deleteSubtree( KFileInfo *subtree )
if ( parent ) if ( parent )
{ {
// Give the parent of the child to be deleted a chance to unlink the // Give the parent of the child to be deleted a chance to unlink the
// child from its tqchildren list and take care of internal summary // child from its children list and take care of internal summary
// fields // fields
parent->deletingChild( subtree ); parent->deletingChild( subtree );
} }

@ -93,8 +93,8 @@ namespace KDirStat
* easily has 150,000+ file system objects, and at least one entry of this * easily has 150,000+ file system objects, and at least one entry of this
* sort is required for each of them. * sort is required for each of them.
* *
* This class provides stubs for tqchildren management, yet those stubs all * This class provides stubs for children management, yet those stubs all
* are default implementations that don't really deal with tqchildren. * are default implementations that don't really deal with children.
* Derived classes need to take care of that. * Derived classes need to take care of that.
* *
* @short Basic file information (like obtained by the lstat() sys call) * @short Basic file information (like obtained by the lstat() sys call)
@ -250,39 +250,39 @@ namespace KDirStat
/** /**
* Returns the total size in bytes of this subtree. * Returns the total size in bytes of this subtree.
* Derived classes that have tqchildren should overwrite this. * Derived classes that have children should overwrite this.
**/ **/
virtual KFileSize totalSize() { return size(); } virtual KFileSize totalSize() { return size(); }
/** /**
* Returns the total size in blocks of this subtree. * Returns the total size in blocks of this subtree.
* Derived classes that have tqchildren should overwrite this. * Derived classes that have children should overwrite this.
**/ **/
virtual KFileSize totalBlocks() { return _blocks; } virtual KFileSize totalBlocks() { return _blocks; }
/** /**
* Returns the total number of tqchildren in this subtree, excluding this item. * Returns the total number of children in this subtree, excluding this item.
* Derived classes that have tqchildren should overwrite this. * Derived classes that have children should overwrite this.
**/ **/
virtual int totalItems() { return 0; } virtual int totalItems() { return 0; }
/** /**
* Returns the total number of subdirectories in this subtree, * Returns the total number of subdirectories in this subtree,
* excluding this item. Dot entries and "." or ".." are not counted. * excluding this item. Dot entries and "." or ".." are not counted.
* Derived classes that have tqchildren should overwrite this. * Derived classes that have children should overwrite this.
**/ **/
virtual int totalSubDirs() { return 0; } virtual int totalSubDirs() { return 0; }
/** /**
* Returns the total number of plain file tqchildren in this subtree, * Returns the total number of plain file children in this subtree,
* excluding this item. * excluding this item.
* Derived classes that have tqchildren should overwrite this. * Derived classes that have children should overwrite this.
**/ **/
virtual int totalFiles() { return 0; } virtual int totalFiles() { return 0; }
/** /**
* Returns the latest modification time of this subtree. * Returns the latest modification time of this subtree.
* Derived classes that have tqchildren should overwrite this. * Derived classes that have children should overwrite this.
**/ **/
virtual time_t latestMtime() { return _mtime; } virtual time_t latestMtime() { return _mtime; }
@ -322,7 +322,7 @@ namespace KDirStat
/** /**
* Returns the number of pending read jobs in this subtree. When this * Returns the number of pending read jobs in this subtree. When this
* number reaches zero, the entire subtree is done. * number reaches zero, the entire subtree is done.
* Derived classes that have tqchildren should overwrite this. * Derived classes that have children should overwrite this.
**/ **/
virtual int pendingReadJobs() { return 0; } virtual int pendingReadJobs() { return 0; }
@ -377,7 +377,7 @@ namespace KDirStat
{ NOT_USED( newFirstChild ); } { NOT_USED( newFirstChild ); }
/** /**
* Returns true if this entry has any tqchildren. * Returns true if this entry has any children.
**/ **/
virtual bool hasChildren() const; virtual bool hasChildren() const;
@ -396,7 +396,7 @@ namespace KDirStat
* *
* Derived classes might or might not wish to overwrite this method; * Derived classes might or might not wish to overwrite this method;
* it's only advisable to do so if a derived class comes up with a * it's only advisable to do so if a derived class comes up with a
* different method than brute-force search all tqchildren. * different method than brute-force search all children.
* *
* 'findDotEntries' specifies if locating "dot entries" (".../<Files>") * 'findDotEntries' specifies if locating "dot entries" (".../<Files>")
* is desired. * is desired.
@ -404,9 +404,9 @@ namespace KDirStat
virtual KFileInfo * locate( TQString url, bool findDotEntries = false ); virtual KFileInfo * locate( TQString url, bool findDotEntries = false );
/** /**
* Insert a child into the tqchildren list. * Insert a child into the children list.
* *
* The order of tqchildren in this list is absolutely undefined; * The order of children in this list is absolutely undefined;
* don't rely on any implementation-specific order. * don't rely on any implementation-specific order.
* *
* This default implementation does nothing. * This default implementation does nothing.
@ -416,7 +416,7 @@ namespace KDirStat
/** /**
* Return the "Dot Entry" for this node if there is one (or 0 * Return the "Dot Entry" for this node if there is one (or 0
* otherwise): This is a pseudo entry that directory nodes use to store * otherwise): This is a pseudo entry that directory nodes use to store
* non-directory tqchildren separately from directories. This way the end * non-directory children separately from directories. This way the end
* user can easily tell which summary fields belong to the directory * user can easily tell which summary fields belong to the directory
* itself and which are the accumulated values of the entire subtree. * itself and which are the accumulated values of the entire subtree.
* *
@ -456,7 +456,7 @@ namespace KDirStat
virtual void childAdded( KFileInfo *newChild ) { NOT_USED( newChild ); } virtual void childAdded( KFileInfo *newChild ) { NOT_USED( newChild ); }
/** /**
* Remove a child from the tqchildren list. * Remove a child from the children list.
* *
* IMPORTANT: This MUST be called just prior to deleting an object of * IMPORTANT: This MUST be called just prior to deleting an object of
* this class. Regrettably, this cannot simply be moved to the * this class. Regrettably, this cannot simply be moved to the
@ -464,7 +464,7 @@ namespace KDirStat
* (e.g., the virtual table - no more virtual methods). * (e.g., the virtual table - no more virtual methods).
* *
* This default implementation does nothing. * This default implementation does nothing.
* Derived classes that can handle tqchildren should overwrite this. * Derived classes that can handle children should overwrite this.
**/ **/
virtual void unlinkChild( KFileInfo *deletedChild ) { NOT_USED( deletedChild ); } virtual void unlinkChild( KFileInfo *deletedChild ) { NOT_USED( deletedChild ); }
@ -580,7 +580,7 @@ namespace KDirStat
/** /**
* A more specialized version of @ref KFileInfo: This class can actually * A more specialized version of @ref KFileInfo: This class can actually
* manage tqchildren. The base class (@ref KFileInfo) has only stubs for the * manage children. The base class (@ref KFileInfo) has only stubs for the
* respective methods to integrate seamlessly with the abstraction of a * respective methods to integrate seamlessly with the abstraction of a
* file / directory tree; this class fills those stubs with life. * file / directory tree; this class fills those stubs with life.
* *
@ -594,7 +594,7 @@ namespace KDirStat
* *
* If "asDotEntry" is set, this will be used as the parent's * If "asDotEntry" is set, this will be used as the parent's
* "dot entry", i.e. the pseudo directory that holds all the parent's * "dot entry", i.e. the pseudo directory that holds all the parent's
* non-directory tqchildren. This is the only way to create a "dot * non-directory children. This is the only way to create a "dot
* entry"! * entry"!
**/ **/
KDirInfo( KDirTree * tree, KDirInfo( KDirTree * tree,
@ -637,7 +637,7 @@ namespace KDirStat
virtual KFileSize totalBlocks(); virtual KFileSize totalBlocks();
/** /**
* Returns the total number of tqchildren in this subtree, excluding this item. * Returns the total number of children in this subtree, excluding this item.
* *
* Reimplemented - inherited from @ref KFileInfo. * Reimplemented - inherited from @ref KFileInfo.
**/ **/
@ -652,7 +652,7 @@ namespace KDirStat
virtual int totalSubDirs(); virtual int totalSubDirs();
/** /**
* Returns the total number of plain file tqchildren in this subtree, * Returns the total number of plain file children in this subtree,
* excluding this item. * excluding this item.
* *
* Reimplemented - inherited from @ref KFileInfo. * Reimplemented - inherited from @ref KFileInfo.
@ -723,9 +723,9 @@ namespace KDirStat
{ _firstChild = newfirstChild; } { _firstChild = newfirstChild; }
/** /**
* Insert a child into the tqchildren list. * Insert a child into the children list.
* *
* The order of tqchildren in this list is absolutely undefined; * The order of children in this list is absolutely undefined;
* don't rely on any implementation-specific order. * don't rely on any implementation-specific order.
**/ **/
virtual void insertChild( KFileInfo *newChild ); virtual void insertChild( KFileInfo *newChild );
@ -733,7 +733,7 @@ namespace KDirStat
/** /**
* Get the "Dot Entry" for this node if there is one (or 0 otherwise): * Get the "Dot Entry" for this node if there is one (or 0 otherwise):
* This is a pseudo entry that directory nodes use to store * This is a pseudo entry that directory nodes use to store
* non-directory tqchildren separately from directories. This way the end * non-directory children separately from directories. This way the end
* user can easily tell which summary fields belong to the directory * user can easily tell which summary fields belong to the directory
* itself and which are the accumulated values of the entire subtree. * itself and which are the accumulated values of the entire subtree.
**/ **/
@ -760,7 +760,7 @@ namespace KDirStat
virtual void childAdded( KFileInfo *newChild ); virtual void childAdded( KFileInfo *newChild );
/** /**
* Remove a child from the tqchildren list. * Remove a child from the children list.
* *
* IMPORTANT: This MUST be called just prior to deleting an object of * IMPORTANT: This MUST be called just prior to deleting an object of
* this class. Regrettably, this cannot simply be moved to the * this class. Regrettably, this cannot simply be moved to the
@ -848,8 +848,8 @@ namespace KDirStat
/** /**
* Clean up unneeded / undesired dot entries: * Clean up unneeded / undesired dot entries:
* Delete dot entries that don't have any tqchildren, * Delete dot entries that don't have any children,
* reparent dot entry tqchildren to the "real" (parent) directory if * reparent dot entry children to the "real" (parent) directory if
* there are not subdirectory siblings at the level of the dot entry. * there are not subdirectory siblings at the level of the dot entry.
**/ **/
void cleanupDotEntries(); void cleanupDotEntries();
@ -862,7 +862,7 @@ namespace KDirStat
// Children management // Children management
KFileInfo * _firstChild; // pointer to the first child KFileInfo * _firstChild; // pointer to the first child
KFileInfo * _dotEntry; // pseudo entry to hold non-dir tqchildren KFileInfo * _dotEntry; // pseudo entry to hold non-dir children
// Some cached values // Some cached values
@ -1252,10 +1252,10 @@ namespace KDirStat
virtual void deletingChildNotify( KFileInfo *deletedChild ); virtual void deletingChildNotify( KFileInfo *deletedChild );
/** /**
* Notification that one or more tqchildren have been deleted. * Notification that one or more children have been deleted.
* *
* Directory read jobs are required to call this when one or more * Directory read jobs are required to call this when one or more
* tqchildren are deleted so the tree can emit the corresponding @ref * children are deleted so the tree can emit the corresponding @ref
* deletingChild() signal. For multiple deletions (e.g. entire * deletingChild() signal. For multiple deletions (e.g. entire
* subtrees) this should only happen once at the end. * subtrees) this should only happen once at the end.
**/ **/

@ -60,7 +60,7 @@ void KFileInfoIterator::next()
{ {
if ( ! _directChildrenProcessed ) if ( ! _directChildrenProcessed )
{ {
// Process direct tqchildren // Process direct children
_current = _current ? _current->next() : _parent->firstChild(); _current = _current ? _current->next() : _parent->firstChild();
@ -98,7 +98,7 @@ void KFileInfoIterator::next()
{ {
if ( _policy == KDotEntryTransparent ) if ( _policy == KDotEntryTransparent )
{ {
// Process dot entry tqchildren // Process dot entry children
_current = _current ? _current = _current ?
_current->next() : _current->next() :
@ -129,7 +129,7 @@ KFileInfoIterator::count()
{ {
int cnt = 0; int cnt = 0;
// Count direct tqchildren // Count direct children
KFileInfo *child = _parent->firstChild(); KFileInfo *child = _parent->firstChild();
@ -144,7 +144,7 @@ KFileInfoIterator::count()
switch ( _policy ) switch ( _policy )
{ {
case KDotEntryTransparent: // Count the dot entry's tqchildren as well. case KDotEntryTransparent: // Count the dot entry's children as well.
if ( _parent->dotEntry() ) if ( _parent->dotEntry() )
{ {
child = _parent->dotEntry()->firstChild(); child = _parent->dotEntry()->firstChild();
@ -183,7 +183,7 @@ KFileInfoSortedIterator::KFileInfoSortedIterator( KFileInfo * parent,
_sortOrder = sortOrder; _sortOrder = sortOrder;
_ascending = ascending; _ascending = ascending;
_initComplete = false; _initComplete = false;
_tqchildrenList = 0; _childrenList = 0;
_current = 0; _current = 0;
} }
@ -191,8 +191,8 @@ KFileInfoSortedIterator::KFileInfoSortedIterator( KFileInfo * parent,
void void
KFileInfoSortedIterator::delayedInit() KFileInfoSortedIterator::delayedInit()
{ {
_tqchildrenList = new KFileInfoList( _sortOrder, _ascending ); _childrenList = new KFileInfoList( _sortOrder, _ascending );
CHECK_PTR( _tqchildrenList ); CHECK_PTR( _childrenList );
if ( _sortOrder == KSortByName ) if ( _sortOrder == KSortByName )
{ {
@ -203,45 +203,45 @@ KFileInfoSortedIterator::delayedInit()
makeChildrenList(); makeChildrenList();
} }
_current = _tqchildrenList->first(); _current = _childrenList->first();
_initComplete = true; _initComplete = true;
} }
KFileInfoSortedIterator::~KFileInfoSortedIterator() KFileInfoSortedIterator::~KFileInfoSortedIterator()
{ {
if ( _tqchildrenList ) if ( _childrenList )
delete _tqchildrenList; delete _childrenList;
} }
void KFileInfoSortedIterator::makeDefaultOrderChildrenList() void KFileInfoSortedIterator::makeDefaultOrderChildrenList()
{ {
// Fill tqchildren list with direct tqchildren // Fill children list with direct children
KFileInfo *child = _parent->firstChild(); KFileInfo *child = _parent->firstChild();
while ( child ) while ( child )
{ {
_tqchildrenList->append( child ); _childrenList->append( child );
child = child->next(); child = child->next();
} }
_tqchildrenList->sort(); _childrenList->sort();
if ( _policy == KDotEntryAsSubDir && _parent->dotEntry() ) if ( _policy == KDotEntryAsSubDir && _parent->dotEntry() )
{ {
// Append dot entry to the tqchildren list // Append dot entry to the children list
_tqchildrenList->append( _parent->dotEntry() ); _childrenList->append( _parent->dotEntry() );
} }
// Append the dot entry's tqchildren to the tqchildren list // Append the dot entry's children to the children list
if ( _policy == KDotEntryTransparent && _parent->dotEntry() ) if ( _policy == KDotEntryTransparent && _parent->dotEntry() )
{ {
// Create a temporary list for the dot entry tqchildren // Create a temporary list for the dot entry children
KFileInfoList dotEntryChildrenList( _sortOrder, _ascending ); KFileInfoList dotEntryChildrenList( _sortOrder, _ascending );
child = _parent->dotEntry()->firstChild(); child = _parent->dotEntry()->firstChild();
@ -255,13 +255,13 @@ void KFileInfoSortedIterator::makeDefaultOrderChildrenList()
dotEntryChildrenList.sort(); dotEntryChildrenList.sort();
// Now append all of this dot entry tqchildren list to the tqchildren list // Now append all of this dot entry children list to the children list
child = dotEntryChildrenList.first(); child = dotEntryChildrenList.first();
while ( child ) while ( child )
{ {
_tqchildrenList->append( child ); _childrenList->append( child );
child = dotEntryChildrenList.next(); child = dotEntryChildrenList.next();
} }
} }
@ -275,11 +275,11 @@ KFileInfoSortedIterator::makeChildrenList()
while ( *it ) while ( *it )
{ {
_tqchildrenList->append( *it ); _childrenList->append( *it );
++it; ++it;
} }
_tqchildrenList->sort(); _childrenList->sort();
} }
@ -298,7 +298,7 @@ void KFileInfoSortedIterator::next()
if ( ! _initComplete ) if ( ! _initComplete )
delayedInit(); delayedInit();
_current = _tqchildrenList->next(); _current = _childrenList->next();
} }
@ -334,12 +334,12 @@ KFileInfoSortedBySizeIterator::makeChildrenList()
while ( *it ) while ( *it )
{ {
if ( (*it)->totalSize() >= _minSize ) if ( (*it)->totalSize() >= _minSize )
_tqchildrenList->append( *it ); _childrenList->append( *it );
++it; ++it;
} }
_tqchildrenList->sort(); _childrenList->sort();
} }

@ -27,9 +27,9 @@ namespace KDirStat
**/ **/
typedef enum typedef enum
{ {
KDotEntryTransparent, // Flatten hierarchy - move dot entry tqchildren up KDotEntryTransparent, // Flatten hierarchy - move dot entry children up
KDotEntryAsSubDir, // Treat dot entry as ordinary subdirectory KDotEntryAsSubDir, // Treat dot entry as ordinary subdirectory
KDotEntryIgnore // Ignore dot entry and its tqchildren completely KDotEntryIgnore // Ignore dot entry and its children completely
} KDotEntryPolicy; } KDotEntryPolicy;
@ -47,8 +47,8 @@ namespace KDirStat
/** /**
* Iterator class for tqchildren of a @ref KFileInfo object. For optimum * Iterator class for children of a @ref KFileInfo object. For optimum
* performance, this iterator class does NOT return tqchildren in any * performance, this iterator class does NOT return children in any
* specific sort order. If you need that, use @ref KFileInfoSortedIterator * specific sort order. If you need that, use @ref KFileInfoSortedIterator
* instead. * instead.
* *
@ -66,37 +66,37 @@ namespace KDirStat
* subdirectory child and each (direct) file child of 'node'. * subdirectory child and each (direct) file child of 'node'.
* Notice: This does not recurse into subdirectories! * Notice: This does not recurse into subdirectories!
* *
* @short (unsorted) iterator for @ref KFileInfo tqchildren. * @short (unsorted) iterator for @ref KFileInfo children.
**/ **/
class KFileInfoIterator class KFileInfoIterator
{ {
public: public:
/** /**
* Constructor: Initialize an iterator object to iterate over the * Constructor: Initialize an iterator object to iterate over the
* tqchildren of 'parent' (unsorted!), depending on 'dotEntryPolicy': * children of 'parent' (unsorted!), depending on 'dotEntryPolicy':
* *
* KDotEntryTransparent (default): * KDotEntryTransparent (default):
* *
* Treat the dot entry as if it wasn't there - pretend to move all its * Treat the dot entry as if it wasn't there - pretend to move all its
* tqchildren up to the real parent. This makes a directory look very * children up to the real parent. This makes a directory look very
* much like the directory on disk, without the dot entry. 'current()' * much like the directory on disk, without the dot entry. 'current()'
* or 'operator*()' will never return the dot entry, but all of its * or 'operator*()' will never return the dot entry, but all of its
* tqchildren. Subdirectories will be processed before any file tqchildren. * children. Subdirectories will be processed before any file children.
* *
* KDotEntryIsSubDir: * KDotEntryIsSubDir:
* *
* Treat the dot entry just like any other subdirectory. Don't iterate * Treat the dot entry just like any other subdirectory. Don't iterate
* over its tqchildren, too (unlike KDotEntryTransparent above). * over its children, too (unlike KDotEntryTransparent above).
* 'current()' or 'operator*()' will return the dot entry, but none of * 'current()' or 'operator*()' will return the dot entry, but none of
* its tqchildren (unless, of course, you create an iterator with the dot * its children (unless, of course, you create an iterator with the dot
* entry as the parent). * entry as the parent).
* *
* KDotEntryIgnore: * KDotEntryIgnore:
* *
* Ignore the dot entry and its tqchildren completely. Useful if tqchildren * Ignore the dot entry and its children completely. Useful if children
* other than subdirectories are not interesting anyway. 'current()' * other than subdirectories are not interesting anyway. 'current()'
* or 'operator*()' will never return the dot entry nor any of its * or 'operator*()' will never return the dot entry nor any of its
* tqchildren. * children.
* *
**/ **/
KFileInfoIterator( KFileInfo * parent, KFileInfoIterator( KFileInfo * parent,
@ -187,13 +187,13 @@ namespace KDirStat
/** /**
* Iterator class for tqchildren of a @ref KFileInfo object. This iterator * Iterator class for children of a @ref KFileInfo object. This iterator
* returns tqchildren sorted by name: Subdirectories first, then the dot * returns children sorted by name: Subdirectories first, then the dot
* entry (if desired - depending on policy), then file tqchildren (if * entry (if desired - depending on policy), then file children (if
* desired). Note: If you don't need the sorting feature, you might want to * desired). Note: If you don't need the sorting feature, you might want to
* use @ref KFileItemIterator instead which has better performance. * use @ref KFileItemIterator instead which has better performance.
* *
* @short sorted iterator for @ref KFileInfo tqchildren. * @short sorted iterator for @ref KFileInfo children.
**/ **/
class KFileInfoSortedIterator: public KFileInfoIterator class KFileInfoSortedIterator: public KFileInfoIterator
{ {
@ -248,15 +248,15 @@ namespace KDirStat
void delayedInit(); void delayedInit();
/** /**
* Make a 'default order' tqchildren list: * Make a 'default order' children list:
* First all subdirectories sorted by name, * First all subdirectories sorted by name,
* then the dot entry (depending on policy), * then the dot entry (depending on policy),
* then the dot entry's tqchildren (depending on policy). * then the dot entry's children (depending on policy).
**/ **/
virtual void makeDefaultOrderChildrenList(); virtual void makeDefaultOrderChildrenList();
/** /**
* Make a sorted tqchildren list according to the current sort * Make a sorted children list according to the current sort
* criteria - unless KSortByName is requested, in which case * criteria - unless KSortByName is requested, in which case
* makeDefaultOrderChildrenList() above is used. * makeDefaultOrderChildrenList() above is used.
**/ **/
@ -265,7 +265,7 @@ namespace KDirStat
// Data members // Data members
KFileInfoList * _tqchildrenList; KFileInfoList * _childrenList;
KFileInfoSortOrder _sortOrder; KFileInfoSortOrder _sortOrder;
bool _ascending; bool _ascending;
bool _initComplete; bool _initComplete;
@ -276,8 +276,8 @@ namespace KDirStat
/** /**
* Specialized KFileInfo iterator that sorts by (total) size, yet * Specialized KFileInfo iterator that sorts by (total) size, yet
* disregards tqchildren below a minimum size. This can considerably improve * disregards children below a minimum size. This can considerably improve
* performance if the number of tqchildren that need to be sorted decreases * performance if the number of children that need to be sorted decreases
* dramatically. * dramatically.
* *
* For example, treemaps can only display a limited portion of large * For example, treemaps can only display a limited portion of large
@ -307,7 +307,7 @@ namespace KDirStat
protected: protected:
/** /**
* Create the (sorted) tqchildren list. Disregard tqchildren below minSize. * Create the (sorted) children list. Disregard children below minSize.
* Reimplemented from KFileInfoSortedIterator. * Reimplemented from KFileInfoSortedIterator.
**/ **/
virtual void makeChildrenList(); virtual void makeChildrenList();

@ -433,7 +433,7 @@ void
KDirTreeView::slotFinished() KDirTreeView::slotFinished()
{ {
emit progressInfo( i18n( "Finished. Elapsed time: %1" ) emit progressInfo( i18n( "Finished. Elapsed time: %1" )
.tqarg( formatTime( _stopWatch.elapsed(), true ) ) ); .arg( formatTime( _stopWatch.elapsed(), true ) ) );
if ( _updateTimer ) if ( _updateTimer )
{ {
@ -463,7 +463,7 @@ void
KDirTreeView::slotAborted() KDirTreeView::slotAborted()
{ {
emit progressInfo( i18n( "Aborted. Elapsed time: %1" ) emit progressInfo( i18n( "Aborted. Elapsed time: %1" )
.tqarg( formatTime( _stopWatch.elapsed(), true ) ) ); .arg( formatTime( _stopWatch.elapsed(), true ) ) );
if ( _updateTimer ) if ( _updateTimer )
{ {
@ -499,11 +499,11 @@ KDirTreeView::sendProgressInfo( const TQString & newCurrentDir )
#if VERBOSE_PROGRESS_INFO #if VERBOSE_PROGRESS_INFO
emit progressInfo( i18n( "Elapsed time: %1 reading directory %2" ) emit progressInfo( i18n( "Elapsed time: %1 reading directory %2" )
.tqarg( formatTime( _stopWatch.elapsed() ) ) .arg( formatTime( _stopWatch.elapsed() ) )
.tqarg( _currentDir ) ); .arg( _currentDir ) );
#else #else
emit progressInfo( i18n( "Elapsed time: %1" ) emit progressInfo( i18n( "Elapsed time: %1" )
.tqarg( formatTime( _stopWatch.elapsed() ) ) ); .arg( formatTime( _stopWatch.elapsed() ) ) );
#endif #endif
} }
@ -778,19 +778,19 @@ KDirTreeView::popupContextMenu( TQListViewItem * listViewItem,
if ( orig->isSparseFile() ) if ( orig->isSparseFile() )
{ {
text = i18n( "Sparse file: %1 (%2 Bytes) -- allocated: %3 (%4 Bytes)" ) text = i18n( "Sparse file: %1 (%2 Bytes) -- allocated: %3 (%4 Bytes)" )
.tqarg( formatSize( orig->byteSize() ) ) .arg( formatSize( orig->byteSize() ) )
.tqarg( formatSizeLong( orig->byteSize() ) ) .arg( formatSizeLong( orig->byteSize() ) )
.tqarg( formatSize( orig->allocatedSize() ) ) .arg( formatSize( orig->allocatedSize() ) )
.tqarg( formatSizeLong( orig->allocatedSize() ) ); .arg( formatSizeLong( orig->allocatedSize() ) );
} }
else else
{ {
text = i18n( "%1 (%2 Bytes) with %3 hard links => effective size: %4 (%5 Bytes)" ) text = i18n( "%1 (%2 Bytes) with %3 hard links => effective size: %4 (%5 Bytes)" )
.tqarg( formatSize( orig->byteSize() ) ) .arg( formatSize( orig->byteSize() ) )
.tqarg( formatSizeLong( orig->byteSize() ) ) .arg( formatSizeLong( orig->byteSize() ) )
.tqarg( orig->links() ) .arg( orig->links() )
.tqarg( formatSize( orig->size() ) ) .arg( formatSize( orig->size() ) )
.tqarg( formatSizeLong( orig->size() ) ); .arg( formatSizeLong( orig->size() ) );
} }
popupContextInfo( pos, text ); popupContextInfo( pos, text );
@ -832,8 +832,8 @@ KDirTreeView::popupContextSizeInfo( const TQPoint & pos,
else else
{ {
info = i18n( "%1 (%2 Bytes)" ) info = i18n( "%1 (%2 Bytes)" )
.tqarg( formatSize( size ) ) .arg( formatSize( size ) )
.tqarg( formatSizeLong( size ) ); .arg( formatSizeLong( size ) );
} }
popupContextInfo( pos, info ); popupContextInfo( pos, info );
@ -1021,15 +1021,15 @@ KDirTreeViewItem::init( KDirTreeView * view,
if ( _orig->isSparseFile() ) if ( _orig->isSparseFile() )
{ {
text = i18n( "%1 / %2 Links (allocated: %3)" ) text = i18n( "%1 / %2 Links (allocated: %3)" )
.tqarg( formatSize( _orig->byteSize() ) ) .arg( formatSize( _orig->byteSize() ) )
.tqarg( formatSize( _orig->links() ) ) .arg( formatSize( _orig->links() ) )
.tqarg( formatSize( _orig->allocatedSize() ) ); .arg( formatSize( _orig->allocatedSize() ) );
} }
else else
{ {
text = i18n( "%1 / %2 Links" ) text = i18n( "%1 / %2 Links" )
.tqarg( formatSize( _orig->byteSize() ) ) .arg( formatSize( _orig->byteSize() ) )
.tqarg( _orig->links() ); .arg( _orig->links() );
} }
} }
else // No multiple links or no regular file else // No multiple links or no regular file
@ -1037,8 +1037,8 @@ KDirTreeViewItem::init( KDirTreeView * view,
if ( _orig->isSparseFile() ) if ( _orig->isSparseFile() )
{ {
text = i18n( "%1 (allocated: %2)" ) text = i18n( "%1 (allocated: %2)" )
.tqarg( formatSize( _orig->byteSize() ) ) .arg( formatSize( _orig->byteSize() ) )
.tqarg( formatSize( _orig->allocatedSize() ) ); .arg( formatSize( _orig->allocatedSize() ) );
} }
else else
{ {
@ -1065,9 +1065,9 @@ KDirTreeViewItem::init( KDirTreeView * view,
* Determine whether or not this item can be opened. * Determine whether or not this item can be opened.
* *
* Normally, TQt handles this very well, but when lazy cloning is in * Normally, TQt handles this very well, but when lazy cloning is in
* effect, TQt cannot know whether or not there are tqchildren - they may * effect, TQt cannot know whether or not there are children - they may
* only be in the original tree until the user tries to open this * only be in the original tree until the user tries to open this
* item. So let's assume there may be tqchildren as long as the directory * item. So let's assume there may be children as long as the directory
* is still being read. * is still being read.
*/ */
@ -1170,7 +1170,7 @@ KDirTreeViewItem::updateSummary()
TQString text = ""; TQString text = "";
if ( jobs > 0 ) if ( jobs > 0 )
text = i18n( "[%1 Read Jobs]" ).tqarg( formatCount( _orig->pendingReadJobs(), true ) ); text = i18n( "[%1 Read Jobs]" ).arg( formatCount( _orig->pendingReadJobs(), true ) );
setText( _view->readJobsCol(), text ); setText( _view->readJobsCol(), text );
#endif #endif
} }
@ -1202,15 +1202,15 @@ KDirTreeViewItem::updateSummary()
if ( ! _pacMan ) if ( ! _pacMan )
_pacMan = new KPacManAnimation( _view, height()-4, true ); _pacMan = new KPacManAnimation( _view, height()-4, true );
tqrepaint(); repaint();
} }
if ( ! isOpen() ) // Lazy update: Nobody can see the tqchildren if ( ! isOpen() ) // Lazy update: Nobody can see the children
return; // -> don't update them. return; // -> don't update them.
// Update all tqchildren // Update all children
KDirTreeViewItem *child = firstChild(); KDirTreeViewItem *child = firstChild();
@ -1231,7 +1231,7 @@ KDirTreeViewItem::locate( KFileInfo * wanted,
if ( lazy && ! isOpen() ) if ( lazy && ! isOpen() )
{ {
/* /*
* In "lazy" mode, we don't bother searching all the tqchildren of this * In "lazy" mode, we don't bother searching all the children of this
* item if they are not visible (i.e. the branch is open) anyway. In * item if they are not visible (i.e. the branch is open) anyway. In
* this case, cloning that branch is deferred until the branch is * this case, cloning that branch is deferred until the branch is
* actually opened - which in most cases will never happen anyway (most * actually opened - which in most cases will never happen anyway (most
@ -1243,7 +1243,7 @@ KDirTreeViewItem::locate( KFileInfo * wanted,
* *
* Note that this mode is _independent_ of lazy cloning in general: The * Note that this mode is _independent_ of lazy cloning in general: The
* caller explicitly specifies if he wants to locate an item at all * caller explicitly specifies if he wants to locate an item at all
* cost, even if that means deferred cloning tqchildren whose creation * cost, even if that means deferred cloning children whose creation
* has been delayed until now. * has been delayed until now.
*/ */
@ -1261,13 +1261,13 @@ KDirTreeViewItem::locate( KFileInfo * wanted,
if ( wanted->urlPart( level ) == _orig->name() ) if ( wanted->urlPart( level ) == _orig->name() )
{ {
// Search all tqchildren // Search all children
KDirTreeViewItem *child = firstChild(); KDirTreeViewItem *child = firstChild();
if ( ! child && _orig->hasChildren() && doClone ) if ( ! child && _orig->hasChildren() && doClone )
{ {
// kdDebug() << "Deferred cloning " << this << " for tqchildren search of " << wanted << endl; // kdDebug() << "Deferred cloning " << this << " for children search of " << wanted << endl;
deferredClone(); deferredClone();
child = firstChild(); child = firstChild();
} }
@ -1294,14 +1294,14 @@ KDirTreeViewItem::deferredClone()
if ( ! _orig->hasChildren() ) if ( ! _orig->hasChildren() )
{ {
// kdDebug() << k_funcinfo << "Oops, no tqchildren - sorry for bothering you!" << endl; // kdDebug() << k_funcinfo << "Oops, no children - sorry for bothering you!" << endl;
setExpandable( false ); setExpandable( false );
return; return;
} }
// Clone all normal tqchildren // Clone all normal children
int level = _orig->treeLevel(); int level = _orig->treeLevel();
bool startingClean = ! firstChild(); bool startingClean = ! firstChild();
@ -1367,7 +1367,7 @@ KDirTreeViewItem::cleanupDotEntries()
return; return;
// Reparent dot entry tqchildren if there are no subdirectories on this level // Reparent dot entry children if there are no subdirectories on this level
if ( ! _orig->firstChild() ) if ( ! _orig->firstChild() )
{ {
@ -1391,9 +1391,9 @@ KDirTreeViewItem::cleanupDotEntries()
/* /*
* Immediately delete the (now emptied) dot entry. The algorithm for * Immediately delete the (now emptied) dot entry. The algorithm for
* the original tree doesn't quite fit here - there, the dot entry is * the original tree doesn't quite fit here - there, the dot entry is
* actually deleted in the step below. But the 'no tqchildren' check for * actually deleted in the step below. But the 'no children' check for
* this fails here since the original dot entry still _has_ its * this fails here since the original dot entry still _has_ its
* tqchildren - they will be deleted only after all clones have been * children - they will be deleted only after all clones have been
* processed. * processed.
* *
* This had been the cause for a core that took me quite some time to * This had been the cause for a core that took me quite some time to
@ -1404,7 +1404,7 @@ KDirTreeViewItem::cleanupDotEntries()
} }
// Delete dot entries without any tqchildren // Delete dot entries without any children
if ( ! _orig->dotEntry()->firstChild() && dotEntry ) if ( ! _orig->dotEntry()->firstChild() && dotEntry )
{ {
@ -1596,7 +1596,7 @@ KDirTreeViewItem::paintCell( TQPainter * painter,
const TQColorGroup & colorGroup, const TQColorGroup & colorGroup,
int column, int column,
int width, int width,
int tqalignment ) int alignment )
{ {
// _view->incDebugCount(5); // _view->incDebugCount(5);
@ -1637,7 +1637,7 @@ KDirTreeViewItem::paintCell( TQPainter * painter,
colorGroup, colorGroup,
column, column,
width, width,
tqalignment ); alignment );
} }
else else
{ {
@ -1657,7 +1657,7 @@ KDirTreeViewItem::paintCell( TQPainter * painter,
colorGroup, colorGroup,
column, column,
width, width,
tqalignment ); alignment );
} }
} }

@ -148,7 +148,7 @@ namespace KDirStat
* Set the fill color of percentage bars of the specified directory * Set the fill color of percentage bars of the specified directory
* level (0..KDirTreeViewMaxFillColor-1). * level (0..KDirTreeViewMaxFillColor-1).
* *
* Calling tqrepaint() after setting all desired colors is the * Calling repaint() after setting all desired colors is the
* caller's responsibility. * caller's responsibility.
**/ **/
void setFillColor( int level, const TQColor &color ); void setFillColor( int level, const TQColor &color );
@ -172,7 +172,7 @@ namespace KDirStat
/** /**
* Set the tree background color. * Set the tree background color.
* *
* Calling tqrepaint() after setting all desired colors is the * Calling repaint() after setting all desired colors is the
* caller's responsibility. * caller's responsibility.
**/ **/
void setTreeBackground( const TQColor &color ); void setTreeBackground( const TQColor &color );
@ -720,8 +720,8 @@ namespace KDirStat
void setIcon(); void setIcon();
/** /**
* Remove dot entry if it doesn't have any tqchildren. * Remove dot entry if it doesn't have any children.
* Reparent all of the dot entry's tqchildren if there are no * Reparent all of the dot entry's children if there are no
* subdirectories on this level. * subdirectories on this level.
**/ **/
void cleanupDotEntries(); void cleanupDotEntries();
@ -748,7 +748,7 @@ namespace KDirStat
const TQColorGroup & colorGroup, const TQColorGroup & colorGroup,
int column, int column,
int width, int width,
int tqalignment ); int alignment );
/** /**
* Paint a percentage bar into a @ref TQListViewItem cell. * Paint a percentage bar into a @ref TQListViewItem cell.

@ -254,14 +254,14 @@ KPacMan::stop()
if ( _timer ) if ( _timer )
_timer->stop(); _timer->stop();
tqrepaint(); repaint();
} }
void void
KPacMan::animate() KPacMan::animate()
{ {
tqrepaint( false ); repaint( false );
} }

@ -79,7 +79,7 @@ KTreemapTile::init()
// Set up height (z coordinate) - one level higher than the parent so this // Set up height (z coordinate) - one level higher than the parent so this
// will be closer to the foreground. // will be closer to the foreground.
// //
// Note that this must happen before any tqchildren are created. // Note that this must happen before any children are created.
// I found that out the hard way. ;-) // I found that out the hard way. ;-)
setZ( _parentTile ? ( _parentTile->z() + 1.0 ) : 0.0 ); setZ( _parentTile ? ( _parentTile->z() + 1.0 ) : 0.0 );

@ -125,7 +125,7 @@ namespace KDirStat
/** /**
* This is the basic building block of a treemap view: One single tile of a * This is the basic building block of a treemap view: One single tile of a
* treemap. If it corresponds to a leaf in the tree, it will be visible as * treemap. If it corresponds to a leaf in the tree, it will be visible as
* one tile (one rectangle) of the treemap. If it has tqchildren, it will be * one tile (one rectangle) of the treemap. If it has children, it will be
* subdivided again. * subdivided again.
* *
* @short Basic building block of a treemap * @short Basic building block of a treemap
@ -192,13 +192,13 @@ namespace KDirStat
protected: protected:
/** /**
* Create tqchildren (sub-tiles) of this tile. * Create children (sub-tiles) of this tile.
**/ **/
void createChildren ( const TQRect & rect, void createChildren ( const TQRect & rect,
KOrientation orientation ); KOrientation orientation );
/** /**
* Create tqchildren (sub-tiles) using the simple treemap algorithm: * Create children (sub-tiles) using the simple treemap algorithm:
* Alternate between horizontal and vertical subdivision in each * Alternate between horizontal and vertical subdivision in each
* level. Each child will get the entire height or width, respectively, * level. Each child will get the entire height or width, respectively,
* of the specified rectangle. This algorithm is very fast, but often * of the specified rectangle. This algorithm is very fast, but often
@ -208,12 +208,12 @@ namespace KDirStat
KOrientation orientation ); KOrientation orientation );
/** /**
* Create tqchildren using the "squarified treemaps" algorithm as * Create children using the "squarified treemaps" algorithm as
* described by Mark Bruls, Kees Huizing, and Jarke J. van Wijk of the * described by Mark Bruls, Kees Huizing, and Jarke J. van Wijk of the
* TU Eindhoven, NL. * TU Eindhoven, NL.
* *
* This algorithm is not quite so simple and involves more expensive * This algorithm is not quite so simple and involves more expensive
* operations, e.g., sorting the tqchildren of each node by size first, * operations, e.g., sorting the children of each node by size first,
* try some variations of the tqlayout and maybe backtrack to the * try some variations of the tqlayout and maybe backtrack to the
* previous attempt. But it results in tiles that are much more * previous attempt. But it results in tiles that are much more
* square-like, i.e. have more reasonable width-to-height ratios. It is * square-like, i.e. have more reasonable width-to-height ratios. It is
@ -221,14 +221,14 @@ namespace KDirStat
* point at and even harder to compare visually against each other. * point at and even harder to compare visually against each other.
* *
* This implementation includes some improvements to that basic * This implementation includes some improvements to that basic
* algorithm. For example, tqchildren below a certain size are * algorithm. For example, children below a certain size are
* disregarded completely since they will not get an adequate visual * disregarded completely since they will not get an adequate visual
* representation anyway (it would be way too small). They are * representation anyway (it would be way too small). They are
* summarized in some kind of 'misc stuff' area in the parent treemap * summarized in some kind of 'misc stuff' area in the parent treemap
* tile - in fact, part of the parent directory's tile can be "seen * tile - in fact, part of the parent directory's tile can be "seen
* through". * through".
* *
* In short, a lot of small tqchildren that don't have any useful effect * In short, a lot of small children that don't have any useful effect
* for the user in finding wasted disk space are omitted from handling * for the user in finding wasted disk space are omitted from handling
* and, most important, don't need to be sorted by size (which has a * and, most important, don't need to be sorted by size (which has a
* cost of O(n*ln(n)) in the best case, so reducing n helps a lot). * cost of O(n*ln(n)) in the best case, so reducing n helps a lot).
@ -236,9 +236,9 @@ namespace KDirStat
void createSquarifiedChildren( const TQRect & rect ); void createSquarifiedChildren( const TQRect & rect );
/** /**
* Squarify as many tqchildren as possible: Try to squeeze members * Squarify as many children as possible: Try to squeeze members
* referred to by 'it' into 'rect' until the aspect ratio doesn't get * referred to by 'it' into 'rect' until the aspect ratio doesn't get
* better any more. Returns a list of tqchildren that should be laid out * better any more. Returns a list of children that should be laid out
* in 'rect'. Moves 'it' until there is no more improvement or 'it' * in 'rect'. Moves 'it' until there is no more improvement or 'it'
* runs out of items. * runs out of items.
* *

Loading…
Cancel
Save