3 // Copyright (C) 2005-2019 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the terms
7 // of the GNU General Public License as published by the Free Software
8 // Foundation; either version 3, or (at your option) any later
11 // This library is distributed in the hope that it will be useful, but
12 // WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
27 // Permission to use, copy, modify, sell, and distribute this software
28 // is hereby granted without fee, provided that the above copyright
29 // notice appears in all copies, and that both that copyright notice
30 // and this permission notice appear in supporting documentation. None
31 // of the above authors, nor IBM Haifa Research Laboratories, make any
32 // representation about the suitability of this software for any
33 // purpose. It is provided "as is" without express or implied
37 * @file pairing_heap_/split_join_fn_imps.hpp
38 * Contains an implementation class for a pairing heap.
41 #ifdef PB_DS_CLASS_C_DEC
44 template<typename Pred>
47 split(Pred pred, PB_DS_CLASS_C_DEC& other)
49 PB_DS_ASSERT_VALID((*this))
50 PB_DS_ASSERT_VALID(other)
54 if (base_type::empty())
56 PB_DS_ASSERT_VALID((*this))
57 PB_DS_ASSERT_VALID(other)
61 base_type::to_linked_list();
62 node_pointer p_out = base_type::prune(pred);
65 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0);
68 node_pointer p_next = p_out->m_p_next_sibling;
69 p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = 0;
71 other.push_imp(p_out);
75 PB_DS_ASSERT_VALID(other)
76 node_pointer p_cur = base_type::m_p_root;
77 base_type::m_p_root = 0;
80 node_pointer p_next = p_cur->m_p_next_sibling;
81 p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = 0;
87 PB_DS_ASSERT_VALID((*this))
88 PB_DS_ASSERT_VALID(other)
94 join(PB_DS_CLASS_C_DEC& other)
96 PB_DS_ASSERT_VALID((*this))
97 PB_DS_ASSERT_VALID(other)
99 if (other.m_p_root == 0)
101 PB_DS_ASSERT_VALID((*this))
102 PB_DS_ASSERT_VALID(other)
106 if (base_type::m_p_root == 0)
107 base_type::m_p_root = other.m_p_root;
108 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value))
110 base_type::make_child_of(base_type::m_p_root, other.m_p_root);
111 PB_DS_ASSERT_NODE_CONSISTENT(other.m_p_root, false)
112 base_type::m_p_root = other.m_p_root;
116 base_type::make_child_of(other.m_p_root, base_type::m_p_root);
117 PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false)
120 base_type::m_size += other.m_size;
123 PB_DS_ASSERT_VALID((*this))
124 PB_DS_ASSERT_VALID(other)