📄 qmap-h.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Qt Toolkit - 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: white; color: black; }--></style></head><body bgcolor="#ffffff"><table width="100%"><tr><td><a href="index.html"><img width="100" height="100" src="qtlogo.png"alt="Home" border="0"><img width="100"height="100" src="face.png" alt="Home" border="0"></a><td valign="top"><div align="right"><img src="dochead.png" width="472" height="27"><br><a href="classes.html"><b>Classes</b></a>- <a href="annotated.html">Annotated</a>- <a href="hierarchy.html">Tree</a>- <a href="functions.html">Functions</a>- <a href="index.html">Home</a>- <a href="topicals.html"><b>Structure</b> <font face="Arial,Helvetica,Geneva,Swiss,SunSans-Regular" align="center" size=32>Qte</font></a></div></table><h1 align=center>qmap.h</h1><br clear="all">This is the verbatim text of the qmap.h include file. It isprovided only for illustration; the copyrightremains with Trolltech.<hr><pre>/****************************************************************************** $Id: qt/src/tools/qmap.h 2.3.8 edited 2004-05-12 $**** 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 "qshared.h"#include "qdatastream.h"#endif // QT_Hstruct 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 Q_EXPORT <a href="qmapiterator.html">QMapIterator</a>{ public: /** * Typedefs */ typedef QMapNode< K, T >* NodePtr; /** * 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; } // Cannot have this - some compilers are too stupid //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() { 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; } int 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; }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>class Q_EXPORT <a href="qmapconstiterator.html">QMapConstIterator</a>{ public: /** * Typedefs */ typedef QMapNode< K, T >* NodePtr; /** * 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; } // Cannot have this - some compilers are too stupid //const T* operator->() const { return &(node->data); } const K& key() const { return node->key; } const T& data() const { return node->data; }private: int 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; } int 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; }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; }};class Q_EXPORT QMapPrivateBase : public <a href="qshared.html">QShared</a>{public: QMapPrivateBase() { node_count = 0; } QMapPrivateBase( const QMapPrivateBase* _map) { node_count = _map->node_count;⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -