Replace TRUE/FALSE with boolean values true/false - part 9rename/true-false-9

Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>

1 files changed, 21 insertions, 21 deletions

diff --git a/src/tools/tqgvector.cpp b/src/tools/tqgvector.cpp
index 9ee7034df..67434110f 100644
--- a/src/tools/tqgvector.cpp
+++ b/src/tools/tqgvector.cpp
@@ -233,7 +233,7 @@ bool TQGVector::insert( uint index, Item d )	// insert item at index
 #if defined(QT_CHECK_RANGE)
     if ( index >= len ) {			// range error
 	tqWarning( "TQGVector::insert: Index %d out of range", index );
-	return FALSE;
+	return false;
     }
 #endif
     if ( vec[index] ) {				// remove old item
@@ -248,7 +248,7 @@ bool TQGVector::insert( uint index, Item d )	// insert item at index
     } else {
 	vec[index] = 0;				// reset item
     }
-    return TRUE;
+    return true;
 }
 
 bool TQGVector::remove( uint index )		// remove item at index
@@ -256,7 +256,7 @@ bool TQGVector::remove( uint index )		// remove item at index
 #if defined(QT_CHECK_RANGE)
     if ( index >= len ) {			// range error
 	tqWarning( "TQGVector::remove: Index %d out of range", index );
-	return FALSE;
+	return false;
     }
 #endif
     if ( vec[index] ) {				// valid item
@@ -264,7 +264,7 @@ bool TQGVector::remove( uint index )		// remove item at index
 	vec[index] = 0;				// reset pointer
 	numItems--;
     }
-    return TRUE;
+    return true;
 }
 
 TQPtrCollection::Item TQGVector::take( uint index )		// take out item
@@ -298,7 +298,7 @@ void TQGVector::clear()				// clear vector
 bool TQGVector::resize( uint newsize )		// resize array
 {
     if ( newsize == len )			// nothing to do
-	return TRUE;
+	return true;
     if ( vec ) {				// existing data
 	if ( newsize < len ) {			// shrink vector
 	    uint i = newsize;
@@ -314,36 +314,36 @@ bool TQGVector::resize( uint newsize )		// resize array
 	    DELETE(vec);
 	    vec = 0;
 	    len = numItems = 0;
-	    return TRUE;
+	    return true;
 	}
 #if defined(DONT_USE_REALLOC)
 	if ( newsize == 0 ) {
 	    DELETE(vec);
 	    vec = 0;
-	    return FALSE;
+	    return false;
 	}
 	Item *newvec = NEW(Item,newsize);		// manual realloc
         if (!newvec)
-            return FALSE;
+            return false;
 	memcpy( newvec, vec, (len < newsize ? len : newsize)*sizeof(Item) );
 	DELETE(vec);
 	vec = newvec;
 #else
 	Item *newvec = (Item*)realloc( (char *)vec, newsize*sizeof(Item) );
         if (!newvec)
-            return FALSE;
+            return false;
         vec = newvec;
 #endif
     } else {					// create new vector
 	vec = NEW(Item,newsize);
         if (!vec)
-            return FALSE;
+            return false;
 	len = numItems = 0;
     }
     if ( newsize > len )			// init extra space added
 	memset( (void*)&vec[len], 0, (newsize-len)*sizeof(Item) );
     len = newsize;
-    return TRUE;
+    return true;
 }
 
 
@@ -352,10 +352,10 @@ bool TQGVector::fill( Item d, int flen )		// resize and fill vector
     if ( flen < 0 )
 	flen = len;				// default: use vector length
     else if ( !resize( flen ) )
-	return FALSE;
+	return false;
     for ( uint i=0; i<(uint)flen; i++ )		// insert d at every index
 	insert( i, d );
-    return TRUE;
+    return true;
 }
 
 
@@ -424,7 +424,7 @@ int TQGVector::bsearch( Item d ) const		// binary search; when sorted
     int n1 = 0;
     int n2 = len - 1;
     int mid = 0;
-    bool found = FALSE;
+    bool found = false;
     while ( n1 <= n2 ) {
 	int  res;
 	mid = (n1 + n2)/2;
@@ -437,7 +437,7 @@ int TQGVector::bsearch( Item d ) const		// binary search; when sorted
 	else if ( res > 0 )
 	    n1 = mid + 1;
 	else {					// found it
-	    found = TRUE;
+	    found = true;
 	    break;
 	}
     }
@@ -507,10 +507,10 @@ bool TQGVector::insertExpand( uint index, Item d )// insert and grow if necessar
 {
     if ( index >= len ) {
 	if ( !resize( index+1 ) )		// no memory
-	    return FALSE;
+	    return false;
     }
     insert( index, d );
-    return TRUE;
+    return true;
 }
 
 void TQGVector::toList( TQGList *list ) const	// store items in list
@@ -581,14 +581,14 @@ TQDataStream &TQGVector::write( TQDataStream &s ) const
 bool TQGVector::operator==( const TQGVector &v ) const
 {
     if ( size() != v.size() )
-	return FALSE;
+	return false;
     if ( count() != v.count() )
-	return FALSE;
+	return false;
     for ( int i = 0; i < (int)size(); ++i ) {
 	if ( ( (TQGVector*)this )->compareItems( at( i ), v.at( i ) ) != 0 )
-	    return FALSE;
+	    return false;
     }
-    return TRUE;
+    return true;
 }
 
 #endif // TQT_NO_DATASTREAM