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