forked from KolibriOS/kolibrios
78 lines
2.4 KiB
C++
78 lines
2.4 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 rc_binomial_heap_/split_join_fn_imps.hpp
|
||
|
* Contains an implementation for rc_binomial_heap_.
|
||
|
*/
|
||
|
|
||
|
PB_DS_CLASS_T_DEC
|
||
|
template<typename Pred>
|
||
|
void
|
||
|
PB_DS_CLASS_C_DEC::
|
||
|
split(Pred pred, PB_DS_CLASS_C_DEC& other)
|
||
|
{
|
||
|
PB_DS_ASSERT_VALID((*this))
|
||
|
PB_DS_ASSERT_VALID(other)
|
||
|
|
||
|
make_binomial_heap();
|
||
|
other.make_binomial_heap();
|
||
|
base_type::split(pred, other);
|
||
|
base_type::find_max();
|
||
|
other.find_max();
|
||
|
|
||
|
PB_DS_ASSERT_VALID((*this))
|
||
|
PB_DS_ASSERT_VALID(other)
|
||
|
}
|
||
|
|
||
|
PB_DS_CLASS_T_DEC
|
||
|
inline void
|
||
|
PB_DS_CLASS_C_DEC::
|
||
|
join(PB_DS_CLASS_C_DEC& other)
|
||
|
{
|
||
|
PB_DS_ASSERT_VALID((*this))
|
||
|
PB_DS_ASSERT_VALID(other)
|
||
|
|
||
|
make_binomial_heap();
|
||
|
other.make_binomial_heap();
|
||
|
base_type::join(other);
|
||
|
base_type::find_max();
|
||
|
other.find_max();
|
||
|
|
||
|
PB_DS_ASSERT_VALID((*this))
|
||
|
PB_DS_ASSERT_VALID(other)
|
||
|
}
|
||
|
|