Home | History | Annotate | Download | only in binomial_heap_base_

Lines Matching defs:p_cur

91     node_pointer p_cur = base_type::m_p_root;
95 while (p_cur != NULL)
97 node_pointer p_next = p_cur->m_p_next_sibling;
99 p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL;
101 p_cur->m_metadata = 0;
103 p_cur->m_p_next_sibling = base_type::m_p_root;
106 base_type::m_p_root->m_p_prev_or_parent = p_cur;
108 base_type::m_p_root = p_cur;
112 p_cur = p_next;
161 node_pointer p_cur = NULL;
167 if (p_cur == NULL)
168 p_ret = p_cur = p_lhs;
171 p_cur->m_p_next_sibling = p_lhs;
173 p_lhs->m_p_prev_or_parent = p_cur;
176 p_cur = p_lhs = NULL;
180 if (p_cur == NULL)
182 p_ret = p_cur = p_rhs;
188 p_cur->m_p_next_sibling = p_rhs;
192 p_cur->m_p_next_sibling->m_p_prev_or_parent = p_cur;
194 p_cur = p_cur->m_p_next_sibling;
199 if (p_cur == NULL)
200 p_ret = p_cur = p_lhs;
203 p_cur->m_p_next_sibling = p_lhs;
205 p_lhs->m_p_prev_or_parent = p_cur;
207 p_cur = p_cur->m_p_next_sibling;
210 p_lhs = p_cur->m_p_next_sibling;
224 if (p_cur != NULL)
225 p_cur->m_p_next_sibling = NULL;