/home/ntakagi/work/STLport-5.1.5/stlport/stl/debug/_tree.h Source File

00001 /*
00002  *
00003  * Copyright (c) 1994
00004  * Hewlett-Packard Company
00005  *
00006  * Copyright (c) 1996,1997
00007  * Silicon Graphics Computer Systems, Inc.
00008  *
00009  * Copyright (c) 1997
00010  * Moscow Center for SPARC Technology
00011  *
00012  * Copyright (c) 1999
00013  * Boris Fomitchev
00014  *
00015  * This material is provided "as is", with absolutely no warranty expressed
00016  * or implied. Any use is at your own risk.
00017  *
00018  * Permission to use or copy this software for any purpose is hereby granted
00019  * without fee, provided the above notices are retained on all copies.
00020  * Permission to modify the code and to distribute modified code is granted,
00021  * provided the above notices are retained, and a notice that the code was
00022  * modified is included with the above copyright notice.
00023  *
00024  */
00025 
00026 /* NOTE: This is an internal header file, included by other STL headers.
00027  *   You should not attempt to use it directly.
00028  */
00029 
00030 #ifndef _STLP_INTERNAL_DBG_TREE_H
00031 #define _STLP_INTERNAL_DBG_TREE_H
00032 
00033 #ifndef _STLP_DBG_ITERATOR_H
00034 #  include <stl/debug/_iterator.h>
00035 #endif
00036 
00037 #ifndef _STLP_INTERNAL_FUNCTION_BASE_H
00038 #  include <stl/_function_base.h>
00039 #endif
00040 
00041 #ifndef _STLP_INTERNAL_ALLOC_H
00042 #  include <stl/_alloc.h>
00043 #endif
00044 
00045 _STLP_BEGIN_NAMESPACE
00046 
00047 _STLP_MOVE_TO_PRIV_NAMESPACE
00048 
00049 template <class _Key, class _Compare>
00050 class _DbgCompare {
00051 public:
00052   _DbgCompare() {}
00053   _DbgCompare(const _Compare& __cmp) : _M_non_dbg_cmp(__cmp) {}
00054   _DbgCompare(const _DbgCompare& __cmp) : _M_non_dbg_cmp(__cmp._M_non_dbg_cmp) {}
00055 
00056 #if !defined (_STLP_USE_CONTAINERS_EXTENSION)
00057   bool operator () (const _Key& __lhs, const _Key& __rhs) const {
00058 #else
00059   template <class _Kp1, class _Kp2>
00060   bool operator () (const _Kp1& __lhs, const _Kp2& __rhs) const {
00061 #endif
00062     if (_M_non_dbg_cmp(__lhs, __rhs)) {
00063       _STLP_VERBOSE_ASSERT(!_M_non_dbg_cmp(__rhs, __lhs), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
00064       return true;
00065     }
00066     return false;
00067   }
00068 
00069   _Compare non_dbg_key_comp() const { return _M_non_dbg_cmp; }
00070 private:
00071   _Compare _M_non_dbg_cmp;
00072 };
00073 
00074 #define _STLP_NON_DBG_TREE _STLP_PRIV _STLP_NON_DBG_NAME(Rb_tree) <_Key, _STLP_PRIV _DbgCompare<_Key, _Compare>, _Value, _KeyOfValue, _Traits, _Alloc>
00075 
00076 #if defined (_STLP_DEBUG_USE_DISTINCT_VALUE_TYPE_HELPERS)
00077 _STLP_MOVE_TO_STD_NAMESPACE
00078 template <class _Key, class _Compare,
00079           class _Value, class _KeyOfValue, class _Traits, class _Alloc >
00080 inline _Value*
00081 value_type(const _STLP_PRIV _DBG_iter_base< _STLP_NON_DBG_TREE >&)
00082 { return (_Value*)0; }
00083 template <class _Key, class _Compare,
00084           class _Value, class _KeyOfValue, class _Traits, class _Alloc >
00085 inline bidirectional_iterator_tag
00086 iterator_category(const _STLP_PRIV _DBG_iter_base< _STLP_NON_DBG_TREE >&)
00087 { return bidirectional_iterator_tag(); }
00088 _STLP_MOVE_TO_PRIV_NAMESPACE
00089 #endif
00090 
00091 template <class _Key, class _Compare,
00092           class _Value, class _KeyOfValue, class _Traits,
00093           _STLP_DBG_ALLOCATOR_SELECT(_Value) >
00094 class _Rb_tree {
00095   typedef _STLP_NON_DBG_TREE _Base;
00096   typedef _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc> _Self;
00097   _Base _M_non_dbg_impl;
00098   _STLP_PRIV __owned_list _M_iter_list;
00099 
00100 public:
00101   __IMPORT_CONTAINER_TYPEDEFS(_Base)
00102   typedef typename _Base::key_type key_type;
00103 
00104   typedef typename _Traits::_NonConstTraits _NonConstIteTraits;
00105   typedef typename _Traits::_ConstTraits    _ConstIteTraits;
00106   typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_NonConstIteTraits> > iterator;
00107   typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_ConstIteTraits> >    const_iterator;
00108 
00109   _STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS;
00110 
00111 private:
00112   _STLP_KEY_TYPE_FOR_CONT_EXT(key_type)
00113   void _Invalidate_iterator(const iterator& __it)
00114   { _STLP_PRIV __invalidate_iterator(&_M_iter_list,__it); }
00115   void _Invalidate_iterators(const iterator& __first, const iterator& __last)
00116   { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
00117 
00118   typedef typename _Base::iterator _Base_iterator;
00119   typedef typename _Base::const_iterator _Base_const_iterator;
00120 
00121 public:
00122   _Rb_tree()
00123     : _M_non_dbg_impl(), _M_iter_list(&_M_non_dbg_impl) {}
00124   _Rb_tree(const _Compare& __comp)
00125     : _M_non_dbg_impl(__comp), _M_iter_list(&_M_non_dbg_impl) {}
00126   _Rb_tree(const _Compare& __comp, const allocator_type& __a)
00127     : _M_non_dbg_impl(__comp, __a), _M_iter_list(&_M_non_dbg_impl) {}
00128   _Rb_tree(const _Self& __x)
00129     : _M_non_dbg_impl(__x._M_non_dbg_impl), _M_iter_list(&_M_non_dbg_impl) {}
00130 
00131   _Rb_tree(__move_source<_Self> src):
00132     _M_non_dbg_impl(__move_source<_Base>(src.get()._M_non_dbg_impl)),
00133     _M_iter_list(&_M_non_dbg_impl) {
00134 #if defined (_STLP_NO_EXTENSIONS) || (_STLP_DEBUG_LEVEL == _STLP_STANDARD_DBG_LEVEL)
00135     src.get()._M_iter_list._Invalidate_all();
00136 #else
00137     src.get()._M_iter_list._Set_owner(_M_iter_list);
00138 #endif
00139   }
00140 
00141   ~_Rb_tree() {}
00142 
00143   _Self& operator=(const _Self& __x) {
00144     if (this != &__x) {
00145       //Should not invalidate end iterator:
00146       _Invalidate_iterators(begin(), end());
00147       _M_non_dbg_impl = __x._M_non_dbg_impl;
00148     }
00149     return *this;
00150   }
00151 
00152   allocator_type get_allocator() const { return _M_non_dbg_impl.get_allocator(); }
00153   _Compare key_comp() const { return _M_non_dbg_impl.key_comp().non_dbg_key_comp(); }
00154 
00155   iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
00156   const_iterator begin() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
00157   iterator end() { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); }
00158   const_iterator end() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.end()); }
00159 
00160   reverse_iterator rbegin() { return reverse_iterator(end()); }
00161   const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
00162   reverse_iterator rend() { return reverse_iterator(begin()); }
00163   const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
00164 
00165   bool empty() const { return _M_non_dbg_impl.empty(); }
00166   size_type size() const { return _M_non_dbg_impl.size(); }
00167   size_type max_size() const { return _M_non_dbg_impl.max_size(); }
00168   _STLP_TEMPLATE_FOR_CONT_EXT
00169   size_type count(const _KT& __x) const { return _M_non_dbg_impl.count(__x); }
00170 
00171   void swap(_Self& __t) {
00172     _M_non_dbg_impl.swap(__t._M_non_dbg_impl);
00173     _M_iter_list._Swap_owners(__t._M_iter_list);
00174   }
00175 
00176   _STLP_TEMPLATE_FOR_CONT_EXT
00177   iterator find(const _KT& __k)
00178   { return iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); }
00179   _STLP_TEMPLATE_FOR_CONT_EXT
00180   const_iterator find(const _KT& __k) const
00181   { return const_iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); }
00182 
00183   _STLP_TEMPLATE_FOR_CONT_EXT
00184   iterator lower_bound(const _KT& __x)
00185   { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
00186   _STLP_TEMPLATE_FOR_CONT_EXT
00187   const_iterator lower_bound(const _KT& __x) const
00188   { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
00189 
00190   _STLP_TEMPLATE_FOR_CONT_EXT
00191   iterator upper_bound(const _KT& __x)
00192   { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
00193   _STLP_TEMPLATE_FOR_CONT_EXT
00194   const_iterator upper_bound(const _KT& __x) const
00195   { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); }
00196 
00197   _STLP_TEMPLATE_FOR_CONT_EXT
00198   pair<iterator,iterator> equal_range(const _KT& __x) {
00199     return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
00200                                     iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
00201   }
00202   _STLP_TEMPLATE_FOR_CONT_EXT
00203   pair<const_iterator, const_iterator> equal_range(const _KT& __x) const {
00204     return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
00205                                                const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)));
00206   }
00207 
00208   _STLP_TEMPLATE_FOR_CONT_EXT
00209   pair<iterator,iterator> equal_range_unique(const _KT& __x) {
00210     _STLP_STD::pair<_Base_iterator, _Base_iterator> __p;
00211     __p = _M_non_dbg_impl.equal_range_unique(__x);
00212     return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second));
00213   }
00214   _STLP_TEMPLATE_FOR_CONT_EXT
00215   pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const {
00216     _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p;
00217     __p = _M_non_dbg_impl.equal_range_unique(__x);
00218     return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first),
00219                                                 const_iterator(&_M_iter_list, __p.second));
00220   }
00221 
00222   pair<iterator,bool> insert_unique(const value_type& __x) {
00223     _STLP_STD::pair<_Base_iterator, bool> __res = _M_non_dbg_impl.insert_unique(__x);
00224     return pair<iterator, bool>(iterator(&_M_iter_list, __res.first), __res.second);
00225   }
00226   iterator insert_equal(const value_type& __x)
00227   { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__x)); }
00228 
00229   iterator insert_unique(iterator __pos, const value_type& __x) {
00230     _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list,__pos))
00231     return iterator(&_M_iter_list, _M_non_dbg_impl.insert_unique(__pos._M_iterator, __x));
00232   }
00233   iterator insert_equal(iterator __pos, const value_type& __x) {
00234     _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list, __pos))
00235     return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__pos._M_iterator, __x));
00236   }
00237 
00238 #if defined (_STLP_MEMBER_TEMPLATES)
00239   template<class _InputIterator>
00240   void insert_equal(_InputIterator __first, _InputIterator __last) {
00241     _STLP_DEBUG_CHECK(__check_range(__first,__last))
00242     _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
00243   }
00244   template<class _InputIterator>
00245   void insert_unique(_InputIterator __first, _InputIterator __last) {
00246     _STLP_DEBUG_CHECK(__check_range(__first,__last))
00247     _M_non_dbg_impl.insert_unique(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
00248   }
00249 #else
00250   void insert_unique(const_iterator __first, const_iterator __last) {
00251     _STLP_DEBUG_CHECK(__check_range(__first,__last))
00252     _M_non_dbg_impl.insert_unique(__first._M_iterator, __last._M_iterator);
00253   }
00254   void insert_unique(const value_type* __first, const value_type* __last) {
00255     _STLP_DEBUG_CHECK(__check_ptr_range(__first,__last))
00256     _M_non_dbg_impl.insert_unique(__first, __last);
00257   }
00258   void insert_equal(const_iterator __first, const_iterator __last) {
00259     _STLP_DEBUG_CHECK(__check_range(__first,__last))
00260     _M_non_dbg_impl.insert_equal(__first._M_iterator, __last._M_iterator);
00261   }
00262   void insert_equal(const value_type* __first, const value_type* __last) {
00263     _STLP_DEBUG_CHECK(__check_ptr_range(__first,__last))
00264     _M_non_dbg_impl.insert_equal(__first, __last);
00265   }
00266 #endif
00267 
00268   void erase(iterator __pos) {
00269     _STLP_DEBUG_CHECK(__check_if_owner(&_M_iter_list,__pos))
00270     _STLP_DEBUG_CHECK(_Dereferenceable(__pos))
00271     _Invalidate_iterator(__pos);
00272     _M_non_dbg_impl.erase(__pos._M_iterator);
00273   }
00274   size_type erase(const key_type& __x) {
00275     pair<_Base_iterator,_Base_iterator> __p = _M_non_dbg_impl.equal_range(__x);
00276     size_type __n = distance(__p.first, __p.second);
00277     _Invalidate_iterators(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second));
00278     _M_non_dbg_impl.erase(__p.first, __p.second);
00279     return __n;
00280   }
00281   size_type erase_unique(const key_type& __x) {
00282     _Base_iterator __i = _M_non_dbg_impl.find(__x);
00283     if (__i != _M_non_dbg_impl.end()) {
00284       _Invalidate_iterator(iterator(&_M_iter_list, __i));
00285       _M_non_dbg_impl.erase(__i);
00286       return 1;
00287     }
00288     return 0;
00289   }
00290 
00291   void erase(iterator __first, iterator __last) {
00292     _STLP_DEBUG_CHECK(__check_range(__first, __last, begin(), end()))
00293     _Invalidate_iterators(__first, __last);
00294     _M_non_dbg_impl.erase(__first._M_iterator, __last._M_iterator);
00295   }
00296   void erase(const key_type* __first, const key_type* __last) {
00297     while (__first != __last) erase(*__first++);
00298   }
00299 
00300   void clear() {
00301     //should not invalidate end:
00302     _Invalidate_iterators(begin(), end());
00303     _M_non_dbg_impl.clear();
00304   }
00305 };
00306 
00307 _STLP_MOVE_TO_STD_NAMESPACE
00308 _STLP_END_NAMESPACE
00309 
00310 #undef _STLP_NON_DBG_TREE
00311 
00312 #endif /* _STLP_INTERNAL_DBG_TREE_H */
00313 
00314 // Local Variables:
00315 // mode:C++
00316 // End: