|
STLdoc
STLdocumentation
|
#include <ext/pb_ds/detail/standard_policies.hpp>#include <utility>#include <vector>#include <assert.h>#include <debug/debug.h>#include <ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp>#include <ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp>#include <ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp>#include <ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp>#include <ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp>#include <ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp>Go to the source code of this file.
Classes | |
| class | __gnu_pbds::detail::PB_DS_RB_TREE_NAME< Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc > |
| Red-Black tree.This implementation uses an idea from the SGI STL (using a header node which is needed for efficient iteration). More... | |
Namespaces | |
| __gnu_pbds | |
| GNU extensions for policy-based data structures for public use. | |
| __gnu_pbds::detail | |
Macros | |
| #define | PB_DS_CLASS_T_DEC |
| #define | PB_DS_CLASS_C_DEC PB_DS_RB_TREE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc> |
| #define | PB_DS_RB_TREE_BASE PB_DS_RB_TREE_BASE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc> |
| #define | PB_DS_STRUCT_ONLY_ASSERT_VALID(X) _GLIBCXX_DEBUG_ONLY(X.structure_only_assert_valid(__FILE__, __LINE__);) |
Contains an implementation for Red Black trees.
| #define PB_DS_CLASS_C_DEC PB_DS_RB_TREE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc> |
| #define PB_DS_CLASS_T_DEC |
| #define PB_DS_RB_TREE_BASE PB_DS_RB_TREE_BASE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc> |
| #define PB_DS_STRUCT_ONLY_ASSERT_VALID | ( | X | ) | _GLIBCXX_DEBUG_ONLY(X.structure_only_assert_valid(__FILE__, __LINE__);) |
1.8.6