From 6dd781c483eea56f51ae0eff47d857976b5d0f0d Mon Sep 17 00:00:00 2001 From: Michele Calgaro Date: Sat, 26 Jul 2025 11:44:58 +0900 Subject: Replace TRUE/FALSE with boolean values true/false - part 3 Signed-off-by: Michele Calgaro --- doc/man/man3/tqcacheiterator.3qt | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'doc/man/man3/tqcacheiterator.3qt') diff --git a/doc/man/man3/tqcacheiterator.3qt b/doc/man/man3/tqcacheiterator.3qt index e44911883..967cfbaff 100644 --- a/doc/man/man3/tqcacheiterator.3qt +++ b/doc/man/man3/tqcacheiterator.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 TQCache. TQCache updates all iterators that refer an item when that item is removed. .PP -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 last item in the cache respectively. The isEmpty() function returns TRUE if the cache is empty, and count() returns the number of items in the cache. +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 last item in the cache respectively. The isEmpty() function returns true if the cache is empty, and count() 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 "TQCacheIterator::TQCacheIterator ( const TQCacheIterator & 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 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 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 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 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 TQCacheIterator::count () const" @@ -99,7 +99,7 @@ Returns a pointer to the current iterator item. .SH "TQString TQCacheIterator::currentKey () const" Returns the key for the current iterator item. .SH "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. .PP See also count(). .SH "TQCacheIterator::operator type * () const" -- cgit v1.2.3