Home | History | Annotate | Download | only in left_child_next_sibling_heap_

Lines Matching refs:p_cur

82   node_pointer p_cur = m_p_root;
83   while (p_cur != 0)
84     if (p_cur->m_p_l_child != 0)
86 	node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling;
87 	p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling;
88 	p_cur->m_p_next_sibling = p_cur->m_p_l_child;
89 	p_cur->m_p_l_child = p_child_next;
92       p_cur = p_cur->m_p_next_sibling;
113   node_pointer p_cur = m_p_root;
116   while (p_cur != 0)
118       node_pointer p_next = p_cur->m_p_next_sibling;
119       if (pred(p_cur->m_value))
121 	  p_cur->m_p_next_sibling = p_out;
123 	    p_out->m_p_prev_or_parent = p_cur;
124 	  p_out = p_cur;
128 	  p_cur->m_p_next_sibling = m_p_root;
130 	    m_p_root->m_p_prev_or_parent = p_cur;
131 	  m_p_root = p_cur;
133       p_cur = p_next;