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 splay_tree_. 45169691Skan */ 46169691Skan 47169691SkanPB_DS_CLASS_T_DEC 48169691Skaninline bool 49169691SkanPB_DS_CLASS_C_DEC:: 50169691Skanerase(const_key_reference r_key) 51169691Skan{ 52169691Skan point_iterator it = find(r_key); 53169691Skan if (it == base_type::end()) 54169691Skan return false; 55169691Skan erase(it); 56169691Skan return true; 57169691Skan} 58169691Skan 59169691SkanPB_DS_CLASS_T_DEC 60169691Skaninline typename PB_DS_CLASS_C_DEC::iterator 61169691SkanPB_DS_CLASS_C_DEC:: 62169691Skanerase(iterator it) 63169691Skan{ 64169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid()); 65169691Skan if (it == base_type::end()) 66169691Skan return it; 67169691Skan iterator ret_it = it; 68169691Skan ++ret_it; 69169691Skan erase_node(it.m_p_nd); 70169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid()); 71169691Skan return ret_it; 72169691Skan} 73169691Skan 74169691SkanPB_DS_CLASS_T_DEC 75169691Skaninline typename PB_DS_CLASS_C_DEC::reverse_iterator 76169691SkanPB_DS_CLASS_C_DEC:: 77169691Skanerase(reverse_iterator it) 78169691Skan{ 79169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid()); 80169691Skan if (it.m_p_nd == base_type::m_p_head) 81169691Skan return (it); 82169691Skan reverse_iterator ret_it = it; 83169691Skan ++ret_it; 84169691Skan erase_node(it.m_p_nd); 85169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid()); 86169691Skan return ret_it; 87169691Skan} 88169691Skan 89169691SkanPB_DS_CLASS_T_DEC 90169691Skantemplate<typename Pred> 91169691Skaninline typename PB_DS_CLASS_C_DEC::size_type 92169691SkanPB_DS_CLASS_C_DEC:: 93169691Skanerase_if(Pred pred) 94169691Skan{ 95169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 96169691Skan size_type num_ersd = 0; 97169691Skan iterator it = base_type::begin(); 98169691Skan while (it != base_type::end()) 99169691Skan { 100169691Skan if (pred(*it)) 101169691Skan { 102169691Skan ++num_ersd; 103169691Skan it = erase(it); 104169691Skan } 105169691Skan else 106169691Skan ++it; 107169691Skan } 108169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 109169691Skan return num_ersd; 110169691Skan} 111169691Skan 112169691SkanPB_DS_CLASS_T_DEC 113169691Skanvoid 114169691SkanPB_DS_CLASS_C_DEC:: 115169691Skanerase_node(node_pointer p_nd) 116169691Skan{ 117169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd != NULL); 118169691Skan splay(p_nd); 119169691Skan 120169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 121169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); 122169691Skan 123169691Skan node_pointer p_l = p_nd->m_p_left; 124169691Skan node_pointer p_r = p_nd->m_p_right; 125169691Skan 126169691Skan base_type::update_min_max_for_erased_node(p_nd); 127169691Skan base_type::actual_erase_node(p_nd); 128169691Skan if (p_r == NULL) 129169691Skan { 130169691Skan base_type::m_p_head->m_p_parent = p_l; 131169691Skan if (p_l != NULL) 132169691Skan p_l->m_p_parent = base_type::m_p_head; 133169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 134169691Skan return; 135169691Skan } 136169691Skan 137169691Skan node_pointer p_target_r = leftmost(p_r); 138169691Skan _GLIBCXX_DEBUG_ASSERT(p_target_r != NULL); 139169691Skan p_r->m_p_parent = base_type::m_p_head; 140169691Skan base_type::m_p_head->m_p_parent = p_r; 141169691Skan splay(p_target_r); 142169691Skan 143169691Skan _GLIBCXX_DEBUG_ONLY(p_target_r->m_p_left = NULL); 144169691Skan _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_parent == this->m_p_head); 145169691Skan _GLIBCXX_DEBUG_ASSERT(this->m_p_head->m_p_parent == p_target_r); 146169691Skan 147169691Skan p_target_r->m_p_left = p_l; 148169691Skan if (p_l != NULL) 149169691Skan p_l->m_p_parent = p_target_r; 150169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 151169691Skan apply_update(p_target_r, (node_update* )this); 152169691Skan} 153169691Skan 154169691SkanPB_DS_CLASS_T_DEC 155169691Skaninline typename PB_DS_CLASS_C_DEC::node_pointer 156169691SkanPB_DS_CLASS_C_DEC:: 157169691Skanleftmost(node_pointer p_nd) 158169691Skan{ 159169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd != NULL); 160169691Skan while (p_nd->m_p_left != NULL) 161169691Skan p_nd = p_nd->m_p_left; 162169691Skan return p_nd; 163169691Skan} 164