3 // Copyright (C) 2005-2019 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 left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp
38 * Contains an implementation class for left_child_next_sibling_heap_.
41 #ifdef PB_DS_CLASS_C_DEC
44 typename
PB_DS_CLASS_C_DEC::node_allocator
45 PB_DS_CLASS_C_DEC::s_node_allocator
;
48 typename
PB_DS_CLASS_C_DEC::no_throw_copies_t
49 PB_DS_CLASS_C_DEC::s_no_throw_copies_ind
;
53 left_child_next_sibling_heap() :
57 PB_DS_ASSERT_VALID((*this))
62 left_child_next_sibling_heap(const Cmp_Fn
& r_cmp_fn
) :
67 PB_DS_ASSERT_VALID((*this))
72 left_child_next_sibling_heap(const PB_DS_CLASS_C_DEC
& other
)
73 : Cmp_Fn(other
), m_p_root(0), m_size(0)
75 m_size
= other
.m_size
;
76 PB_DS_ASSERT_VALID(other
)
77 m_p_root
= recursive_copy_node(other
.m_p_root
);
78 m_size
= other
.m_size
;
79 PB_DS_ASSERT_VALID((*this))
85 swap(PB_DS_CLASS_C_DEC
& other
)
87 PB_DS_ASSERT_VALID((*this))
88 PB_DS_ASSERT_VALID(other
)
90 std::swap((Cmp_Fn
& )(*this), (Cmp_Fn
& )other
);
91 PB_DS_ASSERT_VALID((*this))
92 PB_DS_ASSERT_VALID(other
)
98 value_swap(PB_DS_CLASS_C_DEC
& other
)
100 std::swap(m_p_root
, other
.m_p_root
);
101 std::swap(m_size
, other
.m_size
);
106 ~left_child_next_sibling_heap()
112 typename
PB_DS_CLASS_C_DEC::node_pointer
114 recursive_copy_node(node_const_pointer p_nd
)
119 node_pointer p_ret
= s_node_allocator
.allocate(1);
123 new (p_ret
) node(*p_nd
);
127 s_node_allocator
.deallocate(p_ret
, 1);
128 __throw_exception_again
;
131 p_ret
->m_p_l_child
= p_ret
->m_p_next_sibling
=
132 p_ret
->m_p_prev_or_parent
= 0;
136 p_ret
->m_p_l_child
= recursive_copy_node(p_nd
->m_p_l_child
);
137 p_ret
->m_p_next_sibling
= recursive_copy_node(p_nd
->m_p_next_sibling
);
142 __throw_exception_again
;
145 if (p_ret
->m_p_l_child
!= 0)
146 p_ret
->m_p_l_child
->m_p_prev_or_parent
= p_ret
;
148 if (p_ret
->m_p_next_sibling
!= 0)
149 p_ret
->m_p_next_sibling
->m_p_prev_or_parent
=
150 p_nd
->m_p_next_sibling
->m_p_prev_or_parent
== p_nd
? p_ret
: 0;