1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006 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 2, 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// You should have received a copy of the GNU General Public License 17// along with this library; see the file COPYING. If not, write to 18// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19// MA 02111-1307, USA. 20 21// As a special exception, you may use this file as part of a free 22// software library without restriction. Specifically, if other files 23// instantiate templates or use macros or inline functions from this 24// file, or you compile this file and link it with other files to 25// produce an executable, this file does not by itself cause the 26// resulting executable to be covered by the GNU General Public 27// License. This exception does not however invalidate any other 28// reasons why the executable file might be covered by the GNU General 29// Public License. 30 31// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32 33// Permission to use, copy, modify, sell, and distribute this software 34// is hereby granted without fee, provided that the above copyright 35// notice appears in all copies, and that both that copyright notice 36// and this permission notice appear in supporting documentation. None 37// of the above authors, nor IBM Haifa Research Laboratories, make any 38// representation about the suitability of this software for any 39// purpose. It is provided "as is" without express or implied 40// warranty. 41 42/** 43 * @file rotate_fn_imps.hpp 44 * Contains imps for rotating nodes. 45 */ 46 47PB_DS_CLASS_T_DEC 48inline void 49PB_DS_CLASS_C_DEC:: 50rotate_left(node_pointer p_x) 51{ 52 node_pointer p_y = p_x->m_p_right; 53 54 p_x->m_p_right = p_y->m_p_left; 55 56 if (p_y->m_p_left != NULL) 57 p_y->m_p_left->m_p_parent = p_x; 58 59 p_y->m_p_parent = p_x->m_p_parent; 60 61 if (p_x == m_p_head->m_p_parent) 62 m_p_head->m_p_parent = p_y; 63 else if (p_x == p_x->m_p_parent->m_p_left) 64 p_x->m_p_parent->m_p_left = p_y; 65 else 66 p_x->m_p_parent->m_p_right = p_y; 67 68 p_y->m_p_left = p_x; 69 p_x->m_p_parent = p_y; 70 71 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_x);) 72 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y);) 73 74 apply_update(p_x, (node_update* )this); 75 apply_update(p_x->m_p_parent, (node_update* )this); 76} 77 78PB_DS_CLASS_T_DEC 79inline void 80PB_DS_CLASS_C_DEC:: 81rotate_right(node_pointer p_x) 82{ 83 node_pointer p_y = p_x->m_p_left; 84 85 p_x->m_p_left = p_y->m_p_right; 86 87 if (p_y->m_p_right != NULL) 88 p_y->m_p_right->m_p_parent = p_x; 89 90 p_y->m_p_parent = p_x->m_p_parent; 91 92 if (p_x == m_p_head->m_p_parent) 93 m_p_head->m_p_parent = p_y; 94 else if (p_x == p_x->m_p_parent->m_p_right) 95 p_x->m_p_parent->m_p_right = p_y; 96 else 97 p_x->m_p_parent->m_p_left = p_y; 98 99 p_y->m_p_right = p_x; 100 p_x->m_p_parent = p_y; 101 102 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_x);) 103 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y);) 104 105 apply_update(p_x, (node_update* )this); 106 apply_update(p_x->m_p_parent, (node_update* )this); 107} 108 109PB_DS_CLASS_T_DEC 110inline void 111PB_DS_CLASS_C_DEC:: 112rotate_parent(node_pointer p_nd) 113{ 114 node_pointer p_parent = p_nd->m_p_parent; 115 116 if (p_nd == p_parent->m_p_left) 117 rotate_right(p_parent); 118 else 119 rotate_left(p_parent); 120 121 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd); 122 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || 123 p_nd->m_p_right == p_parent); 124} 125 126PB_DS_CLASS_T_DEC 127inline void 128PB_DS_CLASS_C_DEC:: 129apply_update(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/) 130{ } 131 132PB_DS_CLASS_T_DEC 133template<typename Node_Update_> 134inline void 135PB_DS_CLASS_C_DEC:: 136apply_update(node_pointer p_nd, Node_Update_* /*p_update*/) 137{ 138 node_update::operator()( 139 node_iterator(p_nd), 140 const_node_iterator(static_cast<node_pointer>(NULL))); 141} 142 143PB_DS_CLASS_T_DEC 144template<typename Node_Update_> 145inline void 146PB_DS_CLASS_C_DEC:: 147update_to_top(node_pointer p_nd, Node_Update_* p_update) 148{ 149 while (p_nd != m_p_head) 150 { 151 apply_update(p_nd, p_update); 152 153 p_nd = p_nd->m_p_parent; 154 } 155} 156 157PB_DS_CLASS_T_DEC 158inline void 159PB_DS_CLASS_C_DEC:: 160update_to_top(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/) 161{ } 162 163