diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-11-26 15:11:22 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2025-11-26 15:11:22 +0900 |
| commit | b87533f9904c10f24d6b2e8177c00944e3efe15b (patch) | |
| tree | c1106a381c851b51e86004698457aef1211b77be /doc/html/qmap-h.html | |
| parent | 894037c3e68e1573a34183d936171f8cda5085f3 (diff) | |
| download | tqt-r14.1.x.tar.gz tqt-r14.1.x.zip | |
Replace TRUE/FALSE with boolean values true/false - part 4r14.1.x
Manually cherry-picked from commit 4d495175
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
Diffstat (limited to 'doc/html/qmap-h.html')
| -rw-r--r-- | doc/html/qmap-h.html | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/doc/html/qmap-h.html b/doc/html/qmap-h.html index 044433441..360036bfd 100644 --- a/doc/html/qmap-h.html +++ b/doc/html/qmap-h.html @@ -560,7 +560,7 @@ TQ_INLINE_TEMPLATES TQ_TYPENAME TQMapPrivate<Key,T>::Iterator TQMapPrivate // Search correct position in the tree TQMapNodeBase* y = header; TQMapNodeBase* x = header->parent; - bool result = TRUE; + bool result = true; while ( x != 0 ) { result = ( k < key(x) ); y = x; @@ -760,14 +760,14 @@ public: bool isEmpty() const { return sh->node_count == 0; } - iterator insert( const Key& key, const T& value, bool overwrite = TRUE ); + iterator insert( const Key& key, const T& value, bool overwrite = true ); void remove( iterator it ) { detach(); sh->remove( it ); } void remove( const Key& k ); #if defined(TQ_FULL_TEMPLATE_INSTANTIATION) - bool operator==( const TQMap<Key,T>& ) const { return FALSE; } + bool operator==( const TQMap<Key,T>& ) const { return false; } #ifndef TQT_NO_STL - bool operator==( const std::map<Key,T>& ) const { return FALSE; } + bool operator==( const std::map<Key,T>& ) const { return false; } #endif #endif @@ -800,9 +800,9 @@ TQ_INLINE_TEMPLATES TQ_TYPENAME TQMap<Key,T>::insert_pair TQMap<Key,T&g detach(); size_type n = size(); iterator it = sh->insertSingle( x.first ); - bool inserted = FALSE; + bool inserted = false; if ( n < size() ) { - inserted = TRUE; + inserted = true; it.data() = x.second; } return TQPair<iterator,bool>( it, inserted ); |
