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

12

/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dr_erase_fn_imps.hpp60 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
64 if (m_p_head->m_p_left == p_z)
68 m_p_head->m_p_left = it.m_p_nd;
70 else if (m_p_head->m_p_right == p_z)
74 m_p_head->m_p_right = it.m_p_nd;
84 clear_imp(m_p_head->m_p_parent);
H A Dconstructors_destructor_fn_imps.hpp47 PB_DS_BIN_TREE_NAME() : m_p_head(s_node_allocator.allocate(1)), m_size(0)
56 Cmp_Fn(r_cmp_fn), m_p_head(s_node_allocator.allocate(1)), m_size(0)
67 m_p_head(s_node_allocator.allocate(1)),
85 m_p_head(s_node_allocator.allocate(1)),
94 m_p_head->m_p_parent = recursive_copy_node(other.m_p_head->m_p_parent);
95 if (m_p_head->m_p_parent != 0)
96 m_p_head->m_p_parent->m_p_parent = m_p_head;
103 s_node_allocator.deallocate(m_p_head,
[all...]
H A Diterators_fn_imps.hpp46 return (iterator(m_p_head->m_p_left));
54 return (const_iterator(m_p_head->m_p_left));
62 return (iterator(m_p_head));
70 return (const_iterator(m_p_head));
78 return (const_reverse_iterator(m_p_head->m_p_right));
86 return (reverse_iterator(m_p_head->m_p_right));
94 return (reverse_iterator(m_p_head));
102 return (const_reverse_iterator(m_p_head));
110 return (node_const_iterator(m_p_head->m_p_parent));
118 return (node_iterator(m_p_head
[all...]
H A Dfind_fn_imps.hpp46 node_pointer p_pot = m_p_head;
47 node_pointer p_nd = m_p_head->m_p_parent;
65 node_pointer p_pot = m_p_head;
66 node_pointer p_nd = m_p_head->m_p_parent;
84 node_pointer p_pot = m_p_head;
85 node_pointer p_nd = m_p_head->m_p_parent;
103 node_pointer p_pot = m_p_head;
104 node_pointer p_nd = m_p_head->m_p_parent;
123 node_pointer p_pot = m_p_head;
124 node_pointer p_nd = m_p_head
[all...]
H A Derase_fn_imps.hpp60 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
64 if (m_p_head->m_p_left == p_z)
68 m_p_head->m_p_left = it.m_p_nd;
70 else if (m_p_head->m_p_right == p_z)
74 m_p_head->m_p_right = it.m_p_nd;
84 clear_imp(m_p_head->m_p_parent);
H A Ddebug_fn_imps.hpp52 if (m_p_head->m_p_parent == 0)
67 PB_DS_DEBUG_VERIFY(m_p_head != 0);
68 if (m_p_head->m_p_parent == 0)
70 PB_DS_DEBUG_VERIFY(m_p_head->m_p_left == m_p_head);
71 PB_DS_DEBUG_VERIFY(m_p_head->m_p_right == m_p_head);
75 PB_DS_DEBUG_VERIFY(m_p_head->m_p_parent->m_p_parent == m_p_head);
76 PB_DS_DEBUG_VERIFY(m_p_head
[all...]
H A Dinsert_fn_imps.hpp52 node_pointer p_nd = m_p_head->m_p_parent;
53 node_pointer p_pot = m_p_head;
66 if (p_pot == m_p_head)
67 return std::make_pair(insert_leaf_new(r_value, m_p_head->m_p_right, false),
108 if (m_p_head->m_p_left == p_nd)
109 m_p_head->m_p_left = p_new_nd;
118 if (m_p_head->m_p_right == p_nd)
119 m_p_head->m_p_right = p_new_nd;
139 m_p_head->m_p_left = m_p_head
[all...]
H A Dsplit_join_fn_imps.hpp58 Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value),
59 PB_DS_V2F(other.m_p_head->m_p_left->m_value));
62 Cmp_Fn::operator()(PB_DS_V2F(other.m_p_head->m_p_right->m_value),
63 PB_DS_V2F(m_p_head->m_p_left->m_value));
101 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value)))
109 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value)))
H A Drotate_fn_imps.hpp55 if (p_x == m_p_head->m_p_parent)
56 m_p_head->m_p_parent = p_y;
86 if (p_x == m_p_head->m_p_parent)
87 m_p_head->m_p_parent = p_y;
142 while (p_nd != m_p_head)
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Dsplit_join_fn_imps.hpp55 node_pointer p_target_r = other.leftmost(other.m_p_head);
59 _GLIBCXX_DEBUG_ASSERT(p_target_r == other.m_p_head->m_p_parent);
62 p_target_r->m_p_left = base_type::m_p_head->m_p_parent;
67 base_type::m_p_head->m_p_parent = p_target_r;
68 p_target_r->m_p_parent = base_type::m_p_head;
96 _GLIBCXX_DEBUG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head);
101 base_type::m_p_head->m_p_parent = p_new_root;
102 p_new_root->m_p_parent = base_type::m_p_head;
103 other.m_p_head->m_p_parent = p_upper_bound;
104 p_upper_bound->m_p_parent = other.m_p_head;
[all...]
H A Dfind_fn_imps.hpp47 if (p_found != base_type::m_p_head)
58 if (p_found != base_type::m_p_head)
70 node_pointer p_nd = base_type::m_p_head->m_p_parent;
80 return base_type::m_p_head;
89 node_pointer p_nd = base_type::m_p_head->m_p_parent;
99 return base_type::m_p_head;
H A Derase_fn_imps.hpp74 if (it.m_p_nd == base_type::m_p_head)
115 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
124 base_type::m_p_head->m_p_parent = p_l;
126 p_l->m_p_parent = base_type::m_p_head;
133 p_r->m_p_parent = base_type::m_p_head;
134 base_type::m_p_head->m_p_parent = p_r;
138 _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_parent == this->m_p_head);
139 _GLIBCXX_DEBUG_ASSERT(this->m_p_head->m_p_parent == p_target_r);
H A Ddebug_fn_imps.hpp49 const node_pointer p_head = base_type::m_p_head;
62 if (p_nd == base_type::m_p_head)
H A Dinsert_fn_imps.hpp65 node_pointer p_nd = base_type::m_p_head->m_p_parent;
66 node_pointer p_pot = base_type::m_p_head;
81 if (p_pot == base_type::m_p_head)
82 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true);
H A Dsplay_fn_imps.hpp46 while (p_nd->m_p_parent != base_type::m_p_head)
50 node_pointer p_head = base_type::m_p_head;
57 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head)
60 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
249 const bool grandparent_head = p_grandparent->m_p_parent == base_type::m_p_head;
253 base_type::m_p_head->m_p_parent = base_type::m_p_head->m_p_parent;
254 p_nd->m_p_parent = base_type::m_p_head;
274 if (p_nd->m_p_parent == base_type::m_p_head)
275 base_type::m_p_head
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dconstructors_destructor_fn_imps.hpp56 m_p_head(s_head_allocator.allocate(1)),
67 m_p_head(s_head_allocator.allocate(1)),
82 m_p_head(s_head_allocator.allocate(1)),
88 if (other.m_p_head->m_p_parent == 0)
95 m_p_head->m_p_parent = recursive_copy_node(other.m_p_head->m_p_parent);
99 s_head_allocator.deallocate(m_p_head, 1);
103 m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent);
104 m_p_head
[all...]
H A Diterators_fn_imps.hpp45 { return iterator(m_p_head->m_p_min); }
51 { return const_iterator(m_p_head->m_p_min); }
57 { return iterator(m_p_head); }
63 { return const_iterator(m_p_head); }
89 { return reverse_iterator(m_p_head); }
95 { return const_reverse_iterator(m_p_head); }
101 { return node_const_iterator(m_p_head->m_p_parent, this); }
107 { return node_iterator(m_p_head->m_p_parent, this); }
H A Dr_erase_fn_imps.hpp60 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
64 if (m_p_head->m_p_left == p_z)
68 m_p_head->m_p_left = it.m_p_nd;
70 else if (m_p_head->m_p_right == p_z)
74 m_p_head->m_p_right = it.m_p_nd;
84 clear_imp(m_p_head->m_p_parent);
H A Dsplit_fn_imps.hpp61 m_p_head->m_p_parent = rec_split(m_p_head->m_p_parent, pref_begin(p_split_lf),
64 m_p_head->m_p_parent->m_p_parent = m_p_head;
66 head_pointer __ohead = other.m_p_head;
67 __ohead->m_p_max = m_p_head->m_p_max;
68 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent);
94 PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_min)->value())))
104 PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head
[all...]
H A Ddebug_fn_imps.hpp48 if (m_p_head->m_p_parent != 0)
49 m_p_head->m_p_parent->assert_valid(this, __file, __line);
52 if (m_p_head->m_p_parent == 0)
54 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min == m_p_head);
55 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max == m_p_head);
60 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node);
61 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node);
H A Dinsert_join_fn_imps.hpp56 m_p_head->m_p_parent = rec_join(m_p_head->m_p_parent,
57 other.m_p_head->m_p_parent, 0, bag);
59 m_p_head->m_p_parent->m_p_parent = m_p_head;
63 m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent);
64 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent);
85 synth_access_traits::cmp_keys(PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head
[all...]
H A Derase_fn_imps.hpp75 if (p_parent == m_p_head)
76 m_p_head->m_p_parent = *p_nd->begin();
91 if (p_parent == m_p_head)
132 clear_imp(m_p_head->m_p_parent);
209 if (it.m_p_nd == m_p_head)
228 if (it.m_p_nd == m_p_head)
296 m_p_head->m_p_min = m_p_head;
297 m_p_head->m_p_max = m_p_head;
[all...]
H A Drotate_fn_imps.hpp53 if (p_x == m_p_head->m_p_parent)
54 m_p_head->m_p_parent = p_y;
82 if (p_x == m_p_head->m_p_parent)
83 m_p_head->m_p_parent = p_y;
138 while (p_nd != m_p_head)
H A Dtrace_fn_imps.hpp49 if (m_p_head->m_p_parent == 0)
51 trace_node(m_p_head->m_p_parent, 0);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Dsplit_join_fn_imps.hpp56 join_imp(p_x, other.m_p_head->m_p_parent);
71 const size_type h = black_height(base_type::m_p_head->m_p_parent);
79 join_pos = find_join_pos_right(base_type::m_p_head->m_p_parent,
86 p_x_l = base_type::m_p_head->m_p_parent;
87 base_type::m_p_head->m_p_parent = p_r;
89 p_r->m_p_parent = base_type::m_p_head;
91 join_pos = find_join_pos_left(base_type::m_p_head->m_p_parent,
97 if (p_parent == base_type::m_p_head)
99 base_type::m_p_head->m_p_parent = p_x;
100 p_x->m_p_parent = base_type::m_p_head;
[all...]

Completed in 120 milliseconds

12