From 4d495175043c399fdca6e1bb4c74ef176fc76fb4 Mon Sep 17 00:00:00 2001 From: Michele Calgaro Date: Wed, 6 Aug 2025 11:29:57 +0900 Subject: Replace TRUE/FALSE with boolean values true/false - part 4 Signed-off-by: Michele Calgaro --- doc/html/tqintcache.html | 24 ++++++++++++------------ 1 file changed, 12 insertions(+), 12 deletions(-) (limited to 'doc/html/tqintcache.html') 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; }
  • bool remove ( long k )
  • type * take ( long k )
  • virtual void clear ()
    • -
  • type * find ( long k, bool ref = TRUE ) const
    • +
  • type * find ( long k, bool ref = true ) const
  • type * operator[] ( long k ) const
  • void statistics () const
    • @@ -73,7 +73,7 @@ the cache are removed. item, returns it, and by default marks it as being the most recently used item.

    There are also methods to remove() or take() an object from the -cache. Calling setAutoDelete(TRUE) for a cache tells it to delete +cache. Calling setAutoDelete(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).

    When inserting an item into the cache, only the pointer is copied, @@ -126,11 +126,11 @@ auto-deletion has been enabled.

    See also totalCost().

    Reimplemented from TQPtrCollection. -

    type * TQIntCache::find ( long k, bool ref = TRUE ) const +

    type * TQIntCache::find ( long k, bool ref = true ) const

    Returns the item associated with k, or 0 if the key does not -exist in the cache. If ref is TRUE (the default), the item is +exist in the cache. If ref is true (the default), the item is moved to the front of the least recently used list.

    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.

    Inserts the item d into the cache with key k and assigns it -a cost of c (default 1). Returns TRUE if it succeeds; otherwise -returns FALSE. +a cost of c (default 1). Returns true if it succeeds; otherwise +returns false.

    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.

    The parameter p is internal and should be left at the default value (0). -

    Warning: If this function returns FALSE (for example, the cost , +

    Warning: If this function returns false (for example, the cost , exceeds maxCost()), you must delete d yourself. Additionally, be very careful about using d 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.

    bool TQIntCache::isEmpty () const

    -

    Returns TRUE if the cache is empty; otherwise returns FALSE. +

    Returns true if the cache is empty; otherwise returns false.

    int TQIntCache::maxCost () const

    @@ -172,16 +172,16 @@ in the cache, and moves the item to the front of the least recently used list.

    If there are two or more items with equal keys, the one that was inserted most recently is returned. -

    This is the same as find( k, TRUE ). +

    This is the same as find( k, true ).

    See also find().

    bool TQIntCache::remove ( long k )

    -

    Removes the item associated with k, and returns TRUE if the -item was present in the cache; otherwise returns FALSE. +

    Removes the item associated with k, and returns true if the +item was present in the cache; otherwise returns false.

    The item is deleted if auto-deletion has been enabled, i.e. if you -have called setAutoDelete(TRUE). +have called setAutoDelete(true).

    If there are two or more items with equal keys, the one that was inserted most recently is removed.

    All iterators that refer to the removed item are set to point to -- cgit v1.2.3