/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | erase_fn_imps.hpp | 60 node_pointer p_nd = m_p_max; 74 remove_parentless_node(node_pointer p_nd) 79 node_pointer p_cur_root = p_nd == base_type::m_p_root? 92 node_pointer p_child = p_nd->m_p_l_child; 153 node_pointer p_out = base_type::prune(pred); 161 node_pointer p_next = p_out->m_p_next_sibling; 168 node_pointer p_cur = base_type::m_p_root; 174 node_pointer p_next = p_cur->m_p_next_sibling;
|
H A D | binomial_heap_base_.hpp | 97 typedef typename base_type::node_pointer node_pointer; typedef in class:pb_ds::detail::binomial_heap_base_ 204 inline node_pointer 205 fix(node_pointer p_nd) const; 208 insert_node(node_pointer p_nd); 211 remove_parentless_node(node_pointer p_nd); 213 inline node_pointer 214 join(node_pointer p_lhs, node_pointer p_rhs) const; 222 node_pointer m_p_ma [all...] |
H A D | find_fn_imps.hpp | 67 node_pointer p_cur = base_type::m_p_root;
|
H A D | insert_fn_imps.hpp | 54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 68 insert_node(node_pointer p_nd) 133 inline typename PB_DS_CLASS_C_DEC::node_pointer 135 fix(node_pointer p_nd) const 140 node_pointer p_next = p_nd->m_p_next_sibling; 181 node_pointer p_nd = it.m_p_nd; 192 node_pointer p_parent = base_type::parent(p_nd);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
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 | left_child_next_sibling_heap_.hpp | 133 typedef typename node_allocator::pointer node_pointer; typedef in class:pb_ds::detail::left_child_next_sibling_heap_ 139 typedef std::pair< node_pointer, node_pointer> node_pointer_pair; 249 inline node_pointer 253 make_child_of(node_pointer p_nd, node_pointer p_new_parent); 258 inline static node_pointer 259 parent(node_pointer p_nd); 262 swap_with_parent(node_pointer p_nd, node_pointer p_paren [all...] |
H A D | const_iterator.hpp | 71 typedef typename PB_DS_BASE_C_DEC::node_pointer node_pointer; typedef in class:pb_ds::detail::left_child_next_sibling_heap_const_iterator_ 101 left_child_next_sibling_heap_const_iterator_(node_pointer p_nd) : base_type(p_nd) 154 node_pointer p_next = base_type::m_p_nd;
|
H A D | const_point_iterator.hpp | 71 typedef typename Allocator::template rebind<Node>::other::pointer node_pointer; typedef in class:pb_ds::detail::left_child_next_sibling_heap_node_const_point_iterator_ 111 left_child_next_sibling_heap_node_const_point_iterator_(node_pointer p_nd) : m_p_nd(p_nd) 151 node_pointer m_p_nd;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | child_iterator.hpp | 52 typedef node_pointer value_type; 92 node_pointer
|
H A D | point_iterators.hpp | 113 node_pointer; typedef in class:pb_ds::detail::pat_trie_const_it_ 154 pat_trie_const_it_(node_pointer p_nd = NULL) : m_p_nd(p_nd) 252 node_pointer p_y = m_p_nd->m_p_parent; 281 node_pointer p_y = m_p_nd->m_p_parent; 297 inline static node_pointer 298 get_larger_sibling(node_pointer p_nd) 312 inline static node_pointer 313 get_smaller_sibling(node_pointer p_nd) 337 leftmost_descendant(node_pointer p_nd) 345 rightmost_descendant(node_pointer p_n 372 node_pointer; typedef in class:pb_ds::detail::pat_trie_it_ [all...] |
H A D | insert_join_fn_imps.hpp | 201 typename PB_DS_CLASS_C_DEC::node_pointer 203 rec_join(node_pointer p_l, node_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag) 216 node_pointer p_ret = rec_join(static_cast<leaf_pointer>(p_l), 223 node_pointer p_ret = rec_join(static_cast<leaf_pointer>(p_l), 233 node_pointer p_ret = rec_join(static_cast<internal_node_pointer>(p_l), 241 node_pointer p_ret = rec_join(static_cast<internal_node_pointer>(p_l), 250 typename PB_DS_CLASS_C_DEC::node_pointer 257 node_pointer p_ret = insert_branch(p_l, p_r, r_bag); 263 typename PB_DS_CLASS_C_DEC::node_pointer [all...] |
H A D | head.hpp | 84 node_pointer; typedef in struct:pb_ds::detail::pat_trie_head 101 node_pointer m_p_min; 103 node_pointer m_p_max;
|
H A D | r_erase_fn_imps.hpp | 50 actual_erase_node(node_pointer p_z) 62 update_min_max_for_erased_node(node_pointer p_z) 100 clear_imp(node_pointer p_nd)
|
H A D | pat_trie_.hpp | 143 typedef typename Allocator::template rebind<node>::other::pointer node_pointer; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME 349 node_pointer 358 apply_update(node_pointer, null_node_update_pointer); 362 apply_update(node_pointer, Node_Update_*); 387 node_pointer 388 rec_join(node_pointer, node_pointer, size_type, split_join_branch_bag&); 390 node_pointer 393 node_pointer 397 node_pointer [all...] |
H A D | internal_node.hpp | 90 typedef typename base_rebind::pointer node_pointer; typedef in struct:pb_ds::detail::pat_trie_internal_node 114 typedef typename Allocator::template rebind<node_pointer>::other node_pointer_rebind; 144 inline node_pointer 156 inline node_pointer 160 inline node_pointer 161 add_child(node_pointer, const_e_iterator, const_e_iterator, 167 inline node_pointer 168 get_join_child(node_pointer, const_e_access_traits_pointer); 171 remove_child(node_pointer p_nd); 177 replace_child(node_pointer, const_e_iterato [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | erase_fn_imps.hpp | 55 node_pointer p_new_root = join_node_children(base_type::m_p_root); 80 remove_node(node_pointer p_nd) 84 node_pointer p_new_child = join_node_children(p_nd); 139 typename PB_DS_CLASS_C_DEC::node_pointer 141 join_node_children(node_pointer p_nd) 144 node_pointer p_ret = p_nd->m_p_l_child; 156 typename PB_DS_CLASS_C_DEC::node_pointer 158 forward_join(node_pointer p_nd, node_pointer p_next) 185 typename PB_DS_CLASS_C_DEC::node_pointer [all...] |
H A D | split_join_fn_imps.hpp | 68 node_pointer p_out = base_type::prune(pred); 77 node_pointer p_next = p_out->m_p_next_sibling; 88 node_pointer p_cur = base_type::m_p_root; 94 node_pointer p_next = p_cur->m_p_next_sibling;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | insert_fn_imps.hpp | 54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 87 make_root(node_pointer p_nd) 98 make_root_and_link(node_pointer p_nd) 117 fix(node_pointer p_y) 159 node_pointer p_z = p_y->m_p_prev_or_parent; 173 fix_root(node_pointer p_y) 185 fix_sibling_rank_1_unmarked(node_pointer p_y) 189 _GLIBCXX_DEBUG_ONLY(node_pointer p_w = p_y->m_p_l_child;) 206 fix_sibling_rank_1_marked(node_pointer p_y) 219 fix_sibling_general_unmarked(node_pointer p_ [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | insert_fn_imps.hpp | 59 node_pointer p_nd = m_p_head->m_p_parent; 60 node_pointer p_pot = m_p_head; 111 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd) 113 node_pointer p_new_nd = 160 node_pointer p_new_node = 179 inline typename PB_DS_CLASS_C_DEC::node_pointer 183 node_pointer p_new_nd = s_node_allocator.allocate(1); 201 inline typename PB_DS_CLASS_C_DEC::node_pointer 205 node_pointer p_new_nd = s_node_allocator.allocate(1);
|
H A D | erase_fn_imps.hpp | 50 actual_erase_node(node_pointer p_z) 65 update_min_max_for_erased_node(node_pointer p_z) 113 clear_imp(node_pointer p_nd)
|
H A D | r_erase_fn_imps.hpp | 50 actual_erase_node(node_pointer p_z) 65 update_min_max_for_erased_node(node_pointer p_z) 113 clear_imp(node_pointer p_nd)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | insert_fn_imps.hpp | 58 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 98 inline typename PB_DS_CLASS_C_DEC::node_pointer 100 link_with_next_sibling(node_pointer p_nd) 102 node_pointer p_next = p_nd->m_p_next_sibling; 149 node_pointer p_nd = m_rc.top(); 156 node_pointer p_res = link_with_next_sibling(p_nd);
|
H A D | rc.hpp | 74 node_pointer; typedef in class:pb_ds::detail::rc 78 node_pointer>::other::pointer 83 node_pointer>::other::const_pointer 92 typedef node_pointer entry; 107 inline node_pointer 139 node_pointer m_a_entries[max_entries]; 195 inline typename PB_DS_CLASS_C_DEC::node_pointer
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | erase_fn_imps.hpp | 115 erase_node(node_pointer p_nd) 123 node_pointer p_l = p_nd->m_p_left; 124 node_pointer p_r = p_nd->m_p_right; 137 node_pointer p_target_r = leftmost(p_r); 155 inline typename PB_DS_CLASS_C_DEC::node_pointer 157 leftmost(node_pointer p_nd)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | debug_fn_imps.hpp | 52 assert_node_consistent(const node_pointer p_nd) const 74 const node_pointer p_head = base_type::m_p_head;
|