Searched refs:p_cur (Results 1 – 8 of 8) sorted by relevance
101 while (p_cur != NULL) in split()105 p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL; in split()118 p_cur = p_next; in split()173 if (p_cur == NULL) in join()182 p_cur = p_lhs = NULL; in join()186 if (p_cur == NULL) in join()198 p_cur->m_p_next_sibling->m_p_prev_or_parent = p_cur; in join()200 p_cur = p_cur->m_p_next_sibling; in join()205 if (p_cur == NULL) in join()213 p_cur = p_cur->m_p_next_sibling; in join()[all …]
67 node_pointer p_cur = base_type::m_p_root; in find_max() local69 m_p_max = p_cur; in find_max()71 while (p_cur != NULL) in find_max()73 if (Cmp_Fn::operator()(m_p_max->m_value, p_cur->m_value)) in find_max()74 m_p_max = p_cur; in find_max()76 p_cur = p_cur->m_p_next_sibling; in find_max()
168 node_pointer p_cur = base_type::m_p_root; in erase_if() local172 while (p_cur != NULL) in erase_if()174 node_pointer p_next = p_cur->m_p_next_sibling; in erase_if()176 p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL; in erase_if()178 p_cur->m_metadata = 0; in erase_if()180 p_cur->m_p_next_sibling = base_type::m_p_root; in erase_if()183 base_type::m_p_root->m_p_prev_or_parent = p_cur; in erase_if()185 base_type::m_p_root = p_cur; in erase_if()189 p_cur = p_next; in erase_if()
88 node_pointer p_cur = m_p_root; in to_linked_list()89 while (p_cur != NULL) in to_linked_list()93 p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling; in to_linked_list()94 p_cur->m_p_next_sibling = p_cur->m_p_l_child; in to_linked_list()98 p_cur = p_cur->m_p_next_sibling; in to_linked_list()119 node_pointer p_cur = m_p_root; in prune() local122 while (p_cur != NULL) in prune()125 if (pred(p_cur->m_value)) in prune()130 p_out = p_cur; in prune()137 m_p_root = p_cur; in prune()[all …]
88 node_pointer p_cur = base_type::m_p_root; in split()92 while (p_cur != NULL) in split()94 node_pointer p_next = p_cur->m_p_next_sibling; in split()96 p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL; in split()98 push_imp(p_cur); in split()100 p_cur = p_next; in split()
229 node_pointer p_cur = base_type::m_p_root; in erase_if() local231 while (p_cur != NULL) in erase_if()233 node_pointer p_next = p_cur->m_p_next_sibling; in erase_if()234 p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL; in erase_if()236 push_imp(p_cur); in erase_if()237 p_cur = p_next; in erase_if()
86 node_pointer p_cur = base_type::m_p_root; in split()92 while (p_cur != NULL) in split()94 node_pointer p_next = p_cur->m_p_next_sibling; in split()96 make_root_and_link(p_cur); in split()98 p_cur = p_next; in split()
271 node_pointer p_cur = base_type::m_p_root; in erase_if() local275 while (p_cur != NULL) in erase_if()277 node_pointer p_next = p_cur->m_p_next_sibling; in erase_if()279 make_root_and_link(p_cur); in erase_if()281 p_cur = p_next; in erase_if()