Searched refs:m_a_entries (Results 1 - 10 of 10) sorted by relevance
/freebsd-10.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | iterators_fn_imps.hpp | 52 return (iterator(m_a_entries)); 60 return (const_iterator(m_a_entries)); 68 return (iterator(m_a_entries + m_size)); 76 return (const_iterator(m_a_entries + m_size));
|
H A D | debug_fn_imps.hpp | 55 s_entry_allocator.check_allocated(m_a_entries, m_actual_size); 63 s_value_allocator.check_allocated(m_a_entries[i], 1); 67 _GLIBCXX_DEBUG_ASSERT(!entry_cmp::operator()(m_a_entries[i], m_a_entries[left_child(i)])); 72 _GLIBCXX_DEBUG_ASSERT(!entry_cmp::operator()(m_a_entries[i], m_a_entries[right_child(i)]));
|
H A D | insert_fn_imps.hpp | 56 std::push_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); 60 return point_iterator(m_a_entries); 70 m_a_entries[m_size++] = val; 88 m_a_entries[m_size++] = p_new; 98 m_a_entries[m_size++] = e; 120 std::copy(m_a_entries, m_a_entries + m_size, a_new_entries); 122 s_entry_allocator.deallocate(m_a_entries, m_actual_size); 126 m_a_entries [all...] |
H A D | erase_fn_imps.hpp | 53 erase_at(m_a_entries, i, s_no_throw_copies_ind); 63 s_entry_allocator.deallocate(m_a_entries, m_actual_size); 67 m_a_entries = a_entries; 101 erase_at(m_a_entries, 0, s_no_throw_copies_ind); 103 std::pop_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); 136 erase_at(m_a_entries, i, s_no_throw_copies_ind); 145 std::copy(m_a_entries, m_a_entries + left, a_entries); 147 s_entry_allocator.deallocate(m_a_entries, m_actual_siz [all...] |
H A D | split_join_fn_imps.hpp | 98 erase_at(other.m_a_entries, i, s_no_throw_copies_ind); 101 std::copy(m_a_entries, m_a_entries + left, a_entries); 102 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); 104 s_entry_allocator.deallocate(m_a_entries, m_actual_size); 105 s_entry_allocator.deallocate(other.m_a_entries, other.m_actual_size); 113 m_a_entries = a_entries; 114 other.m_a_entries = a_other_entries; 116 std::make_heap(m_a_entries, m_a_entrie [all...] |
H A D | constructors_destructor_fn_imps.hpp | 71 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); 81 m_a_entries(s_entry_allocator.allocate(m_actual_size)) 92 m_a_entries(s_entry_allocator.allocate(m_actual_size)) 104 m_a_entries(s_entry_allocator.allocate(m_actual_size)) 107 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries); 123 erase_at(m_a_entries, i, s_no_throw_copies_ind); 125 s_entry_allocator.deallocate(m_a_entries, m_actual_size); 138 _GLIBCXX_DEBUG_ASSERT(m_a_entries ! [all...] |
H A D | find_fn_imps.hpp | 63 return* m_a_entries; 71 return** m_a_entries;
|
H A D | trace_fn_imps.hpp | 56 std::cerr << m_a_entries << std::endl; 59 trace_entry(m_a_entries[i], s_no_throw_copies_ind);
|
H A D | binary_heap_.hpp | 341 entry_pointer m_a_entries; member in class:pb_ds::detail::binary_heap_
|
/freebsd-10.3-release/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | rc.hpp | 139 node_pointer m_a_entries[max_entries]; member in class:pb_ds::detail::rc 165 std::swap(m_a_entries[i], other.m_a_entries[i]); 179 m_a_entries[m_over_top++] = p_nd; 201 return *(m_a_entries + m_over_top - 1); 233 { return& m_a_entries[0]; } 239 { return& m_a_entries[m_over_top]; } 257 std::cerr << m_a_entries[i] << std::endl;
|
Completed in 100 milliseconds