/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | insert_fn_imps.hpp | 54 node_pointer p_nd = m_p_head->m_p_parent; 57 while (p_nd != 0) 58 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), 61 p_pot = p_nd; 63 p_nd = p_nd->m_p_left; 66 p_nd = p_nd->m_p_right; 82 p_nd = p_pot->m_p_left; 83 if (p_nd 97 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd) argument [all...] |
H A D | debug_fn_imps.hpp | 91 assert_node_consistent(const node_pointer p_nd, argument 94 assert_node_consistent_(p_nd, __file, __line); 100 assert_node_consistent_(const node_pointer p_nd, argument 103 if (p_nd == 0) 106 assert_node_consistent_with_left(p_nd, __file, __line); 107 assert_node_consistent_with_right(p_nd, __file, __line); 110 l_range = assert_node_consistent_(p_nd->m_p_left, __file, __line); 114 PB_DS_V2F(p_nd->m_value))); 117 r_range = assert_node_consistent_(p_nd->m_p_right, __file, __line); 120 PB_DS_DEBUG_VERIFY(Cmp_Fn::operator()(PB_DS_V2F(p_nd 130 assert_node_consistent_with_left(const node_pointer p_nd, const char* __file, int __line) const argument 143 assert_node_consistent_with_right(const node_pointer p_nd, const char* __file, int __line) const argument 164 assert_min_imp(const node_pointer p_nd, const char* __file, int __line) const argument 191 assert_max_imp(const node_pointer p_nd, const char* __file, int __line) const argument 263 assert_consistent_with_debug_base(const node_pointer p_nd, const char* __file, int __line) const argument [all...] |
H A D | rotate_fn_imps.hpp | 108 rotate_parent(node_pointer p_nd) argument 110 node_pointer p_parent = p_nd->m_p_parent; 112 if (p_nd == p_parent->m_p_left) 117 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd); 118 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || 119 p_nd->m_p_right == p_parent); 125 apply_update(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/) 132 apply_update(node_pointer p_nd, Node_Update_* /*p_update*/) argument 134 node_update::operator()(node_iterator(p_nd), 142 update_to_top(node_pointer p_nd, Node_Update argument [all...] |
H A D | erase_fn_imps.hpp | 96 clear_imp(node_pointer p_nd) argument 98 if (p_nd == 0) 101 clear_imp(p_nd->m_p_left); 102 clear_imp(p_nd->m_p_right); 103 p_nd->~node(); 104 s_node_allocator.deallocate(p_nd, 1);
|
H A D | r_erase_fn_imps.hpp | 96 clear_imp(node_pointer p_nd) argument 98 if (p_nd == 0) 101 clear_imp(p_nd->m_p_left); 102 clear_imp(p_nd->m_p_right); 103 p_nd->~Node(); 104 s_node_allocator.deallocate(p_nd, 1);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
H A D | erase_fn_imps.hpp | 52 node_pointer p_nd = m_p_max; local 54 base_type::actual_erase_node(p_nd); 103 add_to_aux(node_pointer p_nd) argument 105 size_type r = p_nd->m_metadata; 108 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < rank_bound()); 109 if (Cmp_Fn::operator()(m_a_aux[r]->m_value, p_nd->m_value)) 110 make_child_of(m_a_aux[r], p_nd); 113 make_child_of(p_nd, m_a_aux[r]); 114 p_nd = m_a_aux[r]; 121 _GLIBCXX_DEBUG_ASSERT(p_nd 129 make_child_of(node_pointer p_nd, node_pointer p_new_parent) argument 163 remove_node(node_pointer p_nd) argument 199 node_pointer p_nd = it.m_p_nd; local [all...] |
H A D | constructors_destructor_fn_imps.hpp | 78 for (node_pointer p_nd = base_type::m_p_root; p_nd != 0; 79 p_nd = p_nd->m_p_next_sibling) 80 if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value)) 81 m_p_max = p_nd;
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | insert_fn_imps.hpp | 54 node_pointer p_nd = m_p_head->m_p_parent; 57 while (p_nd != 0) 58 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), 61 p_pot = p_nd; 63 p_nd = p_nd->m_p_left; 66 p_nd = p_nd->m_p_right; 82 p_nd = p_pot->m_p_left; 83 if (p_nd 97 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd) argument [all...] |
H A D | debug_fn_imps.hpp | 91 assert_node_consistent(const node_pointer p_nd, argument 94 assert_node_consistent_(p_nd, __file, __line); 100 assert_node_consistent_(const node_pointer p_nd, argument 103 if (p_nd == 0) 106 assert_node_consistent_with_left(p_nd, __file, __line); 107 assert_node_consistent_with_right(p_nd, __file, __line); 110 l_range = assert_node_consistent_(p_nd->m_p_left, __file, __line); 114 PB_DS_V2F(p_nd->m_value))); 117 r_range = assert_node_consistent_(p_nd->m_p_right, __file, __line); 120 PB_DS_DEBUG_VERIFY(Cmp_Fn::operator()(PB_DS_V2F(p_nd 130 assert_node_consistent_with_left(const node_pointer p_nd, const char* __file, int __line) const argument 143 assert_node_consistent_with_right(const node_pointer p_nd, const char* __file, int __line) const argument 164 assert_min_imp(const node_pointer p_nd, const char* __file, int __line) const argument 191 assert_max_imp(const node_pointer p_nd, const char* __file, int __line) const argument 263 assert_consistent_with_debug_base(const node_pointer p_nd, const char* __file, int __line) const argument [all...] |
H A D | rotate_fn_imps.hpp | 108 rotate_parent(node_pointer p_nd) argument 110 node_pointer p_parent = p_nd->m_p_parent; 112 if (p_nd == p_parent->m_p_left) 117 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd); 118 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || 119 p_nd->m_p_right == p_parent); 125 apply_update(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/) 132 apply_update(node_pointer p_nd, Node_Update_* /*p_update*/) argument 134 node_update::operator()(node_iterator(p_nd), 142 update_to_top(node_pointer p_nd, Node_Update argument [all...] |
H A D | erase_fn_imps.hpp | 96 clear_imp(node_pointer p_nd) argument 98 if (p_nd == 0) 101 clear_imp(p_nd->m_p_left); 102 clear_imp(p_nd->m_p_right); 103 p_nd->~node(); 104 s_node_allocator.deallocate(p_nd, 1);
|
H A D | r_erase_fn_imps.hpp | 96 clear_imp(node_pointer p_nd) argument 98 if (p_nd == 0) 101 clear_imp(p_nd->m_p_left); 102 clear_imp(p_nd->m_p_right); 103 p_nd->~Node(); 104 s_node_allocator.deallocate(p_nd, 1);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
H A D | erase_fn_imps.hpp | 52 node_pointer p_nd = m_p_max; local 54 base_type::actual_erase_node(p_nd); 103 add_to_aux(node_pointer p_nd) argument 105 size_type r = p_nd->m_metadata; 108 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < rank_bound()); 109 if (Cmp_Fn::operator()(m_a_aux[r]->m_value, p_nd->m_value)) 110 make_child_of(m_a_aux[r], p_nd); 113 make_child_of(p_nd, m_a_aux[r]); 114 p_nd = m_a_aux[r]; 121 _GLIBCXX_DEBUG_ASSERT(p_nd 129 make_child_of(node_pointer p_nd, node_pointer p_new_parent) argument 163 remove_node(node_pointer p_nd) argument 199 node_pointer p_nd = it.m_p_nd; local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
H A D | rotate_fn_imps.hpp | 104 rotate_parent(node_pointer p_nd) argument 106 node_pointer p_parent = p_nd->m_p_parent; 107 if (p_nd == p_parent->m_p_left) 111 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd); 112 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || p_nd->m_p_right == p_parent); 118 apply_update(node_pointer /*p_nd*/, __gnu_pbds::null_node_update* /*p_update*/) 125 apply_update(node_pointer p_nd, Node_Update_* p_update) argument 127 p_update->operator()(& PB_DS_V2F(p_nd->m_value),(p_nd 138 update_to_top(node_pointer p_nd, Node_Update_* p_update) argument [all...] |
H A D | erase_fn_imps.hpp | 48 node_pointer p_nd = find_imp(r_key); local 49 if (p_nd == 0 || p_nd->m_type == i_node) 55 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); 56 if (!synth_access_traits::equal_keys(PB_DS_V2F(reinterpret_cast<leaf_pointer>(p_nd)->value()), r_key)) 63 erase_leaf(static_cast<leaf_pointer>(p_nd)); 71 erase_fixup(inode_pointer p_nd) argument 73 _GLIBCXX_DEBUG_ASSERT(std::distance(p_nd->begin(), p_nd->end()) >= 1); 74 if (std::distance(p_nd 145 clear_imp(node_pointer p_nd) argument [all...] |
H A D | debug_fn_imps.hpp | 92 node_const_pointer p_nd = local 94 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd); 102 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line) argument 104 if (p_nd == 0) 106 if (p_nd->m_type == leaf_node) 108 PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node); 110 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin(); 111 it != static_cast<inode_const_pointer>(p_nd)->end();
|
H A D | r_erase_fn_imps.hpp | 96 clear_imp(node_pointer p_nd) argument 98 if (p_nd == 0) 100 clear_imp(p_nd->m_p_left); 101 clear_imp(p_nd->m_p_right); 102 p_nd->~Node(); 103 s_node_allocator.deallocate(p_nd, 1);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
H A D | rotate_fn_imps.hpp | 104 rotate_parent(node_pointer p_nd) argument 106 node_pointer p_parent = p_nd->m_p_parent; 107 if (p_nd == p_parent->m_p_left) 111 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd); 112 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || p_nd->m_p_right == p_parent); 118 apply_update(node_pointer /*p_nd*/, __gnu_pbds::null_node_update* /*p_update*/) 125 apply_update(node_pointer p_nd, Node_Update_* p_update) argument 127 p_update->operator()(& PB_DS_V2F(p_nd->m_value),(p_nd 138 update_to_top(node_pointer p_nd, Node_Update_* p_update) argument [all...] |
H A D | erase_fn_imps.hpp | 48 node_pointer p_nd = find_imp(r_key); local 49 if (p_nd == 0 || p_nd->m_type == i_node) 55 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); 56 if (!synth_access_traits::equal_keys(PB_DS_V2F(reinterpret_cast<leaf_pointer>(p_nd)->value()), r_key)) 63 erase_leaf(static_cast<leaf_pointer>(p_nd)); 71 erase_fixup(inode_pointer p_nd) argument 73 _GLIBCXX_DEBUG_ASSERT(std::distance(p_nd->begin(), p_nd->end()) >= 1); 74 if (std::distance(p_nd 145 clear_imp(node_pointer p_nd) argument [all...] |
H A D | debug_fn_imps.hpp | 92 node_const_pointer p_nd = local 94 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd); 102 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line) argument 104 if (p_nd == 0) 106 if (p_nd->m_type == leaf_node) 108 PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node); 110 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin(); 111 it != static_cast<inode_const_pointer>(p_nd)->end();
|
H A D | r_erase_fn_imps.hpp | 96 clear_imp(node_pointer p_nd) argument 98 if (p_nd == 0) 100 clear_imp(p_nd->m_p_left); 101 clear_imp(p_nd->m_p_right); 102 p_nd->~Node(); 103 s_node_allocator.deallocate(p_nd, 1);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | erase_fn_imps.hpp | 55 node_pointer p_nd = m_p_max; local 57 base_type::actual_erase_node(p_nd); 65 remove_parentless_node(node_pointer p_nd) argument 67 _GLIBCXX_DEBUG_ASSERT(p_nd != 0); 68 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == 0); 70 node_pointer p_cur_root = p_nd == base_type::m_p_root? 71 p_nd->m_p_next_sibling : base_type::m_p_root; 76 if (p_nd->m_p_prev_or_parent != 0) 77 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/ |
H A D | erase_fn_imps.hpp | 111 erase_node(node_pointer p_nd) argument 113 _GLIBCXX_DEBUG_ASSERT(p_nd != 0); 114 splay(p_nd); 117 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); 119 node_pointer p_l = p_nd->m_p_left; 120 node_pointer p_r = p_nd->m_p_right; 122 base_type::update_min_max_for_erased_node(p_nd); 123 base_type::actual_erase_node(p_nd); 153 leftmost(node_pointer p_nd) argument 155 _GLIBCXX_DEBUG_ASSERT(p_nd ! [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/ |
H A D | erase_fn_imps.hpp | 111 erase_node(node_pointer p_nd) argument 113 _GLIBCXX_DEBUG_ASSERT(p_nd != 0); 114 splay(p_nd); 117 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); 119 node_pointer p_l = p_nd->m_p_left; 120 node_pointer p_r = p_nd->m_p_right; 122 base_type::update_min_max_for_erased_node(p_nd); 123 base_type::actual_erase_node(p_nd); 153 leftmost(node_pointer p_nd) argument 155 _GLIBCXX_DEBUG_ASSERT(p_nd ! [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | erase_fn_imps.hpp | 55 node_pointer p_nd = m_p_max; local 57 base_type::actual_erase_node(p_nd); 65 remove_parentless_node(node_pointer p_nd) argument 67 _GLIBCXX_DEBUG_ASSERT(p_nd != 0); 68 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == 0); 70 node_pointer p_cur_root = p_nd == base_type::m_p_root? 71 p_nd->m_p_next_sibling : base_type::m_p_root; 76 if (p_nd->m_p_prev_or_parent != 0) 77 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd [all...] |