|
STLdoc
STLdocumentation
|
#include <algorithm>#include <ext/pb_ds/detail/cond_dealtor.hpp>#include <ext/pb_ds/detail/type_utils.hpp>#include <ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp>#include <debug/debug.h>#include <ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp>#include <ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp>#include <ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp>#include <ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp>#include <ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp>#include <ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp>#include <ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp>Go to the source code of this file.
Classes | |
| class | __gnu_pbds::detail::thin_heap< Value_Type, Cmp_Fn, _Alloc > |
Namespaces | |
| __gnu_pbds | |
| GNU extensions for policy-based data structures for public use. | |
| __gnu_pbds::detail | |
Macros | |
| #define | PB_DS_CLASS_T_DEC template<typename Value_Type, typename Cmp_Fn, typename _Alloc> |
| #define | PB_DS_CLASS_C_DEC thin_heap<Value_Type, Cmp_Fn, _Alloc> |
| #define | PB_DS_BASE_T_P <Value_Type, Cmp_Fn, typename _Alloc::size_type, _Alloc> |
| #define | PB_DS_ASSERT_NODE_CONSISTENT(_Node, _Bool) |
| #define | PB_DS_ASSERT_AUX_NULL(X) _GLIBCXX_DEBUG_ONLY(X.assert_aux_null(__FILE__, __LINE__);) |
Enumerations | |
| enum | { __gnu_pbds::detail::num_distinct_rank_bounds = 48 } |
Variables | |
| static const std::size_t | __gnu_pbds::detail::g_a_rank_bounds [num_distinct_rank_bounds] |
Contains an implementation class for a thin heap.
| #define PB_DS_ASSERT_AUX_NULL | ( | X | ) | _GLIBCXX_DEBUG_ONLY(X.assert_aux_null(__FILE__, __LINE__);) |
| #define PB_DS_ASSERT_NODE_CONSISTENT | ( | _Node, | |
| _Bool | |||
| ) |
| #define PB_DS_BASE_T_P <Value_Type, Cmp_Fn, typename _Alloc::size_type, _Alloc> |
| #define PB_DS_CLASS_C_DEC thin_heap<Value_Type, Cmp_Fn, _Alloc> |
| #define PB_DS_CLASS_T_DEC template<typename Value_Type, typename Cmp_Fn, typename _Alloc> |
1.8.6