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 thin_heap_/constructors_destructor_fn_imps.hpp
38 * Contains an implementation for thin_heap_.
39 */
40
41#ifdef PB_DS_CLASS_C_DEC
42
43PB_DS_CLASS_T_DEC
44template<typename It>
45void
46PB_DS_CLASS_C_DEC::
47copy_from_range(It first_it, It last_it)
48{
49  while (first_it != last_it)
50    push(*(first_it++));
51  PB_DS_ASSERT_VALID((*this))
52}
53
54PB_DS_CLASS_T_DEC
55PB_DS_CLASS_C_DEC::
56thin_heap() : m_p_max(0)
57{
58  initialize();
59  PB_DS_ASSERT_VALID((*this))
60}
61
62PB_DS_CLASS_T_DEC
63PB_DS_CLASS_C_DEC::
64thin_heap(const Cmp_Fn& r_cmp_fn)
65: base_type(r_cmp_fn), m_p_max(0)
66{
67  initialize();
68  PB_DS_ASSERT_VALID((*this))
69}
70
71PB_DS_CLASS_T_DEC
72PB_DS_CLASS_C_DEC::
73thin_heap(const PB_DS_CLASS_C_DEC& other)
74: base_type(other)
75{
76  initialize();
77  m_p_max = base_type::m_p_root;
78  for (node_pointer p_nd = base_type::m_p_root; p_nd != 0;
79       p_nd = p_nd->m_p_next_sibling)
80    if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))
81      m_p_max = p_nd;
82
83  PB_DS_ASSERT_VALID((*this))
84}
85
86PB_DS_CLASS_T_DEC
87void
88PB_DS_CLASS_C_DEC::
89swap(PB_DS_CLASS_C_DEC& other)
90{
91  PB_DS_ASSERT_VALID((*this))
92  base_type::swap(other);
93  std::swap(m_p_max, other.m_p_max);
94  PB_DS_ASSERT_VALID((*this))
95}
96
97PB_DS_CLASS_T_DEC
98PB_DS_CLASS_C_DEC::
99~thin_heap()
100{ }
101
102PB_DS_CLASS_T_DEC
103void
104PB_DS_CLASS_C_DEC::
105initialize()
106{ std::fill(m_a_aux, m_a_aux + max_rank, static_cast<node_pointer>(0)); }
107
108#endif
109