1 // -*- C++ -*- 2 3 // Copyright (C) 2005-2013 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 binary_heap_/constructors_destructor_fn_imps.hpp 38 * Contains an implementation class for binary_heap_. 39 */ 40 41 PB_DS_CLASS_T_DEC 42 typename PB_DS_CLASS_C_DEC::entry_allocator 43 PB_DS_CLASS_C_DEC::s_entry_allocator; 44 45 PB_DS_CLASS_T_DEC 46 typename PB_DS_CLASS_C_DEC::value_allocator 47 PB_DS_CLASS_C_DEC::s_value_allocator; 48 49 PB_DS_CLASS_T_DEC 50 typename PB_DS_CLASS_C_DEC::no_throw_copies_t 51 PB_DS_CLASS_C_DEC::s_no_throw_copies_ind; 52 53 PB_DS_CLASS_T_DEC 54 template<typename It> 55 void 56 PB_DS_CLASS_C_DEC:: 57 copy_from_range(It first_it, It last_it) 58 { 59 while (first_it != last_it) 60 { 61 insert_value(*first_it, s_no_throw_copies_ind); 62 ++first_it; 63 } 64 make_heap(); 65 PB_DS_ASSERT_VALID((*this)) 66 } 67 68 PB_DS_CLASS_T_DEC 69 PB_DS_CLASS_C_DEC:: 70 binary_heap() 71 : m_size(0), m_actual_size(resize_policy::min_size), 72 m_a_entries(s_entry_allocator.allocate(m_actual_size)) 73 { PB_DS_ASSERT_VALID((*this)) } 74 75 PB_DS_CLASS_T_DEC 76 PB_DS_CLASS_C_DEC:: 77 binary_heap(const Cmp_Fn& r_cmp_fn) 78 : entry_cmp(r_cmp_fn), m_size(0), m_actual_size(resize_policy::min_size), 79 m_a_entries(s_entry_allocator.allocate(m_actual_size)) 80 { PB_DS_ASSERT_VALID((*this)) } 81 82 PB_DS_CLASS_T_DEC 83 PB_DS_CLASS_C_DEC:: 84 binary_heap(const PB_DS_CLASS_C_DEC& other) 85 : entry_cmp(other), resize_policy(other), m_size(0), 86 m_actual_size(other.m_actual_size), 87 m_a_entries(s_entry_allocator.allocate(m_actual_size)) 88 { 89 PB_DS_ASSERT_VALID(other) 90 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries); 91 92 __try 93 { 94 copy_from_range(other.begin(), other.end()); 95 } 96 __catch(...) 97 { 98 for (size_type i = 0; i < m_size; ++i) 99 erase_at(m_a_entries, i, s_no_throw_copies_ind); 100 101 s_entry_allocator.deallocate(m_a_entries, m_actual_size); 102 __throw_exception_again; 103 } 104 PB_DS_ASSERT_VALID((*this)) 105 } 106 107 PB_DS_CLASS_T_DEC 108 void 109 PB_DS_CLASS_C_DEC:: 110 swap(PB_DS_CLASS_C_DEC& other) 111 { 112 PB_DS_ASSERT_VALID((*this)) 113 PB_DS_ASSERT_VALID(other) 114 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries); 115 value_swap(other); 116 std::swap((entry_cmp&)(*this), (entry_cmp&)other); 117 PB_DS_ASSERT_VALID((*this)) 118 PB_DS_ASSERT_VALID(other) 119 } 120 121 PB_DS_CLASS_T_DEC 122 void 123 PB_DS_CLASS_C_DEC:: 124 value_swap(PB_DS_CLASS_C_DEC& other) 125 { 126 std::swap(m_a_entries, other.m_a_entries); 127 std::swap(m_size, other.m_size); 128 std::swap(m_actual_size, other.m_actual_size); 129 static_cast<resize_policy*>(this)->swap(other); 130 } 131 132 PB_DS_CLASS_T_DEC 133 PB_DS_CLASS_C_DEC:: 134 ~binary_heap() 135 { 136 for (size_type i = 0; i < m_size; ++i) 137 erase_at(m_a_entries, i, s_no_throw_copies_ind); 138 s_entry_allocator.deallocate(m_a_entries, m_actual_size); 139 } 140
