3 // Copyright (C) 2005, 2006, 2009 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 erase_fn_imps.hpp
38 * Contains an implementation class for left_child_next_sibling_heap_.
47 _GLIBCXX_DEBUG_ASSERT(m_size
== 0);
54 actual_erase_node(node_pointer p_nd
)
56 _GLIBCXX_DEBUG_ASSERT(m_size
> 0);
59 s_node_allocator
.deallocate(p_nd
, 1);
65 clear_imp(node_pointer p_nd
)
69 clear_imp(p_nd
->m_p_l_child
);
70 node_pointer p_next
= p_nd
->m_p_next_sibling
;
71 actual_erase_node(p_nd
);
81 _GLIBCXX_DEBUG_ONLY(assert_valid();)
82 node_pointer p_cur
= m_p_root
;
84 if (p_cur
->m_p_l_child
!= NULL
)
86 node_pointer p_child_next
= p_cur
->m_p_l_child
->m_p_next_sibling
;
87 p_cur
->m_p_l_child
->m_p_next_sibling
= p_cur
->m_p_next_sibling
;
88 p_cur
->m_p_next_sibling
= p_cur
->m_p_l_child
;
89 p_cur
->m_p_l_child
= p_child_next
;
92 p_cur
= p_cur
->m_p_next_sibling
;
95 const_node_pointer p_counter
= m_p_root
;
97 while (p_counter
!= NULL
)
100 _GLIBCXX_DEBUG_ASSERT(p_counter
->m_p_l_child
== NULL
);
101 p_counter
= p_counter
->m_p_next_sibling
;
103 _GLIBCXX_DEBUG_ASSERT(count
== m_size
);
108 template<typename Pred
>
109 typename
PB_DS_CLASS_C_DEC::node_pointer
113 node_pointer p_cur
= m_p_root
;
115 node_pointer p_out
= NULL
;
116 while (p_cur
!= NULL
)
118 node_pointer p_next
= p_cur
->m_p_next_sibling
;
119 if (pred(p_cur
->m_value
))
121 p_cur
->m_p_next_sibling
= p_out
;
123 p_out
->m_p_prev_or_parent
= p_cur
;
128 p_cur
->m_p_next_sibling
= m_p_root
;
129 if (m_p_root
!= NULL
)
130 m_p_root
->m_p_prev_or_parent
= p_cur
;
141 bubble_to_top(node_pointer p_nd
)
143 node_pointer p_parent
= parent(p_nd
);
144 while (p_parent
!= NULL
)
146 swap_with_parent(p_nd
, p_parent
);
147 p_parent
= parent(p_nd
);