stl_tree.h File Reference

#include <bits/stl_algobase.h>
#include <bits/allocator.h>
#include <bits/stl_construct.h>
#include <bits/stl_function.h>
#include <bits/cpp_type_traits.h>

Go to the source code of this file.

Namespaces
namespace	std
Classes
struct	std::_Rb_tree_node_base
struct	std::_Rb_tree_node< _Val >
struct	std::_Rb_tree_iterator< _Tp >
struct	std::_Rb_tree_const_iterator< _Tp >
class	std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >
struct	std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Rb_tree_impl< _Key_compare, _Is_pod_comparator >
struct	std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Rb_tree_impl< _Key_compare, true >
Defines
#define	_TREE_H   1
Enumerations
enum	std::_Rb_tree_color { std::_S_red = false, std::_S_black = true }
Functions
_Rb_tree_node_base *	std::_Rb_tree_increment (_Rb_tree_node_base *__x)
const _Rb_tree_node_base *	std::_Rb_tree_increment (const _Rb_tree_node_base *__x)
_Rb_tree_node_base *	std::_Rb_tree_decrement (_Rb_tree_node_base *__x)
const _Rb_tree_node_base *	std::_Rb_tree_decrement (const _Rb_tree_node_base *__x)
template<typename _Val>
bool	std::operator== (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y)
template<typename _Val>
bool	std::operator!= (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y)
void	std::_Rb_tree_rotate_left (_Rb_tree_node_base *const __x, _Rb_tree_node_base *&__root)
void	std::_Rb_tree_rotate_right (_Rb_tree_node_base *const __x, _Rb_tree_node_base *&__root)
void	std::_Rb_tree_insert_and_rebalance (const bool __insert_left, _Rb_tree_node_base *__x, _Rb_tree_node_base *__p, _Rb_tree_node_base &__header)
_Rb_tree_node_base *	std::_Rb_tree_rebalance_for_erase (_Rb_tree_node_base *const __z, _Rb_tree_node_base &__header)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
bool	std::operator== (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
bool	std::operator< (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
bool	std::operator!= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
bool	std::operator> (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
bool	std::operator<= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
bool	std::operator>= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
void	std::swap (_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__x, _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &__y)
unsigned int	std::_Rb_tree_black_count (const _Rb_tree_node_base *__node, const _Rb_tree_node_base *__root)

---

Detailed Description

This is an internal header file, included by other library headers. You should not attempt to use it directly.

Definition in file stl_tree.h.

---

Define Documentation

#define _TREE_H   1

Definition at line 64 of file stl_tree.h.

---