diff options
Diffstat (limited to 'doc/html/tqmap.html')
| -rw-r--r-- | doc/html/tqmap.html | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/doc/html/tqmap.html b/doc/html/tqmap.html index 4c296c9a1..9343a813c 100644 --- a/doc/html/tqmap.html +++ b/doc/html/tqmap.html @@ -80,7 +80,7 @@ provides a dictionary. <li class=fn>TQValueList<Key> <a href="#keys"><b>keys</b></a> () const</li> <li class=fn>TQValueList<T> <a href="#values"><b>values</b></a> () const</li> <li class=fn>bool <a href="#isEmpty"><b>isEmpty</b></a> () const</li> -<li class=fn>iterator <a href="#insert"><b>insert</b></a> ( const Key & key, const T & value, bool overwrite = TRUE )</li> +<li class=fn>iterator <a href="#insert"><b>insert</b></a> ( const Key & key, const T & value, bool overwrite = true )</li> <li class=fn>void <a href="#remove"><b>remove</b></a> ( iterator it )</li> <li class=fn>void <a href="#remove-2"><b>remove</b></a> ( const Key & k )</li> </ul> @@ -358,8 +358,8 @@ dereferenceable; <a href="tqsize.html#operator*-4">operator*</a>() will not retu <h3 class=fn>bool <a name="contains"></a>TQMap::contains ( const Key & k ) const </h3> -<p> Returns TRUE if the map contains an item with key <em>k</em>; otherwise -returns FALSE. +<p> Returns true if the map contains an item with key <em>k</em>; otherwise +returns false. <h3 class=fn><a href="tqmap.html#size_type">size_type</a> <a name="count"></a>TQMap::count ( const <a href="tqmap.html#key_type">key_type</a> & k ) const </h3> @@ -387,8 +387,8 @@ implemented this way. <h3 class=fn>bool <a name="empty"></a>TQMap::empty () const </h3> -<p> Returns TRUE if the map contains no items; otherwise returns -FALSE. +<p> Returns true if the map contains no items; otherwise returns +false. <p> This function is provided for STL compatibility. It is equivalent to <a href="#isEmpty">isEmpty</a>(). <p> <p>See also <a href="#size">size</a>(). @@ -439,13 +439,13 @@ map. <p> Returns <a href="#end">end</a>() if no key matched. <p> <p>See also <a href="tqmapconstiterator.html">TQMapConstIterator</a>. -<h3 class=fn><a href="tqmap.html#iterator">iterator</a> <a name="insert"></a>TQMap::insert ( const Key & key, const T & value, bool overwrite = TRUE ) +<h3 class=fn><a href="tqmap.html#iterator">iterator</a> <a name="insert"></a>TQMap::insert ( const Key & key, const T & value, bool overwrite = true ) </h3> <p> Inserts a new item with the key, <em>key</em>, and a value of <em>value</em>. If there is already an item whose key is <em>key</em>, that item's value -is replaced with <em>value</em>, unless <em>overwrite</em> is FALSE (it is -TRUE by default). In this case an iterator to this item is +is replaced with <em>value</em>, unless <em>overwrite</em> is false (it is +true by default). In this case an iterator to this item is returned, else an iterator to the new item is returned. <p> <h3 class=fn><a href="tqpair.html">TQPair</a><iterator, bool> <a name="insert-2"></a>TQMap::insert ( const <a href="tqmap.html#value_type">value_type</a> & x ) @@ -456,16 +456,16 @@ returned, else an iterator to the new item is returned. whose <tt>first</tt> element is a key to be inserted and whose <tt>second</tt> element is the associated value to be inserted. Returns a pair whose <tt>first</tt> element is an iterator pointing to the inserted -item and whose <tt>second</tt> element is a bool indicating TRUE if <em>x</em> -was inserted and FALSE if it was not inserted, e.g. because it was +item and whose <tt>second</tt> element is a bool indicating true if <em>x</em> +was inserted and false if it was not inserted, e.g. because it was already present. <p> <p>See also <a href="#replace">replace</a>(). <h3 class=fn>bool <a name="isEmpty"></a>TQMap::isEmpty () const </h3> -<p> Returns TRUE if the map contains no items; otherwise returns -FALSE. +<p> Returns true if the map contains no items; otherwise returns +false. <p> <p>See also <a href="#count">count</a>(). <h3 class=fn><a href="tqvaluelist.html">TQValueList</a><Key> <a name="keys"></a>TQMap::keys () const |