|
Packit |
1c1d7e |
/****************************************************************************
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** Definition of QMap class
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** Created : 990406
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** Copyright (C) 1992-2000 Trolltech AS. All rights reserved.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** This file is part of the tools module of the Qt GUI Toolkit.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** This file may be distributed under the terms of the Q Public License
|
|
Packit |
1c1d7e |
** as defined by Trolltech AS of Norway and appearing in the file
|
|
Packit |
1c1d7e |
** LICENSE.QPL included in the packaging of this file.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** This file may be distributed and/or modified under the terms of the
|
|
Packit |
1c1d7e |
** GNU General Public License version 2 as published by the Free Software
|
|
Packit |
1c1d7e |
** Foundation and appearing in the file LICENSE.GPL included in the
|
|
Packit |
1c1d7e |
** packaging of this file.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition
|
|
Packit |
1c1d7e |
** licenses may use this file in accordance with the Qt Commercial License
|
|
Packit |
1c1d7e |
** Agreement provided with the Software.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
Packit |
1c1d7e |
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for
|
|
Packit |
1c1d7e |
** information about Qt Commercial License Agreements.
|
|
Packit |
1c1d7e |
** See http://www.trolltech.com/qpl/ for QPL licensing information.
|
|
Packit |
1c1d7e |
** See http://www.trolltech.com/gpl/ for GPL licensing information.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
** Contact info@trolltech.com if any conditions of this licensing are
|
|
Packit |
1c1d7e |
** not clear to you.
|
|
Packit |
1c1d7e |
**
|
|
Packit |
1c1d7e |
**********************************************************************/
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
#ifndef QMAP_H
|
|
Packit |
1c1d7e |
#define QMAP_H
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
#ifndef QT_H
|
|
Packit |
1c1d7e |
#include "qshared.h"
|
|
Packit |
1c1d7e |
#include "qdatastream.h"
|
|
Packit |
1c1d7e |
#endif // QT_H
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
struct QMapNodeBase
|
|
Packit |
1c1d7e |
{
|
|
Packit |
1c1d7e |
enum Color { Red, Black };
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapNodeBase* left;
|
|
Packit |
1c1d7e |
QMapNodeBase* right;
|
|
Packit |
1c1d7e |
QMapNodeBase* parent;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Color color;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapNodeBase* minimum() {
|
|
Packit |
1c1d7e |
QMapNodeBase* x = this;
|
|
Packit |
1c1d7e |
while ( x->left )
|
|
Packit |
1c1d7e |
x = x->left;
|
|
Packit |
1c1d7e |
return x;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapNodeBase* maximum() {
|
|
Packit |
1c1d7e |
QMapNodeBase* x = this;
|
|
Packit |
1c1d7e |
while ( x->right )
|
|
Packit |
1c1d7e |
x = x->right;
|
|
Packit |
1c1d7e |
return x;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
};
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
template <class K, class T>
|
|
Packit |
1c1d7e |
struct QMapNode : public QMapNodeBase
|
|
Packit |
1c1d7e |
{
|
|
Packit |
1c1d7e |
QMapNode( const K& _key, const T& _data ) { data = _data; key = _key; }
|
|
Packit |
1c1d7e |
QMapNode( const K& _key ) { key = _key; }
|
|
Packit |
1c1d7e |
QMapNode( const QMapNode<K,T>& _n ) { key = _n.key; data = _n.data; }
|
|
Packit |
1c1d7e |
QMapNode() { }
|
|
Packit |
1c1d7e |
T data;
|
|
Packit |
1c1d7e |
K key;
|
|
Packit |
1c1d7e |
};
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
template<class K, class T>
|
|
Packit |
1c1d7e |
class Q_EXPORT QMapIterator
|
|
Packit |
1c1d7e |
{
|
|
Packit |
1c1d7e |
public:
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Typedefs
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
typedef QMapNode< K, T >* NodePtr;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Variables
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
QMapNode<K,T>* node;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Functions
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
QMapIterator() : node( 0 ) {}
|
|
Packit |
1c1d7e |
QMapIterator( QMapNode<K,T>* p ) : node( p ) {}
|
|
Packit |
1c1d7e |
QMapIterator( const QMapIterator<K,T>& it ) : node( it.node ) {}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
bool operator==( const QMapIterator<K,T>& it ) const { return node == it.node; }
|
|
Packit |
1c1d7e |
bool operator!=( const QMapIterator<K,T>& it ) const { return node != it.node; }
|
|
Packit |
1c1d7e |
T& operator*() { return node->data; }
|
|
Packit |
1c1d7e |
const T& operator*() const { return node->data; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
// Cannot have this - some compilers are too stupid
|
|
Packit |
1c1d7e |
//T* operator->() const { return &(node->data); }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
const K& key() const { return node->key; }
|
|
Packit |
1c1d7e |
T& data() { return node->data; }
|
|
Packit |
1c1d7e |
const T& data() const { return node->data; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
private:
|
|
Packit |
1c1d7e |
int inc() {
|
|
Packit |
1c1d7e |
QMapNodeBase* tmp = node;
|
|
Packit |
1c1d7e |
if ( tmp->right ) {
|
|
Packit |
1c1d7e |
tmp = tmp->right;
|
|
Packit |
1c1d7e |
while ( tmp->left )
|
|
Packit |
1c1d7e |
tmp = tmp->left;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
QMapNodeBase* y = tmp->parent;
|
|
Packit |
1c1d7e |
while (tmp == y->right) {
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
y = y->parent;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
if (tmp->right != y)
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
node = (NodePtr)tmp;
|
|
Packit |
1c1d7e |
return 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
int dec() {
|
|
Packit |
1c1d7e |
QMapNodeBase* tmp = node;
|
|
Packit |
1c1d7e |
if (tmp->color == QMapNodeBase::Red &&
|
|
Packit |
1c1d7e |
tmp->parent->parent == tmp ) {
|
|
Packit |
1c1d7e |
tmp = tmp->right;
|
|
Packit |
1c1d7e |
} else if (tmp->left != 0) {
|
|
Packit |
1c1d7e |
QMapNodeBase* y = tmp->left;
|
|
Packit |
1c1d7e |
while ( y->right )
|
|
Packit |
1c1d7e |
y = y->right;
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
QMapNodeBase* y = tmp->parent;
|
|
Packit |
1c1d7e |
while (tmp == y->left) {
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
y = y->parent;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
node = (NodePtr)tmp;
|
|
Packit |
1c1d7e |
return 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
public:
|
|
Packit |
1c1d7e |
QMapIterator<K,T>& operator++() {
|
|
Packit |
1c1d7e |
inc();
|
|
Packit |
1c1d7e |
return *this;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapIterator<K,T> operator++(int) {
|
|
Packit |
1c1d7e |
QMapIterator<K,T> tmp = *this;
|
|
Packit |
1c1d7e |
inc();
|
|
Packit |
1c1d7e |
return tmp;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapIterator<K,T>& operator--() {
|
|
Packit |
1c1d7e |
dec();
|
|
Packit |
1c1d7e |
return *this;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapIterator<K,T> operator--(int) {
|
|
Packit |
1c1d7e |
QMapIterator<K,T> tmp = *this;
|
|
Packit |
1c1d7e |
dec();
|
|
Packit |
1c1d7e |
return tmp;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
};
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
template<class K, class T>
|
|
Packit |
1c1d7e |
class Q_EXPORT QMapConstIterator
|
|
Packit |
1c1d7e |
{
|
|
Packit |
1c1d7e |
public:
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Typedefs
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
typedef QMapNode< K, T >* NodePtr;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Variables
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
QMapNode<K,T>* node;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Functions
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
QMapConstIterator() : node( 0 ) {}
|
|
Packit |
1c1d7e |
QMapConstIterator( QMapNode<K,T>* p ) : node( p ) {}
|
|
Packit |
1c1d7e |
QMapConstIterator( const QMapConstIterator<K,T>& it ) : node( it.node ) {}
|
|
Packit |
1c1d7e |
QMapConstIterator( const QMapIterator<K,T>& it ) : node( it.node ) {}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
bool operator==( const QMapConstIterator<K,T>& it ) const { return node == it.node; }
|
|
Packit |
1c1d7e |
bool operator!=( const QMapConstIterator<K,T>& it ) const { return node != it.node; }
|
|
Packit |
1c1d7e |
const T& operator*() const { return node->data; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
// Cannot have this - some compilers are too stupid
|
|
Packit |
1c1d7e |
//const T* operator->() const { return &(node->data); }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
const K& key() const { return node->key; }
|
|
Packit |
1c1d7e |
const T& data() const { return node->data; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
private:
|
|
Packit |
1c1d7e |
int inc() {
|
|
Packit |
1c1d7e |
QMapNodeBase* tmp = node;
|
|
Packit |
1c1d7e |
if ( tmp->right ) {
|
|
Packit |
1c1d7e |
tmp = tmp->right;
|
|
Packit |
1c1d7e |
while ( tmp->left )
|
|
Packit |
1c1d7e |
tmp = tmp->left;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
QMapNodeBase* y = tmp->parent;
|
|
Packit |
1c1d7e |
while (tmp == y->right) {
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
y = y->parent;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
if (tmp->right != y)
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
node = (NodePtr)tmp;
|
|
Packit |
1c1d7e |
return 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
int dec() {
|
|
Packit |
1c1d7e |
QMapNodeBase* tmp = node;
|
|
Packit |
1c1d7e |
if (tmp->color == QMapNodeBase::Red &&
|
|
Packit |
1c1d7e |
tmp->parent->parent == tmp ) {
|
|
Packit |
1c1d7e |
tmp = tmp->right;
|
|
Packit |
1c1d7e |
} else if (tmp->left != 0) {
|
|
Packit |
1c1d7e |
QMapNodeBase* y = tmp->left;
|
|
Packit |
1c1d7e |
while ( y->right )
|
|
Packit |
1c1d7e |
y = y->right;
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
QMapNodeBase* y = tmp->parent;
|
|
Packit |
1c1d7e |
while (tmp == y->left) {
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
y = y->parent;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
tmp = y;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
node = (NodePtr)tmp;
|
|
Packit |
1c1d7e |
return 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
public:
|
|
Packit |
1c1d7e |
QMapConstIterator<K,T>& operator++() {
|
|
Packit |
1c1d7e |
inc();
|
|
Packit |
1c1d7e |
return *this;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapConstIterator<K,T> operator++(int) {
|
|
Packit |
1c1d7e |
QMapConstIterator<K,T> tmp = *this;
|
|
Packit |
1c1d7e |
inc();
|
|
Packit |
1c1d7e |
return tmp;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapConstIterator<K,T>& operator--() {
|
|
Packit |
1c1d7e |
dec();
|
|
Packit |
1c1d7e |
return *this;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMapConstIterator<K,T> operator--(int) {
|
|
Packit |
1c1d7e |
QMapConstIterator<K,T> tmp = *this;
|
|
Packit |
1c1d7e |
dec();
|
|
Packit |
1c1d7e |
return tmp;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
};
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
class Q_EXPORT QMapPrivateBase : public QShared
|
|
Packit |
1c1d7e |
{
|
|
Packit |
1c1d7e |
public:
|
|
Packit |
1c1d7e |
QMapPrivateBase() {
|
|
Packit |
1c1d7e |
node_count = 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
QMapPrivateBase( const QMapPrivateBase* _map) {
|
|
Packit |
1c1d7e |
node_count = _map->node_count;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Implementations of basic tree algorithms
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
void rotateLeft( QMapNodeBase* x, QMapNodeBase*& root);
|
|
Packit |
1c1d7e |
void rotateRight( QMapNodeBase* x, QMapNodeBase*& root );
|
|
Packit |
1c1d7e |
void rebalance( QMapNodeBase* x, QMapNodeBase*& root );
|
|
Packit |
1c1d7e |
QMapNodeBase* removeAndRebalance( QMapNodeBase* z, QMapNodeBase*& root,
|
|
Packit |
1c1d7e |
QMapNodeBase*& leftmost,
|
|
Packit |
1c1d7e |
QMapNodeBase*& rightmost );
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Variables
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
int node_count;
|
|
Packit |
1c1d7e |
};
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
template <class Key, class T>
|
|
Packit |
1c1d7e |
class QMapPrivate : public QMapPrivateBase
|
|
Packit |
1c1d7e |
{
|
|
Packit |
1c1d7e |
public:
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Typedefs
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
typedef QMapIterator< Key, T > Iterator;
|
|
Packit |
1c1d7e |
typedef QMapConstIterator< Key, T > ConstIterator;
|
|
Packit |
1c1d7e |
typedef QMapNode< Key, T > Node;
|
|
Packit |
1c1d7e |
typedef QMapNode< Key, T >* NodePtr;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Functions
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
QMapPrivate() {
|
|
Packit |
1c1d7e |
header = new Node;
|
|
Packit |
1c1d7e |
header->color = QMapNodeBase::Red; // Mark the header
|
|
Packit |
1c1d7e |
header->parent = 0;
|
|
Packit |
1c1d7e |
header->left = header->right = header;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
QMapPrivate( const QMapPrivate< Key, T >* _map ) : QMapPrivateBase( _map ) {
|
|
Packit |
1c1d7e |
header = new Node;
|
|
Packit |
1c1d7e |
header->color = QMapNodeBase::Red; // Mark the header
|
|
Packit |
1c1d7e |
if ( _map->header->parent == 0 ) {
|
|
Packit |
1c1d7e |
header->parent = 0;
|
|
Packit |
1c1d7e |
header->left = header->right = header;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
header->parent = copy( (NodePtr)(_map->header->parent) );
|
|
Packit |
1c1d7e |
header->parent->parent = header;
|
|
Packit |
1c1d7e |
header->left = header->parent->minimum();
|
|
Packit |
1c1d7e |
header->right = header->parent->maximum();
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
~QMapPrivate() { clear(); delete header; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
NodePtr copy( NodePtr p ) {
|
|
Packit |
1c1d7e |
if ( !p )
|
|
Packit |
1c1d7e |
return 0;
|
|
Packit |
1c1d7e |
NodePtr n = new Node( *p );
|
|
Packit |
1c1d7e |
n->color = p->color;
|
|
Packit |
1c1d7e |
if ( p->left ) {
|
|
Packit |
1c1d7e |
n->left = copy( (NodePtr)(p->left) );
|
|
Packit |
1c1d7e |
n->left->parent = n;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
n->left = 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
if ( p->right ) {
|
|
Packit |
1c1d7e |
n->right = copy( (NodePtr)(p->right) );
|
|
Packit |
1c1d7e |
n->right->parent = n;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
n->right = 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
return n;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
void clear() {
|
|
Packit |
1c1d7e |
clear( (NodePtr)(header->parent) );
|
|
Packit |
1c1d7e |
header->color = QMapNodeBase::Red;
|
|
Packit |
1c1d7e |
header->parent = 0;
|
|
Packit |
1c1d7e |
header->left = header->right = header;
|
|
Packit |
1c1d7e |
node_count = 0;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
void clear( NodePtr p ) {
|
|
Packit |
1c1d7e |
while ( p != 0 ) {
|
|
Packit |
1c1d7e |
clear( (NodePtr)p->right );
|
|
Packit |
1c1d7e |
NodePtr y = (NodePtr)p->left;
|
|
Packit |
1c1d7e |
delete p;
|
|
Packit |
1c1d7e |
p = y;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator begin() { return Iterator( (NodePtr)(header->left ) ); }
|
|
Packit |
1c1d7e |
Iterator end() { return Iterator( header ); }
|
|
Packit |
1c1d7e |
ConstIterator begin() const { return ConstIterator( (NodePtr)(header->left ) ); }
|
|
Packit |
1c1d7e |
ConstIterator end() const { return ConstIterator( header ); }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
ConstIterator find(const Key& k) const {
|
|
Packit |
1c1d7e |
QMapNodeBase* y = header; // Last node
|
|
Packit |
1c1d7e |
QMapNodeBase* x = header->parent; // Root node.
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
while ( x != 0 ) {
|
|
Packit |
1c1d7e |
// If as k <= key(x) go left
|
|
Packit |
1c1d7e |
if ( !( key(x) < k ) ) {
|
|
Packit |
1c1d7e |
y = x;
|
|
Packit |
1c1d7e |
x = x->left;
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
x = x->right;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
// Was k bigger/smaller then the biggest/smallest
|
|
Packit |
1c1d7e |
// element of the tree ? Return end()
|
|
Packit |
1c1d7e |
if ( y == header || k < key(y) )
|
|
Packit |
1c1d7e |
return ConstIterator( header );
|
|
Packit |
1c1d7e |
return ConstIterator( (NodePtr)y );
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
void remove( Iterator it ) {
|
|
Packit |
1c1d7e |
NodePtr del = (NodePtr) removeAndRebalance( it.node, header->parent, header->left, header->right );
|
|
Packit |
1c1d7e |
delete del;
|
|
Packit |
1c1d7e |
--node_count;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
#ifdef QT_QMAP_DEBUG
|
|
Packit |
1c1d7e |
void inorder( QMapNodeBase* x = 0, int level = 0 ){
|
|
Packit |
1c1d7e |
if ( !x )
|
|
Packit |
1c1d7e |
x = header->parent;
|
|
Packit |
1c1d7e |
if ( x->left )
|
|
Packit |
1c1d7e |
inorder( x->left, level + 1 );
|
|
Packit |
1c1d7e |
//cout << level << " Key=" << key(x) << " Value=" << ((NodePtr)x)->data << endl;
|
|
Packit |
1c1d7e |
if ( x->right )
|
|
Packit |
1c1d7e |
inorder( x->right, level + 1 );
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
#endif
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator insertMulti(const Key& v){
|
|
Packit |
1c1d7e |
QMapNodeBase* y = header;
|
|
Packit |
1c1d7e |
QMapNodeBase* x = header->parent;
|
|
Packit |
1c1d7e |
while (x != 0){
|
|
Packit |
1c1d7e |
y = x;
|
|
Packit |
1c1d7e |
x = ( v < key(x) ) ? x->left : x->right;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
return insert(x, y, v);
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator insertSingle( const Key& k ) {
|
|
Packit |
1c1d7e |
// Search correct position in the tree
|
|
Packit |
1c1d7e |
QMapNodeBase* y = header;
|
|
Packit |
1c1d7e |
QMapNodeBase* x = header->parent;
|
|
Packit |
1c1d7e |
bool result = TRUE;
|
|
Packit |
1c1d7e |
while ( x != 0 ) {
|
|
Packit |
1c1d7e |
result = ( k < key(x) );
|
|
Packit |
1c1d7e |
y = x;
|
|
Packit |
1c1d7e |
x = result ? x->left : x->right;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
// Get iterator on the last not empty one
|
|
Packit |
1c1d7e |
Iterator j( (NodePtr)y );
|
|
Packit |
1c1d7e |
if ( result ) {
|
|
Packit |
1c1d7e |
// Smaller then the leftmost one ?
|
|
Packit |
1c1d7e |
if ( j == begin() ) {
|
|
Packit |
1c1d7e |
return insert(x, y, k );
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
// Perhaps daddy is the right one ?
|
|
Packit |
1c1d7e |
--j;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
// Really bigger ?
|
|
Packit |
1c1d7e |
if ( (j.node->key) < k )
|
|
Packit |
1c1d7e |
return insert(x, y, k );
|
|
Packit |
1c1d7e |
// We are going to replace a node
|
|
Packit |
1c1d7e |
return j;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator insert( QMapNodeBase* x, QMapNodeBase* y, const Key& k ) {
|
|
Packit |
1c1d7e |
NodePtr z = new Node( k );
|
|
Packit |
1c1d7e |
if (y == header || x != 0 || k < key(y) ) {
|
|
Packit |
1c1d7e |
y->left = z; // also makes leftmost = z when y == header
|
|
Packit |
1c1d7e |
if ( y == header ) {
|
|
Packit |
1c1d7e |
header->parent = z;
|
|
Packit |
1c1d7e |
header->right = z;
|
|
Packit |
1c1d7e |
} else if ( y == header->left )
|
|
Packit |
1c1d7e |
header->left = z; // maintain leftmost pointing to min node
|
|
Packit |
1c1d7e |
} else {
|
|
Packit |
1c1d7e |
y->right = z;
|
|
Packit |
1c1d7e |
if ( y == header->right )
|
|
Packit |
1c1d7e |
header->right = z; // maintain rightmost pointing to max node
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
z->parent = y;
|
|
Packit |
1c1d7e |
z->left = 0;
|
|
Packit |
1c1d7e |
z->right = 0;
|
|
Packit |
1c1d7e |
rebalance( z, header->parent );
|
|
Packit |
1c1d7e |
++node_count;
|
|
Packit |
1c1d7e |
return Iterator(z);
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
protected:
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Helpers
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
const Key& key( QMapNodeBase* b ) const { return ((NodePtr)b)->key; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Variables
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
NodePtr header;
|
|
Packit |
1c1d7e |
};
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
template<class Key, class T>
|
|
Packit |
1c1d7e |
class Q_EXPORT QMap
|
|
Packit |
1c1d7e |
{
|
|
Packit |
1c1d7e |
public:
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Typedefs
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
typedef QMapIterator< Key, T > Iterator;
|
|
Packit |
1c1d7e |
typedef QMapConstIterator< Key, T > ConstIterator;
|
|
Packit |
1c1d7e |
typedef T ValueType;
|
|
Packit |
1c1d7e |
typedef QMapPrivate< Key, T > Priv;
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* API
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
QMap() { sh = new QMapPrivate< Key, T >; }
|
|
Packit |
1c1d7e |
QMap( const QMap<Key,T>& m ) { sh = m.sh; sh->ref(); }
|
|
Packit |
1c1d7e |
~QMap() { if ( sh->deref() ) delete sh; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
QMap<Key,T>& operator= ( const QMap<Key,T>& m )
|
|
Packit |
1c1d7e |
{ m.sh->ref(); if ( sh->deref() ) delete sh; sh = m.sh; return *this; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator begin() { detach(); return sh->begin(); }
|
|
Packit |
1c1d7e |
Iterator end() { detach(); return sh->end(); }
|
|
Packit |
1c1d7e |
ConstIterator begin() const { return ((const Priv*)sh)->begin(); }
|
|
Packit |
1c1d7e |
ConstIterator end() const { return ((const Priv*)sh)->end(); }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator find ( const Key& k )
|
|
Packit |
1c1d7e |
{ detach(); return Iterator( sh->find( k ).node ); }
|
|
Packit |
1c1d7e |
ConstIterator find ( const Key& k ) const
|
|
Packit |
1c1d7e |
{ return sh->find( k ); }
|
|
Packit |
1c1d7e |
T& operator[] ( const Key& k ) {
|
|
Packit |
1c1d7e |
detach(); QMapNode<Key,T>* p = sh->find( k ).node;
|
|
Packit |
1c1d7e |
if ( p != sh->end().node ) return p->data;
|
|
Packit |
1c1d7e |
return insert( k, T() ).data(); }
|
|
Packit |
1c1d7e |
const T& operator[] ( const Key& k ) const
|
|
Packit |
1c1d7e |
{ return sh->find( k ).data(); }
|
|
Packit |
1c1d7e |
bool contains ( const Key& k ) const
|
|
Packit |
1c1d7e |
{ return find( k ) != end(); }
|
|
Packit |
1c1d7e |
//{ return sh->find( k ) != ((const Priv*)sh)->end(); }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
uint count() const { return sh->node_count; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
bool isEmpty() const { return sh->node_count == 0; }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator insert( const Key& key, const T& value ) {
|
|
Packit |
1c1d7e |
detach();
|
|
Packit |
1c1d7e |
Iterator it = sh->insertSingle( key );
|
|
Packit |
1c1d7e |
it.data() = value;
|
|
Packit |
1c1d7e |
return it;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
void remove( Iterator it ) { detach(); sh->remove( it ); }
|
|
Packit |
1c1d7e |
void remove( const Key& k ) {
|
|
Packit |
1c1d7e |
detach();
|
|
Packit |
1c1d7e |
Iterator it( sh->find( k ).node );
|
|
Packit |
1c1d7e |
if ( it != end() )
|
|
Packit |
1c1d7e |
sh->remove( it );
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Iterator replace( const Key& k, const T& v ) {
|
|
Packit |
1c1d7e |
remove( k );
|
|
Packit |
1c1d7e |
return insert( k, v );
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
void clear() { if ( sh->count == 1 ) sh->clear(); else { sh->deref(); sh = new QMapPrivate<Key,T>; } }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
#if defined(Q_FULL_TEMPLATE_INSTANTIATION)
|
|
Packit |
1c1d7e |
bool operator==( const QMap<Key,T>& ) const { return FALSE; }
|
|
Packit |
1c1d7e |
#endif
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
protected:
|
|
Packit |
1c1d7e |
/**
|
|
Packit |
1c1d7e |
* Helpers
|
|
Packit |
1c1d7e |
*/
|
|
Packit |
1c1d7e |
void detach() { if ( sh->count > 1 ) { sh->deref(); sh = new QMapPrivate<Key,T>( sh ); } }
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
Priv* sh;
|
|
Packit |
1c1d7e |
};
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
#ifndef QT_NO_DATASTREAM
|
|
Packit |
1c1d7e |
template<class Key, class T>
|
|
Packit |
1c1d7e |
inline QDataStream& operator>>( QDataStream& s, QMap<Key,T>& m ) {
|
|
Packit |
1c1d7e |
m.clear();
|
|
Packit |
1c1d7e |
Q_UINT32 c;
|
|
Packit |
1c1d7e |
s >> c;
|
|
Packit |
1c1d7e |
for( Q_UINT32 i = 0; i < c; ++i ) {
|
|
Packit |
1c1d7e |
Key k; T t;
|
|
Packit |
1c1d7e |
s >> k >> t;
|
|
Packit |
1c1d7e |
m.insert( k, t );
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
return s;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
template<class Key, class T>
|
|
Packit |
1c1d7e |
inline QDataStream& operator<<( QDataStream& s, const QMap<Key,T>& m ) {
|
|
Packit |
1c1d7e |
s << (Q_UINT32)m.count();
|
|
Packit |
1c1d7e |
QMapConstIterator<Key,T> it = m.begin();
|
|
Packit |
1c1d7e |
for( ; it != m.end(); ++it )
|
|
Packit |
1c1d7e |
s << it.key() << it.data();
|
|
Packit |
1c1d7e |
return s;
|
|
Packit |
1c1d7e |
}
|
|
Packit |
1c1d7e |
#endif
|
|
Packit |
1c1d7e |
|
|
Packit |
1c1d7e |
#endif // QMAP_H
|