Subversion Repositories Kolibri OS

// -*- C++ -*-

// Copyright (C) 2005-2013 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

// .

// 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_/binomial_heap_base_.hpp

 * Contains an implementation class for a base of binomial heaps.

 */

#ifndef PB_DS_BINOMIAL_HEAP_BASE_HPP

#define PB_DS_BINOMIAL_HEAP_BASE_HPP

/*

 * Binomial heap base.

 * Vuillemin J is the mastah.

 * Modified from CLRS.

 */

#include 

#include 

#include 

#include 

namespace __gnu_pbds

{

  namespace detail

  {

#define PB_DS_CLASS_T_DEC \

    template

#define PB_DS_CLASS_C_DEC \

    binomial_heap_base

#ifdef _GLIBCXX_DEBUG

#define PB_DS_B_HEAP_BASE \

  left_child_next_sibling_heap

				typename _Alloc::size_type,  _Alloc, false>

#else

#define PB_DS_B_HEAP_BASE \

  left_child_next_sibling_heap

				typename _Alloc::size_type, _Alloc>

#endif

    /// Base class for binomial heap.

    template

    class binomial_heap_base

    : public PB_DS_B_HEAP_BASE

    {

    private:

      typedef typename _Alloc::template rebind::other __rebind_v;

      typedef PB_DS_B_HEAP_BASE	  			base_type;

    protected:

      typedef typename base_type::node 			node;

      typedef typename base_type::node_pointer 		node_pointer;

      typedef typename base_type::node_const_pointer 	node_const_pointer;

    public:

      typedef Value_Type 				value_type;

      typedef Cmp_Fn 					cmp_fn;

      typedef _Alloc 					allocator_type;

      typedef typename _Alloc::size_type 		size_type;

      typedef typename _Alloc::difference_type 		difference_type;

      typedef typename __rebind_v::pointer 		pointer;

      typedef typename __rebind_v::const_pointer 	const_pointer;

      typedef typename __rebind_v::reference 		reference;

      typedef typename __rebind_v::const_reference   	const_reference;

      typedef typename base_type::point_const_iterator 	point_const_iterator;

      typedef typename base_type::point_iterator 	point_iterator;

      typedef typename base_type::const_iterator 	const_iterator;

      typedef typename base_type::iterator 		iterator;

    public:

      inline point_iterator

      push(const_reference);

      void

      modify(point_iterator, const_reference);

      inline const_reference

      top() const;

      void

      pop();

      void

      erase(point_iterator);

      inline void

      clear();

      template

      size_type

      erase_if(Pred);

      template

      void

      split(Pred, PB_DS_CLASS_C_DEC&);

      void

      join(PB_DS_CLASS_C_DEC&);

    protected:

      binomial_heap_base();

      binomial_heap_base(const Cmp_Fn&);

      binomial_heap_base(const PB_DS_CLASS_C_DEC&);

      void

      swap(PB_DS_CLASS_C_DEC&);

      ~binomial_heap_base();

      template

      void

      copy_from_range(It, It);

      inline void

      find_max();

#ifdef _GLIBCXX_DEBUG

      void

      assert_valid(bool, const char*, int) const;

      void

      assert_max(const char*, int) const;

#endif

    private:

      inline node_pointer

      fix(node_pointer) const;

      inline void

      insert_node(node_pointer);

      inline void

      remove_parentless_node(node_pointer);

      inline node_pointer

      join(node_pointer, node_pointer) const;

#ifdef _GLIBCXX_DEBUG

      void

      assert_node_consistent(node_const_pointer, bool, bool,

			     const char*, int) const;

#endif

    protected:

      node_pointer 	m_p_max;

    };

#define PB_DS_ASSERT_VALID_COND(X, _StrictlyBinomial)			\

  _GLIBCXX_DEBUG_ONLY(X.assert_valid(_StrictlyBinomial,__FILE__, __LINE__);)

#define PB_DS_ASSERT_BASE_NODE_CONSISTENT(_Node, _Bool)			\

  _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(_Node, _Bool,	\

							__FILE__, __LINE__);)

#include 

#include 

#include 

#include 

#include 

#include 

#undef PB_DS_ASSERT_BASE_NODE_CONSISTENT

#undef PB_DS_ASSERT_VALID_COND

#undef PB_DS_CLASS_C_DEC

#undef PB_DS_CLASS_T_DEC

#undef PB_DS_B_HEAP_BASE

  } // namespace detail

} // namespace __gnu_pbds

#endif