OpenCores
URL https://opencores.org/ocsvn/openrisc/openrisc/trunk

Subversion Repositories openrisc

Compare Revisions

  • This comparison shows the changes necessary to convert path 
    /openrisc/tags/gnu-src/gcc-4.5.1/gcc-4.5.1-or32-1.0rc4/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_
    from Rev 424 to Rev 519
    ↔ Reverse comparison
  •

Rev 424 → Rev 519

/erase_fn_imps.hpp
0,0 → 1,192
// -*- C++ -*-
 
// Copyright (C) 2005, 2006, 2009 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 erase_fn_imps.hpp
* Contains an implementation class for a base of binomial heaps.
*/
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
pop()
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
_GLIBCXX_DEBUG_ASSERT(!base_type::empty());
 
if (m_p_max == NULL)
find_max();
 
_GLIBCXX_DEBUG_ASSERT(m_p_max != NULL);
 
node_pointer p_nd = m_p_max;
 
remove_parentless_node(m_p_max);
 
base_type::actual_erase_node(p_nd);
 
m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
}
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
remove_parentless_node(node_pointer p_nd)
{
_GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
_GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == NULL);
 
node_pointer p_cur_root = p_nd == base_type::m_p_root?
p_nd->m_p_next_sibling :
base_type::m_p_root;
 
if (p_cur_root != NULL)
p_cur_root->m_p_prev_or_parent = NULL;
 
if (p_nd->m_p_prev_or_parent != NULL)
p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling;
 
if (p_nd->m_p_next_sibling != NULL)
p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
 
node_pointer p_child = p_nd->m_p_l_child;
 
if (p_child != NULL)
{
p_child->m_p_prev_or_parent = NULL;
 
while (p_child->m_p_next_sibling != NULL)
p_child = p_child->m_p_next_sibling;
}
 
m_p_max = NULL;
 
base_type::m_p_root = join(p_cur_root, p_child);
}
 
PB_DS_CLASS_T_DEC
inline void
PB_DS_CLASS_C_DEC::
clear()
{
base_type::clear();
 
m_p_max = NULL;
}
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
erase(point_iterator it)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
_GLIBCXX_DEBUG_ASSERT(!base_type::empty());
 
base_type::bubble_to_top(it.m_p_nd);
 
remove_parentless_node(it.m_p_nd);
 
base_type::actual_erase_node(it.m_p_nd);
 
m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
}
 
PB_DS_CLASS_T_DEC
template<typename Pred>
typename PB_DS_CLASS_C_DEC::size_type
PB_DS_CLASS_C_DEC::
erase_if(Pred pred)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 
if (base_type::empty())
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 
return 0;
}
 
base_type::to_linked_list();
 
node_pointer p_out = base_type::prune(pred);
 
size_type ersd = 0;
 
while (p_out != NULL)
{
++ersd;
 
node_pointer p_next = p_out->m_p_next_sibling;
 
base_type::actual_erase_node(p_out);
 
p_out = p_next;
}
 
node_pointer p_cur = base_type::m_p_root;
 
base_type::m_p_root = NULL;
 
while (p_cur != NULL)
{
node_pointer p_next = p_cur->m_p_next_sibling;
 
p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL;
 
p_cur->m_metadata = 0;
 
p_cur->m_p_next_sibling = base_type::m_p_root;
 
if (base_type::m_p_root != NULL)
base_type::m_p_root->m_p_prev_or_parent = p_cur;
 
base_type::m_p_root = p_cur;
 
base_type::m_p_root = fix(base_type::m_p_root);
 
p_cur = p_next;
}
 
m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 
return ersd;
}
 
/find_fn_imps.hpp
0,0 → 1,73
// -*- C++ -*-
 
// Copyright (C) 2005, 2006, 2009 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 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
{
_GLIBCXX_DEBUG_ONLY(assert_valid(false);)
_GLIBCXX_DEBUG_ASSERT(!base_type::empty());
 
if (m_p_max == NULL)
const_cast<PB_DS_CLASS_C_DEC* >(this)->find_max();
 
_GLIBCXX_DEBUG_ASSERT(m_p_max != NULL);
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 != NULL)
{
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;
}
}
 
