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 binomial_heap_base_/find_fn_imps.hpp 00038 * Contains an implementation class for a base of binomial heaps. 00039 */ 00040 00041 PB_DS_CLASS_T_DEC 00042 inline typename PB_DS_CLASS_C_DEC::const_reference 00043 PB_DS_CLASS_C_DEC:: 00044 top() const 00045 { 00046 PB_DS_ASSERT_VALID_COND((*this),false) 00047 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 00048 00049 if (m_p_max == 0) 00050 const_cast<PB_DS_CLASS_C_DEC* >(this)->find_max(); 00051 00052 _GLIBCXX_DEBUG_ASSERT(m_p_max != 0); 00053 return m_p_max->m_value; 00054 } 00055 00056 PB_DS_CLASS_T_DEC 00057 void 00058 PB_DS_CLASS_C_DEC:: 00059 find_max() 00060 { 00061 node_pointer p_cur = base_type::m_p_root; 00062 m_p_max = p_cur; 00063 while (p_cur != 0) 00064 { 00065 if (Cmp_Fn::operator()(m_p_max->m_value, p_cur->m_value)) 00066 m_p_max = p_cur; 00067 p_cur = p_cur->m_p_next_sibling; 00068 } 00069 } 00070