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

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

1 files changed, 20 insertions, 20 deletions

diff --git a/doc/tqcache.doc b/doc/tqcache.doc
index c47f30b5b..4e8a08294 100644
--- a/doc/tqcache.doc
+++ b/doc/tqcache.doc
@@ -66,7 +66,7 @@
     recently used item.
 
     There are also methods to remove() or take() an object from the
-    cache. Calling setAutoDelete(TRUE) for a cache tells it to delete
+    cache. Calling setAutoDelete(true) for a cache tells it to delete
     items that are removed. The default is to not delete items when
     they are removed (i.e., remove() and take() are equivalent).
 
@@ -119,8 +119,8 @@
     recently used) items until there is enough room for the new item
     to be inserted.
 
-    If \a caseSensitive is TRUE (the default), the cache keys are case
-    sensitive; if it is FALSE, they are case-insensitive.
+    If \a caseSensitive is true (the default), the cache keys are case
+    sensitive; if it is false, they are case-insensitive.
     Case-insensitive comparison considers all Unicode letters.
 */
 
@@ -184,15 +184,15 @@
 /*!
     \fn bool TQCache::isEmpty() const
 
-    Returns TRUE if the cache is empty; otherwise returns FALSE.
+    Returns true if the cache is empty; otherwise returns false.
 */
 
 /*!
     \fn bool TQCache::insert( const TQString &k, const type *d, int c, int p )
 
     Inserts the item \a d into the cache with key \a k and associated
-    cost, \a c. Returns TRUE if it is successfully inserted; otherwise
-    returns FALSE.
+    cost, \a c. Returns true if it is successfully inserted; otherwise
+    returns false.
 
     The cache's size is limited, and if the total cost is too high,
     TQCache will remove old, least recently used items until there is
@@ -201,7 +201,7 @@
     The parameter \a p is internal and should be left at the default
     value (0).
 
-    \warning If this function returns FALSE (which could happen, e.g.
+    \warning If this function returns false (which could happen, e.g.
     if the cost of this item alone exceeds maxCost()) you must delete
     \a d yourself. Additionally, be very careful about using \a d
     after calling this function because any other insertions into the
@@ -213,11 +213,11 @@
 /*!
     \fn bool TQCache::remove( const TQString &k )
 
-    Removes the item associated with \a k, and returns TRUE if the
-    item was present in the cache; otherwise returns FALSE.
+    Removes the item associated with \a k, and returns true if the
+    item was present in the cache; otherwise returns false.
 
     The item is deleted if auto-deletion has been enabled, i.e., if
-    you have called setAutoDelete(TRUE).
+    you have called setAutoDelete(true).
 
     If there are two or more items with equal keys, the one that was
     inserted last is removed.
@@ -259,7 +259,7 @@
     \fn type *TQCache::find( const TQString &k, bool ref ) const
 
     Returns the item associated with key \a k, or 0 if the key does
-    not exist in the cache. If \a ref is TRUE (the default), the item
+    not exist in the cache. If \a ref is true (the default), the item
     is moved to the front of the least recently used list.
 
     If there are two or more items with equal keys, the one that was
@@ -276,7 +276,7 @@
     If there are two or more items with equal keys, the one that was
     inserted last is returned.
 
-    This is the same as find( k, TRUE ).
+    This is the same as find( k, true ).
 
     \sa find()
 */
@@ -312,9 +312,9 @@
     TQCacheIterator provides an operator++(), and an operator+=() to
     traverse the cache. The current() and currentKey() functions are
     used to access the current cache item and its key. The atFirst()
-    and atLast() return TRUE if the iterator points to the first or
+    and atLast() return true if the iterator points to the first or
     last item in the cache respectively. The isEmpty() function
-    returns TRUE if the cache is empty, and count() returns the number
+    returns true if the cache is empty, and count() returns the number
     of items in the cache.
 
     Note that atFirst() and atLast() refer to the iterator's arbitrary
@@ -358,8 +358,8 @@
 /*!
     \fn bool TQCacheIterator::isEmpty() const
 
-    Returns TRUE if the cache is empty, i.e. count() == 0; otherwise
-    it returns FALSE.
+    Returns true if the cache is empty, i.e. count() == 0; otherwise
+    it returns false.
     
     \sa count()
 */
@@ -367,8 +367,8 @@
 /*!
     \fn bool TQCacheIterator::atFirst() const
 
-    Returns TRUE if the iterator points to the first item in the
-    cache; otherwise returns FALSE. Note that this refers to the
+    Returns true if the iterator points to the first item in the
+    cache; otherwise returns false. Note that this refers to the
     iterator's arbitrary ordering, not to the cache's internal least
     recently used list.
 
@@ -378,8 +378,8 @@
 /*!
     \fn bool TQCacheIterator::atLast() const
 
-    Returns TRUE if the iterator points to the last item in the cache;
-    otherwise returns FALSE. Note that this refers to the iterator's
+    Returns true if the iterator points to the last item in the cache;
+    otherwise returns false. Note that this refers to the iterator's
     arbitrary ordering, not to the cache's internal least recently
     used list.