/insert_fn_imps.hpp
0,0 → 1,216
// -*- C++ -*-
 
// Copyright (C) 2005, 2006, 2009 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 insert_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::point_iterator
PB_DS_CLASS_C_DEC::
push(const_reference r_val)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 
node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
 
insert_node(p_nd);
 
m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 
return point_iterator(p_nd);
}
 
PB_DS_CLASS_T_DEC
inline void
PB_DS_CLASS_C_DEC::
insert_node(node_pointer p_nd)
{
if (base_type::m_p_root == NULL)
{
p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
p_nd->m_p_l_child = NULL;
 
p_nd->m_metadata = 0;
 
base_type::m_p_root = p_nd;
 
return;
}
 
if (base_type::m_p_root->m_metadata > 0)
{
p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL;
 
p_nd->m_p_next_sibling = base_type::m_p_root;
 
base_type::m_p_root->m_p_prev_or_parent = p_nd;
 
base_type::m_p_root = p_nd;
 
p_nd->m_metadata = 0;
 
return;
}
 
if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
{
p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling;
 
p_nd->m_p_prev_or_parent = NULL;
 
p_nd->m_metadata = 1;
 
p_nd->m_p_l_child = base_type::m_p_root;
 
base_type::m_p_root->m_p_prev_or_parent = p_nd;
 
base_type::m_p_root->m_p_next_sibling = NULL;
 
base_type::m_p_root = p_nd;
}
else
{
p_nd->m_p_next_sibling = NULL;
 
p_nd->m_p_l_child = NULL;
 
p_nd->m_p_prev_or_parent = base_type::m_p_root;
 
p_nd->m_metadata = 0;
 
_GLIBCXX_DEBUG_ASSERT(base_type::m_p_root->m_p_l_child == 0);
base_type::m_p_root->m_p_l_child = p_nd;
 
base_type::m_p_root->m_metadata = 1;
}
 
base_type::m_p_root = fix(base_type::m_p_root);
}
 
PB_DS_CLASS_T_DEC
inline typename PB_DS_CLASS_C_DEC::node_pointer
PB_DS_CLASS_C_DEC::
fix(node_pointer p_nd) const
{
while (p_nd->m_p_next_sibling != NULL&&
p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata)
{
node_pointer p_next = p_nd->m_p_next_sibling;
 
if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
{
p_next->m_p_prev_or_parent =
p_nd->m_p_prev_or_parent;
 
if (p_nd->m_p_prev_or_parent != NULL)
p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next;
 
base_type::make_child_of(p_nd, p_next);
 
++p_next->m_metadata;
 
p_nd = p_next;
}
else
{
p_nd->m_p_next_sibling = p_next->m_p_next_sibling;
 
if (p_nd->m_p_next_sibling != NULL)
p_next->m_p_next_sibling = NULL;
 
base_type::make_child_of(p_next, p_nd);
 
++p_nd->m_metadata;
}
}
 
if (p_nd->m_p_next_sibling != NULL)
p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
 
return p_nd;
}
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
modify(point_iterator it, const_reference r_new_val)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
node_pointer p_nd = it.m_p_nd;
 
_GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
_GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd, false);)
 
const bool bubble_up = Cmp_Fn::operator()(p_nd->m_value, r_new_val);
 
p_nd->m_value = r_new_val;
 
if (bubble_up)
{
node_pointer p_parent = base_type::parent(p_nd);
 
while (p_parent != NULL&&
Cmp_Fn::operator()(p_parent->m_value, p_nd->m_value))
{
base_type::swap_with_parent(p_nd, p_parent);
 
p_parent = base_type::parent(p_nd);
}
 
if (p_nd->m_p_prev_or_parent == NULL)
base_type::m_p_root = p_nd;
 
m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 
return;
}
 
base_type::bubble_to_top(p_nd);
 
remove_parentless_node(p_nd);
 
insert_node(p_nd);
 
m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
}
 
