3 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc.
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
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file constructors_destructor_fn_imps.hpp
38 * Contains an implementation class for left_child_next_sibling_heap_.
42 typename
PB_DS_CLASS_C_DEC::node_allocator
43 PB_DS_CLASS_C_DEC::s_node_allocator
;
46 typename
PB_DS_CLASS_C_DEC::no_throw_copies_t
47 PB_DS_CLASS_C_DEC::s_no_throw_copies_ind
;
51 left_child_next_sibling_heap_() :
55 _GLIBCXX_DEBUG_ONLY(assert_valid();)
60 left_child_next_sibling_heap_(const Cmp_Fn
& r_cmp_fn
) :
65 _GLIBCXX_DEBUG_ONLY(assert_valid();)
70 left_child_next_sibling_heap_(const PB_DS_CLASS_C_DEC
& other
)
71 : Cmp_Fn(other
), m_p_root(NULL
), m_size(0)
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();)
83 swap(PB_DS_CLASS_C_DEC
& other
)
85 _GLIBCXX_DEBUG_ONLY(assert_valid();)
86 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)
88 std::swap((Cmp_Fn
& )(*this), (Cmp_Fn
& )other
);
89 _GLIBCXX_DEBUG_ONLY(assert_valid();)
90 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)
96 value_swap(PB_DS_CLASS_C_DEC
& other
)
98 std::swap(m_p_root
, other
.m_p_root
);
99 std::swap(m_size
, other
.m_size
);
104 ~left_child_next_sibling_heap_()
110 typename
PB_DS_CLASS_C_DEC::node_pointer
112 recursive_copy_node(const_node_pointer p_nd
)
117 node_pointer p_ret
= s_node_allocator
.allocate(1);
121 new (p_ret
) node(*p_nd
);
125 s_node_allocator
.deallocate(p_ret
, 1);
126 __throw_exception_again
;
129 p_ret
->m_p_l_child
= p_ret
->m_p_next_sibling
=
130 p_ret
->m_p_prev_or_parent
= NULL
;
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
);
140 __throw_exception_again
;
143 if (p_ret
->m_p_l_child
!= NULL
)
144 p_ret
->m_p_l_child
->m_p_prev_or_parent
= p_ret
;
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
;