diff options
Diffstat (limited to 'doc/html/ntqcache.html')
-rw-r--r-- | doc/html/ntqcache.html | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/doc/html/ntqcache.html b/doc/html/ntqcache.html index da9c879d0..e7f0ad16b 100644 --- a/doc/html/ntqcache.html +++ b/doc/html/ntqcache.html @@ -62,7 +62,7 @@ body { background: #ffffff; color: black; } <hr><a name="details"></a><h2>Detailed Description</h2> -The TQCache class is a template class that provides a cache based on <a href="ntqstring.html">TQString</a> keys. +The TQCache class is a template class that provides a cache based on <a href="tqstring.html">TQString</a> keys. <p> <p> @@ -93,7 +93,7 @@ implementation deletes the item if auto-deletion is enabled, and does nothing otherwise. <p> There is a <a href="qcacheiterator.html">TQCacheIterator</a> that can be used to traverse the items in the cache in arbitrary order. -<p> In TQCache, the cache items are accessed via <a href="ntqstring.html">TQString</a> keys, which +<p> In TQCache, the cache items are accessed via <a href="tqstring.html">TQString</a> keys, which are Unicode strings. If you want to use non-Unicode, plain 8-bit <tt>char*</tt> keys, use the <a href="ntqasciicache.html">TQAsciiCache</a> template. A TQCache has the same performance as a TQAsciiCache. @@ -145,7 +145,7 @@ 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>TQCache::find ( const <a href="ntqstring.html">TQString</a> & k, bool ref = TRUE ) const +<h3 class=fn>type * <a name="find"></a>TQCache::find ( const <a href="tqstring.html">TQString</a> & k, bool ref = TRUE ) const </h3> <p> Returns the item associated with key <em>k</em>, or 0 if the key does @@ -154,7 +154,7 @@ 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. -<h3 class=fn>bool <a name="insert"></a>TQCache::insert ( const <a href="ntqstring.html">TQString</a> & k, const type * d, int c = 1, int p = 0 ) +<h3 class=fn>bool <a name="insert"></a>TQCache::insert ( const <a href="tqstring.html">TQString</a> & k, const type * d, int c = 1, int p = 0 ) </h3> <p> Inserts the item <em>d</em> into the cache with key <em>k</em> and associated @@ -184,7 +184,7 @@ become invalid. <p> Returns the maximum allowed total cost of the cache. <p> <p>See also <a href="#setMaxCost">setMaxCost</a>() and <a href="#totalCost">totalCost</a>(). -<h3 class=fn>type * <a name="operator[]"></a>TQCache::operator[] ( const <a href="ntqstring.html">TQString</a> & k ) const +<h3 class=fn>type * <a name="operator[]"></a>TQCache::operator[] ( const <a href="tqstring.html">TQString</a> & k ) const </h3> <p> Returns the item associated with key <em>k</em>, or 0 if <em>k</em> does not @@ -195,7 +195,7 @@ inserted last is returned. <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>TQCache::remove ( const <a href="ntqstring.html">TQString</a> & k ) +<h3 class=fn>bool <a name="remove"></a>TQCache::remove ( const <a href="tqstring.html">TQString</a> & k ) </h3> <p> Removes the item associated with <em>k</em>, and returns TRUE if the @@ -247,7 +247,7 @@ This should be a bit bigger than <a href="#count">count</a>() is likely to be. and distribution information using <a href="ntqapplication.html#qDebug">tqDebug</a>(). This function does nothing in the release library. -<h3 class=fn>type * <a name="take"></a>TQCache::take ( const <a href="ntqstring.html">TQString</a> & k ) +<h3 class=fn>type * <a name="take"></a>TQCache::take ( const <a href="tqstring.html">TQString</a> & k ) </h3> <p> Takes the item associated with <em>k</em> out of the cache without |