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 erase_fn_imps.hpp
44 * Contains an implementation class for left_child_next_sibling_heap_.
45 */
46
47 PB_DS_CLASS_T_DEC
48 void
49 PB_DS_CLASS_C_DEC::
clear()50 clear()
51 {
52 clear_imp(m_p_root);
53 _GLIBCXX_DEBUG_ASSERT(m_size == 0);
54 m_p_root = NULL;
55 }
56
57 PB_DS_CLASS_T_DEC
58 inline void
59 PB_DS_CLASS_C_DEC::
actual_erase_node(node_pointer p_nd)60 actual_erase_node(node_pointer p_nd)
61 {
62 _GLIBCXX_DEBUG_ASSERT(m_size > 0);
63 --m_size;
64 p_nd->~node();
65 s_node_allocator.deallocate(p_nd, 1);
66 }
67
68 PB_DS_CLASS_T_DEC
69 void
70 PB_DS_CLASS_C_DEC::
clear_imp(node_pointer p_nd)71 clear_imp(node_pointer p_nd)
72 {
73 while (p_nd != NULL)
74 {
75 clear_imp(p_nd->m_p_l_child);
76 node_pointer p_next = p_nd->m_p_next_sibling;
77 actual_erase_node(p_nd);
78 p_nd = p_next;
79 }
80 }
81
82 PB_DS_CLASS_T_DEC
83 void
84 PB_DS_CLASS_C_DEC::
to_linked_list()85 to_linked_list()
86 {
87 _GLIBCXX_DEBUG_ONLY(assert_valid();)
88 node_pointer p_cur = m_p_root;
89 while (p_cur != NULL)
90 if (p_cur->m_p_l_child != NULL)
91 {
92 node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling;
93 p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling;
94 p_cur->m_p_next_sibling = p_cur->m_p_l_child;
95 p_cur->m_p_l_child = p_child_next;
96 }
97 else
98 p_cur = p_cur->m_p_next_sibling;
99
100 #ifdef _GLIBCXX_DEBUG
101 const_node_pointer p_counter = m_p_root;
102 size_type count = 0;
103 while (p_counter != NULL)
104 {
105 ++count;
106 _GLIBCXX_DEBUG_ASSERT(p_counter->m_p_l_child == NULL);
107 p_counter = p_counter->m_p_next_sibling;
108 }
109 _GLIBCXX_DEBUG_ASSERT(count == m_size);
110 #endif
111 }
112
113 PB_DS_CLASS_T_DEC
114 template<typename Pred>
115 typename PB_DS_CLASS_C_DEC::node_pointer
116 PB_DS_CLASS_C_DEC::
prune(Pred pred)117 prune(Pred pred)
118 {
119 node_pointer p_cur = m_p_root;
120 m_p_root = NULL;
121 node_pointer p_out = NULL;
122 while (p_cur != NULL)
123 {
124 node_pointer p_next = p_cur->m_p_next_sibling;
125 if (pred(p_cur->m_value))
126 {
127 p_cur->m_p_next_sibling = p_out;
128 if (p_out != NULL)
129 p_out->m_p_prev_or_parent = p_cur;
130 p_out = p_cur;
131 }
132 else
133 {
134 p_cur->m_p_next_sibling = m_p_root;
135 if (m_p_root != NULL)
136 m_p_root->m_p_prev_or_parent = p_cur;
137 m_p_root = p_cur;
138 }
139 p_cur = p_next;
140 }
141 return p_out;
142 }
143
144 PB_DS_CLASS_T_DEC
145 void
146 PB_DS_CLASS_C_DEC::
bubble_to_top(node_pointer p_nd)147 bubble_to_top(node_pointer p_nd)
148 {
149 node_pointer p_parent = parent(p_nd);
150 while (p_parent != NULL)
151 {
152 swap_with_parent(p_nd, p_parent);
153 p_parent = parent(p_nd);
154 }
155 }
156
157