/binomial_heap_base_.hpp
0,0 → 1,234
// -*- C++ -*-
 
// Copyright (C) 2005, 2006, 2009 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_.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 <debug/debug.h>
#include <ext/pb_ds/detail/cond_dealtor.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_/null_metadata.hpp>
 
namespace __gnu_pbds
{
namespace detail
{
 
#define PB_DS_CLASS_T_DEC \
template<typename Value_Type, class Cmp_Fn, class Allocator>
 
#define PB_DS_CLASS_C_DEC \
binomial_heap_base_<Value_Type, Cmp_Fn, Allocator>
 
#ifdef _GLIBCXX_DEBUG
#define PB_DS_BASE_C_DEC \
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
typename Allocator::size_type, \
Allocator, false>
#else
#define PB_DS_BASE_C_DEC \
left_child_next_sibling_heap_<Value_Type, Cmp_Fn, \
typename Allocator::size_type, Allocator>
#endif
 
/**
* class description = "8y|\|0|\/|i41 h34p 74813">
**/
template<typename Value_Type, class Cmp_Fn, class Allocator>
class binomial_heap_base_ : public PB_DS_BASE_C_DEC
{
 
private:
typedef PB_DS_BASE_C_DEC base_type;
 
protected:
typedef typename base_type::node node;
 
typedef typename base_type::node_pointer node_pointer;
 
typedef typename base_type::const_node_pointer const_node_pointer;
 
public:
 
typedef typename Allocator::size_type size_type;
 
typedef typename Allocator::difference_type difference_type;
 
typedef Value_Type value_type;
 
typedef
typename Allocator::template rebind<
value_type>::other::pointer
pointer;
 
typedef
typename Allocator::template rebind<
value_type>::other::const_pointer
const_pointer;
 
typedef
typename Allocator::template rebind<
value_type>::other::reference
reference;
 
typedef
typename Allocator::template rebind<
value_type>::other::const_reference
const_reference;
 
typedef
typename PB_DS_BASE_C_DEC::const_point_iterator
const_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::iterator iterator;
 
typedef Cmp_Fn cmp_fn;
 
typedef Allocator allocator_type;
 
public:
 
inline point_iterator
push(const_reference r_val);
 
void
modify(point_iterator it, const_reference r_new_val);
 
inline const_reference
top() const;
 
void
pop();
 
void
erase(point_iterator it);
 
inline void
clear();
 
template<typename Pred>
size_type
erase_if(Pred pred);
 
template<typename Pred>
void
split(Pred pred, PB_DS_CLASS_C_DEC& other);
 
void
join(PB_DS_CLASS_C_DEC& other);
 
protected:
 
binomial_heap_base_();
 
binomial_heap_base_(const Cmp_Fn& r_cmp_fn);
 
binomial_heap_base_(const PB_DS_CLASS_C_DEC& other);
 
void
swap(PB_DS_CLASS_C_DEC& other);
 
~binomial_heap_base_();
 
template<typename It>
void
copy_from_range(It first_it, It last_it);
 
inline void
find_max();
 
#ifdef _GLIBCXX_DEBUG
void
assert_valid(bool strictly_binomial) const;
 
void
assert_max() const;
#endif
 
private:
 
inline node_pointer
fix(node_pointer p_nd) const;
 
inline void
insert_node(node_pointer p_nd);
 
inline void
remove_parentless_node(node_pointer p_nd);
 
inline node_pointer
join(node_pointer p_lhs, node_pointer p_rhs) const;
 
#ifdef _GLIBCXX_DEBUG
void
assert_node_consistent(const_node_pointer, bool, bool) const;
#endif
 
protected:
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_/debug_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_/erase_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_T_DEC
#undef PB_DS_BASE_C_DEC
 
 
} // namespace detail
} // namespace __gnu_pbds
 
#endif
/constructors_destructor_fn_imps.hpp
0,0 → 1,97
// -*- C++ -*-
 
// Copyright (C) 2005, 2006, 2009 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 constructors_destructor_fn_imps.hpp
* Contains an implementation class for a base of binomial heaps.
*/
 
PB_DS_CLASS_T_DEC
template<typename It>
void
PB_DS_CLASS_C_DEC::
copy_from_range(It first_it, It last_it)
{
while (first_it != last_it)
push(*(first_it++));
 
_GLIBCXX_DEBUG_ONLY(assert_valid(false);)
}
 
PB_DS_CLASS_T_DEC
PB_DS_CLASS_C_DEC::
binomial_heap_base_() :
m_p_max(NULL)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(false);)
}
 
