| /dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
| H A D | insert_fn_imps.hpp | 50 return point_iterator(m_a_entries); in push()
59 m_a_entries[m_size++] = val; in insert_value()
72 m_a_entries[m_size++] = p_new; in insert_value()
90 std::copy(m_a_entries, m_a_entries + m_size, new_entries); in resize_for_insert_if_needed()
91 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in resize_for_insert_if_needed()
93 m_a_entries = new_entries; in resize_for_insert_if_needed()
113 size_type i = p_e - m_a_entries; in fix()
114 if (i > 0 && entry_cmp::operator()(m_a_entries[parent(i)], m_a_entries[i])) in fix()
118 && entry_cmp::operator()(m_a_entries[parent_i], m_a_entries[i])) in fix()
120 std::swap(m_a_entries[i], m_a_entries[parent_i]); in fix()
[all …]
|
| H A D | erase_fn_imps.hpp | 47 erase_at(m_a_entries, i, s_no_throw_copies_ind); in clear()
54 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in clear()
56 m_a_entries = new_entries; in clear()
89 erase_at(m_a_entries, m_size - 1, s_no_throw_copies_ind); in pop()
112 erase_at(m_a_entries, i, s_no_throw_copies_ind); in erase_if()
120 std::copy(m_a_entries, m_a_entries + left, new_entries); in erase_if()
121 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in erase_if()
142 const size_type fix_pos = it.m_p_e - m_a_entries; in erase()
143 std::swap(*it.m_p_e, m_a_entries[m_size - 1]); in erase()
144 erase_at(m_a_entries, m_size - 1, s_no_throw_copies_ind); in erase()
[all …]
|
| H A D | split_join_fn_imps.hpp | 82 erase_at(other.m_a_entries, i, s_no_throw_copies_ind); in split()
85 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
88 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in split()
89 s_entry_allocator.deallocate(other.m_a_entries, other.m_actual_size); in split()
97 m_a_entries = a_entries; in split()
98 other.m_a_entries = a_other_entries; in split()
140 std::copy(m_a_entries, m_a_entries + m_size, a_entries); in join()
141 std::copy(other.m_a_entries, other.m_a_entries + other.m_size, in join()
144 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in join()
[all …]
|
| H A D | constructors_destructor_fn_imps.hpp | 72 m_a_entries(s_entry_allocator.allocate(m_actual_size)) in binary_heap()
79 m_a_entries(s_entry_allocator.allocate(m_actual_size)) in binary_heap()
87 m_a_entries(s_entry_allocator.allocate(m_actual_size)) in binary_heap()
90 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries); in binary_heap()
99 erase_at(m_a_entries, i, s_no_throw_copies_ind); in binary_heap()
101 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in binary_heap()
114 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries); in swap()
126 std::swap(m_a_entries, other.m_a_entries); in value_swap()
137 erase_at(m_a_entries, i, s_no_throw_copies_ind); in ~binary_heap()
138 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in ~binary_heap()
|
| H A D | debug_fn_imps.hpp | 49 s_entry_allocator.check_allocated(m_a_entries, m_actual_size); in assert_valid()
57 s_value_allocator.check_allocated(m_a_entries[i], 1); in assert_valid()
61 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[left_child(i)])); in assert_valid()
66 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[right_child(i)])); in assert_valid()
|
| H A D | binary_heap_.hpp | 267 entry_pointer end = m_a_entries + m_size; in make_heap()
268 std::make_heap(m_a_entries, end, m_cmp); in make_heap()
275 entry_pointer end = m_a_entries + m_size; in push_heap()
276 std::push_heap(m_a_entries, end, m_cmp); in push_heap()
283 entry_pointer end = m_a_entries + m_size; in pop_heap()
284 std::pop_heap(m_a_entries, end, m_cmp); in pop_heap()
306 entry_pointer m_a_entries; member in __gnu_pbds::detail::binary_heap
|
| H A D | iterators_fn_imps.hpp | 45 { return iterator(m_a_entries); } in begin()
51 { return const_iterator(m_a_entries); } in begin()
57 { return iterator(m_a_entries + m_size); } in end()
63 { return const_iterator(m_a_entries + m_size); } in end()
|
| H A D | find_fn_imps.hpp | 55 { return *m_a_entries; } in top_imp()
61 { return **m_a_entries; } in top_imp()
|
| H A D | trace_fn_imps.hpp | 50 std::cerr << m_a_entries << std::endl; in trace()
53 trace_entry(m_a_entries[i], s_no_throw_copies_ind); in trace()
|
| /dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
| H A D | insert_fn_imps.hpp | 50 return point_iterator(m_a_entries); in push()
59 m_a_entries[m_size++] = val; in insert_value()
72 m_a_entries[m_size++] = p_new; in insert_value()
90 std::copy(m_a_entries, m_a_entries + m_size, new_entries); in resize_for_insert_if_needed()
91 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in resize_for_insert_if_needed()
93 m_a_entries = new_entries; in resize_for_insert_if_needed()
114 size_type i = p_e - m_a_entries; in fix()
115 if (i > 0 && entry_cmp::operator()(m_a_entries[parent(i)], m_a_entries[i])) in fix()
119 && entry_cmp::operator()(m_a_entries[parent_i], m_a_entries[i])) in fix()
121 std::swap(m_a_entries[i], m_a_entries[parent_i]); in fix()
[all …]
|
| H A D | erase_fn_imps.hpp | 48 erase_at(m_a_entries, i, s_no_throw_copies_ind); in clear()
55 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in clear()
57 m_a_entries = new_entries; in clear()
90 erase_at(m_a_entries, m_size - 1, s_no_throw_copies_ind); in pop()
113 erase_at(m_a_entries, i, s_no_throw_copies_ind); in erase_if()
121 std::copy(m_a_entries, m_a_entries + left, new_entries); in erase_if()
122 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in erase_if()
143 const size_type fix_pos = it.m_p_e - m_a_entries; in erase()
144 std::swap(*it.m_p_e, m_a_entries[m_size - 1]); in erase()
145 erase_at(m_a_entries, m_size - 1, s_no_throw_copies_ind); in erase()
[all …]
|
| H A D | split_join_fn_imps.hpp | 83 erase_at(other.m_a_entries, i, s_no_throw_copies_ind); in split()
86 std::copy(m_a_entries, m_a_entries + left, a_entries); in split()
87 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
89 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in split()
90 s_entry_allocator.deallocate(other.m_a_entries, other.m_actual_size); in split()
98 m_a_entries = a_entries; in split()
99 other.m_a_entries = a_other_entries; in split()
141 std::copy(m_a_entries, m_a_entries + m_size, a_entries); in join()
142 std::copy(other.m_a_entries, other.m_a_entries + other.m_size, in join()
145 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in join()
[all …]
|
| H A D | constructors_destructor_fn_imps.hpp | 73 m_a_entries(s_entry_allocator.allocate(m_actual_size)) in binary_heap()
80 m_a_entries(s_entry_allocator.allocate(m_actual_size)) in binary_heap()
88 m_a_entries(s_entry_allocator.allocate(m_actual_size)) in binary_heap()
91 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries); in binary_heap()
100 erase_at(m_a_entries, i, s_no_throw_copies_ind); in binary_heap()
102 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in binary_heap()
115 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries); in swap()
127 std::swap(m_a_entries, other.m_a_entries); in value_swap()
138 erase_at(m_a_entries, i, s_no_throw_copies_ind); in ~binary_heap()
139 s_entry_allocator.deallocate(m_a_entries, m_actual_size); in ~binary_heap()
|
| H A D | debug_fn_imps.hpp | 49 s_entry_allocator.check_allocated(m_a_entries, m_actual_size); in assert_valid()
57 s_value_allocator.check_allocated(m_a_entries[i], 1); in assert_valid()
61 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[left_child(i)])); in assert_valid()
66 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[right_child(i)])); in assert_valid()
|
| H A D | binary_heap_.hpp | 267 entry_pointer end = m_a_entries + m_size; in make_heap()
268 std::make_heap(m_a_entries, end, m_cmp); in make_heap()
280 entry_pointer end = m_a_entries + m_size; in push_heap()
281 std::push_heap(m_a_entries, end, m_cmp); in push_heap()
289 entry_pointer end = m_a_entries + m_size; in pop_heap()
290 std::pop_heap(m_a_entries, end, m_cmp); in pop_heap()
297 entry_pointer end = m_a_entries + m_size; in is_heap()
298 bool p = std::__is_heap(m_a_entries, end, m_cmp); in is_heap()
321 entry_pointer m_a_entries; member in __gnu_pbds::detail::binary_heap
|
| H A D | iterators_fn_imps.hpp | 45 { return iterator(m_a_entries); } in begin()
51 { return const_iterator(m_a_entries); } in begin()
57 { return iterator(m_a_entries + m_size); } in end()
63 { return const_iterator(m_a_entries + m_size); } in end()
|
| H A D | find_fn_imps.hpp | 55 { return *m_a_entries; } in top_imp()
61 { return **m_a_entries; } in top_imp()
|
| H A D | trace_fn_imps.hpp | 50 std::cerr << m_a_entries << std::endl; in trace()
53 trace_entry(m_a_entries[i], s_no_throw_copies_ind); in trace()
|
| /dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| H A D | rc.hpp | 116 node_pointer m_a_entries[max_entries]; member in __gnu_pbds::detail::rc
141 std::swap(m_a_entries[i], other.m_a_entries[i]); in swap()
155 m_a_entries[m_over_top++] = p_nd; in push()
177 return *(m_a_entries + m_over_top - 1); in top()
209 { return& m_a_entries[0]; } in begin()
215 { return& m_a_entries[m_over_top]; } in end()
233 std::cerr << m_a_entries[i] << std::endl; in trace()
|
| /dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| H A D | rc.hpp | 116 node_pointer m_a_entries[max_entries]; member in __gnu_pbds::detail::rc
141 std::swap(m_a_entries[i], other.m_a_entries[i]); in swap()
155 m_a_entries[m_over_top++] = p_nd; in push()
177 return *(m_a_entries + m_over_top - 1); in top()
209 { return& m_a_entries[0]; } in begin()
215 { return& m_a_entries[m_over_top]; } in end()
233 std::cerr << m_a_entries[i] << std::endl; in trace()
|