• Home
  • History
  • Annotate
  • Line#
  • Navigate
  • Raw
  • Download
  • only in /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-arm-linux-2.6.36-uclibc-4.5.3/arm-linux/include/c++/4.5.3/ext/pb_ds/detail/thin_heap_/
1// -*- C++ -*-
2
3// Copyright (C) 2005, 2006, 2009 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 constructors_destructor_fn_imps.hpp
38 * Contains an implementation for thin_heap_.
39 */
40
41PB_DS_CLASS_T_DEC
42template<typename It>
43void
44PB_DS_CLASS_C_DEC::
45copy_from_range(It first_it, It last_it)
46{
47  while (first_it != last_it)
48    push(*(first_it++));
49  _GLIBCXX_DEBUG_ONLY(assert_valid();)
50}
51
52PB_DS_CLASS_T_DEC
53PB_DS_CLASS_C_DEC::
54thin_heap_() :
55  m_p_max(NULL)
56{
57  initialize();
58  _GLIBCXX_DEBUG_ONLY(assert_valid();)
59}
60
61PB_DS_CLASS_T_DEC
62PB_DS_CLASS_C_DEC::
63thin_heap_(const Cmp_Fn& r_cmp_fn) :
64  PB_DS_BASE_C_DEC(r_cmp_fn),
65  m_p_max(NULL)
66{
67  initialize();
68  _GLIBCXX_DEBUG_ONLY(assert_valid();)
69}
70
71PB_DS_CLASS_T_DEC
72PB_DS_CLASS_C_DEC::
73thin_heap_(const PB_DS_CLASS_C_DEC& other) :
74  PB_DS_BASE_C_DEC(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 != NULL; p_nd = p_nd->m_p_next_sibling)
79    if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))
80      m_p_max = p_nd;
81
82  _GLIBCXX_DEBUG_ONLY(assert_valid();)
83}
84
85PB_DS_CLASS_T_DEC
86void
87PB_DS_CLASS_C_DEC::
88swap(PB_DS_CLASS_C_DEC& other)
89{
90  _GLIBCXX_DEBUG_ONLY(assert_valid();)
91  base_type::swap(other);
92  std::swap(m_p_max, other.m_p_max);
93  _GLIBCXX_DEBUG_ONLY(assert_valid();)
94}
95
96PB_DS_CLASS_T_DEC
97PB_DS_CLASS_C_DEC::
98~thin_heap_()
99{ }
100
101PB_DS_CLASS_T_DEC
102void
103PB_DS_CLASS_C_DEC::
104initialize()
105{ std::fill(m_a_aux, m_a_aux + max_rank, static_cast<node_pointer>(NULL)); }
106
107