/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | debug_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_root == NULL 55 || base_type::m_p_root->m_p_next_sibling == NULL);
|
H A D | split_join_fn_imps.hpp | 88 node_pointer p_cur = base_type::m_p_root; 90 base_type::m_p_root = NULL; member in class:base_type 115 if (other.m_p_root == NULL) 123 if (base_type::m_p_root == NULL) 124 base_type::m_p_root = other.m_p_root; member in class:base_type 125 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value)) 127 base_type::make_child_of(base_type::m_p_root, other.m_p_root); 130 base_type::m_p_root = other.m_p_root; member in class:base_type [all...] |
H A D | find_fn_imps.hpp | 55 return base_type::m_p_root->m_value;
|
H A D | insert_fn_imps.hpp | 70 if (base_type::m_p_root == NULL) 74 base_type::m_p_root = p_nd; member in class:base_type 76 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 80 base_type::make_child_of(base_type::m_p_root, p_nd); 83 base_type::m_p_root = p_nd; member in class:base_type 87 base_type::make_child_of(p_nd, base_type::m_p_root); 88 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false));
|
H A D | erase_fn_imps.hpp | 55 node_pointer p_new_root = join_node_children(base_type::m_p_root); 60 base_type::actual_erase_node(base_type::m_p_root); 61 base_type::m_p_root = p_new_root; member in class:base_type 91 if (p_nd == base_type::m_p_root) 95 base_type::m_p_root = p_new_child; member in class:base_type 96 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false);) 229 node_pointer p_cur = base_type::m_p_root; 230 base_type::m_p_root = NULL; member in class:base_type
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | erase_fn_imps.hpp | 52 clear_imp(m_p_root); 54 m_p_root = NULL; 88 node_pointer p_cur = m_p_root; 101 const_node_pointer p_counter = m_p_root; 119 node_pointer p_cur = m_p_root; 120 m_p_root = NULL; 134 p_cur->m_p_next_sibling = m_p_root; 135 if (m_p_root != NULL) 136 m_p_root->m_p_prev_or_parent = p_cur; 137 m_p_root [all...] |
H A D | constructors_destructor_fn_imps.hpp | 58 m_p_root(NULL), 68 m_p_root(NULL), 77 : Cmp_Fn(other), m_p_root(NULL), m_size(0) 81 m_p_root = recursive_copy_node(other.m_p_root); 104 std::swap(m_p_root, other.m_p_root);
|
H A D | iterators_fn_imps.hpp | 52 node_pointer p_nd = m_p_root; 68 node_pointer p_nd = m_p_root;
|
H A D | debug_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ASSERT(m_p_root == NULL || m_p_root->m_p_prev_or_parent == NULL); 56 if (m_p_root != NULL) 57 assert_node_consistent(m_p_root, Single_Link_Roots); 107 if (size_from_node(m_p_root) == m_size)
|
H A D | trace_fn_imps.hpp | 56 trace_node(m_p_root, 0);
|
H A D | insert_fn_imps.hpp | 130 if (p_parent == m_p_root) 131 m_p_root = p_nd;
|
H A D | left_child_next_sibling_heap_.hpp | 300 node_pointer m_p_root; member in class:pb_ds::detail::left_child_next_sibling_heap_
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 70 if (base_type::m_p_root == NULL) 77 base_type::m_p_root = p_nd; member in class:base_type 82 if (base_type::m_p_root->m_metadata > 0) 86 p_nd->m_p_next_sibling = base_type::m_p_root; 88 base_type::m_p_root->m_p_prev_or_parent = p_nd; 90 base_type::m_p_root = p_nd; member in class:base_type 97 if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 99 p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling; 105 p_nd->m_p_l_child = base_type::m_p_root; 107 base_type::m_p_root 111 base_type::m_p_root = p_nd; member in class:base_type 129 base_type::m_p_root = fix(base_type::m_p_root); member in class:base_type 203 base_type::m_p_root = p_nd; member in class:base_type [all...] |
H A D | split_join_fn_imps.hpp | 83 p_out->m_p_next_sibling = other.m_p_root; 85 if (other.m_p_root != NULL) 86 other.m_p_root->m_p_prev_or_parent = p_out; 88 other.m_p_root = p_out; 90 other.m_p_root = other.fix(other.m_p_root); 97 node_pointer p_cur = base_type::m_p_root; 99 base_type::m_p_root = NULL; member in class:base_type 109 p_cur->m_p_next_sibling = base_type::m_p_root; 111 if (base_type::m_p_root ! 114 base_type::m_p_root = p_cur; member in class:base_type 116 base_type::m_p_root = fix(base_type::m_p_root); member in class:base_type 148 base_type::m_p_root = join(base_type::m_p_root, other.m_p_root); member in class:base_type [all...] |
H A D | erase_fn_imps.hpp | 79 node_pointer p_cur_root = p_nd == base_type::m_p_root? 81 base_type::m_p_root; 104 base_type::m_p_root = join(p_cur_root, p_child); member in class:base_type 168 node_pointer p_cur = base_type::m_p_root; 170 base_type::m_p_root = NULL; member in class:base_type 180 p_cur->m_p_next_sibling = base_type::m_p_root; 182 if (base_type::m_p_root != NULL) 183 base_type::m_p_root->m_p_prev_or_parent = p_cur; 185 base_type::m_p_root = p_cur; member in class:base_type 187 base_type::m_p_root member in class:base_type [all...] |
H A D | find_fn_imps.hpp | 67 node_pointer p_cur = base_type::m_p_root;
|
H A D | debug_fn_imps.hpp | 55 assert_node_consistent(base_type::m_p_root, strictly_binomial, true);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | split_join_fn_imps.hpp | 86 node_pointer p_cur = base_type::m_p_root; 90 base_type::m_p_root = NULL; member in class:base_type 113 node_pointer p_other = other.m_p_root; 126 other.m_p_root = NULL;
|
H A D | insert_fn_imps.hpp | 60 if (base_type::m_p_root == NULL) 64 m_p_max = base_type::m_p_root = p_nd; 71 p_nd->m_p_next_sibling = base_type::m_p_root; 73 base_type::m_p_root->m_p_prev_or_parent = NULL; 75 base_type::m_p_root = p_nd; member in class:base_type 104 p_nd->m_p_next_sibling = base_type::m_p_root; 106 if (base_type::m_p_root != NULL) 107 base_type::m_p_root->m_p_prev_or_parent = NULL; 109 base_type::m_p_root = p_nd; member in class:base_type
|
H A D | constructors_destructor_fn_imps.hpp | 83 m_p_max = base_type::m_p_root; 84 for (node_pointer p_nd = base_type::m_p_root; p_nd != NULL; p_nd = p_nd->m_p_next_sibling)
|
H A D | erase_fn_imps.hpp | 81 node_pointer p_add = base_type::m_p_root; 168 base_type::m_p_root = m_p_max = NULL; member in class:base_type 202 node_pointer p_fix = base_type::m_p_root; 271 node_pointer p_cur = base_type::m_p_root; 273 m_p_max = base_type::m_p_root = NULL;
|
H A D | debug_fn_imps.hpp | 55 assert_node_consistent(base_type::m_p_root, true);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | insert_fn_imps.hpp | 66 p_nd->m_p_next_sibling = base_type::m_p_root; 68 if (base_type::m_p_root != NULL) 69 base_type::m_p_root->m_p_prev_or_parent = p_nd; 71 base_type::m_p_root = p_nd; member in class:base_type 112 base_type::m_p_root = p_next; member in class:base_type
|
H A D | debug_fn_imps.hpp | 66 _GLIBCXX_DEBUG_ASSERT(next_2_pointer(base_type::m_p_root) == NULL); 70 const_node_pointer p_nd = next_2_pointer(base_type::m_p_root);
|
H A D | erase_fn_imps.hpp | 72 node_pointer p_nd = base_type::m_p_root;
|