Replace TRUE/FALSE with boolean values true/false - part 3

Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
(cherry picked and manually edited from commit 6dd781c483eea56f51ae0eff47d857976b5d0f0d)

1 files changed, 4 insertions, 4 deletions

diff --git a/doc/man/man3/tqintcacheiterator.3qt b/doc/man/man3/tqintcacheiterator.3qt
index c45ef38a3..b6d7c13e0 100644
--- a/doc/man/man3/tqintcacheiterator.3qt
+++ b/doc/man/man3/tqintcacheiterator.3qt
@@ -72,7 +72,7 @@ Note that the traversal order is arbitrary; you are not guaranteed any particula
 .PP
 Multiple iterators are completely independent, even when they operate on the same QIntCache. QIntCache updates all iterators that refer an item when that item is removed.
 .PP
-QIntCacheIterator provides an operator++(), and an operator+=() to traverse the cache; current() and currentKey() to access the current cache item and its key; atFirst() atLast(), which return TRUE if the iterator points to the first/last item in the cache; isEmpty(), which returns TRUE if the cache is empty; and count(), which returns the number of items in the cache.
+QIntCacheIterator provides an operator++(), and an operator+=() to traverse the cache; current() and currentKey() to access the current cache item and its key; atFirst() atLast(), which return true if the iterator points to the first/last item in the cache; isEmpty(), which returns true if the cache is empty; and count(), which returns the number of items in the cache.
 .PP
 Note that atFirst() and atLast() refer to the iterator's arbitrary ordering, not to the cache's internal least recently used list.
 .PP
@@ -83,11 +83,11 @@ Constructs an iterator for \fIcache\fR. The current iterator item is set to poin
 .SH "QIntCacheIterator::QIntCacheIterator ( const QIntCacheIterator<type> & ci )"
 Constructs an iterator for the same cache as \fIci\fR. The new iterator starts at the same item as ci.current(), but moves independently from there on.
 .SH "bool QIntCacheIterator::atFirst () const"
-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.
+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.
 .PP
 See also toFirst() and atLast().
 .SH "bool QIntCacheIterator::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 arbitrary ordering, not to the cache's internal least recently used list.
+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.
 .PP
 See also toLast() and atFirst().
 .SH "uint QIntCacheIterator::count () const"
@@ -99,7 +99,7 @@ Returns a pointer to the current iterator item.
 .SH "long QIntCacheIterator::currentKey () const"
 Returns the key for the current iterator item.
 .SH "bool QIntCacheIterator::isEmpty () const"
-Returns TRUE if the cache is empty; otherwise returns FALSE.
+Returns true if the cache is empty; otherwise returns false.
 .PP
 See also count().
 .SH "QIntCacheIterator::operator type * () const"