// -*- C++ -*-
|
// -*- C++ -*-
|
|
|
// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
|
// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
|
//
|
//
|
// This file is part of the GNU ISO C++ Library. This library is free
|
// 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
|
// software; you can redistribute it and/or modify it under the terms
|
// of the GNU General Public License as published by the Free Software
|
// of the GNU General Public License as published by the Free Software
|
// Foundation; either version 3, or (at your option) any later
|
// Foundation; either version 3, or (at your option) any later
|
// version.
|
// version.
|
|
|
// This library is distributed in the hope that it will be useful, but
|
// This library is distributed in the hope that it will be useful, but
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
// General Public License for more details.
|
// General Public License for more details.
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
// Under Section 7 of GPL version 3, you are granted additional
|
// permissions described in the GCC Runtime Library Exception, version
|
// permissions described in the GCC Runtime Library Exception, version
|
// 3.1, as published by the Free Software Foundation.
|
// 3.1, as published by the Free Software Foundation.
|
|
|
// You should have received a copy of the GNU General Public License and
|
// 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;
|
// a copy of the GCC Runtime Library Exception along with this program;
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// <http://www.gnu.org/licenses/>.
|
// <http://www.gnu.org/licenses/>.
|
|
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
|
|
// Permission to use, copy, modify, sell, and distribute this software
|
// Permission to use, copy, modify, sell, and distribute this software
|
// is hereby granted without fee, provided that the above copyright
|
// is hereby granted without fee, provided that the above copyright
|
// notice appears in all copies, and that both that copyright notice
|
// notice appears in all copies, and that both that copyright notice
|
// and this permission notice appear in supporting documentation. None
|
// and this permission notice appear in supporting documentation. None
|
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
// representation about the suitability of this software for any
|
// representation about the suitability of this software for any
|
// purpose. It is provided "as is" without express or implied
|
// purpose. It is provided "as is" without express or implied
|
// warranty.
|
// warranty.
|
|
|
/**
|
/**
|
* @file binomial_heap_base_.hpp
|
* @file binomial_heap_base_.hpp
|
* Contains an implementation class for a base of binomial heaps.
|
* Contains an implementation class for a base of binomial heaps.
|
*/
|
*/
|
|
|
#ifndef PB_DS_BINOMIAL_HEAP_BASE_HPP
|
#ifndef PB_DS_BINOMIAL_HEAP_BASE_HPP
|
#define PB_DS_BINOMIAL_HEAP_BASE_HPP
|
#define PB_DS_BINOMIAL_HEAP_BASE_HPP
|
|
|
/*
|
/*
|
* Binomial heap base.
|
* Binomial heap base.
|
* Vuillemin J is the mastah.
|
* Vuillemin J is the mastah.
|
* Modified from CLRS.
|
* Modified from CLRS.
|
*/
|
*/
|
|
|
#include <debug/debug.h>
|
#include <debug/debug.h>
|
#include <ext/pb_ds/detail/cond_dealtor.hpp>
|
#include <ext/pb_ds/detail/cond_dealtor.hpp>
|
#include <ext/pb_ds/detail/type_utils.hpp>
|
#include <ext/pb_ds/detail/type_utils.hpp>
|
#include <ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp>
|
#include <ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp>
|
#include <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
|
#include <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
|
|
|
namespace __gnu_pbds
|
namespace __gnu_pbds
|
{
|
{
|
namespace detail
|
namespace detail
|
{
|
{
|
|
|
#define PB_DS_CLASS_T_DEC \
|
#define PB_DS_CLASS_T_DEC \
|
template<typename Value_Type, class Cmp_Fn, class Allocator>
|
template<typename Value_Type, class Cmp_Fn, class Allocator>
|
|
|
#define PB_DS_CLASS_C_DEC \
|
#define PB_DS_CLASS_C_DEC \
|
binomial_heap_base_<Value_Type, Cmp_Fn, Allocator>
|
binomial_heap_base_<Value_Type, Cmp_Fn, Allocator>
|
|
|
#ifdef _GLIBCXX_DEBUG
|
#ifdef _GLIBCXX_DEBUG
|
#define PB_DS_BASE_C_DEC \
|
#define PB_DS_BASE_C_DEC \
|
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
|
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
|
typename Allocator::size_type, \
|
typename Allocator::size_type, \
|
Allocator, false>
|
Allocator, false>
|
#else
|
#else
|
#define PB_DS_BASE_C_DEC \
|
#define PB_DS_BASE_C_DEC \
|
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
|
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
|
typename Allocator::size_type, Allocator>
|
typename Allocator::size_type, Allocator>
|
#endif
|
#endif
|
|
|
/**
|
/**
|
* class description = "8y|\|0|\/|i41 h34p 74813">
|
* class description = "8y|\|0|\/|i41 h34p 74813">
|
**/
|
**/
|
template<typename Value_Type, class Cmp_Fn, class Allocator>
|
template<typename Value_Type, class Cmp_Fn, class Allocator>
|
class binomial_heap_base_ : public PB_DS_BASE_C_DEC
|
class binomial_heap_base_ : public PB_DS_BASE_C_DEC
|
{
|
{
|
|
|
private:
|
private:
|
typedef PB_DS_BASE_C_DEC base_type;
|
typedef PB_DS_BASE_C_DEC base_type;
|
|
|
protected:
|
protected:
|
typedef typename base_type::node node;
|
typedef typename base_type::node node;
|
|
|
typedef typename base_type::node_pointer node_pointer;
|
typedef typename base_type::node_pointer node_pointer;
|
|
|
typedef typename base_type::const_node_pointer const_node_pointer;
|
typedef typename base_type::const_node_pointer const_node_pointer;
|
|
|
public:
|
public:
|
|
|
typedef typename Allocator::size_type size_type;
|
typedef typename Allocator::size_type size_type;
|
|
|
typedef typename Allocator::difference_type difference_type;
|
typedef typename Allocator::difference_type difference_type;
|
|
|
typedef Value_Type value_type;
|
typedef Value_Type value_type;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
value_type>::other::pointer
|
value_type>::other::pointer
|
pointer;
|
pointer;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
value_type>::other::const_pointer
|
value_type>::other::const_pointer
|
const_pointer;
|
const_pointer;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
value_type>::other::reference
|
value_type>::other::reference
|
reference;
|
reference;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
value_type>::other::const_reference
|
value_type>::other::const_reference
|
const_reference;
|
const_reference;
|
|
|
typedef
|
typedef
|
typename PB_DS_BASE_C_DEC::const_point_iterator
|
typename PB_DS_BASE_C_DEC::const_point_iterator
|
const_point_iterator;
|
const_point_iterator;
|
|
|
typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
|
typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
|
|
|
typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
|
typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
|
|
|
typedef typename PB_DS_BASE_C_DEC::iterator iterator;
|
typedef typename PB_DS_BASE_C_DEC::iterator iterator;
|
|
|
typedef Cmp_Fn cmp_fn;
|
typedef Cmp_Fn cmp_fn;
|
|
|
typedef Allocator allocator_type;
|
typedef Allocator allocator_type;
|
|
|
public:
|
public:
|
|
|
inline point_iterator
|
inline point_iterator
|
push(const_reference r_val);
|
push(const_reference r_val);
|
|
|
void
|
void
|
modify(point_iterator it, const_reference r_new_val);
|
modify(point_iterator it, const_reference r_new_val);
|
|
|
inline const_reference
|
inline const_reference
|
top() const;
|
top() const;
|
|
|
void
|
void
|
pop();
|
pop();
|
|
|
void
|
void
|
erase(point_iterator it);
|
erase(point_iterator it);
|
|
|
inline void
|
inline void
|
clear();
|
clear();
|
|
|
template<typename Pred>
|
template<typename Pred>
|
size_type
|
size_type
|
erase_if(Pred pred);
|
erase_if(Pred pred);
|
|
|
template<typename Pred>
|
template<typename Pred>
|
void
|
void
|
split(Pred pred, PB_DS_CLASS_C_DEC& other);
|
split(Pred pred, PB_DS_CLASS_C_DEC& other);
|
|
|
void
|
void
|
join(PB_DS_CLASS_C_DEC& other);
|
join(PB_DS_CLASS_C_DEC& other);
|
|
|
protected:
|
protected:
|
|
|
binomial_heap_base_();
|
binomial_heap_base_();
|
|
|
binomial_heap_base_(const Cmp_Fn& r_cmp_fn);
|
binomial_heap_base_(const Cmp_Fn& r_cmp_fn);
|
|
|
binomial_heap_base_(const PB_DS_CLASS_C_DEC& other);
|
binomial_heap_base_(const PB_DS_CLASS_C_DEC& other);
|
|
|
void
|
void
|
swap(PB_DS_CLASS_C_DEC& other);
|
swap(PB_DS_CLASS_C_DEC& other);
|
|
|
~binomial_heap_base_();
|
~binomial_heap_base_();
|
|
|
template<typename It>
|
template<typename It>
|
void
|
void
|
copy_from_range(It first_it, It last_it);
|
copy_from_range(It first_it, It last_it);
|
|
|
inline void
|
inline void
|
find_max();
|
find_max();
|
|
|
#ifdef _GLIBCXX_DEBUG
|
#ifdef _GLIBCXX_DEBUG
|
void
|
void
|
assert_valid(bool strictly_binomial) const;
|
assert_valid(bool strictly_binomial) const;
|
|
|
void
|
void
|
assert_max() const;
|
assert_max() const;
|
#endif
|
#endif
|
|
|
private:
|
private:
|
|
|
inline node_pointer
|
inline node_pointer
|
fix(node_pointer p_nd) const;
|
fix(node_pointer p_nd) const;
|
|
|
inline void
|
inline void
|
insert_node(node_pointer p_nd);
|
insert_node(node_pointer p_nd);
|
|
|
inline void
|
inline void
|
remove_parentless_node(node_pointer p_nd);
|
remove_parentless_node(node_pointer p_nd);
|
|
|
inline node_pointer
|
inline node_pointer
|
join(node_pointer p_lhs, node_pointer p_rhs) const;
|
join(node_pointer p_lhs, node_pointer p_rhs) const;
|
|
|
#ifdef _GLIBCXX_DEBUG
|
#ifdef _GLIBCXX_DEBUG
|
void
|
void
|
assert_node_consistent(const_node_pointer, bool, bool) const;
|
assert_node_consistent(const_node_pointer, bool, bool) const;
|
#endif
|
#endif
|
|
|
protected:
|
protected:
|
node_pointer m_p_max;
|
node_pointer m_p_max;
|
};
|
};
|
|
|
#include <ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp>
|
#include <ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp>
|
|
|
#undef PB_DS_CLASS_C_DEC
|
#undef PB_DS_CLASS_C_DEC
|
#undef PB_DS_CLASS_T_DEC
|
#undef PB_DS_CLASS_T_DEC
|
#undef PB_DS_BASE_C_DEC
|
#undef PB_DS_BASE_C_DEC
|
|
|
|
|
} // namespace detail
|
} // namespace detail
|
} // namespace __gnu_pbds
|
} // namespace __gnu_pbds
|
|
|
#endif
|
#endif
|
|
|
