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

diff --git a/doc/html/tqasciicache.html b/doc/html/tqasciicache.html
index 0f4a5216b..179f3f21d 100644
--- a/doc/html/tqasciicache.html
+++ b/doc/html/tqasciicache.html
@@ -37,7 +37,7 @@ body { background: #ffffff; color: black; }
 <p><a href="tqasciicache-members.html">List of all member functions.</a>
 <h2>Public Members</h2>
 <ul>
-<li class=fn><a href="#TQAsciiCache-2"><b>TQAsciiCache</b></a> ( int&nbsp;maxCost = 100, int&nbsp;size = 17, bool&nbsp;caseSensitive = TRUE, bool&nbsp;copyKeys = TRUE )</li>
+<li class=fn><a href="#TQAsciiCache-2"><b>TQAsciiCache</b></a> ( int&nbsp;maxCost = 100, int&nbsp;size = 17, bool&nbsp;caseSensitive = true, bool&nbsp;copyKeys = true )</li>
 <li class=fn><a href="#~TQAsciiCache"><b>~TQAsciiCache</b></a> ()</li>
 <li class=fn>int <a href="#maxCost"><b>maxCost</b></a> () const</li>
 <li class=fn>int <a href="#totalCost"><b>totalCost</b></a> () const</li>
@@ -49,7 +49,7 @@ body { background: #ffffff; color: black; }
 <li class=fn>bool <a href="#insert"><b>insert</b></a> ( const&nbsp;char&nbsp;*&nbsp;k, const&nbsp;type&nbsp;*&nbsp;d, int&nbsp;c = 1, int&nbsp;p = 0 )</li>
 <li class=fn>bool <a href="#remove"><b>remove</b></a> ( const&nbsp;char&nbsp;*&nbsp;k )</li>
 <li class=fn>type * <a href="#take"><b>take</b></a> ( const&nbsp;char&nbsp;*&nbsp;k )</li>
-<li class=fn>type * <a href="#find"><b>find</b></a> ( const&nbsp;char&nbsp;*&nbsp;k, bool&nbsp;ref = TRUE ) const</li>
+<li class=fn>type * <a href="#find"><b>find</b></a> ( const&nbsp;char&nbsp;*&nbsp;k, bool&nbsp;ref = true ) const</li>
 <li class=fn>type * <a href="#operator[]"><b>operator[]</b></a> ( const&nbsp;char&nbsp;*&nbsp;k ) const</li>
 <li class=fn>void <a href="#statistics"><b>statistics</b></a> () const</li>
 </ul>
@@ -75,7 +75,7 @@ the least recently used items in the cache are removed.
 item, returns it, and by default marks it as being the most
 recently used item.
 <p> There are also methods to <a href="#remove">remove</a>() or <a href="#take">take</a>() an object from the
-cache. Calling <a href="tqptrcollection.html#setAutoDelete">setAutoDelete(TRUE)</a> tells the cache to delete items that
+cache. Calling <a href="tqptrcollection.html#setAutoDelete">setAutoDelete(true)</a> 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).
 <p> When inserting an item into the cache, only the pointer is copied,
@@ -91,7 +91,7 @@ items in the cache in arbitrary order.
 <p> <p>See also <a href="tqasciicacheiterator.html">TQAsciiCacheIterator</a>, <a href="tqcache.html">TQCache</a>, <a href="tqintcache.html">TQIntCache</a>, <a href="collection.html">Collection Classes</a>, and <a href="tools.html">Non-GUI Classes</a>.
 
 <hr><h2>Member Function Documentation</h2>
-<h3 class=fn><a name="TQAsciiCache-2"></a>TQAsciiCache::TQAsciiCache ( int&nbsp;maxCost = 100, int&nbsp;size = 17, bool&nbsp;caseSensitive = TRUE, bool&nbsp;copyKeys = TRUE )
+<h3 class=fn><a name="TQAsciiCache-2"></a>TQAsciiCache::TQAsciiCache ( int&nbsp;maxCost = 100, int&nbsp;size = 17, bool&nbsp;caseSensitive = true, bool&nbsp;copyKeys = true )
 </h3>
 
 <p> Constructs a cache whose contents will never have a total cost
@@ -104,10 +104,10 @@ largest expected number of items in the cache.
 item, if the total cost of all items in the cache will exceed <em>maxCost</em>, the cache will start throwing out the older (least
 recently used) items until there is enough room for the new item
 to be inserted.
-<p> If <em>caseSensitive</em> is TRUE (the default), the cache keys are case
-sensitive; if it is FALSE, they are case-insensitive.
+<p> If <em>caseSensitive</em> 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 <em>copyKeys</em> is TRUE (the default), TQAsciiCache makes
+US-ASCII. If <em>copyKeys</em> 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.
@@ -134,11 +134,11 @@ enabled.
 <p> <p>See also <a href="#totalCost">totalCost</a>() and <a href="#size">size</a>().
 
 <p>Reimplemented from <a href="tqptrcollection.html#count">TQPtrCollection</a>.
-<h3 class=fn>type * <a name="find"></a>TQAsciiCache::find ( const&nbsp;char&nbsp;*&nbsp;k, bool&nbsp;ref = TRUE ) const
+<h3 class=fn>type * <a name="find"></a>TQAsciiCache::find ( const&nbsp;char&nbsp;*&nbsp;k, bool&nbsp;ref = true ) const
 </h3>
 
 <p> Returns the item with key <em>k</em>, or 0 if the key does not exist
-in the cache. If <em>ref</em> is TRUE (the default), the item is moved
+in the cache. If <em>ref</em> is true (the default), the item is moved
 to the front of the least recently used list.
 <p> If there are two or more items with equal keys, the one that was
 inserted last is returned.
@@ -147,8 +147,8 @@ inserted last is returned.
 </h3>
 
 <p> Inserts the item <em>d</em> into the cache using key <em>k</em>, and with an
-associated cost of <em>c</em>. Returns TRUE if the item is successfully
-inserted. Returns FALSE if the item is not inserted, for example,
+associated cost of <em>c</em>. 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 <a href="#maxCost">maxCost</a>().
 <p> The cache's size is limited, and if the total cost is too high,
 TQAsciiCache will remove old, least recently used items until there
@@ -156,7 +156,7 @@ is room for this new item.
 <p> Items with duplicate keys can be inserted.
 <p> The parameter <em>p</em> is internal and should be left at the default
 value (0).
-<p> <b>Warning:</b> If this function returns FALSE, you must delete <em>d</em>
+<p> <b>Warning:</b> If this function returns false, you must delete <em>d</em>
 yourself. Additionally, be very careful about using <em>d</em> after
 calling this function, because any other insertions into the
 cache, from anywhere in the application or within TQt itself, could
@@ -166,7 +166,7 @@ become invalid.
 <h3 class=fn>bool <a name="isEmpty"></a>TQAsciiCache::isEmpty () const
 </h3>
 
-<p> Returns TRUE if the cache is empty; otherwise returns FALSE.
+<p> Returns true if the cache is empty; otherwise returns false.
 
 <h3 class=fn>int <a name="maxCost"></a>TQAsciiCache::maxCost () const
 </h3>
@@ -182,16 +182,16 @@ the cache, and moves the item to the front of the least recently
 used list.
 <p> If there are two or more items with equal keys, the one that was
 inserted last is returned.
-<p> This is the same as <a href="#find">find</a>( k, TRUE ).
+<p> This is the same as <a href="#find">find</a>( k, true ).
 <p> <p>See also <a href="#find">find</a>().
 
 <h3 class=fn>bool <a name="remove"></a>TQAsciiCache::remove ( const&nbsp;char&nbsp;*&nbsp;k )
 </h3>
 
-<p> Removes the item with key <em>k</em> and returns TRUE if the item was
-present in the cache; otherwise returns FALSE.
+<p> Removes the item with key <em>k</em> and returns true if the item was
+present in the cache; otherwise returns false.
 <p> The item is deleted if auto-deletion has been enabled, i.e., if
-you have called <a href="tqptrcollection.html#setAutoDelete">setAutoDelete(TRUE)</a>.
+you have called <a href="tqptrcollection.html#setAutoDelete">setAutoDelete(true)</a>.
 <p> If there are two or more items with equal keys, the one that was
 inserted last is removed.
 <p> All iterators that refer to the removed item are set to point to