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 // <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 binomial_heap_base_/find_fn_imps.hpp 38 * Contains an implementation class for a base of binomial heaps. 39 */ 40 41 PB_DS_CLASS_T_DEC 42 inline typename PB_DS_CLASS_C_DEC::const_reference 43 PB_DS_CLASS_C_DEC:: 44 top() const 45 { 46 PB_DS_ASSERT_VALID_COND((*this),false) 47 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 48 49 if (m_p_max == 0) 50 const_cast<PB_DS_CLASS_C_DEC* >(this)->find_max(); 51 52 _GLIBCXX_DEBUG_ASSERT(m_p_max != 0); 53 return m_p_max->m_value; 54 } 55 56 PB_DS_CLASS_T_DEC 57 void 58 PB_DS_CLASS_C_DEC:: 59 find_max() 60 { 61 node_pointer p_cur = base_type::m_p_root; 62 m_p_max = p_cur; 63 while (p_cur != 0) 64 { 65 if (Cmp_Fn::operator()(m_p_max->m_value, p_cur->m_value)) 66 m_p_max = p_cur; 67 p_cur = p_cur->m_p_next_sibling; 68 } 69 } 70 71
