steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

完成查找

Browse Source
This commit is contained in:
邹晓航
2014-10-29 09:23:52 +08:00
parent 08f260ec99
commit 2570b00e15
1 changed files with 56 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
TinySTL/AVLTree.h
View File

@@ -7,6 +7,10 @@
#include <set> #include <set>
namespace TinySTL{ namespace TinySTL{
namespace {
template<class T>
class avl_iter;
}
//class of avl tree //class of avl tree
template<class T> template<class T>
class avl_tree{ class avl_tree{
@@ -18,10 +22,11 @@ namespace TinySTL{
T data_; T data_;
node *left_, *right_; node *left_, *right_;
size_t height_; size_t height_;
typedef T value_type;
explicit node(T d = T(), node *l = 0, node *r = 0, size_t h = 0) explicit node(T d = T(), node *l = 0, node *r = 0, size_t h = 0)
:data_(d), left_(l), right_(r), height_(h){} :data_(d), left_(l), right_(r), height_(h){}
}; };
typedef TinySTL::allocator<T> dataAllocator; typedef TinySTL::allocator<node> dataAllocator;
public: public:
typedef T value_type; typedef T value_type;
typedef avl_iter<node> const_iterator; typedef avl_iter<node> const_iterator;
@@ -38,7 +43,14 @@ namespace TinySTL{
size_t height()const{ return root_ == 0 ? -1 : root_->height_; } size_t height()const{ return root_ == 0 ? -1 : root_->height_; }
size_t size()const{ return size_; } size_t size()const{ return size_; }
bool empty()const{ return root_ == 0; } bool empty()const{ return root_ == 0; }
/*const_iterator root(){ return const_iterator(root_, this); }*/ const_iterator root(){ return const_iterator(root_, this); }
const_iterator cbegin(){ return find_min(); }
const_iterator cend(){ return const_iterator(0, this); }
const_iterator find_min();
const_iterator find_max();
const_iterator find(const T& val);
private: private:
void destroyAndDeallocateAllNodes(node *p){ void destroyAndDeallocateAllNodes(node *p){
if (p != 0){ if (p != 0){
@@ -48,17 +60,56 @@ namespace TinySTL{
dataAllocator::deallocate(p); dataAllocator::deallocate(p);
} }
} }
}; const_iterator find_min_aux(const node *ptr);
const_iterator find_max_aux(const node *ptr);
const_iterator find_aux(const T& val, const node *ptr);
};// end of avl_tree
template<class T>
typename avl_tree<T>::const_iterator avl_tree<T>::find_aux(const T& val, const node *ptr){
while (ptr != 0){
if (ptr->data_ < val)
ptr = ptr->right_;
else if (ptr->data_ > val)
ptr = ptr->left_;
else
break;
}
return const_iterator(ptr, this);
}
template<class T>
typename avl_tree<T>::const_iterator avl_tree<T>::find(const T& val){
return find_aux(val, root_);
}
template<class T>
typename avl_tree<T>::const_iterator avl_tree<T>::find_max_aux(const node *ptr){
while (ptr != 0 && ptr->right_ != 0)
ptr = ptr->right_;
return const_iterator(ptr, this);
}
template<class T>
typename avl_tree<T>::const_iterator avl_tree<T>::find_max(){
return find_max_aux(root_);
}
template<class T>
typename avl_tree<T>::const_iterator avl_tree<T>::find_min_aux(const node *ptr){
while (ptr != 0 && ptr->left_ != 0)
ptr = ptr->left_;
return const_iterator(ptr, this);
}
template<class T>
typename avl_tree<T>::const_iterator avl_tree<T>::find_min(){
return find_min_aux(root_);
}
namespace{ namespace{
//class of bst iterator //class of avl tree iterator
template<class T>//T = node template<class T>//T = node
class avl_iter{ class avl_iter{
private: private:
template<class T> template<class T>
friend class avl_tree; friend class avl_tree;
private: private:
typedef typename avl_tree<typename T::value_type>::vaule_type value_type; typedef typename avl_tree<typename T::value_type>::value_type value_type;
typedef typename avl_tree<typename T::value_type>::const_reference const_reference; typedef typename avl_tree<typename T::value_type>::const_reference const_reference;
typedef typename const T::value_type *const_pointer; typedef typename const T::value_type *const_pointer;
typedef avl_tree<typename T::value_type> * cntrPtr; typedef avl_tree<typename T::value_type> * cntrPtr;