Home | History | Annotate | Download | only in binomial_heap_base_

Lines Matching defs:p_cur

80   node_pointer p_cur = base_type::m_p_root;
83   while (p_cur != 0)
85       node_pointer p_next = p_cur->m_p_next_sibling;
86       p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = 0;
87       p_cur->m_metadata = 0;
88       p_cur->m_p_next_sibling = base_type::m_p_root;
91 	base_type::m_p_root->m_p_prev_or_parent = p_cur;
93       base_type::m_p_root = p_cur;
95       p_cur = p_next;
139   node_pointer p_cur = 0;
145 	  if (p_cur == 0)
146 	    p_ret = p_cur = p_lhs;
149 	      p_cur->m_p_next_sibling = p_lhs;
150 	      p_lhs->m_p_prev_or_parent = p_cur;
152 	  p_cur = p_lhs = 0;
156 	  if (p_cur == 0)
158 	      p_ret = p_cur = p_rhs;
163 	      p_cur->m_p_next_sibling = p_rhs;
165 	      p_cur->m_p_next_sibling->m_p_prev_or_parent = p_cur;
166 	      p_cur = p_cur->m_p_next_sibling;
171 	  if (p_cur == 0)
172 	    p_ret = p_cur = p_lhs;
175 	      p_cur->m_p_next_sibling = p_lhs;
176 	      p_lhs->m_p_prev_or_parent = p_cur;
177 	      p_cur = p_cur->m_p_next_sibling;
179 	  p_lhs = p_cur->m_p_next_sibling;
190   if (p_cur != 0)
191     p_cur->m_p_next_sibling = 0;