]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
83ffe9cd | 3 | // Copyright (C) 2005-2023 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. | |
4569a895 | 19 | |
748086b7 JJ |
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 | /** | |
a345e45d | 37 | * @file binomial_heap_base_/erase_fn_imps.hpp |
4569a895 AT |
38 | * Contains an implementation class for a base of binomial heaps. |
39 | */ | |
40 | ||
574dfb67 JW |
41 | #ifdef PB_DS_CLASS_C_DEC |
42 | ||
4569a895 AT |
43 | PB_DS_CLASS_T_DEC |
44 | void | |
45 | PB_DS_CLASS_C_DEC:: | |
46 | pop() | |
47 | { | |
cfca3f72 | 48 | PB_DS_ASSERT_VALID_COND((*this),true) |
f5886803 | 49 | _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); |
4569a895 | 50 | |
8fc81078 | 51 | if (m_p_max == 0) |
4569a895 AT |
52 | find_max(); |
53 | ||
8fc81078 | 54 | _GLIBCXX_DEBUG_ASSERT(m_p_max != 0); |
4569a895 | 55 | node_pointer p_nd = m_p_max; |
4569a895 | 56 | remove_parentless_node(m_p_max); |
4569a895 | 57 | base_type::actual_erase_node(p_nd); |
8fc81078 | 58 | m_p_max = 0; |
cfca3f72 | 59 | PB_DS_ASSERT_VALID_COND((*this),true) |
f5886803 | 60 | } |
4569a895 AT |
61 | |
62 | PB_DS_CLASS_T_DEC | |
63 | void | |
64 | PB_DS_CLASS_C_DEC:: | |
65 | remove_parentless_node(node_pointer p_nd) | |
66 | { | |
8fc81078 PC |
67 | _GLIBCXX_DEBUG_ASSERT(p_nd != 0); |
68 | _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == 0); | |
4569a895 AT |
69 | |
70 | node_pointer p_cur_root = p_nd == base_type::m_p_root? | |
a345e45d | 71 | p_nd->m_p_next_sibling : base_type::m_p_root; |
4569a895 | 72 | |
8fc81078 PC |
73 | if (p_cur_root != 0) |
74 | p_cur_root->m_p_prev_or_parent = 0; | |
4569a895 | 75 | |
8fc81078 | 76 | if (p_nd->m_p_prev_or_parent != 0) |
4569a895 AT |
77 | p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling; |
78 | ||
8fc81078 | 79 | if (p_nd->m_p_next_sibling != 0) |
4569a895 AT |
80 | p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; |
81 | ||
82 | node_pointer p_child = p_nd->m_p_l_child; | |
8fc81078 | 83 | if (p_child != 0) |
4569a895 | 84 | { |
8fc81078 | 85 | p_child->m_p_prev_or_parent = 0; |
8fc81078 | 86 | while (p_child->m_p_next_sibling != 0) |
4569a895 AT |
87 | p_child = p_child->m_p_next_sibling; |
88 | } | |
89 | ||
8fc81078 | 90 | m_p_max = 0; |
4569a895 AT |
91 | base_type::m_p_root = join(p_cur_root, p_child); |
92 | } | |
93 | ||
94 | PB_DS_CLASS_T_DEC | |
95 | inline void | |
96 | PB_DS_CLASS_C_DEC:: | |
97 | clear() | |
98 | { | |
99 | base_type::clear(); | |
8fc81078 | 100 | m_p_max = 0; |
4569a895 AT |
101 | } |
102 | ||
103 | PB_DS_CLASS_T_DEC | |
104 | void | |
105 | PB_DS_CLASS_C_DEC:: | |
106 | erase(point_iterator it) | |
107 | { | |
cfca3f72 | 108 | PB_DS_ASSERT_VALID_COND((*this),true) |
f5886803 | 109 | _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); |
4569a895 AT |
110 | |
111 | base_type::bubble_to_top(it.m_p_nd); | |
4569a895 | 112 | remove_parentless_node(it.m_p_nd); |
4569a895 | 113 | base_type::actual_erase_node(it.m_p_nd); |
8fc81078 | 114 | m_p_max = 0; |
cfca3f72 | 115 | PB_DS_ASSERT_VALID_COND((*this),true) |
f5886803 | 116 | } |
4569a895 AT |
117 | |
118 | PB_DS_CLASS_T_DEC | |
119 | template<typename Pred> | |
120 | typename PB_DS_CLASS_C_DEC::size_type | |
121 | PB_DS_CLASS_C_DEC:: | |
122 | erase_if(Pred pred) | |
123 | { | |
cfca3f72 | 124 | PB_DS_ASSERT_VALID_COND((*this),true) |
4569a895 | 125 | |
f5886803 FD |
126 | if (base_type::empty()) |
127 | { | |
cfca3f72 | 128 | PB_DS_ASSERT_VALID_COND((*this),true) |
f5886803 FD |
129 | return 0; |
130 | } | |
4569a895 AT |
131 | |
132 | base_type::to_linked_list(); | |
4569a895 | 133 | node_pointer p_out = base_type::prune(pred); |
4569a895 | 134 | size_type ersd = 0; |
8fc81078 | 135 | while (p_out != 0) |
4569a895 AT |
136 | { |
137 | ++ersd; | |
4569a895 | 138 | node_pointer p_next = p_out->m_p_next_sibling; |
4569a895 | 139 | base_type::actual_erase_node(p_out); |
4569a895 AT |
140 | p_out = p_next; |
141 | } | |
142 | ||
143 | node_pointer p_cur = base_type::m_p_root; | |
8fc81078 | 144 | base_type::m_p_root = 0; |
8fc81078 | 145 | while (p_cur != 0) |
4569a895 AT |
146 | { |
147 | node_pointer p_next = p_cur->m_p_next_sibling; | |
8fc81078 | 148 | p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = 0; |
4569a895 | 149 | p_cur->m_metadata = 0; |
4569a895 AT |
150 | p_cur->m_p_next_sibling = base_type::m_p_root; |
151 | ||
8fc81078 | 152 | if (base_type::m_p_root != 0) |
4569a895 AT |
153 | base_type::m_p_root->m_p_prev_or_parent = p_cur; |
154 | ||
155 | base_type::m_p_root = p_cur; | |
4569a895 | 156 | base_type::m_p_root = fix(base_type::m_p_root); |
4569a895 AT |
157 | p_cur = p_next; |
158 | } | |
159 | ||
8fc81078 | 160 | m_p_max = 0; |
cfca3f72 | 161 | PB_DS_ASSERT_VALID_COND((*this),true) |
f5886803 | 162 | return ersd; |
4569a895 | 163 | } |
574dfb67 | 164 | #endif |