| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
| D | erase_fn_imps.hpp | 52 for (size_type i = 0; i < m_size; ++i) in clear()
72 m_size = 0; in clear()
103 std::pop_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); in pop()
107 _GLIBCXX_DEBUG_ASSERT(m_size > 0); in pop()
108 --m_size; in pop()
131 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in erase_if()
133 const size_type ersd = m_size - left; in erase_if()
135 for (size_type i = left; i < m_size; ++i) in erase_if()
156 m_size = left; in erase_if()
158 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); in erase_if()
[all …]
|
| D | split_join_fn_imps.hpp | 65 _GLIBCXX_DEBUG_ASSERT(m_size >= left); in split()
67 const size_type ersd = m_size - left; in split()
69 _GLIBCXX_DEBUG_ASSERT(m_size >= ersd); in split()
97 for (size_type i = 0; i < other.m_size; ++i) in split()
102 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries); in split()
110 m_size = left; in split()
111 other.m_size = ersd; in split()
116 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); in split()
117 …std::make_heap(other.m_a_entries, other.m_a_entries + other.m_size, static_cast<entry_cmp& >(other… in split()
134 const size_type len = m_size + other.m_size; in join()
[all …]
|
| D | insert_fn_imps.hpp | 56 std::push_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); in push()
70 m_a_entries[m_size++] = val; in insert_value()
88 m_a_entries[m_size++] = p_new; in insert_value()
98 m_a_entries[m_size++] = e; in insert_entry()
106 if (!resize_policy::resize_needed_for_grow(m_size)) in resize_for_insert_if_needed()
108 _GLIBCXX_DEBUG_ASSERT(m_size < m_actual_size); in resize_for_insert_if_needed()
120 std::copy(m_a_entries, m_a_entries + m_size, a_new_entries); in resize_for_insert_if_needed()
168 while (i < m_size) in fix()
176 left_child_i < m_size&& in fix()
180 right_child_i < m_size&& in fix()
[all …]
|
| D | constructors_destructor_fn_imps.hpp | 71 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this)); in copy_from_range()
79 m_size(0), in binary_heap_()
90 m_size(0), in binary_heap_()
102 m_size(0), in binary_heap_()
122 for (size_type i = 0; i < m_size; ++i) in binary_heap_()
152 std::swap(m_size, other.m_size); in value_swap()
161 for (size_type i = 0; i < m_size; ++i) in ~binary_heap_()
|
| D | debug_fn_imps.hpp | 59 _GLIBCXX_DEBUG_ASSERT(m_size <= m_actual_size); in assert_valid()
60 for (size_type i = 0; i < m_size; ++i) in assert_valid()
66 if (left_child(i) < m_size) in assert_valid()
71 if (right_child(i) < m_size) in assert_valid()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
| D | erase_fn_imps.hpp | 53 if (m_size == 0) in clear()
61 cond_dtor<size_type> cd(m_a_values, m_end_it, m_size); in clear()
66 m_size = 0; in clear()
80 typename Allocator::group_throw_prob_adjustor adjust(m_size); in erase_if()
118 cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size); in erase_if()
122 m_size = new_size; in erase_if()
142 typename Allocator::group_throw_prob_adjustor adjust(m_size); in erase_imp()
145 _GLIBCXX_DEBUG_ASSERT(m_size > 0); in erase_imp()
146 value_vector a_values = s_value_alloc.allocate(m_size - 1); in erase_imp()
152 cond_dtor<size_type> cd(a_values, target_it, m_size - 1); in erase_imp()
[all …]
|
| D | constructors_destructor_fn_imps.hpp | 61 m_size(0) in PB_DS_OV_TREE_CLASS_NAME()
71 m_size(0) in PB_DS_OV_TREE_CLASS_NAME()
82 m_size(0) in PB_DS_OV_TREE_CLASS_NAME()
99 m_size(0) in PB_DS_OV_TREE_CLASS_NAME()
161 m_size = len; in copy_from_ordered_range()
162 m_end_it = m_a_values + m_size; in copy_from_ordered_range()
214 m_size = len; in copy_from_ordered_range()
215 m_end_it = m_a_values + m_size; in copy_from_ordered_range()
247 std::swap(m_size, other.m_size); in value_swap()
257 cond_dtor<size_type> cd(m_a_values, m_end_it, m_size); in ~PB_DS_OV_TREE_CLASS_NAME()
|
| D | debug_fn_imps.hpp | 56 if (m_a_values == NULL || m_end_it == NULL || m_size == 0) in assert_valid()
57 _GLIBCXX_DEBUG_ASSERT(m_a_values == NULL && m_end_it == NULL && m_size == 0); in assert_valid()
69 map_debug_base::check_size(m_size); in assert_iterators()
72 _GLIBCXX_DEBUG_ASSERT( m_end_it == m_a_values + m_size); in assert_iterators()
86 _GLIBCXX_DEBUG_ASSERT(iterated_num == m_size); in assert_iterators()
|
| D | ov_tree_map_.hpp | 282 pointer e_it = m_a_values + m_size; in lower_bound()
423 typename Allocator::group_throw_prob_adjustor adjust(m_size); in insert_new_val()
428 value_vector a_values = s_value_alloc.allocate(m_size + 1); in insert_new_val()
435 cond_dtor<size_type> cd(a_values, target_it, m_size + 1); in insert_new_val()
454 reallocate_metadata((node_update* )this, m_size + 1); in insert_new_val()
456 if (m_size != 0) in insert_new_val()
458 cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size); in insert_new_val()
461 ++m_size; in insert_new_val()
463 m_end_it = m_a_values + m_size; in insert_new_val()
501 size_type m_size; member in pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME
|
| D | iterators_fn_imps.hpp | 80 mid_pointer(m_a_metadata, m_a_metadata + m_size)); in PB_DS_node_begin_imp()
89 (m_a_metadata == NULL) ? NULL : m_a_metadata + m_size); in PB_DS_node_end_imp()
98 (m_a_metadata == NULL) ? NULL : mid_pointer(m_a_metadata, m_a_metadata + m_size)); in PB_DS_node_begin_imp()
107 end(),(m_a_metadata == NULL) ? NULL : m_a_metadata + m_size); in PB_DS_node_end_imp()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/resize_policy/ |
| D | hash_standard_resize_policy_imp.hpp | 53 : m_size(Size_Policy::get_nearest_larger_size(1)) in hash_standard_resize_policy()
54 { trigger_policy_base::notify_externally_resized(m_size); } in hash_standard_resize_policy()
59 : Size_Policy(r_size_policy), m_size(Size_Policy::get_nearest_larger_size(1)) in hash_standard_resize_policy()
60 { trigger_policy_base::notify_externally_resized(m_size); } in hash_standard_resize_policy()
67 m_size(Size_Policy::get_nearest_larger_size(1)) in hash_standard_resize_policy()
68 { trigger_policy_base::notify_externally_resized(m_size); } in hash_standard_resize_policy()
82 std::swap(m_size, other.m_size); in swap()
179 m_size = new_size; in notify_resized()
188 return m_size; in get_actual_size()
210 const size_type old_size = m_size; in resize()
[all …]
|
| D | hash_load_check_resize_trigger_size_base.hpp | 65 hash_load_check_resize_trigger_size_base(): m_size(0) in hash_load_check_resize_trigger_size_base()
70 { std::swap(m_size, other.m_size); } in swap()
74 { m_size = size; } in set_size()
78 { return m_size; } in get_size()
81 size_type m_size; member in pb_ds::detail::hash_load_check_resize_trigger_size_base
|
| D | cc_hash_max_collision_check_resize_trigger_imp.hpp | 54 m_size(0), in cc_hash_max_collision_check_resize_trigger()
149 m_size = new_size; in notify_resized()
167 const double ln_arg = 2 * m_size * ::log(double(m_size)); in calc_max_num_coll()
172 << static_cast<unsigned long>(m_size) << " " in calc_max_num_coll()
189 std::swap(m_size, other.m_size); in swap()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
| D | constructors_destructor_fn_imps.hpp | 53 PB_DS_CLASS_NAME() : m_p_head(s_node_allocator.allocate(1)), m_size(0) in PB_DS_CLASS_NAME()
62 Cmp_Fn(r_cmp_fn), m_p_head(s_node_allocator.allocate(1)), m_size(0) in PB_DS_CLASS_NAME()
74 m_size(0) in PB_DS_CLASS_NAME()
92 m_size(0) in PB_DS_CLASS_NAME()
95 m_size = other.m_size; in PB_DS_CLASS_NAME()
103 m_size = other.m_size; in PB_DS_CLASS_NAME()
135 std::swap(m_size, other.m_size); in value_swap()
154 m_size = 0; in initialize()
|
| D | split_join_fn_imps.hpp | 54 if (other.m_size == 0) in join_prep()
57 if (m_size == 0) in join_prep()
73 m_size += other.m_size; in join_prep()
96 if (m_size == 0) in split_prep()
118 if (m_size == 1) in split_prep()
136 other.m_size = std::distance(other.begin(), other.end()); in split_finish()
137 m_size -= other.m_size; in split_finish()
|
| D | erase_fn_imps.hpp | 52 _GLIBCXX_DEBUG_ASSERT(m_size > 0); in actual_erase_node()
53 --m_size; in actual_erase_node()
67 if (m_size == 1) in update_min_max_for_erased_node()
101 m_size = 0; in clear()
|
| D | r_erase_fn_imps.hpp | 52 _GLIBCXX_DEBUG_ASSERT(m_size > 0); in actual_erase_node()
53 --m_size; in actual_erase_node()
67 if (m_size == 1) in update_min_max_for_erased_node()
101 m_size = 0; in clear()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| D | constructors_destructor_fn_imps.hpp | 59 m_size(0) in left_child_next_sibling_heap_()
69 m_size(0) in left_child_next_sibling_heap_()
77 : Cmp_Fn(other), m_p_root(NULL), m_size(0) in left_child_next_sibling_heap_()
79 m_size = other.m_size; in left_child_next_sibling_heap_()
82 m_size = other.m_size; in left_child_next_sibling_heap_()
105 std::swap(m_size, other.m_size); in value_swap()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
| D | split_join_fn_imps.hpp | 72 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); in split()
73 --base_type::m_size; in split()
75 ++other.m_size; in split()
124 base_type::m_size += other.m_size; in join()
127 other.m_size = 0; in join()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| D | constructors_destructor_fn_imps.hpp | 63 m_size(0) in PB_DS_CLASS_NAME()
74 m_size(0) in PB_DS_CLASS_NAME()
89 m_size(0) in PB_DS_CLASS_NAME()
92 m_size = other.m_size; in PB_DS_CLASS_NAME()
135 std::swap(m_size, other.m_size); in value_swap()
155 m_size = 0; in initialize()
|
| D | r_erase_fn_imps.hpp | 52 _GLIBCXX_DEBUG_ASSERT(m_size > 0); in actual_erase_node()
53 --m_size; in actual_erase_node()
64 if (m_size == 1) in update_min_max_for_erased_node()
91 m_size = 0; in clear()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/ |
| D | mod_based_range_hashing.hpp | 80 size_type m_size; member in pb_ds::detail::mod_based_range_hashing
88 std::swap(m_size, other.m_size); in swap()
96 m_size = size; in notify_resized()
104 return (hash % m_size); in range_hash()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
| D | split_join_fn_imps.hpp | 72 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); in split()
73 --base_type::m_size; in split()
75 ++other.m_size; in split()
138 base_type::m_size += other.m_size; in join()
141 other.m_size = 0; in join()
|
| /freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
| D | split_join_fn_imps.hpp | 72 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); in split()
73 --base_type::m_size; in split()
75 ++other.m_size; in split()
149 base_type::m_size += other.m_size; in join()
153 other.m_size = 0; in join()
|
| /freebsd-12-stable/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/ |
| D | LibCxxVariant.cpp | 182 size_t CalculateNumChildren() override { return m_size; } in CalculateNumChildren()
186 size_t m_size = 0; member in __anon6047fd020211::VariantFrontEnd
191 m_size = 0; in Update()
205 m_size = 1; in Update()
211 if (idx >= m_size) in GetChildAtIndex()
|