1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010 4// Free Software Foundation, Inc. 5// 6// This file is part of the GNU ISO C++ Library. This library is free 7// software; you can redistribute it and/or modify it under the terms 8// of the GNU General Public License as published by the Free Software 9// Foundation; either version 3, or (at your option) any later 10// version. 11 12// This library is distributed in the hope that it will be useful, but 13// WITHOUT ANY WARRANTY; without even the implied warranty of 14// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 15// General Public License for more details. 16 17// Under Section 7 of GPL version 3, you are granted additional 18// permissions described in the GCC Runtime Library Exception, version 19// 3.1, as published by the Free Software Foundation. 20 21// You should have received a copy of the GNU General Public License and 22// a copy of the GCC Runtime Library Exception along with this program; 23// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 24// <http://www.gnu.org/licenses/>. 25 26// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 27 28// Permission to use, copy, modify, sell, and distribute this software 29// is hereby granted without fee, provided that the above copyright 30// notice appears in all copies, and that both that copyright notice 31// and this permission notice appear in supporting documentation. None 32// of the above authors, nor IBM Haifa Research Laboratories, make any 33// representation about the suitability of this software for any 34// purpose. It is provided "as is" without express or implied 35// warranty. 36 37/** 38 * @file constructors_destructor_fn_imps.hpp 39 * Contains an implementation class for left_child_next_sibling_heap_. 40 */ 41 42PB_DS_CLASS_T_DEC 43typename PB_DS_CLASS_C_DEC::node_allocator 44PB_DS_CLASS_C_DEC::s_node_allocator; 45 46PB_DS_CLASS_T_DEC 47typename PB_DS_CLASS_C_DEC::no_throw_copies_t 48PB_DS_CLASS_C_DEC::s_no_throw_copies_ind; 49 50PB_DS_CLASS_T_DEC 51PB_DS_CLASS_C_DEC:: 52left_child_next_sibling_heap_() : 53 m_p_root(0), 54 m_size(0) 55{ 56 _GLIBCXX_DEBUG_ONLY(assert_valid();) 57} 58 59PB_DS_CLASS_T_DEC 60PB_DS_CLASS_C_DEC:: 61left_child_next_sibling_heap_(const Cmp_Fn& r_cmp_fn) : 62 Cmp_Fn(r_cmp_fn), 63 m_p_root(0), 64 m_size(0) 65{ 66 _GLIBCXX_DEBUG_ONLY(assert_valid();) 67} 68 69PB_DS_CLASS_T_DEC 70PB_DS_CLASS_C_DEC:: 71left_child_next_sibling_heap_(const PB_DS_CLASS_C_DEC& other) 72: Cmp_Fn(other), m_p_root(0), m_size(0) 73{ 74 m_size = other.m_size; 75 _GLIBCXX_DEBUG_ONLY(other.assert_valid();) 76 m_p_root = recursive_copy_node(other.m_p_root); 77 m_size = other.m_size; 78 _GLIBCXX_DEBUG_ONLY(assert_valid();) 79} 80 81PB_DS_CLASS_T_DEC 82void 83PB_DS_CLASS_C_DEC:: 84swap(PB_DS_CLASS_C_DEC& other) 85{ 86 _GLIBCXX_DEBUG_ONLY(assert_valid();) 87 _GLIBCXX_DEBUG_ONLY(other.assert_valid();) 88 value_swap(other); 89 std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )other); 90 _GLIBCXX_DEBUG_ONLY(assert_valid();) 91 _GLIBCXX_DEBUG_ONLY(other.assert_valid();) 92} 93 94PB_DS_CLASS_T_DEC 95void 96PB_DS_CLASS_C_DEC:: 97value_swap(PB_DS_CLASS_C_DEC& other) 98{ 99 std::swap(m_p_root, other.m_p_root); 100 std::swap(m_size, other.m_size); 101} 102 103PB_DS_CLASS_T_DEC 104PB_DS_CLASS_C_DEC:: 105~left_child_next_sibling_heap_() 106{ 107 clear(); 108} 109 110PB_DS_CLASS_T_DEC 111typename PB_DS_CLASS_C_DEC::node_pointer 112PB_DS_CLASS_C_DEC:: 113recursive_copy_node(const_node_pointer p_nd) 114{ 115 if (p_nd == 0) 116 return (0); 117 118 node_pointer p_ret = s_node_allocator.allocate(1); 119 120 __try 121 { 122 new (p_ret) node(*p_nd); 123 } 124 __catch(...) 125 { 126 s_node_allocator.deallocate(p_ret, 1); 127 __throw_exception_again; 128 } 129 130 p_ret->m_p_l_child = p_ret->m_p_next_sibling = 131 p_ret->m_p_prev_or_parent = 0; 132 133 __try 134 { 135 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child); 136 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling); 137 } 138 __catch(...) 139 { 140 clear_imp(p_ret); 141 __throw_exception_again; 142 } 143 144 if (p_ret->m_p_l_child != 0) 145 p_ret->m_p_l_child->m_p_prev_or_parent = p_ret; 146 147 if (p_ret->m_p_next_sibling != 0) 148 p_ret->m_p_next_sibling->m_p_prev_or_parent = 149 p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd ? p_ret : 0; 150 151 return p_ret; 152} 153 154