forked from KolibriOS/kolibrios
432e5f16f8
git-svn-id: svn://kolibrios.org@6554 a494cfbc-eb01-0410-851d-a64ba20cac60
71 lines
2.3 KiB
C++
71 lines
2.3 KiB
C++
// -*- C++ -*-
|
|
|
|
// Copyright (C) 2005-2015 Free Software Foundation, Inc.
|
|
//
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
// software; you can redistribute it and/or modify it under the terms
|
|
// of the GNU General Public License as published by the Free Software
|
|
// Foundation; either version 3, or (at your option) any later
|
|
// version.
|
|
|
|
// This library is distributed in the hope that it will be useful, but
|
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
// General Public License for more details.
|
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
|
// permissions described in the GCC Runtime Library Exception, version
|
|
// 3.1, as published by the Free Software Foundation.
|
|
|
|
// You should have received a copy of the GNU General Public License and
|
|
// a copy of the GCC Runtime Library Exception along with this program;
|
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
|
|
|
// Permission to use, copy, modify, sell, and distribute this software
|
|
// is hereby granted without fee, provided that the above copyright
|
|
// notice appears in all copies, and that both that copyright notice
|
|
// and this permission notice appear in supporting documentation. None
|
|
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
|
// representation about the suitability of this software for any
|
|
// purpose. It is provided "as is" without express or implied
|
|
// warranty.
|
|
|
|
/**
|
|
* @file binomial_heap_base_/find_fn_imps.hpp
|
|
* Contains an implementation class for a base of binomial heaps.
|
|
*/
|
|
|
|
PB_DS_CLASS_T_DEC
|
|
inline typename PB_DS_CLASS_C_DEC::const_reference
|
|
PB_DS_CLASS_C_DEC::
|
|
top() const
|
|
{
|
|
PB_DS_ASSERT_VALID_COND((*this),false)
|
|
_GLIBCXX_DEBUG_ASSERT(!base_type::empty());
|
|
|
|
if (m_p_max == 0)
|
|
const_cast<PB_DS_CLASS_C_DEC* >(this)->find_max();
|
|
|
|
_GLIBCXX_DEBUG_ASSERT(m_p_max != 0);
|
|
return m_p_max->m_value;
|
|
}
|
|
|
|
PB_DS_CLASS_T_DEC
|
|
void
|
|
PB_DS_CLASS_C_DEC::
|
|
find_max()
|
|
{
|
|
node_pointer p_cur = base_type::m_p_root;
|
|
m_p_max = p_cur;
|
|
while (p_cur != 0)
|
|
{
|
|
if (Cmp_Fn::operator()(m_p_max->m_value, p_cur->m_value))
|
|
m_p_max = p_cur;
|
|
p_cur = p_cur->m_p_next_sibling;
|
|
}
|
|
}
|
|
|