/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | node_iterators.hpp | 94 node_pointer; typedef in class:pb_ds::detail::pat_trie_const_node_it_ 189 pat_trie_const_node_it_(node_pointer p_nd = NULL, 191 : m_p_nd(const_cast<node_pointer>(p_nd)), m_p_traits(p_traits) 251 node_pointer m_p_nd; 273 node_pointer; typedef in class:pb_ds::detail::pat_trie_node_it_ 308 pat_trie_node_it_(node_pointer p_nd = NULL, const_e_access_traits_pointer p_traits = NULL) : base_type(p_nd, p_traits)
|
H A D | find_fn_imps.hpp | 53 node_pointer p_nd = find_imp(r_key); 89 return const_iterator(const_cast<node_pointer>(p_nd)); 97 inline typename PB_DS_CLASS_C_DEC::node_pointer 109 node_pointer p_nd = m_p_head->m_p_parent; 115 node_pointer p_next_nd = static_cast<internal_node_pointer>(p_nd)->get_child_node(b_it, e_it, this); 125 inline typename PB_DS_CLASS_C_DEC::node_pointer 132 node_pointer p_nd = m_p_head->m_p_parent; 249 leftmost_descendant(node_pointer p_nd) 269 rightmost_descendant(node_pointer p_nd)
|
H A D | node_base.hpp | 85 node_pointer; typedef in struct:pb_ds::detail::pat_trie_node_base 110 node_pointer m_p_parent;
|
H A D | const_child_iterator.hpp | 54 typedef node_pointer value_type;
|
H A D | erase_fn_imps.hpp | 52 node_pointer p_nd = find_imp(r_key); 80 node_pointer p_parent = p_nd->m_p_parent; 86 node_pointer p_new_child =* p_nd->begin(); 151 clear_imp(node_pointer p_nd) 161 node_pointer p_child =* it;
|
H A D | split_fn_imps.hpp | 123 node_pointer p_nd = it.m_p_nd; 137 typename PB_DS_CLASS_C_DEC::node_pointer 139 rec_split(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag) 150 node_pointer p_child_ret = rec_split(p_internal_nd->get_child_node(b_it, e_it, this), b_it, e_it, other, r_bag); 198 node_pointer p_ret =* p_internal_nd->begin();
|
H A D | constructors_destructor_fn_imps.hpp | 169 typename PB_DS_CLASS_C_DEC::node_pointer 187 node_pointer a_p_children[internal_node::arr_size];
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | insert_fn_imps.hpp | 68 insert_fixup(node_pointer p_nd) 75 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right; 97 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left;
|
H A D | erase_fn_imps.hpp | 118 erase_node(node_pointer p_nd) 128 remove_node(node_pointer p_z) 131 node_pointer p_y = p_z; 132 node_pointer p_x = NULL; 133 node_pointer p_new_x_parent = NULL; 205 remove_fixup(node_pointer p_x, node_pointer p_new_x_parent) 212 node_pointer p_w = p_new_x_parent->m_p_right; 253 node_pointer p_w = p_new_x_parent->m_p_left;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | split_join_fn_imps.hpp | 61 node_pointer p_target_r = other.leftmost(other.m_p_head); 98 node_pointer p_upper_bound = upper_bound(r_key).m_p_nd; 104 node_pointer p_new_root = p_upper_bound->m_p_left;
|
H A D | insert_fn_imps.hpp | 70 node_pointer p_nd = base_type::m_p_head->m_p_parent; 71 node_pointer p_pot = base_type::m_p_head;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | rc_binomial_heap_.hpp | 83 typedef typename base_type::node_pointer node_pointer; typedef in class:pb_ds::detail::rc_binomial_heap_ 168 inline node_pointer 169 link_with_next_sibling(node_pointer p_nd);
|
H A D | debug_fn_imps.hpp | 97 node_pointer p_next = p_nd->m_p_next_sibling; 116 node_pointer p_next = p_nd->m_p_next_sibling;
|
H A D | erase_fn_imps.hpp | 72 node_pointer p_nd = base_type::m_p_root; 75 node_pointer p_next = p_nd->m_p_next_sibling;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_/ |
H A D | binomial_heap_.hpp | 80 typedef typename base_type::node_pointer node_pointer; typedef in class:pb_ds::detail::binomial_heap_
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | insert_fn_imps.hpp | 54 node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val); 66 push_imp(node_pointer p_nd)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | constructors_destructor_fn_imps.hpp | 84 for (node_pointer p_nd = base_type::m_p_root; p_nd != NULL; p_nd = p_nd->m_p_next_sibling) 111 { std::fill(m_a_aux, m_a_aux + max_rank, static_cast<node_pointer>(NULL)); }
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | constructors_destructor_fn_imps.hpp | 158 typename PB_DS_CLASS_C_DEC::node_pointer 160 recursive_copy_node(const node_pointer p_nd) 165 node_pointer p_ret = s_node_allocator.allocate(1); 211 node_pointer p_min = m_p_head->m_p_parent; 218 node_pointer p_max = m_p_head->m_p_parent;
|
H A D | debug_fn_imps.hpp | 95 assert_node_consistent(const node_pointer p_nd) const 103 assert_node_consistent_(const node_pointer p_nd) const 131 assert_node_consistent_with_left(const node_pointer p_nd) const 143 assert_node_consistent_with_right(const node_pointer p_nd) const 163 assert_min_imp(const node_pointer p_nd) const 190 assert_max_imp(const node_pointer p_nd) const 261 assert_consistent_with_debug_base(const node_pointer p_nd) const
|
H A D | split_join_fn_imps.hpp | 146 recursive_count(node_pointer p) const
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | ilist_iterator.h | 28 using node_pointer = ilist_node_impl<OptionsT> *; 35 using node_pointer = const ilist_node_impl<OptionsT> *; 75 using node_pointer = typename Traits::node_pointer; 78 node_pointer NodePtr = nullptr; 173 node_pointer getNodePtr() const { return static_cast<node_pointer>(NodePtr); }
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | constructors_destructor_fn_imps.hpp | 116 typename PB_DS_CLASS_C_DEC::node_pointer 123 node_pointer p_ret = s_node_allocator.allocate(1);
|