libstdc++
|
00001 // -*- C++ -*- 00002 00003 // Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc. 00004 // 00005 // This file is part of the GNU ISO C++ Library. This library is free 00006 // software; you can redistribute it and/or modify it under the terms 00007 // of the GNU General Public License as published by the Free Software 00008 // Foundation; either version 3, or (at your option) any later 00009 // version. 00010 00011 // This library is distributed in the hope that it will be useful, but 00012 // WITHOUT ANY WARRANTY; without even the implied warranty of 00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00014 // General Public License for more details. 00015 00016 // Under Section 7 of GPL version 3, you are granted additional 00017 // permissions described in the GCC Runtime Library Exception, version 00018 // 3.1, as published by the Free Software Foundation. 00019 00020 // You should have received a copy of the GNU General Public License and 00021 // a copy of the GCC Runtime Library Exception along with this program; 00022 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 00023 // <http://www.gnu.org/licenses/>. 00024 00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 00026 00027 // Permission to use, copy, modify, sell, and distribute this software 00028 // is hereby granted without fee, provided that the above copyright 00029 // notice appears in all copies, and that both that copyright notice 00030 // and this permission notice appear in supporting documentation. None 00031 // of the above authors, nor IBM Haifa Research Laboratories, make any 00032 // representation about the suitability of this software for any 00033 // purpose. It is provided "as is" without express or implied 00034 // warranty. 00035 00036 /** 00037 * @file thin_heap_/constructors_destructor_fn_imps.hpp 00038 * Contains an implementation for thin_heap_. 00039 */ 00040 00041 PB_DS_CLASS_T_DEC 00042 template<typename It> 00043 void 00044 PB_DS_CLASS_C_DEC:: 00045 copy_from_range(It first_it, It last_it) 00046 { 00047 while (first_it != last_it) 00048 push(*(first_it++)); 00049 PB_DS_ASSERT_VALID((*this)) 00050 } 00051 00052 PB_DS_CLASS_T_DEC 00053 PB_DS_CLASS_C_DEC:: 00054 thin_heap() : m_p_max(0) 00055 { 00056 initialize(); 00057 PB_DS_ASSERT_VALID((*this)) 00058 } 00059 00060 PB_DS_CLASS_T_DEC 00061 PB_DS_CLASS_C_DEC:: 00062 thin_heap(const Cmp_Fn& r_cmp_fn) 00063 : base_type(r_cmp_fn), m_p_max(0) 00064 { 00065 initialize(); 00066 PB_DS_ASSERT_VALID((*this)) 00067 } 00068 00069 PB_DS_CLASS_T_DEC 00070 PB_DS_CLASS_C_DEC:: 00071 thin_heap(const PB_DS_CLASS_C_DEC& other) 00072 : base_type(other) 00073 { 00074 initialize(); 00075 m_p_max = base_type::m_p_root; 00076 for (node_pointer p_nd = base_type::m_p_root; p_nd != 0; 00077 p_nd = p_nd->m_p_next_sibling) 00078 if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value)) 00079 m_p_max = p_nd; 00080 00081 PB_DS_ASSERT_VALID((*this)) 00082 } 00083 00084 PB_DS_CLASS_T_DEC 00085 void 00086 PB_DS_CLASS_C_DEC:: 00087 swap(PB_DS_CLASS_C_DEC& other) 00088 { 00089 PB_DS_ASSERT_VALID((*this)) 00090 base_type::swap(other); 00091 std::swap(m_p_max, other.m_p_max); 00092 PB_DS_ASSERT_VALID((*this)) 00093 } 00094 00095 PB_DS_CLASS_T_DEC 00096 PB_DS_CLASS_C_DEC:: 00097 ~thin_heap() 00098 { } 00099 00100 PB_DS_CLASS_T_DEC 00101 void 00102 PB_DS_CLASS_C_DEC:: 00103 initialize() 00104 { std::fill(m_a_aux, m_a_aux + max_rank, static_cast<node_pointer>(0)); } 00105