qmap-h.html
来自「QT 下载资料仅供参考」· HTML 代码 · 共 918 行 · 第 1/2 页
HTML
918 行
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"><!-- /home/reggie/tmp/qt-3.0-reggie-5401/qt-x11-commercial-3.0.5/include/qmap.h:1 --><html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>qmap.h Include File</title><style type="text/css"><!--h3.fn,span.fn { margin-left: 1cm; text-indent: -1cm; }a:link { color: #004faf; text-decoration: none }a:visited { color: #672967; text-decoration: none }body { background: #ffffff; color: black; }--></style></head><body><table border="0" cellpadding="0" cellspacing="0" width="100%"><tr bgcolor="#E5E5E5"><td valign=center> <a href="index.html"><font color="#004faf">Home</font></a> | <a href="classes.html"><font color="#004faf">All Classes</font></a> | <a href="mainclasses.html"><font color="#004faf">Main Classes</font></a> | <a href="annotated.html"><font color="#004faf">Annotated</font></a> | <a href="groups.html"><font color="#004faf">Grouped Classes</font></a> | <a href="functions.html"><font color="#004faf">Functions</font></a></td><td align="right" valign="center"><img src="logo32.png" align="right" width="64" height="32" border="0"></td></tr></table><h1 align=center>qmap.h</h1><p>This is the verbatim text of the qmap.h include file. It is provided only for illustration; the copyright remains with Trolltech.<hr><pre>/****************************************************************************** $Id: qt/qmap.h 3.0.5 edited Jun 7 04:20 $**** Definition of QMap class**** Created : 990406**** Copyright (C) 1992-2000 Trolltech AS. All rights reserved.**** This file is part of the tools module of the Qt GUI Toolkit.**** This file may be distributed under the terms of the Q Public License** as defined by Trolltech AS of Norway and appearing in the file** LICENSE.QPL included in the packaging of this file.**** This file may be distributed and/or modified under the terms of the** GNU General Public License version 2 as published by the Free Software** Foundation and appearing in the file LICENSE.GPL included in the** packaging of this file.**** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition** licenses may use this file in accordance with the Qt Commercial License** Agreement provided with the Software.**** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.**** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for** information about Qt Commercial License Agreements.** See http://www.trolltech.com/qpl/ for QPL licensing information.** See http://www.trolltech.com/gpl/ for GPL licensing information.**** Contact info@trolltech.com if any conditions of this licensing are** not clear to you.************************************************************************/#ifndef QMAP_H#define QMAP_H#ifndef QT_H#include "qglobal.h"#include "qshared.h"#include "qdatastream.h"#include "qpair.h"#include "qtl.h"#include "qvaluelist.h"#endif // QT_H#ifndef QT_NO_STL#include <iterator>#include <map>#endif//#define QT_CHECK_MAP_RANGEstruct Q_EXPORT QMapNodeBase{ enum Color { Red, Black }; QMapNodeBase* left; QMapNodeBase* right; QMapNodeBase* parent; Color color; QMapNodeBase* minimum() { QMapNodeBase* x = this; while ( x->left ) x = x->left; return x; } QMapNodeBase* maximum() { QMapNodeBase* x = this; while ( x->right ) x = x->right; return x; }};template <class K, class T>struct QMapNode : public QMapNodeBase{ QMapNode( const K& _key, const T& _data ) { data = _data; key = _key; } QMapNode( const K& _key ) { key = _key; } QMapNode( const QMapNode<K,T>& _n ) { key = _n.key; data = _n.data; } QMapNode() { } T data; K key;};template<class K, class T>class QMapIterator{ public: /** * Typedefs */ typedef QMapNode< K, T >* NodePtr;#ifndef QT_NO_STL typedef std::bidirectional_iterator_tag iterator_category;#endif typedef T value_type;#ifndef QT_NO_STL typedef ptrdiff_t difference_type;#else typedef int difference_type;#endif typedef T* pointer; typedef T& reference; /** * Variables */ QMapNode<K,T>* node; /** * Functions */ QMapIterator() : node( 0 ) {} QMapIterator( QMapNode<K,T>* p ) : node( p ) {} QMapIterator( const QMapIterator<K,T>& it ) : node( it.node ) {} bool operator==( const QMapIterator<K,T>& it ) const { return node == it.node; } bool operator!=( const QMapIterator<K,T>& it ) const { return node != it.node; } T& operator*() { return node->data; } const T& operator*() const { return node->data; } // UDT for T = x* // T* operator->() const { return &node->data; } const K& key() const { return node->key; } T& data() { return node->data; } const T& data() const { return node->data; }private: int inc(); int dec();public: QMapIterator<K,T>& operator++() { inc(); return *this; } QMapIterator<K,T> operator++(int) { QMapIterator<K,T> tmp = *this; inc(); return tmp; } QMapIterator<K,T>& operator--() { dec(); return *this; } QMapIterator<K,T> operator--(int) { QMapIterator<K,T> tmp = *this; dec(); return tmp; }};template <class K, class T>Q_INLINE_TEMPLATES int QMapIterator<K,T>::inc(){ QMapNodeBase* tmp = node; if ( tmp->right ) { tmp = tmp->right; while ( tmp->left ) tmp = tmp->left; } else { QMapNodeBase* y = tmp->parent; while (tmp == y->right) { tmp = y; y = y->parent; } if (tmp->right != y) tmp = y; } node = (NodePtr)tmp; return 0;}template <class K, class T>Q_INLINE_TEMPLATES int QMapIterator<K,T>::dec(){ QMapNodeBase* tmp = node; if (tmp->color == QMapNodeBase::Red && tmp->parent->parent == tmp ) { tmp = tmp->right; } else if (tmp->left != 0) { QMapNodeBase* y = tmp->left; while ( y->right ) y = y->right; tmp = y; } else { QMapNodeBase* y = tmp->parent; while (tmp == y->left) { tmp = y; y = y->parent; } tmp = y; } node = (NodePtr)tmp; return 0;}template<class K, class T>class QMapConstIterator{ public: /** * Typedefs */ typedef QMapNode< K, T >* NodePtr;#ifndef QT_NO_STL typedef std::bidirectional_iterator_tag iterator_category;#endif typedef T value_type;#ifndef QT_NO_STL typedef ptrdiff_t difference_type;#else typedef int difference_type;#endif typedef const T* pointer; typedef const T& reference; /** * Variables */ QMapNode<K,T>* node; /** * Functions */ QMapConstIterator() : node( 0 ) {} QMapConstIterator( QMapNode<K,T>* p ) : node( p ) {} QMapConstIterator( const QMapConstIterator<K,T>& it ) : node( it.node ) {} QMapConstIterator( const QMapIterator<K,T>& it ) : node( it.node ) {} bool operator==( const QMapConstIterator<K,T>& it ) const { return node == it.node; } bool operator!=( const QMapConstIterator<K,T>& it ) const { return node != it.node; } const T& operator*() const { return node->data; } // UDT for T = x* // const T* operator->() const { return &node->data; } const K& key() const { return node->key; } const T& data() const { return node->data; }private: int inc(); int dec();public: QMapConstIterator<K,T>& operator++() { inc(); return *this; } QMapConstIterator<K,T> operator++(int) { QMapConstIterator<K,T> tmp = *this; inc(); return tmp; } QMapConstIterator<K,T>& operator--() { dec(); return *this; } QMapConstIterator<K,T> operator--(int) { QMapConstIterator<K,T> tmp = *this; dec(); return tmp; }};template <class K, class T>Q_INLINE_TEMPLATES int QMapConstIterator<K,T>::inc(){ QMapNodeBase* tmp = node; if ( tmp->right ) { tmp = tmp->right; while ( tmp->left ) tmp = tmp->left; } else { QMapNodeBase* y = tmp->parent; while (tmp == y->right) { tmp = y; y = y->parent; } if (tmp->right != y) tmp = y; } node = (NodePtr)tmp; return 0;}template <class K, class T>Q_INLINE_TEMPLATES int QMapConstIterator<K,T>::dec(){ QMapNodeBase* tmp = node; if (tmp->color == QMapNodeBase::Red && tmp->parent->parent == tmp ) { tmp = tmp->right; } else if (tmp->left != 0) { QMapNodeBase* y = tmp->left; while ( y->right ) y = y->right; tmp = y; } else { QMapNodeBase* y = tmp->parent; while (tmp == y->left) { tmp = y; y = y->parent; } tmp = y; } node = (NodePtr)tmp; return 0;}class Q_EXPORT QMapPrivateBase : public QShared{public: QMapPrivateBase() { node_count = 0; } QMapPrivateBase( const QMapPrivateBase* _map) { node_count = _map->node_count; } /** * 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(); QMapPrivate( const QMapPrivate< Key, T >* _map ); ~QMapPrivate() { clear(); delete header; } NodePtr copy( NodePtr p ); void clear(); void clear( NodePtr p ); 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; 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#if 0 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); }#endif Iterator insertSingle( const Key& k ); Iterator insert( QMapNodeBase* x, QMapNodeBase* y, const Key& k );protected: /** * Helpers */ const Key& key( QMapNodeBase* b ) const { return ((NodePtr)b)->key; } /**⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?