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 insert_fn_imps.hpp 44169691Skan * Contains an implementation for rc_binomial_heap_. 45169691Skan */ 46169691Skan 47169691SkanPB_DS_CLASS_T_DEC 48169691Skaninline typename PB_DS_CLASS_C_DEC::point_iterator 49169691SkanPB_DS_CLASS_C_DEC:: 50169691Skanpush(const_reference r_val) 51169691Skan{ 52169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 53169691Skan 54169691Skan make_0_exposed(); 55169691Skan 56169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 57169691Skan 58169691Skan node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 59169691Skan 60169691Skan p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = NULL; 61169691Skan p_nd->m_metadata = 0; 62169691Skan 63169691Skan if (base_type::m_p_max == NULL || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val)) 64169691Skan base_type::m_p_max = p_nd; 65169691Skan 66169691Skan p_nd->m_p_next_sibling = base_type::m_p_root; 67169691Skan 68169691Skan if (base_type::m_p_root != NULL) 69169691Skan base_type::m_p_root->m_p_prev_or_parent = p_nd; 70169691Skan 71169691Skan base_type::m_p_root = p_nd; 72169691Skan 73169691Skan if (p_nd->m_p_next_sibling != NULL&& p_nd->m_p_next_sibling->m_metadata == 0) 74169691Skan m_rc.push(p_nd); 75169691Skan 76169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 77169691Skan 78169691Skan return point_iterator(p_nd); 79169691Skan} 80169691Skan 81169691SkanPB_DS_CLASS_T_DEC 82169691Skanvoid 83169691SkanPB_DS_CLASS_C_DEC:: 84169691Skanmodify(point_iterator it, const_reference r_new_val) 85169691Skan{ 86169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 87169691Skan 88169691Skan make_binomial_heap(); 89169691Skan 90169691Skan base_type::modify(it, r_new_val); 91169691Skan 92169691Skan base_type::find_max(); 93169691Skan 94169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 95169691Skan } 96169691Skan 97169691SkanPB_DS_CLASS_T_DEC 98169691Skaninline typename PB_DS_CLASS_C_DEC::node_pointer 99169691SkanPB_DS_CLASS_C_DEC:: 100169691Skanlink_with_next_sibling(node_pointer p_nd) 101169691Skan{ 102169691Skan node_pointer p_next = p_nd->m_p_next_sibling; 103169691Skan 104169691Skan _GLIBCXX_DEBUG_ASSERT(p_next != NULL); 105169691Skan _GLIBCXX_DEBUG_ASSERT(p_next->m_p_prev_or_parent == p_nd); 106169691Skan 107169691Skan if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) 108169691Skan { 109169691Skan p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; 110169691Skan 111169691Skan if (p_next->m_p_prev_or_parent == NULL) 112169691Skan base_type::m_p_root = p_next; 113169691Skan else 114169691Skan p_next->m_p_prev_or_parent->m_p_next_sibling = p_next; 115169691Skan 116169691Skan if (base_type::m_p_max == p_nd) 117169691Skan base_type::m_p_max = p_next; 118169691Skan 119169691Skan base_type::make_child_of(p_nd, p_next); 120169691Skan 121169691Skan ++p_next->m_metadata; 122169691Skan 123169691Skan return p_next; 124169691Skan } 125169691Skan 126169691Skan p_nd->m_p_next_sibling = p_next->m_p_next_sibling; 127169691Skan 128169691Skan if (p_nd->m_p_next_sibling != NULL) 129169691Skan p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd; 130169691Skan 131169691Skan if (base_type::m_p_max == p_next) 132169691Skan base_type::m_p_max = p_nd; 133169691Skan 134169691Skan base_type::make_child_of(p_next, p_nd); 135169691Skan 136169691Skan ++p_nd->m_metadata; 137169691Skan 138169691Skan return p_nd; 139169691Skan} 140169691Skan 141169691SkanPB_DS_CLASS_T_DEC 142169691Skanvoid 143169691SkanPB_DS_CLASS_C_DEC:: 144169691Skanmake_0_exposed() 145169691Skan{ 146169691Skan if (m_rc.empty()) 147169691Skan return; 148169691Skan 149169691Skan node_pointer p_nd = m_rc.top(); 150169691Skan 151169691Skan m_rc.pop(); 152169691Skan 153169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling != NULL); 154169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata); 155169691Skan 156169691Skan node_pointer p_res = link_with_next_sibling(p_nd); 157169691Skan 158169691Skan if (p_res->m_p_next_sibling != NULL&& p_res->m_metadata == p_res->m_p_next_sibling->m_metadata) 159169691Skan m_rc.push(p_res); 160169691Skan} 161