diff options
author | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-08-06 11:29:57 +0900 |
---|---|---|
committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-08-06 11:29:57 +0900 |
commit | dcce5b1f2c449ed9a02b1752e0d74f147a83d07d (patch) | |
tree | d57fe27457a96451f1a67e2a2db268a441d917fc /doc/html/tqintcache.html | |
parent | 649c4c61a1f1f479f4532b196f68df476cef2680 (diff) | |
download | tqt-rename/true-false-4.tar.gz tqt-rename/true-false-4.zip |
Replace TRUE/FALSE with boolean values true/false - part 4rename/true-false-4
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
Diffstat (limited to 'doc/html/tqintcache.html')
-rw-r--r-- | doc/html/tqintcache.html | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/doc/html/tqintcache.html b/doc/html/tqintcache.html index a72ef3ee4..db5b3b13d 100644 --- a/doc/html/tqintcache.html +++ b/doc/html/tqintcache.html @@ -49,7 +49,7 @@ body { background: #ffffff; color: black; } <li class=fn>bool <a href="#remove"><b>remove</b></a> ( long k )</li> <li class=fn>type * <a href="#take"><b>take</b></a> ( long k )</li> <li class=fn>virtual void <a href="#clear"><b>clear</b></a> ()</li> -<li class=fn>type * <a href="#find"><b>find</b></a> ( long k, bool ref = TRUE ) const</li> +<li class=fn>type * <a href="#find"><b>find</b></a> ( long k, bool ref = true ) const</li> <li class=fn>type * <a href="#operator[]"><b>operator[]</b></a> ( long k ) const</li> <li class=fn>void <a href="#statistics"><b>statistics</b></a> () const</li> </ul> @@ -73,7 +73,7 @@ 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</a>(TRUE) for a cache tells it to delete +cache. Calling <a href="tqptrcollection.html#setAutoDelete">setAutoDelete</a>(true) for a cache tells it to delete items that are removed. The default is to not delete items when they are removed (i.e. remove() and take() are equivalent). <p> When inserting an item into the cache, only the pointer is copied, @@ -126,11 +126,11 @@ auto-deletion has been enabled. <p> <p>See also <a href="#totalCost">totalCost</a>(). <p>Reimplemented from <a href="tqptrcollection.html#count">TQPtrCollection</a>. -<h3 class=fn>type * <a name="find"></a>TQIntCache::find ( long k, bool ref = TRUE ) const +<h3 class=fn>type * <a name="find"></a>TQIntCache::find ( long k, bool ref = true ) const </h3> <p> Returns the item associated with <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 +exist 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 most recently is returned. @@ -139,14 +139,14 @@ inserted most recently is returned. </h3> <p> Inserts the item <em>d</em> into the cache with key <em>k</em> and assigns it -a cost of <em>c</em> (default 1). Returns TRUE if it succeeds; otherwise -returns FALSE. +a cost of <em>c</em> (default 1). Returns true if it succeeds; otherwise +returns false. <p> The cache's size is limited, and if the total cost is too high, TQIntCache will remove old, least-used items until there is room for this new item. <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 (for example, the cost <tt>,</tt> +<p> <b>Warning:</b> If this function returns false (for example, the cost <tt>,</tt> exceeds <a href="#maxCost">maxCost</a>()), you must delete <em>d</em> yourself. Additionally, be very careful about using <em>d</em> after calling this function. Any other insertions into the cache, from anywhere in the application @@ -156,7 +156,7 @@ the cache and the pointer to become invalid. <h3 class=fn>bool <a name="isEmpty"></a>TQIntCache::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>TQIntCache::maxCost () const </h3> @@ -172,16 +172,16 @@ in 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 most recently 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>TQIntCache::remove ( long k ) </h3> -<p> Removes the item associated with <em>k</em>, and returns TRUE if the -item was present in the cache; otherwise returns FALSE. +<p> Removes the item associated with <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</a>(TRUE). +have called <a href="tqptrcollection.html#setAutoDelete">setAutoDelete</a>(true). <p> If there are two or more items with equal keys, the one that was inserted most recently is removed. <p> All iterators that refer to the removed item are set to point to |