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/tqmap-h.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/tqmap-h.html')
-rw-r--r-- | doc/html/tqmap-h.html | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/doc/html/tqmap-h.html b/doc/html/tqmap-h.html index 152c28adc..161cfe82c 100644 --- a/doc/html/tqmap-h.html +++ b/doc/html/tqmap-h.html @@ -559,7 +559,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; @@ -759,14 +759,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 @@ -799,9 +799,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 ); |