X-Git-Url: http://wagnertech.de/git?a=blobdiff_plain;f=i686-linux-gnu-4.7%2Fusr%2Finclude%2Fc%2B%2B%2F4.7%2Fext%2Fpb_ds%2Fdetail%2Fbinomial_heap_base_%2Fsplit_join_fn_imps.hpp;fp=i686-linux-gnu-4.7%2Fusr%2Finclude%2Fc%2B%2B%2F4.7%2Fext%2Fpb_ds%2Fdetail%2Fbinomial_heap_base_%2Fsplit_join_fn_imps.hpp;h=44bc4ed7c4dc2e479cea174591245f66f73d166d;hb=94df942c2c7bd3457276fe5b7367623cbb8c1302;hp=0000000000000000000000000000000000000000;hpb=4dd7d9155a920895ff7b1cb6b9c9c676aa62000a;p=cross.git
diff --git a/i686-linux-gnu-4.7/usr/include/c++/4.7/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp b/i686-linux-gnu-4.7/usr/include/c++/4.7/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp
new file mode 100644
index 0000000..44bc4ed
--- /dev/null
+++ b/i686-linux-gnu-4.7/usr/include/c++/4.7/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp
@@ -0,0 +1,197 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006, 2009, 2010, 2011 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_/split_join_fn_imps.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+PB_DS_CLASS_T_DEC
+template
+void
+PB_DS_CLASS_C_DEC::
+split(Pred pred, PB_DS_CLASS_C_DEC& other)
+{
+ PB_DS_ASSERT_VALID_COND((*this),true)
+ PB_DS_ASSERT_VALID_COND(other,true)
+
+ other.clear();
+ if (base_type::empty())
+ {
+ PB_DS_ASSERT_VALID_COND((*this),true)
+ PB_DS_ASSERT_VALID_COND(other,true)
+ return;
+ }
+
+ base_type::to_linked_list();
+ node_pointer p_out = base_type::prune(pred);
+ while (p_out != 0)
+ {
+ _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 = 0;
+ p_out->m_metadata = 0;
+
+ p_out->m_p_next_sibling = other.m_p_root;
+ if (other.m_p_root != 0)
+ 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;
+ }
+
+ PB_DS_ASSERT_VALID_COND(other,true)
+ node_pointer p_cur = base_type::m_p_root;
+ base_type::m_p_root = 0;
+
+ while (p_cur != 0)
+ {
+ node_pointer p_next = p_cur->m_p_next_sibling;
+ p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = 0;
+ p_cur->m_metadata = 0;
+ p_cur->m_p_next_sibling = base_type::m_p_root;
+
+ if (base_type::m_p_root != 0)
+ 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 = 0;
+ PB_DS_ASSERT_VALID_COND((*this),true)
+ PB_DS_ASSERT_VALID_COND(other,true)
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+ PB_DS_ASSERT_VALID_COND((*this),true)
+ PB_DS_ASSERT_VALID_COND(other,true)
+
+ node_pointer p_other = other.m_p_root;
+ if (p_other != 0)
+ 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 != 0);
+
+ 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 = 0;
+
+ other.m_p_root = 0;
+ other.m_size = 0;
+ other.m_p_max = 0;
+
+ PB_DS_ASSERT_VALID_COND((*this),true)
+ PB_DS_ASSERT_VALID_COND(other,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 = 0;
+ node_pointer p_cur = 0;
+
+ while (p_lhs != 0 || p_rhs != 0)
+ {
+ if (p_rhs == 0)
+ {
+ if (p_cur == 0)
+ 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 = 0;
+ }
+ else if (p_lhs == 0 || p_rhs->m_metadata < p_lhs->m_metadata)
+ {
+ if (p_cur == 0)
+ {
+ 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 == 0)
+ 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 != 0)
+ p_cur->m_p_next_sibling = 0;
+
+ if (p_ret != 0)
+ p_ret->m_p_prev_or_parent = 0;
+
+ return p_ret;
+}