1 // -*- C++ -*- 2 3 // Copyright (C) 2005, 2006, 2009, 2010, 2011 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 pairing_heap_/insert_fn_imps.hpp 38 * Contains an implementation class for a pairing heap. 39 */ 40 41 PB_DS_CLASS_T_DEC 42 inline typename PB_DS_CLASS_C_DEC::point_iterator 43 PB_DS_CLASS_C_DEC:: 44 push(const_reference r_val) 45 { 46 PB_DS_ASSERT_VALID((*this)) 47 node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val); 48 push_imp(p_new_nd); 49 PB_DS_ASSERT_VALID((*this)) 50 return point_iterator(p_new_nd); 51 } 52 53 PB_DS_CLASS_T_DEC 54 inline void 55 PB_DS_CLASS_C_DEC:: 56 push_imp(node_pointer p_nd) 57 { 58 p_nd->m_p_l_child = 0; 59 if (base_type::m_p_root == 0) 60 { 61 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0; 62 base_type::m_p_root = p_nd; 63 } 64 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 65 { 66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0; 67 base_type::make_child_of(base_type::m_p_root, p_nd); 68 PB_DS_ASSERT_NODE_CONSISTENT(p_nd, false) 69 base_type::m_p_root = p_nd; 70 } 71 else 72 { 73 base_type::make_child_of(p_nd, base_type::m_p_root); 74 PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false) 75 } 76 } 77 78 PB_DS_CLASS_T_DEC 79 void 80 PB_DS_CLASS_C_DEC:: 81 modify(point_iterator it, const_reference r_new_val) 82 { 83 PB_DS_ASSERT_VALID((*this)) 84 remove_node(it.m_p_nd); 85 it.m_p_nd->m_value = r_new_val; 86 push_imp(it.m_p_nd); 87 PB_DS_ASSERT_VALID((*this)) 88 } 89
