Remove additional unneeded tq method conversions

1 files changed, 9 insertions, 9 deletions

diff --git a/kdirstat/ktreemaptile.h b/kdirstat/ktreemaptile.h
index 26d8f45..fc2ea07 100644
--- a/kdirstat/ktreemaptile.h
+++ b/kdirstat/ktreemaptile.h
@@ -125,7 +125,7 @@ namespace KDirStat
     /**
      * 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
-     * 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.
      *
      * @short Basic building block of a treemap
@@ -192,13 +192,13 @@ namespace KDirStat
     protected:
 
 	/**
-	 * Create tqchildren (sub-tiles) of this tile.
+	 * Create children (sub-tiles) of this tile.
 	 **/
 	void createChildren	( const TQRect &	rect,
 				  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
 	 * level. Each child will get the entire height or width, respectively,
 	 * of the specified rectangle. This algorithm is very fast, but often
@@ -208,12 +208,12 @@ namespace KDirStat
 				   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
 	 * TU Eindhoven, NL.
 	 *
 	 * 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
 	 * previous attempt. But it results in tiles that are much more
 	 * 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.
 	 *
 	 * 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
 	 * representation anyway (it would be way too small). They are
 	 * 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
 	 * 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
 	 * 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).
@@ -236,9 +236,9 @@ namespace KDirStat
 	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
-	 * 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'
 	 * runs out of items.
 	 *