diff options
Diffstat (limited to 'gcc-4.4.3/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp')
-rw-r--r-- | gcc-4.4.3/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp | 232 |
1 files changed, 0 insertions, 232 deletions
diff --git a/gcc-4.4.3/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp b/gcc-4.4.3/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp deleted file mode 100644 index a701937cb..000000000 --- a/gcc-4.4.3/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp +++ /dev/null @@ -1,232 +0,0 @@ -// -*- 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; -} - |