]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
748086b7 | 3 | // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc. |
4569a895 AT |
4 | // |
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 | |
748086b7 | 8 | // Foundation; either version 3, or (at your option) any later |
4569a895 AT |
9 | // version. |
10 | ||
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. | |
15 | ||
748086b7 JJ |
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. | |
19 | ||
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/>. | |
4569a895 AT |
24 | |
25 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
26 | ||
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 | |
34 | // warranty. | |
35 | ||
36 | /** | |
37 | * @file split_join_fn_imps.hpp | |
38 | * Contains an implementation class for a pairing heap. | |
39 | */ | |
40 | ||
41 | PB_DS_CLASS_T_DEC | |
42 | template<typename Pred> | |
43 | void | |
44 | PB_DS_CLASS_C_DEC:: | |
45 | split(Pred pred, PB_DS_CLASS_C_DEC& other) | |
46 | { | |
47bea7b8 BK |
47 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
48 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
49 | |
50 | other.clear(); | |
51 | ||
52 | if (base_type::empty()) | |
53 | { | |
47bea7b8 BK |
54 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
55 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
56 | |
57 | return; | |
58 | } | |
59 | ||
60 | base_type::to_linked_list(); | |
61 | ||
62 | node_pointer p_out = base_type::prune(pred); | |
63 | ||
64 | while (p_out != NULL) | |
65 | { | |
47bea7b8 | 66 | _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); |
4569a895 AT |
67 | --base_type::m_size; |
68 | ||
69 | ++other.m_size; | |
70 | ||
71 | node_pointer p_next = p_out->m_p_next_sibling; | |
72 | ||
73 | p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = NULL; | |
74 | ||
75 | other.push_imp(p_out); | |
76 | ||
77 | p_out = p_next; | |
78 | } | |
79 | ||
47bea7b8 | 80 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) |
4569a895 AT |
81 | |
82 | node_pointer p_cur = base_type::m_p_root; | |
83 | ||
84 | base_type::m_p_root = NULL; | |
85 | ||
86 | while (p_cur != NULL) | |
87 | { | |
88 | node_pointer p_next = p_cur->m_p_next_sibling; | |
89 | ||
90 | p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL; | |
91 | ||
92 | push_imp(p_cur); | |
93 | ||
94 | p_cur = p_next; | |
95 | } | |
96 | ||
47bea7b8 BK |
97 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
98 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
99 | } |
100 | ||
101 | PB_DS_CLASS_T_DEC | |
102 | inline void | |
103 | PB_DS_CLASS_C_DEC:: | |
104 | join(PB_DS_CLASS_C_DEC& other) | |
105 | { | |
47bea7b8 BK |
106 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
107 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
108 | |
109 | if (other.m_p_root == NULL) | |
110 | { | |
47bea7b8 BK |
111 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
112 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
113 | |
114 | return; | |
115 | } | |
116 | ||
117 | if (base_type::m_p_root == NULL) | |
118 | base_type::m_p_root = other.m_p_root; | |
119 | else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value)) | |
120 | { | |
121 | base_type::make_child_of(base_type::m_p_root, other.m_p_root); | |
47bea7b8 | 122 | _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(other.m_p_root, false)); |
4569a895 AT |
123 | |
124 | base_type::m_p_root = other.m_p_root; | |
125 | } | |
126 | else | |
127 | { | |
128 | base_type::make_child_of(other.m_p_root, base_type::m_p_root); | |
47bea7b8 | 129 | _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false)); |
4569a895 AT |
130 | } |
131 | ||
132 | base_type::m_size += other.m_size; | |
133 | ||
134 | other.m_p_root = NULL; | |
135 | other.m_size = 0; | |
136 | ||
47bea7b8 BK |
137 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
138 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
139 | } |
140 |