#ifndef PB_DS_THIN_HEAP_HPP
#define PB_DS_THIN_HEAP_HPP
#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 <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
#include <debug/debug.h>
namespace pb_ds
{
namespace detail
{
#define PB_DS_CLASS_T_DEC \
template<typename Value_Type, class Cmp_Fn, class Allocator>
#define PB_DS_CLASS_C_DEC \
thin_heap_<Value_Type, Cmp_Fn, Allocator>
#ifdef _GLIBCXX_DEBUG
#define PB_DS_BASE_C_DEC \
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
typename Allocator::size_type, Allocator, true>
#else
#define PB_DS_BASE_C_DEC \
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
typename Allocator::size_type, Allocator>
#endif
template<typename Value_Type, class Cmp_Fn, class Allocator>
class thin_heap_ : public PB_DS_BASE_C_DEC
{
private:
typedef PB_DS_BASE_C_DEC base_type;
protected:
typedef typename base_type::node node;
typedef typename base_type::node_pointer node_pointer;
typedef typename base_type::const_node_pointer const_node_pointer;
public:
typedef typename Allocator::size_type size_type;
typedef typename Allocator::difference_type difference_type;
typedef Value_Type value_type;
typedef
typename Allocator::template rebind<
value_type>::other::pointer
pointer;
typedef
typename Allocator::template rebind<
value_type>::other::const_pointer
const_pointer;
typedef
typename Allocator::template rebind<
value_type>::other::reference
reference;
typedef
typename Allocator::template rebind<
value_type>::other::const_reference
const_reference;
typedef
typename PB_DS_BASE_C_DEC::const_point_iterator
const_point_iterator;
typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
typedef typename PB_DS_BASE_C_DEC::iterator iterator;
typedef Cmp_Fn cmp_fn;
typedef Allocator allocator;
public:
inline point_iterator
push(const_reference r_val);
void
modify(point_iterator it, const_reference r_new_val);
inline const_reference
top() const;
void
pop();
void
erase(point_iterator it);
inline void
clear();
template<typename Pred>
size_type
erase_if(Pred pred);
template<typename Pred>
void
split(Pred pred, PB_DS_CLASS_C_DEC& other);
void
join(PB_DS_CLASS_C_DEC& other);
protected:
thin_heap_();
thin_heap_(const Cmp_Fn& r_cmp_fn);
thin_heap_(const PB_DS_CLASS_C_DEC& other);
void
swap(PB_DS_CLASS_C_DEC& other);
~thin_heap_();
template<typename It>
void
copy_from_range(It first_it, It last_it);
#ifdef _GLIBCXX_DEBUG
void
assert_valid() const;
void
assert_max() const;
#endif
#ifdef PB_DS_THIN_HEAP_TRACE_
void
trace() const;
#endif
private:
enum
{
max_rank = (sizeof(size_type) << 4) + 2
};
private:
void
initialize();
inline void
update_max(node_pointer p_nd);
inline void
fix(node_pointer p_nd);
inline void
fix_root(node_pointer p_y);
inline void
fix_sibling_rank_1_unmarked(node_pointer p_y);
inline void
fix_sibling_rank_1_marked(node_pointer p_y);
inline void
fix_sibling_general_unmarked(node_pointer p_y);
inline void
fix_sibling_general_marked(node_pointer p_y);
inline void
fix_child(node_pointer p_y);
inline static void
make_root(node_pointer p_nd);
inline void
make_root_and_link(node_pointer p_nd);
inline void
remove_max_node();
void
to_aux_except_max();
inline void
add_to_aux(node_pointer p_nd);
inline void
make_from_aux();
inline size_type
rank_bound();
inline void
make_child_of(node_pointer p_nd, node_pointer p_new_parent);
inline void
remove_node(node_pointer p_nd);
inline node_pointer
join(node_pointer p_lhs, node_pointer p_rhs) const;
#ifdef _GLIBCXX_DEBUG
void
assert_node_consistent(const_node_pointer p_nd, bool root) const;
void
assert_aux_null() const;
#endif
private:
node_pointer m_p_max;
node_pointer m_a_aux[max_rank];
};
enum
{
num_distinct_rank_bounds = 48
};
static const std::size_t g_a_rank_bounds[num_distinct_rank_bounds] =
{
0ul,
1ul,
1ul,
2ul,
4ul,
6ul,
11ul,
17ul,
29ul,
46ul,
76ul,
122ul,
199ul,
321ul,
521ul,
842ul,
1364ul,
2206ul,
3571ul,
5777ul,
9349ul,
15126ul,
24476ul,
39602ul,
64079ul,
103681ul,
167761ul,
271442ul,
439204ul,
710646ul,
1149851ul,
1860497ul,
3010349ul,
4870846ul,
7881196ul,
12752042ul,
20633239ul,
33385282ul,
54018521ul,
87403803ul,
141422324ul,
228826127ul,
370248451ul,
599074578ul,
969323029ul,
1568397607ul,
2537720636ul,
4106118243ul
};
#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>
#undef PB_DS_CLASS_C_DEC
#undef PB_DS_CLASS_T_DEC
#undef PB_DS_BASE_C_DEC
} }
#endif