3 // Copyright (C) 2005, 2006 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 2, 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 // 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.
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
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
43 * @file constructors_destructor_fn_imps.hpp
44 * Contains an implementation class for binary_heap_.
48 typename PB_DS_CLASS_C_DEC::entry_allocator
49 PB_DS_CLASS_C_DEC::s_entry_allocator;
52 typename PB_DS_CLASS_C_DEC::value_allocator
53 PB_DS_CLASS_C_DEC::s_value_allocator;
56 typename PB_DS_CLASS_C_DEC::no_throw_copies_t
57 PB_DS_CLASS_C_DEC::s_no_throw_copies_ind;
63 copy_from_range(It first_it, It last_it)
65 while (first_it != last_it)
67 insert_value(*first_it, s_no_throw_copies_ind);
71 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
73 _GLIBCXX_DEBUG_ONLY(assert_valid();)
80 m_actual_size(resize_policy::min_size),
81 m_a_entries(s_entry_allocator.allocate(m_actual_size))
83 _GLIBCXX_DEBUG_ONLY(assert_valid();)
88 binary_heap_(const Cmp_Fn& r_cmp_fn) :
91 m_actual_size(resize_policy::min_size),
92 m_a_entries(s_entry_allocator.allocate(m_actual_size))
94 _GLIBCXX_DEBUG_ONLY(assert_valid();)
99 binary_heap_(const PB_DS_CLASS_C_DEC& other) :
101 resize_policy(other),
103 m_actual_size(other.m_actual_size),
104 m_a_entries(s_entry_allocator.allocate(m_actual_size))
106 _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
107 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries);
109 const_iterator first_it = other.begin();
110 const_iterator last_it = other.end();
114 while (first_it != last_it)
116 insert_value(*first_it, s_no_throw_copies_ind);
122 for (size_type i = 0; i < m_size; ++i)
123 erase_at(m_a_entries, i, s_no_throw_copies_ind);
125 s_entry_allocator.deallocate(m_a_entries, m_actual_size);
126 __throw_exception_again;
128 _GLIBCXX_DEBUG_ONLY(assert_valid();)
134 swap(PB_DS_CLASS_C_DEC& other)
136 _GLIBCXX_DEBUG_ONLY(assert_valid();)
137 _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
138 _GLIBCXX_DEBUG_ASSERT(m_a_entries != other.m_a_entries);
141 std::swap((entry_cmp& )(*this), (entry_cmp& )other);
142 _GLIBCXX_DEBUG_ONLY(assert_valid();)
143 _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
149 value_swap(PB_DS_CLASS_C_DEC& other)
151 std::swap(m_a_entries, other.m_a_entries);
152 std::swap(m_size, other.m_size);
153 std::swap(m_actual_size, other.m_actual_size);
154 static_cast<resize_policy*>(this)->swap(other);
161 for (size_type i = 0; i < m_size; ++i)
162 erase_at(m_a_entries, i, s_no_throw_copies_ind);
163 s_entry_allocator.deallocate(m_a_entries, m_actual_size);