stl_tree.h File Reference

#include <bits/stl_algobase.h>
#include <bits/stl_alloc.h>
#include <bits/stl_construct.h>
#include <bits/stl_function.h>

Include dependency graph for stl_tree.h:

This graph shows which files directly or indirectly include this file:

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_base_iterator
struct	std::Rb_tree_iterator< Val, Ref, Ptr >
class	std::Rb_tree_alloc_base< Type, Alloc, S_instanceless >
class	std::Rb_tree_alloc_base< Type, Alloc, true >
struct	std::Rb_tree_base< Type, Alloc >
class	std::Rb_tree< Key, Val, KeyOfValue, Compare, Alloc >
Enumerations
enum	std::Rb_tree_color
Functions
template<typename Val, typename Ref, typename Ptr>
bool	std::operator== (const Rb_tree_iterator< Val, Ref, Ptr > &x, const Rb_tree_iterator< Val, Ref, Ptr > &y)
template<typename Val>
bool	std::operator== (const Rb_tree_iterator< Val, const Val &, const Val * > &x, const Rb_tree_iterator< Val, Val &, Val * > &y)
template<typename Val>
bool	std::operator== (const Rb_tree_iterator< Val, Val &, Val * > &x, const Rb_tree_iterator< Val, const Val &, const Val * > &y)
template<typename Val, typename Ref, typename Ptr>
bool	std::operator!= (const Rb_tree_iterator< Val, Ref, Ptr > &x, const Rb_tree_iterator< Val, Ref, Ptr > &y)
template<typename Val>
bool	std::operator!= (const Rb_tree_iterator< Val, const Val &, const Val * > &x, const Rb_tree_iterator< Val, Val &, Val * > &y)
template<typename Val>
bool	std::operator!= (const Rb_tree_iterator< Val, Val &, Val * > &x, const Rb_tree_iterator< Val, const Val &, const Val * > &y)
void	std::Rb_tree_rotate_left (Rb_tree_node_base *x, Rb_tree_node_base *&__root)
void	std::Rb_tree_rotate_right (Rb_tree_node_base *x, Rb_tree_node_base *&__root)
void	std::Rb_tree_rebalance (Rb_tree_node_base *x, Rb_tree_node_base *&__root)
Rb_tree_node_base *	std::Rb_tree_rebalance_for_erase (Rb_tree_node_base *__z, Rb_tree_node_base *&__root, Rb_tree_node_base *&__leftmost, Rb_tree_node_base *&__rightmost)
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)
int	std::__black_count (Rb_tree_node_base *node, 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.

---