qmap-h.html

qtopiaphone英文帮助,用于初学者和开发人员,初学者可以用来学习,开发人员可以用来资料查询.

    }

    /**
     * Implementations of basic tree algorithms
     */
    void rotateLeft( QMapNodeBase* x, QMapNodeBase*& root);
    void rotateRight( QMapNodeBase* x, QMapNodeBase*& root );
    void rebalance( QMapNodeBase* x, QMapNodeBase*& root );
    QMapNodeBase* removeAndRebalance( QMapNodeBase* z, QMapNodeBase*& root,
                                      QMapNodeBase*& leftmost,
                                      QMapNodeBase*& rightmost );

    /**
     * Variables
     */
    int node_count;
};


template <class Key, class T>
class QMapPrivate : public QMapPrivateBase
{
public:
    /**
     * Typedefs
     */
    typedef QMapIterator< Key, T > Iterator;
    typedef QMapConstIterator< Key, T > ConstIterator;
    typedef QMapNode< Key, T > Node;
    typedef QMapNode< Key, T >* NodePtr;

    /**
     * Functions
     */
    QMapPrivate() {
        header = new Node;
        header->color = QMapNodeBase::Red; // Mark the header
        header->parent = 0;
        header->left = header->right = header;
    }
    QMapPrivate( const QMapPrivate< Key, T >* _map ) : QMapPrivateBase( _map ) {
        header = new Node;
        header->color = QMapNodeBase::Red; // Mark the header
        if ( _map->header->parent == 0 ) {
            header->parent = 0;
            header->left = header->right = header;
        } else {
            header->parent = copy( (NodePtr)(_map->header->parent) );
            header->parent->parent = header;
            header->left = header->parent->minimum();
            header->right = header->parent->maximum();
        }
    }
    ~QMapPrivate() { clear(); delete header; }

    NodePtr copy( NodePtr p ) {
        if ( !p )
            return 0;
        NodePtr n = new Node( *p );
        n->color = p->color;
        if ( p->left ) {
            n->left = copy( (NodePtr)(p->left) );
            n->left->parent = n;
        } else {
            n->left = 0;
        }
        if ( p->right ) {
            n->right = copy( (NodePtr)(p->right) );
            n->right->parent = n;
        } else {
            n->right = 0;
        }
        return n;
    }

    void clear() {
        clear( (NodePtr)(header->parent) );
        header->color = QMapNodeBase::Red;
        header->parent = 0;
        header->left = header->right = header;
        node_count = 0;
    }

    void clear( NodePtr p ) {
        while ( p != 0 ) {
            clear( (NodePtr)p->right );
            NodePtr y = (NodePtr)p->left;
            delete p;
            p = y;
        }
    }

    Iterator begin()    { return Iterator( (NodePtr)(header->left ) ); }
    Iterator end()      { return Iterator( header ); }
    ConstIterator begin() const { return ConstIterator( (NodePtr)(header->left ) ); }
    ConstIterator end() const { return ConstIterator( header ); }

    ConstIterator find(const Key& k) const {
        QMapNodeBase* y = header;        // Last node
        QMapNodeBase* x = header->parent; // Root node.

        while ( x != 0 ) {
            // If as k <= key(x) go left
            if ( !( key(x) < k ) ) {
                y = x;
                x = x->left;
            } else {
                x = x->right;
            }
        }

        // Was k bigger/smaller then the biggest/smallest
        // element of the tree ? Return end()
        if ( y == header || k < key(y) )
            return ConstIterator( header );
        return ConstIterator( (NodePtr)y );
    }

    void remove( Iterator it ) {
        NodePtr del = (NodePtr) removeAndRebalance( it.node, header->parent, header->left, header->right );
        delete del;
        --node_count;
    }

#ifdef QT_QMAP_DEBUG
    void inorder( QMapNodeBase* x = 0, int level = 0 ){
        if ( !x )
            x = header->parent;
        if ( x->left )
            inorder( x->left, level + 1 );
    //cout << level << " Key=" << key(x) << " Value=" << ((NodePtr)x)->data << endl;
        if ( x->right )
            inorder( x->right, level + 1 );
    }
#endif

    Iterator insertMulti(const Key& v){
        QMapNodeBase* y = header;
        QMapNodeBase* x = header->parent;
        while (x != 0){
            y = x;
            x = ( v < key(x) ) ? x->left : x->right;
        }
        return insert(x, y, v);
    }

    Iterator insertSingle( const Key& k ) {
        // Search correct position in the tree
        QMapNodeBase* y = header;
        QMapNodeBase* x = header->parent;
        bool result = TRUE;
        while ( x != 0 ) {
            result = ( k < key(x) );
            y = x;
            x = result ? x->left : x->right;
        }
        // Get iterator on the last not empty one
        Iterator j( (NodePtr)y );
        if ( result ) {
            // Smaller then the leftmost one ?
            if ( j == begin() ) {
                return insert(x, y, k );
            } else {
                // Perhaps daddy is the right one ?
                --j;
            }
        }
        // Really bigger ?
        if ( (j.node->key) < k )
            return insert(x, y, k );
        // We are going to replace a node
        return j;
    }

