1 // -*- C++ -*- 2 3 // Copyright (C) 2005, 2006, 2009, 2010 Free Software Foundation, Inc. 4 // 5 // This file is part of the GNU ISO C++ Library. This library is free 6 // software; you can redistribute it and/or modify it under the terms 7 // of the GNU General Public License as published by the Free Software 8 // Foundation; either version 3, or (at your option) any later 9 // version. 10 11 // This library is distributed in the hope that it will be useful, but 12 // WITHOUT ANY WARRANTY; without even the implied warranty of 13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14 // General Public License for more details. 15 16 // Under Section 7 of GPL version 3, you are granted additional 17 // permissions described in the GCC Runtime Library Exception, version 18 // 3.1, as published by the Free Software Foundation. 19 20 // You should have received a copy of the GNU General Public License and 21 // a copy of the GCC Runtime Library Exception along with this program; 22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 23 // <http://www.gnu.org/licenses/>. 24 25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 26 27 // Permission to use, copy, modify, sell, and distribute this software 28 // is hereby granted without fee, provided that the above copyright 29 // notice appears in all copies, and that both that copyright notice 30 // and this permission notice appear in supporting documentation. None 31 // of the above authors, nor IBM Haifa Research Laboratories, make any 32 // representation about the suitability of this software for any 33 // purpose. It is provided "as is" without express or implied 34 // warranty. 35 36 /** 37 * @file split_join_fn_imps.hpp 38 * Contains an implementation class for a base of binomial heaps. 39 */ 40 41 PB_DS_CLASS_T_DEC 42 template<typename Pred> 43 void 44 PB_DS_CLASS_C_DEC:: 45 split(Pred pred, PB_DS_CLASS_C_DEC& other) 46 { 47 _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 48 _GLIBCXX_DEBUG_ONLY(other.assert_valid(true);) 49 50 other.clear(); 51 52 if (base_type::empty()) 53 { 54 _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 55 _GLIBCXX_DEBUG_ONLY(other.assert_valid(true);) 56 57 return; 58 } 59 60 base_type::to_linked_list(); 61 62 node_pointer p_out = base_type::prune(pred); 63 64 while (p_out != 0) 65 { 66 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); 67 --base_type::m_size; 68 69 ++other.m_size; 70 71 node_pointer p_next = p_out->m_p_next_sibling; 72 73 p_out->m_p_l_child = p_out->m_p_prev_or_parent = 0; 74 75 p_out->m_metadata = 0; 76 77 p_out->m_p_next_sibling = other.m_p_root; 78 79 if (other.m_p_root != 0) 80 other.m_p_root->m_p_prev_or_parent = p_out; 81 82 other.m_p_root = p_out; 83 84 other.m_p_root = other.fix(other.m_p_root); 85 86 p_out = p_next; 87 } 88 89 _GLIBCXX_DEBUG_ONLY(other.assert_valid(true);) 90 91 node_pointer p_cur = base_type::m_p_root; 92 93 base_type::m_p_root = 0; 94 95 while (p_cur != 0) 96 { 97 node_pointer p_next = p_cur->m_p_next_sibling; 98 99 p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = 0; 100 101 p_cur->m_metadata = 0; 102 103 p_cur->m_p_next_sibling = base_type::m_p_root; 104 105 if (base_type::m_p_root != 0) 106 base_type::m_p_root->m_p_prev_or_parent = p_cur; 107 108 base_type::m_p_root = p_cur; 109 110 base_type::m_p_root = fix(base_type::m_p_root); 111 112 p_cur = p_next; 113 } 114 115 m_p_max = 0; 116 117 _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 118 _GLIBCXX_DEBUG_ONLY(other.assert_valid(true);) 119 } 120 121 PB_DS_CLASS_T_DEC 122 inline void 123 PB_DS_CLASS_C_DEC:: 124 join(PB_DS_CLASS_C_DEC& other) 125 { 126 _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 127 _GLIBCXX_DEBUG_ONLY(other.assert_valid(true);) 128 129 node_pointer p_other = other.m_p_root; 130 131 if (p_other != 0) 132 do 133 { 134 node_pointer p_next = p_other->m_p_next_sibling; 135 136 std::swap(p_other->m_p_next_sibling, p_other->m_p_prev_or_parent); 137 138 p_other = p_next; 139 } 140 while (p_other != 0); 141 142 base_type::m_p_root = join(base_type::m_p_root, other.m_p_root); 143 base_type::m_size += other.m_size; 144 m_p_max = 0; 145 146 other.m_p_root = 0; 147 other.m_size = 0; 148 other.m_p_max = 0; 149 150 _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 151 _GLIBCXX_DEBUG_ONLY(other.assert_valid(true);) 152 } 153 154 PB_DS_CLASS_T_DEC 155 inline typename PB_DS_CLASS_C_DEC::node_pointer 156 PB_DS_CLASS_C_DEC:: 157 join(node_pointer p_lhs, node_pointer p_rhs) const 158 { 159 node_pointer p_ret = 0; 160 161 node_pointer p_cur = 0; 162 163 while (p_lhs != 0 || p_rhs != 0) 164 { 165 if (p_rhs == 0) 166 { 167 if (p_cur == 0) 168 p_ret = p_cur = p_lhs; 169 else 170 { 171 p_cur->m_p_next_sibling = p_lhs; 172 173 p_lhs->m_p_prev_or_parent = p_cur; 174 } 175 176 p_cur = p_lhs = 0; 177 } 178 else if (p_lhs == 0 || p_rhs->m_metadata < p_lhs->m_metadata) 179 { 180 if (p_cur == 0) 181 { 182 p_ret = p_cur = p_rhs; 183 184 p_rhs = p_rhs->m_p_prev_or_parent; 185 } 186 else 187 { 188 p_cur->m_p_next_sibling = p_rhs; 189 190 p_rhs = p_rhs->m_p_prev_or_parent; 191 192 p_cur->m_p_next_sibling->m_p_prev_or_parent = p_cur; 193 194 p_cur = p_cur->m_p_next_sibling; 195 } 196 } 197 else if (p_lhs->m_metadata < p_rhs->m_metadata) 198 { 199 if (p_cur == 0) 200 p_ret = p_cur = p_lhs; 201 else 202 { 203 p_cur->m_p_next_sibling = p_lhs; 204 205 p_lhs->m_p_prev_or_parent = p_cur; 206 207 p_cur = p_cur->m_p_next_sibling; 208 } 209 210 p_lhs = p_cur->m_p_next_sibling; 211 } 212 else 213 { 214 node_pointer p_next_rhs = p_rhs->m_p_prev_or_parent; 215 216 p_rhs->m_p_next_sibling = p_lhs; 217 218 p_lhs = fix(p_rhs); 219 220 p_rhs = p_next_rhs; 221 } 222 } 223 224 if (p_cur != 0) 225 p_cur->m_p_next_sibling = 0; 226 227 if (p_ret != 0) 228 p_ret->m_p_prev_or_parent = 0; 229 230 return p_ret; 231 } 232 233