PB_DS_CLASS_T_DEC
PB_DS_CLASS_C_DEC::
binomial_heap_base_(const Cmp_Fn& r_cmp_fn) :
PB_DS_BASE_C_DEC(r_cmp_fn),
m_p_max(NULL)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(false);)
}
 
PB_DS_CLASS_T_DEC
PB_DS_CLASS_C_DEC::
binomial_heap_base_(const PB_DS_CLASS_C_DEC& other) :
PB_DS_BASE_C_DEC(other),
m_p_max(NULL)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(false);)
}
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
swap(PB_DS_CLASS_C_DEC& other)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(false);)
 
base_type::swap(other);
 
std::swap(m_p_max, other.m_p_max);
 
_GLIBCXX_DEBUG_ONLY(assert_valid(false);)
}
 
PB_DS_CLASS_T_DEC
PB_DS_CLASS_C_DEC::
~binomial_heap_base_()
{ }
 
/debug_fn_imps.hpp
0,0 → 1,98
// -*- C++ -*-
 
// Copyright (C) 2005, 2006, 2007, 2008, 2009 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 debug_fn_imps.hpp
* Contains an implementation class for a base of binomial heaps.
*/
 
#ifdef _GLIBCXX_DEBUG
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
assert_valid(bool strictly_binomial) const
{
base_type::assert_valid();
assert_node_consistent(base_type::m_p_root, strictly_binomial, true);
assert_max();
}
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
assert_max() const
{
if (m_p_max == NULL)
return;
_GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL);
for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
_GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value,
it.m_p_nd->m_value));
}
 
PB_DS_CLASS_T_DEC
void
PB_DS_CLASS_C_DEC::
assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial,
bool increasing) const
{
_GLIBCXX_DEBUG_ASSERT(increasing || strictly_binomial);
base_type::assert_node_consistent(p_nd, false);
if (p_nd == NULL)
return;
_GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd));
_GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) ==
static_cast<size_type>(1 << p_nd->m_metadata));
assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing);
assert_node_consistent(p_nd->m_p_l_child, true, false);
if (p_nd->m_p_next_sibling != NULL)
{
if (increasing)
{
if (strictly_binomial)
_GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
< p_nd->m_p_next_sibling->m_metadata);
else
_GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
<= p_nd->m_p_next_sibling->m_metadata);
}
else
_GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata
> p_nd->m_p_next_sibling->m_metadata);
}
}
 
#endif
/split_join_fn_imps.hpp
0,0 → 1,232
// -*- C++ -*-
 
// Copyright (C) 2005, 2006, 2009 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 split_join_fn_imps.hpp
* Contains an implementation class for a base of binomial heaps.
*/
 
PB_DS_CLASS_T_DEC
template<typename Pred>
void
PB_DS_CLASS_C_DEC::
split(Pred pred, PB_DS_CLASS_C_DEC& other)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
_GLIBCXX_DEBUG_ONLY(other.assert_valid(true);)
 
other.clear();
 
if (base_type::empty())
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
_GLIBCXX_DEBUG_ONLY(other.assert_valid(true);)
 
return;
}
 
base_type::to_linked_list();
 
node_pointer p_out = base_type::prune(pred);
 
while (p_out != NULL)
{
_GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0);
--base_type::m_size;
 
++other.m_size;
 
node_pointer p_next = p_out->m_p_next_sibling;
 
p_out->m_p_l_child = p_out->m_p_prev_or_parent = NULL;
 
p_out->m_metadata = 0;
 
p_out->m_p_next_sibling = other.m_p_root;
 
