1// -*- C++ -*-
2
3// Copyright (C) 2005, 2006 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 2, 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// You should have received a copy of the GNU General Public License
17// along with this library; see the file COPYING.  If not, write to
18// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19// MA 02111-1307, USA.
20
21// As a special exception, you may use this file as part of a free
22// software library without restriction.  Specifically, if other files
23// instantiate templates or use macros or inline functions from this
24// file, or you compile this file and link it with other files to
25// produce an executable, this file does not by itself cause the
26// resulting executable to be covered by the GNU General Public
27// License.  This exception does not however invalidate any other
28// reasons why the executable file might be covered by the GNU General
29// Public License.
30
31// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32
33// Permission to use, copy, modify, sell, and distribute this software
34// is hereby granted without fee, provided that the above copyright
35// notice appears in all copies, and that both that copyright notice
36// and this permission notice appear in supporting documentation. None
37// of the above authors, nor IBM Haifa Research Laboratories, make any
38// representation about the suitability of this software for any
39// purpose. It is provided "as is" without express or implied
40// warranty.
41
42/**
43 * @file constructors_destructor_fn_imps.hpp
44 * Contains an implementation class for left_child_next_sibling_heap_.
45 */
46
47PB_DS_CLASS_T_DEC
48typename PB_DS_CLASS_C_DEC::node_allocator
49PB_DS_CLASS_C_DEC::s_node_allocator;
50
51PB_DS_CLASS_T_DEC
52typename PB_DS_CLASS_C_DEC::no_throw_copies_t
53PB_DS_CLASS_C_DEC::s_no_throw_copies_ind;
54
55PB_DS_CLASS_T_DEC
56PB_DS_CLASS_C_DEC::
57left_child_next_sibling_heap_() :
58  m_p_root(NULL),
59  m_size(0)
60{
61  _GLIBCXX_DEBUG_ONLY(assert_valid();)
62}
63
64PB_DS_CLASS_T_DEC
65PB_DS_CLASS_C_DEC::
66left_child_next_sibling_heap_(const Cmp_Fn& r_cmp_fn) :
67  Cmp_Fn(r_cmp_fn),
68  m_p_root(NULL),
69  m_size(0)
70{
71  _GLIBCXX_DEBUG_ONLY(assert_valid();)
72}
73
74PB_DS_CLASS_T_DEC
75PB_DS_CLASS_C_DEC::
76left_child_next_sibling_heap_(const PB_DS_CLASS_C_DEC& other)
77: Cmp_Fn(other), m_p_root(NULL), m_size(0)
78{
79  m_size = other.m_size;
80  _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
81  m_p_root = recursive_copy_node(other.m_p_root);
82  m_size = other.m_size;
83  _GLIBCXX_DEBUG_ONLY(assert_valid();)
84}
85
86PB_DS_CLASS_T_DEC
87void
88PB_DS_CLASS_C_DEC::
89swap(PB_DS_CLASS_C_DEC& other)
90{
91  _GLIBCXX_DEBUG_ONLY(assert_valid();)
92  _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
93  value_swap(other);
94  std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )other);
95  _GLIBCXX_DEBUG_ONLY(assert_valid();)
96  _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
97}
98
99PB_DS_CLASS_T_DEC
100void
101PB_DS_CLASS_C_DEC::
102value_swap(PB_DS_CLASS_C_DEC& other)
103{
104  std::swap(m_p_root, other.m_p_root);
105  std::swap(m_size, other.m_size);
106}
107
108PB_DS_CLASS_T_DEC
109PB_DS_CLASS_C_DEC::
110~left_child_next_sibling_heap_()
111{
112  clear();
113}
114
115PB_DS_CLASS_T_DEC
116typename PB_DS_CLASS_C_DEC::node_pointer
117PB_DS_CLASS_C_DEC::
118recursive_copy_node(const_node_pointer p_nd)
119{
120  if (p_nd == NULL)
121    return (NULL);
122
123  node_pointer p_ret = s_node_allocator.allocate(1);
124
125  try
126    {
127      new (p_ret) node(*p_nd);
128    }
129  catch(...)
130    {
131      s_node_allocator.deallocate(p_ret, 1);
132      __throw_exception_again;
133    }
134
135  p_ret->m_p_l_child = p_ret->m_p_next_sibling =
136    p_ret->m_p_prev_or_parent = NULL;
137
138  try
139    {
140      p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
141      p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
142    }
143  catch(...)
144    {
145      clear_imp(p_ret);
146      __throw_exception_again;
147    }
148
149  if (p_ret->m_p_l_child != NULL)
150    p_ret->m_p_l_child->m_p_prev_or_parent = p_ret;
151
152  if (p_ret->m_p_next_sibling != NULL)
153    p_ret->m_p_next_sibling->m_p_prev_or_parent =
154      p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd ? p_ret : NULL;
155
156  return p_ret;
157}
158
159