Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Details | Last modification | View Log | RSS feed

Rev Author Line No. Line
5134 serge 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
// .
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
PB_DS_CLASS_T_DEC
42
template
43
void
44
PB_DS_CLASS_C_DEC::
45
copy_from_range(It first_it, It last_it)
46
{
47
  while (first_it != last_it)
48
    push(*(first_it++));
49
  PB_DS_ASSERT_VALID((*this))
50
}
51
 
52
PB_DS_CLASS_T_DEC
53
PB_DS_CLASS_C_DEC::
54
thin_heap() : m_p_max(0)
55
{
56
  initialize();
57
  PB_DS_ASSERT_VALID((*this))
58
}
59
 
60
PB_DS_CLASS_T_DEC
61
PB_DS_CLASS_C_DEC::
62
thin_heap(const Cmp_Fn& r_cmp_fn)
63
: base_type(r_cmp_fn), m_p_max(0)
64
{
65
  initialize();
66
  PB_DS_ASSERT_VALID((*this))
67
}
68
 
69
PB_DS_CLASS_T_DEC
70
PB_DS_CLASS_C_DEC::
71
thin_heap(const PB_DS_CLASS_C_DEC& other)
72
: base_type(other)
73
{
74
  initialize();
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))
79
      m_p_max = p_nd;
80
 
81
  PB_DS_ASSERT_VALID((*this))
82
}
83
 
84
PB_DS_CLASS_T_DEC
85
void
86
PB_DS_CLASS_C_DEC::
87
swap(PB_DS_CLASS_C_DEC& other)
88
{
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))
93
}
94
 
95
PB_DS_CLASS_T_DEC
96
PB_DS_CLASS_C_DEC::
97
~thin_heap()
98
{ }
99
 
100
PB_DS_CLASS_T_DEC
101
void
102
PB_DS_CLASS_C_DEC::
103
initialize()
104
{ std::fill(m_a_aux, m_a_aux + max_rank, static_cast(0)); }
105