libstdc++
pairing_heap_/insert_fn_imps.hpp
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc.
00004 //
00005 // This file is part of the GNU ISO C++ Library.  This library is free
00006 // software; you can redistribute it and/or modify it under the terms
00007 // of the GNU General Public License as published by the Free Software
00008 // Foundation; either version 3, or (at your option) any later
00009 // version.
00010 
00011 // This library is distributed in the hope that it will be useful, but
00012 // WITHOUT ANY WARRANTY; without even the implied warranty of
00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00014 // General Public License for more details.
00015 
00016 // Under Section 7 of GPL version 3, you are granted additional
00017 // permissions described in the GCC Runtime Library Exception, version
00018 // 3.1, as published by the Free Software Foundation.
00019 
00020 // You should have received a copy of the GNU General Public License and
00021 // a copy of the GCC Runtime Library Exception along with this program;
00022 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
00023 // <http://www.gnu.org/licenses/>.
00024 
00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
00026 
00027 // Permission to use, copy, modify, sell, and distribute this software
00028 // is hereby granted without fee, provided that the above copyright
00029 // notice appears in all copies, and that both that copyright notice
00030 // and this permission notice appear in supporting documentation. None
00031 // of the above authors, nor IBM Haifa Research Laboratories, make any
00032 // representation about the suitability of this software for any
00033 // purpose. It is provided "as is" without express or implied
00034 // warranty.
00035 
00036 /**
00037  * @file pairing_heap_/insert_fn_imps.hpp
00038  * Contains an implementation class for a pairing heap.
00039  */
00040 
00041 PB_DS_CLASS_T_DEC
00042 inline typename PB_DS_CLASS_C_DEC::point_iterator
00043 PB_DS_CLASS_C_DEC::
00044 push(const_reference r_val)
00045 {
00046   PB_DS_ASSERT_VALID((*this))
00047   node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val);
00048   push_imp(p_new_nd);
00049   PB_DS_ASSERT_VALID((*this))
00050   return point_iterator(p_new_nd);
00051 }
00052 
00053 PB_DS_CLASS_T_DEC
00054 inline void
00055 PB_DS_CLASS_C_DEC::
00056 push_imp(node_pointer p_nd)
00057 {
00058   p_nd->m_p_l_child = 0;
00059   if (base_type::m_p_root == 0)
00060     {
00061       p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
00062       base_type::m_p_root = p_nd;
00063     }
00064   else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
00065     {
00066       p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
00067       base_type::make_child_of(base_type::m_p_root, p_nd);
00068       PB_DS_ASSERT_NODE_CONSISTENT(p_nd, false)
00069       base_type::m_p_root = p_nd;
00070     }
00071   else
00072     {
00073       base_type::make_child_of(p_nd, base_type::m_p_root);
00074       PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false)
00075     }
00076 }
00077 
00078 PB_DS_CLASS_T_DEC
00079 void
00080 PB_DS_CLASS_C_DEC::
00081 modify(point_iterator it, const_reference r_new_val)
00082 {
00083   PB_DS_ASSERT_VALID((*this))
00084   remove_node(it.m_p_nd);
00085   it.m_p_nd->m_value = r_new_val;
00086   push_imp(it.m_p_nd);
00087   PB_DS_ASSERT_VALID((*this))
00088 }