Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann    

tree.h File Reference

Detailed Description

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

Definition in file tree.h.

Go to the source code of this file.

Namespaces

namespace  inplaceds
namespace  inplaceds::block

Data Structures

struct  inplaceds::block::_Rb_tree_node_base
struct  inplaceds::block::_Rb_tree_node< _Val >
struct  inplaceds::block::_Rb_tree_iterator< _Tp >
struct  inplaceds::block::_Rb_tree_const_iterator< _Tp >
class  inplaceds::block::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc >
struct  inplaceds::block::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc >::_Rb_tree_impl< _Key_compare, _Key_compare_pq, _Is_pod_comparator >
struct  inplaceds::block::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc >::_Rb_tree_impl< _Key_compare, _Key_compare_pq, true >

Enumerations

enum  inplaceds::block::_Rb_tree_color { inplaceds::block::_S_red = false, inplaceds::block::_S_black = true }

Functions

_Rb_tree_node_base * inplaceds::block::_Rb_tree_increment (_Rb_tree_node_base *__x)
const _Rb_tree_node_base * inplaceds::block::_Rb_tree_increment (const _Rb_tree_node_base *__x)
_Rb_tree_node_base * inplaceds::block::_Rb_tree_decrement (_Rb_tree_node_base *__x)
const _Rb_tree_node_base * inplaceds::block::_Rb_tree_decrement (const _Rb_tree_node_base *__x)
template<typename _Val>
bool inplaceds::block::operator== (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y)
template<typename _Val>
bool inplaceds::block::operator!= (const _Rb_tree_iterator< _Val > &__x, const _Rb_tree_const_iterator< _Val > &__y)
void inplaceds::block::_Rb_tree_rotate_left (_Rb_tree_node_base *const __x, _Rb_tree_node_base *&__root)
void inplaceds::block::_Rb_tree_rotate_right (_Rb_tree_node_base *const __x, _Rb_tree_node_base *&__root)
void inplaceds::block::_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 * inplaceds::block::_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 _Compare_PQ, typename _Alloc>
bool inplaceds::block::operator== (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Compare_PQ, typename _Alloc>
bool inplaceds::block::operator< (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Compare_PQ, typename _Alloc>
bool inplaceds::block::operator!= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Compare_PQ, typename _Alloc>
bool inplaceds::block::operator> (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Compare_PQ, typename _Alloc>
bool inplaceds::block::operator<= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Compare_PQ, typename _Alloc>
bool inplaceds::block::operator>= (const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__x, const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__y)
template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Compare_PQ, typename _Alloc>
void inplaceds::block::swap (_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__x, _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Compare_PQ, _Alloc > &__y)
unsigned int inplaceds::block::_Rb_tree_black_count (const _Rb_tree_node_base *__node, const _Rb_tree_node_base *__root)

Code Documentation generated Using Doxygen

Copyright © Ilya Katz and Hervé Brönnimann, 2005, 2006.