1 files changed, 31 insertions, 31 deletions

diff --git a/src/tools/tqglist.cpp b/src/tools/tqglist.cpp
index def2fd4e3..1da131e69 100644
--- a/src/tools/tqglist.cpp
+++ b/src/tools/tqglist.cpp
@@ -106,7 +106,7 @@ public:
 	: list(0), iterator(0) {
     }
     ~TQGListIteratorList() {
-	notifyClear( TRUE );
+	notifyClear( true );
 	delete list;
     }
 
@@ -297,18 +297,18 @@ TQGList& TQGList::operator=( const TQGList &list )
 }
 
 /*!
-  Compares this list with \a list. Returns TRUE if the lists
-  contain the same data, otherwise FALSE.
+  Compares this list with \a list. Returns true if the lists
+  contain the same data, otherwise false.
 */
 
 bool TQGList::operator==( const TQGList &list ) const
 {
     if ( count() != list.count() ) {
-	return FALSE;
+	return false;
     }
 
     if ( count() == 0 ) {
-	return TRUE;
+	return true;
     }
 
     TQLNode *n1 = firstNode;
@@ -316,12 +316,12 @@ bool TQGList::operator==( const TQGList &list ) const
     while ( n1 && n2 ) {
 	// should be mutable
 	if ( ( (TQGList*)this )->compareItems( n1->data, n2->data ) != 0 )
-	    return FALSE;
+	    return false;
 	n1 = n1->next;
 	n2 = n2->next;
     }
 
-    return TRUE;
+    return true;
 }
 
 /*!
@@ -370,13 +370,13 @@ TQLNode *TQGList::locate( uint index )
     } else if ( index < numNodes - index ) {	// start from first node
 	node = firstNode;
 	distance = index;
-	forward = TRUE;
+	forward = true;
     } else {					// start from last node
 	node = lastNode;
 	distance = numNodes - index - 1;
 	if ( distance < 0 )
 	    distance = 0;
-	forward = FALSE;
+	forward = false;
     }
     if ( forward ) {				// now run through nodes
 	while ( distance-- ) {
@@ -483,21 +483,21 @@ bool TQGList::insertAt( uint index, TQPtrCollection::Item d )
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return TRUE;
+	return true;
     }
     else if ( index == numNodes ) {
 	append( d );
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return TRUE;
+	return true;
     }
     TQLNode *nextNode = locate( index );
     if ( !nextNode ) {
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     TQLNode *prevNode = nextNode->prev;
     TQLNode *n = new TQLNode( newItem(d) );
@@ -512,7 +512,7 @@ bool TQGList::insertAt( uint index, TQPtrCollection::Item d )
 #if defined(TQT_THREAD_SUPPORT)
     //mutex->unlock();
 #endif
-    return TRUE;
+    return true;
 }
 
 
@@ -613,7 +613,7 @@ bool TQGList::removeNode( TQLNode *n )
     if ( n == 0 || (n->prev && n->prev->next != n) ||
 	 (n->next && n->next->prev != n) ) {
 	tqWarning( "TQGList::removeNode: Corrupted node" );
-	return FALSE;
+	return false;
     }
 #endif
     curNode = n;
@@ -625,7 +625,7 @@ bool TQGList::removeNode( TQLNode *n )
 #if defined(TQT_THREAD_SUPPORT)
     //mutex->unlock();
 #endif
-    return TRUE;
+    return true;
 }
 
 /*!
@@ -643,21 +643,21 @@ bool TQGList::remove( TQPtrCollection::Item d )
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     TQLNode *n = unlink();
     if ( !n ) {
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     deleteItem( n->data );
     delete n;
 #if defined(TQT_THREAD_SUPPORT)
     //mutex->unlock();
 #endif
-    return TRUE;
+    return true;
 }
 
 /*!
@@ -673,21 +673,21 @@ bool TQGList::removeRef( TQPtrCollection::Item d )
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     TQLNode *n = unlink();
     if ( !n ) {
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     deleteItem( n->data );
     delete n;
 #if defined(TQT_THREAD_SUPPORT)
     //mutex->unlock();
 #endif
-    return TRUE;
+    return true;
 }
 
 /*!
@@ -715,21 +715,21 @@ bool TQGList::removeAt( uint index )
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     TQLNode *n = unlink();
     if ( !n ) {
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     deleteItem( n->data );
     delete n;
 #if defined(TQT_THREAD_SUPPORT)
     //mutex->unlock();
 #endif
-    return TRUE;
+    return true;
 }
 
 
@@ -746,7 +746,7 @@ bool TQGList::replaceAt( uint index, TQPtrCollection::Item d )
 #if defined(TQT_THREAD_SUPPORT)
 	//mutex->unlock();
 #endif
-	return FALSE;
+	return false;
     }
     if ( n->data != d ) {
 	deleteItem( n->data );
@@ -755,7 +755,7 @@ bool TQGList::replaceAt( uint index, TQPtrCollection::Item d )
 #if defined(TQT_THREAD_SUPPORT)
     //mutex->unlock();
 #endif
-    return TRUE;
+    return true;
 }
 
 
@@ -888,7 +888,7 @@ void TQGList::clear()
     curIndex = -1;
 
     if ( iterators ) {
-	iterators->notifyClear( FALSE );
+	iterators->notifyClear( false );
     }
 
     TQLNode *prevNode;
@@ -905,7 +905,7 @@ void TQGList::clear()
 
 
 /*!
-  Finds item \a d in the list. If \a fromStart is TRUE the search
+  Finds item \a d in the list. If \a fromStart is true the search
   begins at the first node; otherwise it begins at the current node.
 */
 
@@ -937,7 +937,7 @@ int TQGList::findRef( TQPtrCollection::Item d, bool fromStart )
 
 /*!
   Finds item \a d in the list using compareItems(). If \a fromStart is
-  TRUE the search begins at the first node; otherwise it begins at the
+  true the search begins at the first node; otherwise it begins at the
   current node.
 */
 
@@ -1451,13 +1451,13 @@ TQGListIterator::~TQGListIterator()
 /*!
   \fn bool TQGListIterator::atFirst() const
   \internal
-  Returns TRUE if the iterator points to the first item, otherwise FALSE.
+  Returns true if the iterator points to the first item, otherwise false.
 */
 
 /*!
   \fn bool TQGListIterator::atLast() const
   \internal
-  Returns TRUE if the iterator points to the last item, otherwise FALSE.
+  Returns true if the iterator points to the last item, otherwise false.
 */