@ -202,7 +202,7 @@ public:
};
template < class K, class T>
Q_INLINE_TEMPLATES int TQMapIterator< K,T> ::inc()
T Q_INLINE_TEMPLATES int TQMapIterator< K,T> ::inc()
{
TQMapNodeBase* tmp = node;
if ( tmp-> right ) {
@ -223,7 +223,7 @@ Q_INLINE_TEMPLATES int TQMapIterator<K,T>::inc()
}
template < class K, class T>
Q_INLINE_TEMPLATES int TQMapIterator< K,T> ::dec()
T Q_INLINE_TEMPLATES int TQMapIterator< K,T> ::dec()
{
TQMapNodeBase* tmp = node;
if (tmp-> color == TQMapNodeBase::Red & &
@ -318,7 +318,7 @@ public:
};
template < class K, class T>
Q_INLINE_TEMPLATES int TQMapConstIterator< K,T> ::inc()
T Q_INLINE_TEMPLATES int TQMapConstIterator< K,T> ::inc()
{
TQMapNodeBase* tmp = node;
if ( tmp-> right ) {
@ -339,7 +339,7 @@ Q_INLINE_TEMPLATES int TQMapConstIterator<K,T>::inc()
}
template < class K, class T>
Q_INLINE_TEMPLATES int TQMapConstIterator< K,T> ::dec()
T Q_INLINE_TEMPLATES int TQMapConstIterator< K,T> ::dec()
{
TQMapNodeBase* tmp = node;
if (tmp-> color == TQMapNodeBase::Red & &
@ -467,14 +467,14 @@ protected:
template < class Key, class T>
Q_INLINE_TEMPLATES TQMapPrivate< Key,T> ::TQMapPrivate() {
T Q_INLINE_TEMPLATES TQMapPrivate< Key,T> ::TQMapPrivate() {
header = new Node;
header-> color = TQMapNodeBase::Red; // Mark the header
header-> parent = 0;
header-> left = header-> right = header;
}
template < class Key, class T>
Q_INLINE_TEMPLATES TQMapPrivate< Key,T> ::TQMapPrivate( const TQMapPrivate< Key, T > * _map ) : TQMapPrivateBase( _map ) {
T Q_INLINE_TEMPLATES TQMapPrivate< Key,T> ::TQMapPrivate( const TQMapPrivate< Key, T > * _map ) : TQMapPrivateBase( _map ) {
header = new Node;
header-> color = TQMapNodeBase::Red; // Mark the header
if ( _map-> header-> parent == 0 ) {
@ -489,7 +489,7 @@ Q_INLINE_TEMPLATES TQMapPrivate<Key,T>::TQMapPrivate( const TQMapPrivate&l
}
template < class Key, class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate< Key,T> ::NodePtr TQMapPrivate< Key,T> ::copy( Q_TYPENAME TQMapPrivate< Key,T> ::NodePtr p )
T Q_INLINE_TEMPLATES T Q_TYPENAME TQMapPrivate< Key,T> ::NodePtr TQMapPrivate< Key,T> ::copy( T Q_TYPENAME TQMapPrivate< Key,T> ::NodePtr p )
{
if ( !p )
return 0;
@ -511,7 +511,7 @@ Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate<Key,T>::NodePtr TQMapPrivate<
}
template < class Key, class T>
Q_INLINE_TEMPLATES void TQMapPrivate< Key,T> ::clear()
T Q_INLINE_TEMPLATES void TQMapPrivate< Key,T> ::clear()
{
clear( (NodePtr)(header-> parent) );
header-> color = TQMapNodeBase::Red;
@ -521,7 +521,7 @@ Q_INLINE_TEMPLATES void TQMapPrivate<Key,T>::clear()
}
template < class Key, class T>
Q_INLINE_TEMPLATES void TQMapPrivate< Key,T> ::clear( Q_TYPENAME TQMapPrivate< Key,T> ::NodePtr p )
T Q_INLINE_TEMPLATES void TQMapPrivate< Key,T> ::clear( T Q_TYPENAME TQMapPrivate< Key,T> ::NodePtr p )
{
while ( p != 0 ) {
clear( (NodePtr)p-> right );
@ -532,7 +532,7 @@ Q_INLINE_TEMPLATES void TQMapPrivate<Key,T>::clear( Q_TYPENAME TQMapPrivat
}
template < class Key, class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate< Key,T> ::ConstIterator TQMapPrivate< Key,T> ::find(const Key& k) const
T Q_INLINE_TEMPLATES T Q_TYPENAME TQMapPrivate< Key,T> ::ConstIterator TQMapPrivate< Key,T> ::find(const Key& k) const
{
TQMapNodeBase* y = header; // Last node
TQMapNodeBase* x = header-> parent; // Root node.
@ -555,7 +555,7 @@ Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate<Key,T>::ConstIterator TQMapPriv
}
template < class Key, class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate< Key,T> ::Iterator TQMapPrivate< Key,T> ::insertSingle( const Key& k )
T Q_INLINE_TEMPLATES T Q_TYPENAME TQMapPrivate< Key,T> ::Iterator TQMapPrivate< Key,T> ::insertSingle( const Key& k )
{
// Search correct position in the tree
TQMapNodeBase* y = header;
@ -586,7 +586,7 @@ Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate<Key,T>::Iterator TQMapPrivate&l
template < class Key, class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate< Key,T> ::Iterator TQMapPrivate< Key,T> ::insert( TQMapNodeBase* x, TQMapNodeBase* y, const Key& k )
T Q_INLINE_TEMPLATES T Q_TYPENAME TQMapPrivate< Key,T> ::Iterator TQMapPrivate< Key,T> ::insert( TQMapNodeBase* x, TQMapNodeBase* y, const Key& k )
{
NodePtr z = new Node( k );
if (y == header || x != 0 || k < key(y) ) {
@ -612,15 +612,15 @@ Q_INLINE_TEMPLATES Q_TYPENAME TQMapPrivate<Key,T>::Iterator TQMapPrivate&l
#ifdef QT_CHECK_RANGE
# if !defined( TQT_NO_DEBUG ) & & defined( QT_CHECK_MAP_RANGE )
# define QT_CHECK_INVALID_MAP_ELEMENT if ( empty() ) tqWarning( "TQMap: Warning invalid element" )
# define QT_CHECK_INVALID_MAP_ELEMENT_FATAL Q_ASSERT( !empty() );
# define T QT_CHECK_INVALID_MAP_ELEMENT if ( empty() ) tqWarning( "TQMap: Warning invalid element" )
# define T QT_CHECK_INVALID_MAP_ELEMENT_FATAL Q_ASSERT( !empty() );
# else
# define QT_CHECK_INVALID_MAP_ELEMENT
# define QT_CHECK_INVALID_MAP_ELEMENT_FATAL
# define T QT_CHECK_INVALID_MAP_ELEMENT
# define T QT_CHECK_INVALID_MAP_ELEMENT_FATAL
# endif
#else
# define QT_CHECK_INVALID_MAP_ELEMENT
# define QT_CHECK_INVALID_MAP_ELEMENT_FATAL
# define T QT_CHECK_INVALID_MAP_ELEMENT
# define T QT_CHECK_INVALID_MAP_ELEMENT_FATAL
#endif
template < class T> class TQDeepCopy;
@ -670,7 +670,7 @@ public:
TQMap( const std::map< Key,T> & m )
{
sh = new TQMapPrivate< Key,T> ;
Q_TYPENAME std::map< Key,T> ::const_iterator it = m.begin();
T Q_TYPENAME std::map< Key,T> ::const_iterator it = m.begin();
for ( ; it != m.end(); ++it ) {
value_type p( (*it).first, (*it).second );
insert( p );
@ -687,7 +687,7 @@ public:
TQMap< Key,T> & operator= ( const std::map< Key,T> & m )
{
clear();
Q_TYPENAME std::map< Key,T> ::const_iterator it = m.begin();
T Q_TYPENAME std::map< Key,T> ::const_iterator it = m.begin();
for ( ; it != m.end(); ++it ) {
value_type p( (*it).first, (*it).second );
insert( p );
@ -737,7 +737,7 @@ public:
const_iterator find ( const Key& k ) const { return sh-> find( k ); }
const T& operator[] ( const Key& k ) const
{ QT_CHECK_INVALID_MAP_ELEMENT; return sh-> find( k ).data(); }
{ T QT_CHECK_INVALID_MAP_ELEMENT; return sh-> find( k ).data(); }
bool contains ( const Key& k ) const
{ return find( k ) != end(); }
//{ return sh-> find( k ) != ((const Priv*)sh)-> end(); }
@ -785,7 +785,7 @@ private:
};
template< class Key, class T>
Q_INLINE_TEMPLATES TQMap< Key,T> & TQMap< Key,T> ::operator= ( const TQMap< Key,T> & m )
T Q_INLINE_TEMPLATES TQMap< Key,T> & TQMap< Key,T> ::operator= ( const TQMap< Key,T> & m )
{
m.sh-> ref();
if ( sh-> deref() )
@ -795,7 +795,7 @@ Q_INLINE_TEMPLATES TQMap<Key,T>& TQMap<Key,T>::operator= ( const
}
template< class Key, class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQMap< Key,T> ::insert_pair TQMap< Key,T> ::insert( const Q_TYPENAME TQMap< Key,T> ::value_type& x )
T Q_INLINE_TEMPLATES T Q_TYPENAME TQMap< Key,T> ::insert_pair TQMap< Key,T> ::insert( const T Q_TYPENAME TQMap< Key,T> ::value_type& x )
{
detach();
size_type n = size();
@ -809,7 +809,7 @@ Q_INLINE_TEMPLATES Q_TYPENAME TQMap<Key,T>::insert_pair TQMap<Key,T>
}
template< class Key, class T>
Q_INLINE_TEMPLATES void TQMap< Key,T> ::erase( const Key& k )
T Q_INLINE_TEMPLATES void TQMap< Key,T> ::erase( const Key& k )
{
detach();
iterator it( sh-> find( k ).node );
@ -818,7 +818,7 @@ Q_INLINE_TEMPLATES void TQMap<Key,T>::erase( const Key& k )
}
template< class Key, class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQMap< Key,T> ::size_type TQMap< Key,T> ::count( const Key& k ) const
T Q_INLINE_TEMPLATES T Q_TYPENAME TQMap< Key,T> ::size_type TQMap< Key,T> ::count( const Key& k ) const
{
const_iterator it( sh-> find( k ).node );
if ( it != end() ) {
@ -833,7 +833,7 @@ Q_INLINE_TEMPLATES Q_TYPENAME TQMap<Key,T>::size_type TQMap<Key,T>::
}
template< class Key, class T>
Q_INLINE_TEMPLATES T& TQMap< Key,T> ::operator[] ( const Key& k )
T Q_INLINE_TEMPLATES T& TQMap< Key,T> ::operator[] ( const Key& k )
{
detach();
TQMapNode< Key,T> * p = sh-> find( k ).node;
@ -843,7 +843,7 @@ Q_INLINE_TEMPLATES T& TQMap<Key,T>::operator[] ( const Key& k )
}
template< class Key, class T>
Q_INLINE_TEMPLATES void TQMap< Key,T> ::clear()
T Q_INLINE_TEMPLATES void TQMap< Key,T> ::clear()
{
if ( sh-> count == 1 )
sh-> clear();
@ -854,7 +854,7 @@ Q_INLINE_TEMPLATES void TQMap<Key,T>::clear()
}
template< class Key, class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQMap< Key,T> ::iterator TQMap< Key,T> ::insert( const Key& key, const T& value, bool overwrite )
T Q_INLINE_TEMPLATES T Q_TYPENAME TQMap< Key,T> ::iterator TQMap< Key,T> ::insert( const Key& key, const T& value, bool overwrite )
{
detach();
size_type n = size();
@ -865,7 +865,7 @@ Q_INLINE_TEMPLATES Q_TYPENAME TQMap<Key,T>::iterator TQMap<Key,T>::i
}
template< class Key, class T>
Q_INLINE_TEMPLATES void TQMap< Key,T> ::remove( const Key& k )
T Q_INLINE_TEMPLATES void TQMap< Key,T> ::remove( const Key& k )
{
detach();
iterator it( sh-> find( k ).node );
@ -874,7 +874,7 @@ Q_INLINE_TEMPLATES void TQMap<Key,T>::remove( const Key& k )
}
template< class Key, class T>
Q_INLINE_TEMPLATES void TQMap< Key,T> ::detachInternal()
T Q_INLINE_TEMPLATES void TQMap< Key,T> ::detachInternal()
{
sh-> deref(); sh = new TQMapPrivate< Key,T> ( sh );
}
@ -882,7 +882,7 @@ Q_INLINE_TEMPLATES void TQMap<Key,T>::detachInternal()
#ifndef TQT_NO_DATASTREAM
template< class Key, class T>
Q_INLINE_TEMPLATES TQDataStream& operator> > ( TQDataStream& s, TQMap< Key,T> & m ) {
T Q_INLINE_TEMPLATES TQDataStream& operator> > ( TQDataStream& s, TQMap< Key,T> & m ) {
m.clear();
TQ_UINT32 c;
s > > c;
@ -898,7 +898,7 @@ Q_INLINE_TEMPLATES TQDataStream& operator>>( TQDataStream& s, TQMa
template< class Key, class T>
Q_INLINE_TEMPLATES TQDataStream& operator< < ( TQDataStream& s, const TQMap< Key,T> & m ) {
T Q_INLINE_TEMPLATES TQDataStream& operator< < ( TQDataStream& s, const TQMap< Key,T> & m ) {
s < < (TQ_UINT32)m.size();
TQMapConstIterator< Key,T> it = m.begin();
for( ; it != m.end(); ++it )