]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / include / ext / pb_ds / detail / left_child_next_sibling_heap_ / erase_fn_imps.hpp
CommitLineData
4569a895
AT
1// -*- C++ -*-
2
a5544970 3// Copyright (C) 2005-2019 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/**
a345e45d 37 * @file left_child_next_sibling_heap_/erase_fn_imps.hpp
4569a895
AT
38 * Contains an implementation class for left_child_next_sibling_heap_.
39 */
40
41PB_DS_CLASS_T_DEC
42void
43PB_DS_CLASS_C_DEC::
44clear()
45{
46 clear_imp(m_p_root);
47bea7b8 47 _GLIBCXX_DEBUG_ASSERT(m_size == 0);
8fc81078 48 m_p_root = 0;
4569a895
AT
49}
50
51PB_DS_CLASS_T_DEC
52inline void
53PB_DS_CLASS_C_DEC::
54actual_erase_node(node_pointer p_nd)
55{
47bea7b8 56 _GLIBCXX_DEBUG_ASSERT(m_size > 0);
4569a895 57 --m_size;
4569a895 58 p_nd->~node();
4569a895
AT
59 s_node_allocator.deallocate(p_nd, 1);
60}
61
62PB_DS_CLASS_T_DEC
63void
64PB_DS_CLASS_C_DEC::
65clear_imp(node_pointer p_nd)
66{
8fc81078 67 while (p_nd != 0)
4569a895
AT
68 {
69 clear_imp(p_nd->m_p_l_child);
4569a895 70 node_pointer p_next = p_nd->m_p_next_sibling;
4569a895 71 actual_erase_node(p_nd);
4569a895
AT
72 p_nd = p_next;
73 }
74}
75
76PB_DS_CLASS_T_DEC
77void
78PB_DS_CLASS_C_DEC::
79to_linked_list()
80{
f5886803 81 PB_DS_ASSERT_VALID((*this))
47bea7b8 82 node_pointer p_cur = m_p_root;
8fc81078
PC
83 while (p_cur != 0)
84 if (p_cur->m_p_l_child != 0)
4569a895
AT
85 {
86 node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling;
4569a895 87 p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling;
4569a895 88 p_cur->m_p_next_sibling = p_cur->m_p_l_child;
4569a895
AT
89 p_cur->m_p_l_child = p_child_next;
90 }
91 else
92 p_cur = p_cur->m_p_next_sibling;
93
47bea7b8 94#ifdef _GLIBCXX_DEBUG
a345e45d 95 node_const_pointer p_counter = m_p_root;
4569a895 96 size_type count = 0;
8fc81078 97 while (p_counter != 0)
4569a895
AT
98 {
99 ++count;
8fc81078 100 _GLIBCXX_DEBUG_ASSERT(p_counter->m_p_l_child == 0);
4569a895
AT
101 p_counter = p_counter->m_p_next_sibling;
102 }
47bea7b8
BK
103 _GLIBCXX_DEBUG_ASSERT(count == m_size);
104#endif
4569a895
AT
105}
106
107PB_DS_CLASS_T_DEC
108template<typename Pred>
109typename PB_DS_CLASS_C_DEC::node_pointer
110PB_DS_CLASS_C_DEC::
111prune(Pred pred)
112{
113 node_pointer p_cur = m_p_root;
8fc81078
PC
114 m_p_root = 0;
115 node_pointer p_out = 0;
116 while (p_cur != 0)
4569a895
AT
117 {
118 node_pointer p_next = p_cur->m_p_next_sibling;
4569a895
AT
119 if (pred(p_cur->m_value))
120 {
121 p_cur->m_p_next_sibling = p_out;
8fc81078 122 if (p_out != 0)
4569a895 123 p_out->m_p_prev_or_parent = p_cur;
4569a895
AT
124 p_out = p_cur;
125 }
126 else
127 {
128 p_cur->m_p_next_sibling = m_p_root;
8fc81078 129 if (m_p_root != 0)
4569a895 130 m_p_root->m_p_prev_or_parent = p_cur;
4569a895
AT
131 m_p_root = p_cur;
132 }
4569a895
AT
133 p_cur = p_next;
134 }
4569a895
AT
135 return p_out;
136}
137
138PB_DS_CLASS_T_DEC
139void
140PB_DS_CLASS_C_DEC::
141bubble_to_top(node_pointer p_nd)
142{
143 node_pointer p_parent = parent(p_nd);
8fc81078 144 while (p_parent != 0)
4569a895
AT
145 {
146 swap_with_parent(p_nd, p_parent);
4569a895
AT
147 p_parent = parent(p_nd);
148 }
149}
150