if (other.m_p_root != NULL)
other.m_p_root->m_p_prev_or_parent = p_out;
 
other.m_p_root = p_out;
 
other.m_p_root = other.fix(other.m_p_root);
 
p_out = p_next;
}
 
_GLIBCXX_DEBUG_ONLY(other.assert_valid(true);)
 
node_pointer p_cur = base_type::m_p_root;
 
base_type::m_p_root = NULL;
 
while (p_cur != NULL)
{
node_pointer p_next = p_cur->m_p_next_sibling;
 
p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL;
 
p_cur->m_metadata = 0;
 
p_cur->m_p_next_sibling = base_type::m_p_root;
 
if (base_type::m_p_root != NULL)
base_type::m_p_root->m_p_prev_or_parent = p_cur;
 
base_type::m_p_root = p_cur;
 
base_type::m_p_root = fix(base_type::m_p_root);
 
p_cur = p_next;
}
 
m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
_GLIBCXX_DEBUG_ONLY(other.assert_valid(true);)
}
 
PB_DS_CLASS_T_DEC
inline void
PB_DS_CLASS_C_DEC::
join(PB_DS_CLASS_C_DEC& other)
{
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
_GLIBCXX_DEBUG_ONLY(other.assert_valid(true);)
 
node_pointer p_other = other.m_p_root;
 
if (p_other != NULL)
do
{
node_pointer p_next = p_other->m_p_next_sibling;
 
std::swap(p_other->m_p_next_sibling, p_other->m_p_prev_or_parent);
 
p_other = p_next;
}
while (p_other != NULL);
 
base_type::m_p_root = join(base_type::m_p_root, other.m_p_root);
base_type::m_size += other.m_size;
m_p_max = NULL;
 
other.m_p_root = NULL;
other.m_size = 0;
other.m_p_max = NULL;
 
_GLIBCXX_DEBUG_ONLY(assert_valid(true);)
_GLIBCXX_DEBUG_ONLY(other.assert_valid(true);)
}
 
PB_DS_CLASS_T_DEC
inline typename PB_DS_CLASS_C_DEC::node_pointer
PB_DS_CLASS_C_DEC::
join(node_pointer p_lhs, node_pointer p_rhs) const
{
node_pointer p_ret = NULL;
 
node_pointer p_cur = NULL;
 
while (p_lhs != NULL || p_rhs != NULL)
{
if (p_rhs == NULL)
{
if (p_cur == NULL)
p_ret = p_cur = p_lhs;
else
{
p_cur->m_p_next_sibling = p_lhs;
 
p_lhs->m_p_prev_or_parent = p_cur;
}
 
p_cur = p_lhs = NULL;
}
else if (p_lhs == NULL || p_rhs->m_metadata < p_lhs->m_metadata)
{
if (p_cur == NULL)
{
p_ret = p_cur = p_rhs;
 
p_rhs = p_rhs->m_p_prev_or_parent;
}
else
{
p_cur->m_p_next_sibling = p_rhs;
 
p_rhs = p_rhs->m_p_prev_or_parent;
 
p_cur->m_p_next_sibling->m_p_prev_or_parent = p_cur;
 
p_cur = p_cur->m_p_next_sibling;
}
}
else if (p_lhs->m_metadata < p_rhs->m_metadata)
{
if (p_cur == NULL)
p_ret = p_cur = p_lhs;
else
{
p_cur->m_p_next_sibling = p_lhs;
 
p_lhs->m_p_prev_or_parent = p_cur;
 
p_cur = p_cur->m_p_next_sibling;
}
 
p_lhs = p_cur->m_p_next_sibling;
}
else
{
node_pointer p_next_rhs = p_rhs->m_p_prev_or_parent;
 
p_rhs->m_p_next_sibling = p_lhs;
 
p_lhs = fix(p_rhs);
 
p_rhs = p_next_rhs;
}
}
 
if (p_cur != NULL)
p_cur->m_p_next_sibling = NULL;
 
if (p_ret != NULL)
p_ret->m_p_prev_or_parent = NULL;
 
return p_ret;
}
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.