1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006, 2007, 2008, 2009 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 constructors_destructor_fn_imps.hpp 38 * Contains an implementation class for left_child_next_sibling_heap_. 39 */ 40 41PB_DS_CLASS_T_DEC 42typename PB_DS_CLASS_C_DEC::node_allocator 43PB_DS_CLASS_C_DEC::s_node_allocator; 44 45PB_DS_CLASS_T_DEC 46typename PB_DS_CLASS_C_DEC::no_throw_copies_t 47PB_DS_CLASS_C_DEC::s_no_throw_copies_ind; 48 49PB_DS_CLASS_T_DEC 50PB_DS_CLASS_C_DEC:: 51left_child_next_sibling_heap_() : 52 m_p_root(NULL), 53 m_size(0) 54{ 55 _GLIBCXX_DEBUG_ONLY(assert_valid();) 56} 57 58PB_DS_CLASS_T_DEC 59PB_DS_CLASS_C_DEC:: 60left_child_next_sibling_heap_(const Cmp_Fn& r_cmp_fn) : 61 Cmp_Fn(r_cmp_fn), 62 m_p_root(NULL), 63 m_size(0) 64{ 65 _GLIBCXX_DEBUG_ONLY(assert_valid();) 66} 67 68PB_DS_CLASS_T_DEC 69PB_DS_CLASS_C_DEC:: 70left_child_next_sibling_heap_(const PB_DS_CLASS_C_DEC& other) 71: Cmp_Fn(other), m_p_root(NULL), m_size(0) 72{ 73 m_size = other.m_size; 74 _GLIBCXX_DEBUG_ONLY(other.assert_valid();) 75 m_p_root = recursive_copy_node(other.m_p_root); 76 m_size = other.m_size; 77 _GLIBCXX_DEBUG_ONLY(assert_valid();) 78} 79 80PB_DS_CLASS_T_DEC 81void 82PB_DS_CLASS_C_DEC:: 83swap(PB_DS_CLASS_C_DEC& other) 84{ 85 _GLIBCXX_DEBUG_ONLY(assert_valid();) 86 _GLIBCXX_DEBUG_ONLY(other.assert_valid();) 87 value_swap(other); 88 std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )other); 89 _GLIBCXX_DEBUG_ONLY(assert_valid();) 90 _GLIBCXX_DEBUG_ONLY(other.assert_valid();) 91} 92 93PB_DS_CLASS_T_DEC 94void 95PB_DS_CLASS_C_DEC:: 96value_swap(PB_DS_CLASS_C_DEC& other) 97{ 98 std::swap(m_p_root, other.m_p_root); 99 std::swap(m_size, other.m_size); 100} 101 102PB_DS_CLASS_T_DEC 103PB_DS_CLASS_C_DEC:: 104~left_child_next_sibling_heap_() 105{ 106 clear(); 107} 108 109PB_DS_CLASS_T_DEC 110typename PB_DS_CLASS_C_DEC::node_pointer 111PB_DS_CLASS_C_DEC:: 112recursive_copy_node(const_node_pointer p_nd) 113{ 114 if (p_nd == NULL) 115 return (NULL); 116 117 node_pointer p_ret = s_node_allocator.allocate(1); 118 119 __try 120 { 121 new (p_ret) node(*p_nd); 122 } 123 __catch(...) 124 { 125 s_node_allocator.deallocate(p_ret, 1); 126 __throw_exception_again; 127 } 128 129 p_ret->m_p_l_child = p_ret->m_p_next_sibling = 130 p_ret->m_p_prev_or_parent = NULL; 131 132 __try 133 { 134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child); 135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling); 136 } 137 __catch(...) 138 { 139 clear_imp(p_ret); 140 __throw_exception_again; 141 } 142 143 if (p_ret->m_p_l_child != NULL) 144 p_ret->m_p_l_child->m_p_prev_or_parent = p_ret; 145 146 if (p_ret->m_p_next_sibling != NULL) 147 p_ret->m_p_next_sibling->m_p_prev_or_parent = 148 p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd ? p_ret : NULL; 149 150 return p_ret; 151} 152 153