42 typename PB_DS_CLASS_C_DEC::entry_allocator
43 PB_DS_CLASS_C_DEC::s_entry_allocator;
46 typename PB_DS_CLASS_C_DEC::value_allocator
47 PB_DS_CLASS_C_DEC::s_value_allocator;
50 typename PB_DS_CLASS_C_DEC::no_throw_copies_t
51 PB_DS_CLASS_C_DEC::s_no_throw_copies_ind;
57 copy_from_range(It first_it, It last_it)
59 while (first_it != last_it)
61 insert_value(*first_it, s_no_throw_copies_ind);
71 : m_size(0), m_actual_size(resize_policy::min_size),
72 m_a_entries(s_entry_allocator.allocate(m_actual_size))
77 binary_heap(
const Cmp_Fn& r_cmp_fn)
78 : entry_cmp(r_cmp_fn), m_size(0), m_actual_size(resize_policy::min_size),
79 m_a_entries(s_entry_allocator.allocate(m_actual_size))
85 : entry_cmp(other), resize_policy(other), m_size(0),
86 m_actual_size(other.m_actual_size),
87 m_a_entries(s_entry_allocator.allocate(m_actual_size))
94 copy_from_range(other.begin(), other.end());
98 for (size_type i = 0; i < m_size; ++i)
99 erase_at(m_a_entries, i, s_no_throw_copies_ind);
101 s_entry_allocator.deallocate(m_a_entries, m_actual_size);
116 std::
swap((entry_cmp&)(*this), (entry_cmp&)other);
126 std::swap(m_a_entries, other.m_a_entries);
128 std::swap(m_actual_size, other.m_actual_size);
129 static_cast<resize_policy*
>(
this)->
swap(other);
136 for (size_type i = 0; i < m_size; ++i)
137 erase_at(m_a_entries, i, s_no_throw_copies_ind);
138 s_entry_allocator.deallocate(m_a_entries, m_actual_size);
#define __try
Definition: exception_defines.h:35
#define _GLIBCXX_DEBUG_ASSERT(_Condition)
Definition: debug.h:61
#define __throw_exception_again
Definition: exception_defines.h:37
#define PB_DS_CLASS_C_DEC
Definition: bin_search_tree_.hpp:71
#define PB_DS_CLASS_T_DEC
Definition: bin_search_tree_.hpp:67
#define __catch(X)
Definition: exception_defines.h:36
#define PB_DS_ASSERT_VALID(X)
Definition: binary_heap_.hpp:324
void swap(exception_ptr &__lhs, exception_ptr &__rhs)
Definition: exception_ptr.h:160