Home
last modified time | relevance | path

Searched refs:m_p_head (Results 1 – 25 of 33) sorted by relevance

12

/trueos/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
Dconstructors_destructor_fn_imps.hpp53 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()
73 m_p_head(s_node_allocator.allocate(1)), in PB_DS_CLASS_NAME()
91 m_p_head(s_node_allocator.allocate(1)), in PB_DS_CLASS_NAME()
100 m_p_head->m_p_parent = recursive_copy_node(other.m_p_head->m_p_parent); in PB_DS_CLASS_NAME()
101 if (m_p_head->m_p_parent != NULL) in PB_DS_CLASS_NAME()
102 m_p_head->m_p_parent->m_p_parent = m_p_head; in PB_DS_CLASS_NAME()
109 s_node_allocator.deallocate(m_p_head, 1); in PB_DS_CLASS_NAME()
134 std::swap(m_p_head, other.m_p_head); in value_swap()
143 s_node_allocator.deallocate(m_p_head, 1); in ~PB_DS_CLASS_NAME()
[all …]
Ddebug_fn_imps.hpp58 if (m_p_head->m_p_parent == NULL) in assert_valid()
73 _GLIBCXX_DEBUG_ASSERT(m_p_head != NULL); in structure_only_assert_valid()
74 if (m_p_head->m_p_parent == NULL) in structure_only_assert_valid()
76 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_left == m_p_head); in structure_only_assert_valid()
77 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_right == m_p_head); in structure_only_assert_valid()
81 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_parent->m_p_parent == m_p_head); in structure_only_assert_valid()
82 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_left != m_p_head); in structure_only_assert_valid()
83 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_right != m_p_head); in structure_only_assert_valid()
86 if (m_p_head->m_p_parent != NULL) in structure_only_assert_valid()
87 assert_node_consistent(m_p_head->m_p_parent); in structure_only_assert_valid()
[all …]
Dfind_fn_imps.hpp52 node_pointer p_pot = m_p_head; in lower_bound()
53 node_pointer p_nd = m_p_head->m_p_parent; in lower_bound()
75 node_pointer p_pot = m_p_head; in lower_bound()
76 node_pointer p_nd = m_p_head->m_p_parent; in lower_bound()
98 node_pointer p_pot = m_p_head; in upper_bound()
99 node_pointer p_nd = m_p_head->m_p_parent; in upper_bound()
120 node_pointer p_pot = m_p_head; in upper_bound()
121 node_pointer p_nd = m_p_head->m_p_parent; in upper_bound()
144 node_pointer p_pot = m_p_head; in find()
145 node_pointer p_nd = m_p_head->m_p_parent; in find()
[all …]
Diterators_fn_imps.hpp52 return (iterator(m_p_head->m_p_left)); in begin()
60 return (const_iterator(m_p_head->m_p_left)); in begin()
68 return (iterator(m_p_head)); in end()
76 return (const_iterator(m_p_head)); in end()
84 return (const_reverse_iterator(m_p_head->m_p_right)); in rbegin()
92 return (reverse_iterator(m_p_head->m_p_right)); in rbegin()
100 return (reverse_iterator(m_p_head)); in rend()
108 return (const_reverse_iterator(m_p_head)); in rend()
116 return (const_node_iterator(m_p_head->m_p_parent)); in node_begin()
124 return (node_iterator(m_p_head->m_p_parent)); in node_begin()
Dinsert_fn_imps.hpp59 node_pointer p_nd = m_p_head->m_p_parent; in insert_leaf()
60 node_pointer p_pot = m_p_head; in insert_leaf()
74 if (p_pot == m_p_head) in insert_leaf()
76 insert_leaf_new(r_value, m_p_head->m_p_right, false), in insert_leaf()
125 if (m_p_head->m_p_left == p_nd) in insert_leaf_new()
126 m_p_head->m_p_left = p_new_nd; in insert_leaf_new()
137 if (m_p_head->m_p_right == p_nd) in insert_leaf_new()
138 m_p_head->m_p_right = p_new_nd; in insert_leaf_new()
163 m_p_head->m_p_left = m_p_head->m_p_right = in insert_imp_empty()
164 m_p_head->m_p_parent = p_new_node; in insert_imp_empty()
[all …]
Derase_fn_imps.hpp69 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; in update_min_max_for_erased_node()
74 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()
80 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
82 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()
88 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
99 clear_imp(m_p_head->m_p_parent); in clear()
Dr_erase_fn_imps.hpp69 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; in update_min_max_for_erased_node()
74 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()
80 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
82 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()
88 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
99 clear_imp(m_p_head->m_p_parent); in clear()
Dsplit_join_fn_imps.hpp63 …onst bool greater = Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value), PB_DS_V2F(other.m_… in join_prep()
65 …st bool lesser = Cmp_Fn::operator()(PB_DS_V2F(other.m_p_head->m_p_right->m_value), PB_DS_V2F(m_p_h… in join_prep()
103 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value))) in split_prep()
111 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value))) in split_prep()
Drotate_fn_imps.hpp61 if (p_x == m_p_head->m_p_parent) in rotate_left()
62 m_p_head->m_p_parent = p_y; in rotate_left()
92 if (p_x == m_p_head->m_p_parent) in rotate_right()
93 m_p_head->m_p_parent = p_y; in rotate_right()
149 while (p_nd != m_p_head) in update_to_top()
/trueos/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
Dsplit_fn_imps.hpp66 m_p_head->m_p_parent = rec_split(m_p_head->m_p_parent, in split()
72 m_p_head->m_p_parent->m_p_parent = m_p_head; in split()
74 other.m_p_head->m_p_max = m_p_head->m_p_max; in split()
75 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); in split()
76 other.m_p_head->m_p_min = in split()
77 other.leftmost_descendant(other.m_p_head->m_p_parent); in split()
101 PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_min)->value()))) in split_prep()
111 PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_max)->value()))) in split_prep()
143 _GLIBCXX_DEBUG_ASSERT(other.m_p_head->m_p_parent == NULL); in rec_split()
211 if (m_p_head->m_p_parent != NULL) in split_insert_branch()
[all …]
Dconstructors_destructor_fn_imps.hpp62 m_p_head(s_head_allocator.allocate(1)), in PB_DS_CLASS_NAME()
73 m_p_head(s_head_allocator.allocate(1)), in PB_DS_CLASS_NAME()
88 m_p_head(s_head_allocator.allocate(1)), in PB_DS_CLASS_NAME()
94 if (other.m_p_head->m_p_parent == NULL) in PB_DS_CLASS_NAME()
101 m_p_head->m_p_parent = recursive_copy_node(other.m_p_head->m_p_parent); in PB_DS_CLASS_NAME()
105 s_head_allocator.deallocate(m_p_head, 1); in PB_DS_CLASS_NAME()
109 m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent); in PB_DS_CLASS_NAME()
110 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); in PB_DS_CLASS_NAME()
111 m_p_head->m_p_parent->m_p_parent = m_p_head; in PB_DS_CLASS_NAME()
134 std::swap(m_p_head, other.m_p_head); in value_swap()
[all …]
Dinsert_join_fn_imps.hpp62 m_p_head->m_p_parent = rec_join(m_p_head->m_p_parent, in join()
63 other.m_p_head->m_p_parent, 0, bag); in join()
65 m_p_head->m_p_parent->m_p_parent = m_p_head; in join()
69 m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent); in join()
70 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); in join()
91 m_p_head->m_p_max)->value()),PB_DS_V2F(static_cast<const_leaf_pointer>( in join_prep()
92 other.m_p_head->m_p_min)->value())); in join_prep()
95 …other.m_p_head->m_p_max)->value()),PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_min)->v… in join_prep()
100 rec_join_prep(m_p_head->m_p_parent, other.m_p_head->m_p_parent, r_bag); in join_prep()
405 m_p_head->m_p_parent = rec_join(m_p_head->m_p_parent, p_new_lf, 0, bag); in insert()
[all …]
Ddebug_fn_imps.hpp54 if (m_p_head->m_p_parent != NULL) in assert_valid()
55 m_p_head->m_p_parent->assert_valid(this); in assert_valid()
58 if (m_p_head->m_p_parent == NULL) in assert_valid()
60 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min == m_p_head); in assert_valid()
61 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max == m_p_head); in assert_valid()
66 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min->m_type == pat_trie_leaf_node_type); in assert_valid()
67 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type); in assert_valid()
Dr_erase_fn_imps.hpp66 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; in update_min_max_for_erased_node()
70 if (m_p_head->m_p_left == p_z) in update_min_max_for_erased_node()
74 m_p_head->m_p_left = it.m_p_nd; in update_min_max_for_erased_node()
76 else if (m_p_head->m_p_right == p_z) in update_min_max_for_erased_node()
80 m_p_head->m_p_right = it.m_p_nd; in update_min_max_for_erased_node()
90 clear_imp(m_p_head->m_p_parent); in clear()
Diterators_fn_imps.hpp51 { return iterator(m_p_head->m_p_min); } in begin()
57 { return const_iterator(m_p_head->m_p_min); } in begin()
63 { return iterator(m_p_head); } in end()
69 { return const_iterator(m_p_head); } in end()
95 { return reverse_iterator(m_p_head); } in rend()
101 { return const_reverse_iterator(m_p_head); } in rend()
107 { return const_node_iterator(m_p_head->m_p_parent, this); } in node_begin()
113 { return node_iterator(m_p_head->m_p_parent, this); } in node_begin()
Derase_fn_imps.hpp81 if (p_parent == m_p_head) in erase_fixup()
82 m_p_head->m_p_parent =* p_nd->begin(); in erase_fixup()
97 if (p_parent == m_p_head) in erase_fixup()
141 clear_imp(m_p_head->m_p_parent); in clear()
217 if (it.m_p_nd == m_p_head) in erase()
236 if (it.m_p_nd == m_p_head) in erase()
306 m_p_head->m_p_min = m_p_head; in update_min_max_for_erased_leaf()
307 m_p_head->m_p_max = m_p_head; in update_min_max_for_erased_leaf()
311 if (p_l == static_cast<const_leaf_pointer>(m_p_head->m_p_min)) in update_min_max_for_erased_leaf()
315 m_p_head->m_p_min = it.m_p_nd; in update_min_max_for_erased_leaf()
[all …]
Drotate_fn_imps.hpp59 if (p_x == m_p_head->m_p_parent) in rotate_left()
60 m_p_head->m_p_parent = p_y; in rotate_left()
88 if (p_x == m_p_head->m_p_parent) in rotate_right()
89 m_p_head->m_p_parent = p_y; in rotate_right()
144 while (p_nd != m_p_head) in update_to_top()
/trueos/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
Dsplit_join_fn_imps.hpp63 join_imp(p_x, other.m_p_head->m_p_parent); in join()
80 const size_type h = black_height(base_type::m_p_head->m_p_parent); in join_imp()
88 join_pos = find_join_pos_right(base_type::m_p_head->m_p_parent, in join_imp()
95 p_x_l = base_type::m_p_head->m_p_parent; in join_imp()
96 base_type::m_p_head->m_p_parent = p_r; in join_imp()
98 p_r->m_p_parent = base_type::m_p_head; in join_imp()
100 join_pos = find_join_pos_left(base_type::m_p_head->m_p_parent, in join_imp()
106 if (p_parent == base_type::m_p_head) in join_imp()
108 base_type::m_p_head->m_p_parent = p_x; in join_imp()
109 p_x->m_p_parent = base_type::m_p_head; in join_imp()
[all …]
Derase_fn_imps.hpp81 if (it.m_p_nd == base_type::m_p_head) in erase()
153 if (base_type::m_p_head->m_p_parent == p_z) in remove_node()
154 base_type::m_p_head->m_p_parent = p_x; in remove_node()
182 if (base_type::m_p_head->m_p_parent == p_z) in remove_node()
183 base_type::m_p_head->m_p_parent = p_y; in remove_node()
209 while (p_x != base_type::m_p_head->m_p_parent && is_effectively_black(p_x)) in remove_fixup()
/trueos/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
Dsplit_join_fn_imps.hpp61 node_pointer p_target_r = other.leftmost(other.m_p_head); in join()
65 _GLIBCXX_DEBUG_ASSERT(p_target_r == other.m_p_head->m_p_parent); in join()
68 p_target_r->m_p_left = base_type::m_p_head->m_p_parent; in join()
73 base_type::m_p_head->m_p_parent = p_target_r; in join()
74 p_target_r->m_p_parent = base_type::m_p_head; in join()
102 _GLIBCXX_DEBUG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head); in split()
107 base_type::m_p_head->m_p_parent = p_new_root; in split()
108 p_new_root->m_p_parent = base_type::m_p_head; in split()
109 other.m_p_head->m_p_parent = p_upper_bound; in split()
110 p_upper_bound->m_p_parent = other.m_p_head; in split()
Derase_fn_imps.hpp80 if (it.m_p_nd == base_type::m_p_head) in erase()
121 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); in erase_node()
130 base_type::m_p_head->m_p_parent = p_l; in erase_node()
132 p_l->m_p_parent = base_type::m_p_head; in erase_node()
139 p_r->m_p_parent = base_type::m_p_head; in erase_node()
140 base_type::m_p_head->m_p_parent = p_r; in erase_node()
144 _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_parent == this->m_p_head); in erase_node()
145 _GLIBCXX_DEBUG_ASSERT(this->m_p_head->m_p_parent == p_target_r); in erase_node()
Dfind_fn_imps.hpp53 if (p_found != base_type::m_p_head) in find()
64 if (p_found != base_type::m_p_head) in find()
75 node_pointer p_nd = base_type::m_p_head->m_p_parent; in find_imp()
85 return base_type::m_p_head; in find_imp()
94 node_pointer p_nd = base_type::m_p_head->m_p_parent; in find_imp()
104 return base_type::m_p_head; in find_imp()
Dsplay_fn_imps.hpp52 while (p_nd->m_p_parent != base_type::m_p_head) in splay()
56 node_pointer p_head = base_type::m_p_head; in splay()
63 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head) in splay()
66 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); in splay()
255 const bool grandparent_head = p_grandparent->m_p_parent == base_type::m_p_head; in splay_zz_start()
259 base_type::m_p_head->m_p_parent = base_type::m_p_head->m_p_parent; in splay_zz_start()
260 p_nd->m_p_parent = base_type::m_p_head; in splay_zz_start()
280 if (p_nd->m_p_parent == base_type::m_p_head) in splay_zz_end()
281 base_type::m_p_head->m_p_parent = p_nd; in splay_zz_end()
Dinsert_fn_imps.hpp70 node_pointer p_nd = base_type::m_p_head->m_p_parent; in insert_leaf_imp()
71 node_pointer p_pot = base_type::m_p_head; in insert_leaf_imp()
86 if (p_pot == base_type::m_p_head) in insert_leaf_imp()
87 …return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), … in insert_leaf_imp()
Ddebug_fn_imps.hpp55 const node_pointer p_head = base_type::m_p_head; in assert_valid()
67 if (p_nd == base_type::m_p_head) in assert_special_imp()

12