]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
3 | // Copyright (C) 2005, 2006 Free Software Foundation, Inc. | |
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 | |
8 | // Foundation; either version 2, or (at your option) any later | |
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 | ||
16 | // You should have received a copy of the GNU General Public License | |
17 | // along with this library; see the file COPYING. If not, write to | |
18 | // the Free Software Foundation, 59 Temple Place - Suite 330, Boston, | |
19 | // MA 02111-1307, USA. | |
20 | ||
21 | // As a special exception, you may use this file as part of a free | |
22 | // software library without restriction. Specifically, if other files | |
23 | // instantiate templates or use macros or inline functions from this | |
24 | // file, or you compile this file and link it with other files to | |
25 | // produce an executable, this file does not by itself cause the | |
26 | // resulting executable to be covered by the GNU General Public | |
27 | // License. This exception does not however invalidate any other | |
28 | // reasons why the executable file might be covered by the GNU General | |
29 | // Public License. | |
30 | ||
31 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
32 | ||
33 | // Permission to use, copy, modify, sell, and distribute this software | |
34 | // is hereby granted without fee, provided that the above copyright | |
35 | // notice appears in all copies, and that both that copyright notice | |
36 | // and this permission notice appear in supporting documentation. None | |
37 | // of the above authors, nor IBM Haifa Research Laboratories, make any | |
38 | // representation about the suitability of this software for any | |
39 | // purpose. It is provided "as is" without express or implied | |
40 | // warranty. | |
41 | ||
42 | /** | |
43 | * @file split_join_fn_imps.hpp | |
44 | * Contains an implementation class for a pairing heap. | |
45 | */ | |
46 | ||
47 | PB_DS_CLASS_T_DEC | |
48 | template<typename Pred> | |
49 | void | |
50 | PB_DS_CLASS_C_DEC:: | |
51 | split(Pred pred, PB_DS_CLASS_C_DEC& other) | |
52 | { | |
47bea7b8 BK |
53 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
54 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
55 | |
56 | other.clear(); | |
57 | ||
58 | if (base_type::empty()) | |
59 | { | |
47bea7b8 BK |
60 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
61 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
62 | |
63 | return; | |
64 | } | |
65 | ||
66 | base_type::to_linked_list(); | |
67 | ||
68 | node_pointer p_out = base_type::prune(pred); | |
69 | ||
70 | while (p_out != NULL) | |
71 | { | |
47bea7b8 | 72 | _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); |
4569a895 AT |
73 | --base_type::m_size; |
74 | ||
75 | ++other.m_size; | |
76 | ||
77 | node_pointer p_next = p_out->m_p_next_sibling; | |
78 | ||
79 | p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = NULL; | |
80 | ||
81 | other.push_imp(p_out); | |
82 | ||
83 | p_out = p_next; | |
84 | } | |
85 | ||
47bea7b8 | 86 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) |
4569a895 AT |
87 | |
88 | node_pointer p_cur = base_type::m_p_root; | |
89 | ||
90 | base_type::m_p_root = NULL; | |
91 | ||
92 | while (p_cur != NULL) | |
93 | { | |
94 | node_pointer p_next = p_cur->m_p_next_sibling; | |
95 | ||
96 | p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL; | |
97 | ||
98 | push_imp(p_cur); | |
99 | ||
100 | p_cur = p_next; | |
101 | } | |
102 | ||
47bea7b8 BK |
103 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
104 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
105 | } |
106 | ||
107 | PB_DS_CLASS_T_DEC | |
108 | inline void | |
109 | PB_DS_CLASS_C_DEC:: | |
110 | join(PB_DS_CLASS_C_DEC& other) | |
111 | { | |
47bea7b8 BK |
112 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
113 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
114 | |
115 | if (other.m_p_root == NULL) | |
116 | { | |
47bea7b8 BK |
117 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
118 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
119 | |
120 | return; | |
121 | } | |
122 | ||
123 | if (base_type::m_p_root == NULL) | |
124 | base_type::m_p_root = other.m_p_root; | |
125 | else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value)) | |
126 | { | |
127 | base_type::make_child_of(base_type::m_p_root, other.m_p_root); | |
47bea7b8 | 128 | _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(other.m_p_root, false)); |
4569a895 AT |
129 | |
130 | base_type::m_p_root = other.m_p_root; | |
131 | } | |
132 | else | |
133 | { | |
134 | base_type::make_child_of(other.m_p_root, base_type::m_p_root); | |
47bea7b8 | 135 | _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false)); |
4569a895 AT |
136 | } |
137 | ||
138 | base_type::m_size += other.m_size; | |
139 | ||
140 | other.m_p_root = NULL; | |
141 | other.m_size = 0; | |
142 | ||
47bea7b8 BK |
143 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
144 | _GLIBCXX_DEBUG_ONLY(other.assert_valid();) | |
4569a895 AT |
145 | } |
146 |