    Iterator insert( QMapNodeBase* x, QMapNodeBase* y, const Key& k ) {
        NodePtr z = new Node( k );
        if (y == header || x != 0 || k < key(y) ) {
            y->left = z;                // also makes leftmost = z when y == header
            if ( y == header ) {
                header->parent = z;
                header->right = z;
            } else if ( y == header->left )
                header->left = z;           // maintain leftmost pointing to min node
        } else {
            y->right = z;
            if ( y == header->right )
                header->right = z;          // maintain rightmost pointing to max node
        }
        z->parent = y;
        z->left = 0;
        z->right = 0;
        rebalance( z, header->parent );
        ++node_count;
        return Iterator(z);
    }

protected:
    /**
     * Helpers
     */
    const Key& key( QMapNodeBase* b ) const { return ((NodePtr)b)->key; }

    /**
     * Variables
     */
    NodePtr header;
};


template<class Key, class T>
class Q_EXPORT <a href="qmap.html">QMap</a>
{
public:
    /**
     * Typedefs
     */
    typedef QMapIterator&lt; Key, T &gt; Iterator;
    typedef QMapConstIterator&lt; Key, T &gt; ConstIterator;
    typedef T ValueType;
    typedef QMapPrivate&lt; Key, T &gt; Priv;

    /**
     * API
     */
    QMap() { sh = new QMapPrivate&lt; Key, T &gt;; }
    QMap( const QMap&lt;Key,T&gt;&amp; m ) { sh = m.sh; sh-&gt;ref(); }
    ~QMap() { if ( sh-&gt;deref() ) delete sh; }

    QMap&lt;Key,T&gt;&amp; operator= ( const QMap&lt;Key,T&gt;&amp; m )
      { m.sh-&gt;ref(); if ( sh-&gt;deref() ) delete sh; sh = m.sh; return *this; }

    Iterator begin() { detach(); return sh-&gt;begin(); }
    Iterator end() { detach(); return sh-&gt;end(); }
    ConstIterator begin() const { return ((const Priv*)sh)-&gt;begin(); }
    ConstIterator end() const { return ((const Priv*)sh)-&gt;end(); }

    Iterator find ( const Key&amp; k )
        { detach(); return Iterator( sh-&gt;find( k ).node ); }
    ConstIterator find ( const Key&amp; k ) const
        { return sh-&gt;find( k ); }
    T&amp; operator[] ( const Key&amp; k ) {
        detach(); QMapNode&lt;Key,T&gt;* p = sh-&gt;find( k ).node;
        if ( p != sh-&gt;end().node ) return p-&gt;data;
        return insert( k, T() ).data(); }
    const T&amp; operator[] ( const Key&amp; k ) const
        { return sh-&gt;find( k ).data(); }
    bool contains ( const Key&amp; k ) const
        { return find( k ) != end(); }
        //{ return sh-&gt;find( k ) != ((const Priv*)sh)-&gt;end(); }

    uint count() const { return sh-&gt;node_count; }

    bool isEmpty() const { return sh-&gt;node_count == 0; }

    Iterator insert( const Key&amp; key, const T&amp; value ) {
        detach();
        Iterator it = sh-&gt;insertSingle( key );
        it.data() = value;
        return it;
    }

    void remove( Iterator it ) { detach(); sh-&gt;remove( it ); }
    void remove( const Key&amp; k ) {
        detach();
        Iterator it( sh-&gt;find( k ).node );
        if ( it != end() )
            sh-&gt;remove( it );
    }

    Iterator replace( const Key&amp; k, const T&amp; v ) {
        remove( k );
        return insert( k, v );
    }

    void clear() { if ( sh-&gt;count == 1 ) sh-&gt;clear(); else { sh-&gt;deref(); sh = new QMapPrivate&lt;Key,T&gt;; } }

#if defined(Q_FULL_TEMPLATE_INSTANTIATION)
    bool operator==( const QMap&lt;Key,T&gt;&amp; ) const { return FALSE; }
#endif

protected:
    /**
     * Helpers
     */
    void detach() { if ( sh-&gt;count &gt; 1 ) { sh-&gt;deref(); sh = new QMapPrivate&lt;Key,T&gt;( sh ); } }

    Priv* sh;
};


#ifndef QT_NO_DATASTREAM
template&lt;class Key, class T&gt;
inline QDataStream&amp; operator&gt;&gt;( QDataStream&amp; s, QMap&lt;Key,T&gt;&amp; m ) {
    m.clear();
    Q_UINT32 c;
    s &gt;&gt; c;
    for( Q_UINT32 i = 0; i &lt; c; ++i ) {
        Key k; T t;
        s &gt;&gt; k &gt;&gt; t;
        m.insert( k, t );
        if ( s.atEnd() )
            break;
    }
    return s;
}


template&lt;class Key, class T&gt;
inline QDataStream&amp; operator&lt;&lt;( QDataStream&amp; s, const QMap&lt;Key,T&gt;&amp; m ) {
    s &lt;&lt; (Q_UINT32)m.count();
    QMapConstIterator&lt;Key,T&gt; it = m.begin();
    for( ; it != m.end(); ++it )
        s &lt;&lt; it.key() &lt;&lt; it.data();
    return s;
}
#endif

#endif // QMAP_H

</pre>
<p><address><hr><div align="center">
<table width="100%" cellspacing="0" border="0"><tr>
<td>Copyright