diff options
Diffstat (limited to 'doc/man/man3/tqasciicacheiterator.3qt')
| -rw-r--r-- | doc/man/man3/tqasciicacheiterator.3qt | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/doc/man/man3/tqasciicacheiterator.3qt b/doc/man/man3/tqasciicacheiterator.3qt index a0ab8dc29..520bde0a4 100644 --- a/doc/man/man3/tqasciicacheiterator.3qt +++ b/doc/man/man3/tqasciicacheiterator.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 TQAsciiCache. TQAsciiCache updates all iterators that refer an item when that item is removed. .PP -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 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. +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 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 "TQAsciiCacheIterator::TQAsciiCacheIterator ( const TQAsciiCacheIterator<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 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 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 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 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 TQAsciiCacheIterator::count () const" @@ -99,7 +99,7 @@ Returns a pointer to the current iterator item. .SH "const char * TQAsciiCacheIterator::currentKey () const" Returns the key for the current iterator item. .SH "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. .PP See also count(). .SH "TQAsciiCacheIterator::operator type * () const" |