STLdoc
STLdocumentation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Classes | Macros | Functions
xtree File Reference
#include <xmemory>
#include <stdexcept>

Classes

class  _Tree_unchecked_const_iterator< _Mytree, _Base >
 
class  _Tree_unchecked_iterator< _Mytree >
 
class  _Tree_const_iterator< _Mytree >
 
class  _Tree_iterator< _Mytree >
 
struct  _Tree_iter_types< _Value_type, _Size_type, _Difference_type, _Pointer, _Const_pointer, _Reference, _Const_reference, _Nodeptr_type >
 
struct  _Tree_node< _Value_type, _Voidptr >
 
struct  _Tree_node< _Value_type, void * >
 
struct  _Tree_simple_types< _Ty >
 
struct  _Tree_base_types< _Ty, _Alloc0 >
 
class  _Tree_val< _Val_types >
 
class  _Tree_alloc< _Al_has_storage, _Alloc_types >
 
class  _Tree_alloc< false, _Alloc_types >
 
class  _Tree_buy< _Ty, _Alloc >
 
class  _Tree_comp< _Pr_has_storage, _Traits >
 
class  _Tree_comp< false, _Traits >
 
class  _Tree< _Traits >
 

Macros

#define _XTREE_
 

Functions

template<class _Mytree >
_Tree_const_iterator< _Mytree >::_Unchecked_type _Unchecked (_Tree_const_iterator< _Mytree > _Iter)
 
template<class _Mytree >
_Tree_const_iterator< _Mytree > & _Rechecked (_Tree_const_iterator< _Mytree > &_Iter, typename _Tree_const_iterator< _Mytree >::_Unchecked_type _Right)
 
template<class _Mytree >
_Tree_iterator< _Mytree >::_Unchecked_type _Unchecked (_Tree_iterator< _Mytree > _Iter)
 
template<class _Mytree >
_Tree_iterator< _Mytree > & _Rechecked (_Tree_iterator< _Mytree > &_Iter, typename _Tree_iterator< _Mytree >::_Unchecked_type _Right)
 
template<class _Traits >
bool operator== (const _Tree< _Traits > &_Left, const _Tree< _Traits > &_Right)
 
template<class _Traits >
bool operator!= (const _Tree< _Traits > &_Left, const _Tree< _Traits > &_Right)
 
template<class _Traits >
bool operator< (const _Tree< _Traits > &_Left, const _Tree< _Traits > &_Right)
 
template<class _Traits >
bool operator> (const _Tree< _Traits > &_Left, const _Tree< _Traits > &_Right)
 
template<class _Traits >
bool operator<= (const _Tree< _Traits > &_Left, const _Tree< _Traits > &_Right)
 
template<class _Traits >
bool operator>= (const _Tree< _Traits > &_Left, const _Tree< _Traits > &_Right)
 

Macro Definition Documentation

#define _XTREE_

Function Documentation

template<class _Mytree >
_Tree_const_iterator<_Mytree>& _Rechecked ( _Tree_const_iterator< _Mytree > &  _Iter,
typename _Tree_const_iterator< _Mytree >::_Unchecked_type  _Right 
)
inline
357  { // convert to checked
358  return (_Iter._Rechecked(_Right));
359  }
_Myiter & _Rechecked(_Unchecked_type _Right)
Definition: xtree:219
const _Ty & _Right
Definition: algorithm:4087
template<class _Mytree >
_Tree_iterator<_Mytree>& _Rechecked ( _Tree_iterator< _Mytree > &  _Iter,
typename _Tree_iterator< _Mytree >::_Unchecked_type  _Right 
)
inline
449  { // convert to checked
450  return (_Iter._Rechecked(_Right));
451  }
_Myiter & _Rechecked(_Unchecked_type _Right)
Definition: xtree:389
const _Ty & _Right
Definition: algorithm:4087
template<class _Mytree >
_Tree_const_iterator<_Mytree>::_Unchecked_type _Unchecked ( _Tree_const_iterator< _Mytree >  _Iter)
inline
348  { // convert to unchecked
349  return (_Iter._Unchecked());
350  }
_Unchecked_type _Unchecked() const
Definition: xtree:225
template<class _Mytree >
_Tree_iterator<_Mytree>::_Unchecked_type _Unchecked ( _Tree_iterator< _Mytree >  _Iter)
inline
440  { // convert to unchecked
441  return (_Iter._Unchecked());
442  }
_Unchecked_type _Unchecked() const
Definition: xtree:395
template<class _Traits >
bool operator!= ( const _Tree< _Traits > &  _Left,
const _Tree< _Traits > &  _Right 
)
inline
2254  { // test for _Tree inequality
2255  return (!(_Left == _Right));
2256  }
template<class _Traits >
bool operator< ( const _Tree< _Traits > &  _Left,
const _Tree< _Traits > &  _Right 
)
inline
2260  { // test if _Less < _Right for _Trees
2261  return (lexicographical_compare(_Left.begin(), _Left.end(),
2262  _Right.begin(), _Right.end()));
2263  }
iterator end() _NOEXCEPT
Definition: xtree:1220
iterator begin() _NOEXCEPT
Definition: xtree:1210
bool lexicographical_compare(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _InIt2 _Last2)
Definition: memory:830
template<class _Traits >
bool operator<= ( const _Tree< _Traits > &  _Left,
const _Tree< _Traits > &  _Right 
)
inline
2273  { // test if _Less <= _Right for _Trees
2274  return (!(_Right < _Left));
2275  }
template<class _Traits >
bool operator== ( const _Tree< _Traits > &  _Left,
const _Tree< _Traits > &  _Right 
)
inline
2247  { // test for _Tree equality
2248  return (_Left.size() == _Right.size()
2249  && equal(_Left.begin(), _Left.end(), _Right.begin()));
2250  }
iterator end() _NOEXCEPT
Definition: xtree:1220
iterator begin() _NOEXCEPT
Definition: xtree:1210
bool equal(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2)
Definition: memory:611
size_type size() const _NOEXCEPT
Definition: xtree:1270
template<class _Traits >
bool operator> ( const _Tree< _Traits > &  _Left,
const _Tree< _Traits > &  _Right 
)
inline
2267  { // test if _Less > _Right for _Trees
2268  return (_Right < _Left);
2269  }
template<class _Traits >
bool operator>= ( const _Tree< _Traits > &  _Left,
const _Tree< _Traits > &  _Right 
)
inline
2279  { // test if _Less >= _Right for _Trees
2280  return (!(_Left < _Right));
2281  }