3 // Copyright (C) 2005-2015 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 thin_heap_/constructors_destructor_fn_imps.hpp
38 * Contains an implementation for thin_heap_.
45 copy_from_range(It first_it, It last_it)
47 while (first_it != last_it)
49 PB_DS_ASSERT_VALID((*this))
54 thin_heap() : m_p_max(0)
57 PB_DS_ASSERT_VALID((*this))
62 thin_heap(const Cmp_Fn& r_cmp_fn)
63 : base_type(r_cmp_fn), m_p_max(0)
66 PB_DS_ASSERT_VALID((*this))
71 thin_heap(const PB_DS_CLASS_C_DEC& other)
75 m_p_max = base_type::m_p_root;
76 for (node_pointer p_nd = base_type::m_p_root; p_nd != 0;
77 p_nd = p_nd->m_p_next_sibling)
78 if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))
81 PB_DS_ASSERT_VALID((*this))
87 swap(PB_DS_CLASS_C_DEC& other)
89 PB_DS_ASSERT_VALID((*this))
90 base_type::swap(other);
91 std::swap(m_p_max, other.m_p_max);
92 PB_DS_ASSERT_VALID((*this))
104 { std::fill(m_a_aux, m_a_aux + max_rank, static_cast<node_pointer>(0)); }