libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp

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