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, 21 insertions, 21 deletions

diff --git a/doc/tqasciicache.doc b/doc/tqasciicache.doc
index e7b7d3df8..69d15fa8f 100644
--- a/doc/tqasciicache.doc
+++ b/doc/tqasciicache.doc
@@ -70,7 +70,7 @@
 
     There are also methods to remove() or take() an object from the
     cache. Calling \link TQPtrCollection::setAutoDelete()
-    setAutoDelete(TRUE)\endlink tells the cache to delete items that
+    setAutoDelete(true)\endlink tells the cache to delete items that
     are removed. The default is to not delete items when then are
     removed (i.e., remove() and take() are equivalent).
 
@@ -118,10 +118,10 @@
     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 only affects the 26 letters in
-    US-ASCII. If \a copyKeys is TRUE (the default), TQAsciiCache makes
+    US-ASCII. If \a copyKeys is true (the default), TQAsciiCache makes
     a copy of the cache keys, otherwise it copies just the const char
     * pointer - slightly faster if you can guarantee that the keys
     will never change, but very risky.
@@ -187,15 +187,15 @@
 /*!
     \fn bool TQAsciiCache::isEmpty() const
 
-    Returns TRUE if the cache is empty; otherwise returns FALSE.
+    Returns true if the cache is empty; otherwise returns false.
 */
 
 /*!
     \fn bool TQAsciiCache::insert( const char *k, const type *d, int c, int p )
 
     Inserts the item \a d into the cache using key \a k, and with an
-    associated cost of \a c. Returns TRUE if the item is successfully
-    inserted. Returns FALSE if the item is not inserted, for example,
+    associated cost of \a c. Returns true if the item is successfully
+    inserted. Returns false if the item is not inserted, for example,
     if the cost of the item exceeds maxCost().
 
     The cache's size is limited, and if the total cost is too high,
@@ -207,7 +207,7 @@
     The parameter \a p is internal and should be left at the default
     value (0).
 
-    \warning If this function returns FALSE, you must delete \a d
+    \warning If this function returns false, you must delete \a d
     yourself. Additionally, be very careful about using \a d after
     calling this function, because any other insertions into the
     cache, from anywhere in the application or within TQt itself, could
@@ -218,12 +218,12 @@
 /*!
     \fn bool TQAsciiCache::remove( const char *k )
 
-    Removes the item with key \a k and returns TRUE if the item was
-    present in the cache; otherwise returns FALSE.
+    Removes the item with key \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 \link TQPtrCollection::setAutoDelete()
-    setAutoDelete(TRUE)\endlink.
+    setAutoDelete(true)\endlink.
 
     If there are two or more items with equal keys, the one that was
     inserted last is removed.
@@ -266,7 +266,7 @@
     \fn type *TQAsciiCache::find( const char *k, bool ref ) const
 
     Returns the item with key \a k, or 0 if the key does not exist
-    in the cache. If \a ref is TRUE (the default), the item is moved
+    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
@@ -283,7 +283,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()
 */
@@ -319,9 +319,9 @@
     TQAsciiCacheIterator provides an operator++() and an operator+=()
     to traverse the cache; current() and currentKey() to access the
     current cache item and its key. It also provides atFirst() and
-    atLast(), which return TRUE if the iterator points to the first or
+    atLast(), which 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
@@ -365,8 +365,8 @@
 /*!
     \fn bool TQAsciiCacheIterator::isEmpty() const
 
-    Returns TRUE if the cache is empty, i.e. count() == 0; otherwise
-    returns FALSE.
+    Returns true if the cache is empty, i.e. count() == 0; otherwise
+    returns false.
     
     \sa count()
 */
@@ -374,8 +374,8 @@
 /*!
     \fn bool TQAsciiCacheIterator::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.
 
@@ -385,8 +385,8 @@
 /*!
     \fn bool TQAsciiCacheIterator::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.