Searched refs:p_parent (Results 1 - 10 of 10) sorted by relevance
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/ |
H A D | splay_fn_imps.hpp | 64 const node_pointer p_parent = p_nd->m_p_parent; local 65 const node_pointer p_grandparent = p_parent->m_p_parent; 73 if (p_parent->m_p_left == p_nd && 74 p_grandparent->m_p_right == p_parent) 75 splay_zig_zag_left(p_nd, p_parent, p_grandparent); 76 else if (p_parent->m_p_right == p_nd && 77 p_grandparent->m_p_left == p_parent) 78 splay_zig_zag_right(p_nd, p_parent, p_grandparent); 79 else if (p_parent->m_p_left == p_nd && 80 p_grandparent->m_p_left == p_parent) 94 splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 130 splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 166 splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 202 splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 237 splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 271 splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | insert_fn_imps.hpp | 122 swap_with_parent(node_pointer p_nd, node_pointer p_parent) argument 124 if (p_parent == m_p_root) 128 _GLIBCXX_DEBUG_ASSERT(p_parent != 0); 129 _GLIBCXX_DEBUG_ASSERT(parent(p_nd) == p_parent); 131 const bool nd_direct_child = p_parent->m_p_l_child == p_nd; 132 const bool parent_root = p_parent->m_p_prev_or_parent == 0; 134 !parent_root&& p_parent->m_p_prev_or_parent->m_p_l_child == p_parent; 136 std::swap(p_parent->m_p_prev_or_parent, p_nd->m_p_prev_or_parent); 137 std::swap(p_parent [all...] |
H A D | erase_fn_imps.hpp | 143 node_pointer p_parent = parent(p_nd); local 144 while (p_parent != 0) 146 swap_with_parent(p_nd, p_parent); 147 p_parent = parent(p_nd);
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | rotate_fn_imps.hpp | 108 node_pointer p_parent = p_nd->m_p_parent; local 110 if (p_nd == p_parent->m_p_left) 111 rotate_right(p_parent); 113 rotate_left(p_parent); 115 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd); 116 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || 117 p_nd->m_p_right == p_parent);
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
H A D | rotate_fn_imps.hpp | 104 node_pointer p_parent = p_nd->m_p_parent; local 105 if (p_nd == p_parent->m_p_left) 106 rotate_right(p_parent); 108 rotate_left(p_parent); 109 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd); 110 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || p_nd->m_p_right == p_parent);
|
H A D | erase_fn_imps.hpp | 74 node_pointer p_parent = p_nd->m_p_parent; local 75 if (p_parent == m_p_head) 79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); 83 inode_ptr p_internal = static_cast<inode_ptr>(p_parent); 91 if (p_parent == m_p_head) 94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); 95 p_nd = static_cast<inode_pointer>(p_parent); 282 inode_pointer p_parent = static_cast<inode_pointer>(p_l->m_p_parent); local 284 p_parent->remove_child(p_l); 285 erase_fixup(p_parent); [all...] |
H A D | pat_trie_base.hpp | 658 inode_pointer p_parent = static_cast<inode_pointer>(p_nd->m_p_parent); local 660 inode_iterator it = p_parent->begin(); 666 return (next_it == p_parent->end())? 0 : *next_it; 672 inode_pointer p_parent = static_cast<inode_pointer>(p_nd->m_p_parent); local 674 inode_iterator it = p_parent->begin();
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | split_join_fn_imps.hpp | 96 node_pointer p_parent = join_pos.second; local 97 if (p_parent == base_type::m_p_head) 104 p_x->m_p_parent = p_parent; 275 node_pointer p_parent = p_nd->m_p_parent; local 276 if (p_parent == base_type::m_p_head) 287 if (p_parent->m_p_left == p_nd) 288 p_parent->m_p_left = p_l; 290 p_parent->m_p_right = p_l; 293 p_l->m_p_parent = p_parent; 295 this->update_to_top(p_parent, (node_updat [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 157 node_pointer p_parent = base_type::parent(p_nd); local 158 while (p_parent != 0 && 159 Cmp_Fn::operator()(p_parent->m_value, p_nd->m_value)) 161 base_type::swap_with_parent(p_nd, p_parent); 162 p_parent = base_type::parent(p_nd);
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
H A D | erase_fn_imps.hpp | 163 node_pointer p_parent = p_nd; local 164 while (base_type::parent(p_parent) != 0) 165 p_parent = base_type::parent(p_parent); 171 while (p_fix != 0&& p_fix->m_p_next_sibling != p_parent)
|
Completed in 172 milliseconds