1169691Skan// -*- C++ -*- 2169691Skan 3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc. 4169691Skan// 5169691Skan// This file is part of the GNU ISO C++ Library. This library is free 6169691Skan// software; you can redistribute it and/or modify it under the terms 7169691Skan// of the GNU General Public License as published by the Free Software 8169691Skan// Foundation; either version 2, or (at your option) any later 9169691Skan// version. 10169691Skan 11169691Skan// This library is distributed in the hope that it will be useful, but 12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of 13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14169691Skan// General Public License for more details. 15169691Skan 16169691Skan// You should have received a copy of the GNU General Public License 17169691Skan// along with this library; see the file COPYING. If not, write to 18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19169691Skan// MA 02111-1307, USA. 20169691Skan 21169691Skan// As a special exception, you may use this file as part of a free 22169691Skan// software library without restriction. Specifically, if other files 23169691Skan// instantiate templates or use macros or inline functions from this 24169691Skan// file, or you compile this file and link it with other files to 25169691Skan// produce an executable, this file does not by itself cause the 26169691Skan// resulting executable to be covered by the GNU General Public 27169691Skan// License. This exception does not however invalidate any other 28169691Skan// reasons why the executable file might be covered by the GNU General 29169691Skan// Public License. 30169691Skan 31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32169691Skan 33169691Skan// Permission to use, copy, modify, sell, and distribute this software 34169691Skan// is hereby granted without fee, provided that the above copyright 35169691Skan// notice appears in all copies, and that both that copyright notice 36169691Skan// and this permission notice appear in supporting documentation. None 37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any 38169691Skan// representation about the suitability of this software for any 39169691Skan// purpose. It is provided "as is" without express or implied 40169691Skan// warranty. 41169691Skan 42169691Skan/** 43169691Skan * @file erase_fn_imps.hpp 44169691Skan * Contains an implementation class for left_child_next_sibling_heap_. 45169691Skan */ 46169691Skan 47169691SkanPB_DS_CLASS_T_DEC 48169691Skanvoid 49169691SkanPB_DS_CLASS_C_DEC:: 50169691Skanclear() 51169691Skan{ 52169691Skan clear_imp(m_p_root); 53169691Skan _GLIBCXX_DEBUG_ASSERT(m_size == 0); 54169691Skan m_p_root = NULL; 55169691Skan} 56169691Skan 57169691SkanPB_DS_CLASS_T_DEC 58169691Skaninline void 59169691SkanPB_DS_CLASS_C_DEC:: 60169691Skanactual_erase_node(node_pointer p_nd) 61169691Skan{ 62169691Skan _GLIBCXX_DEBUG_ASSERT(m_size > 0); 63169691Skan --m_size; 64169691Skan p_nd->~node(); 65169691Skan s_node_allocator.deallocate(p_nd, 1); 66169691Skan} 67169691Skan 68169691SkanPB_DS_CLASS_T_DEC 69169691Skanvoid 70169691SkanPB_DS_CLASS_C_DEC:: 71169691Skanclear_imp(node_pointer p_nd) 72169691Skan{ 73169691Skan while (p_nd != NULL) 74169691Skan { 75169691Skan clear_imp(p_nd->m_p_l_child); 76169691Skan node_pointer p_next = p_nd->m_p_next_sibling; 77169691Skan actual_erase_node(p_nd); 78169691Skan p_nd = p_next; 79169691Skan } 80169691Skan} 81169691Skan 82169691SkanPB_DS_CLASS_T_DEC 83169691Skanvoid 84169691SkanPB_DS_CLASS_C_DEC:: 85169691Skanto_linked_list() 86169691Skan{ 87169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 88169691Skan node_pointer p_cur = m_p_root; 89169691Skan while (p_cur != NULL) 90169691Skan if (p_cur->m_p_l_child != NULL) 91169691Skan { 92169691Skan node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling; 93169691Skan p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling; 94169691Skan p_cur->m_p_next_sibling = p_cur->m_p_l_child; 95169691Skan p_cur->m_p_l_child = p_child_next; 96169691Skan } 97169691Skan else 98169691Skan p_cur = p_cur->m_p_next_sibling; 99169691Skan 100169691Skan#ifdef _GLIBCXX_DEBUG 101169691Skan const_node_pointer p_counter = m_p_root; 102169691Skan size_type count = 0; 103169691Skan while (p_counter != NULL) 104169691Skan { 105169691Skan ++count; 106169691Skan _GLIBCXX_DEBUG_ASSERT(p_counter->m_p_l_child == NULL); 107169691Skan p_counter = p_counter->m_p_next_sibling; 108169691Skan } 109169691Skan _GLIBCXX_DEBUG_ASSERT(count == m_size); 110169691Skan#endif 111169691Skan} 112169691Skan 113169691SkanPB_DS_CLASS_T_DEC 114169691Skantemplate<typename Pred> 115169691Skantypename PB_DS_CLASS_C_DEC::node_pointer 116169691SkanPB_DS_CLASS_C_DEC:: 117169691Skanprune(Pred pred) 118169691Skan{ 119169691Skan node_pointer p_cur = m_p_root; 120169691Skan m_p_root = NULL; 121169691Skan node_pointer p_out = NULL; 122169691Skan while (p_cur != NULL) 123169691Skan { 124169691Skan node_pointer p_next = p_cur->m_p_next_sibling; 125169691Skan if (pred(p_cur->m_value)) 126169691Skan { 127169691Skan p_cur->m_p_next_sibling = p_out; 128169691Skan if (p_out != NULL) 129169691Skan p_out->m_p_prev_or_parent = p_cur; 130169691Skan p_out = p_cur; 131169691Skan } 132169691Skan else 133169691Skan { 134169691Skan p_cur->m_p_next_sibling = m_p_root; 135169691Skan if (m_p_root != NULL) 136169691Skan m_p_root->m_p_prev_or_parent = p_cur; 137169691Skan m_p_root = p_cur; 138169691Skan } 139169691Skan p_cur = p_next; 140169691Skan } 141169691Skan return p_out; 142169691Skan} 143169691Skan 144169691SkanPB_DS_CLASS_T_DEC 145169691Skanvoid 146169691SkanPB_DS_CLASS_C_DEC:: 147169691Skanbubble_to_top(node_pointer p_nd) 148169691Skan{ 149169691Skan node_pointer p_parent = parent(p_nd); 150169691Skan while (p_parent != NULL) 151169691Skan { 152169691Skan swap_with_parent(p_nd, p_parent); 153169691Skan p_parent = parent(p_nd); 154169691Skan } 155169691Skan} 156169691Skan 157