libstdc++
|
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 rc_binomial_heap_/insert_fn_imps.hpp 00038 * Contains an implementation for rc_binomial_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 00048 make_0_exposed(); 00049 00050 PB_DS_ASSERT_VALID((*this)) 00051 00052 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 00053 00054 p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = 0; 00055 p_nd->m_metadata = 0; 00056 00057 if (base_type::m_p_max == 0 || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val)) 00058 base_type::m_p_max = p_nd; 00059 00060 p_nd->m_p_next_sibling = base_type::m_p_root; 00061 00062 if (base_type::m_p_root != 0) 00063 base_type::m_p_root->m_p_prev_or_parent = p_nd; 00064 00065 base_type::m_p_root = p_nd; 00066 00067 if (p_nd->m_p_next_sibling != 0&& p_nd->m_p_next_sibling->m_metadata == 0) 00068 m_rc.push(p_nd); 00069 00070 PB_DS_ASSERT_VALID((*this)) 00071 00072 return point_iterator(p_nd); 00073 } 00074 00075 PB_DS_CLASS_T_DEC 00076 void 00077 PB_DS_CLASS_C_DEC:: 00078 modify(point_iterator it, const_reference r_new_val) 00079 { 00080 PB_DS_ASSERT_VALID((*this)) 00081 00082 make_binomial_heap(); 00083 00084 base_type::modify(it, r_new_val); 00085 00086 base_type::find_max(); 00087 00088 PB_DS_ASSERT_VALID((*this)) 00089 } 00090 00091 PB_DS_CLASS_T_DEC 00092 inline typename PB_DS_CLASS_C_DEC::node_pointer 00093 PB_DS_CLASS_C_DEC:: 00094 link_with_next_sibling(node_pointer p_nd) 00095 { 00096 node_pointer p_next = p_nd->m_p_next_sibling; 00097 00098 _GLIBCXX_DEBUG_ASSERT(p_next != 0); 00099 _GLIBCXX_DEBUG_ASSERT(p_next->m_p_prev_or_parent == p_nd); 00100 00101 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) 00102 { 00103 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; 00104 00105 if (p_next->m_p_prev_or_parent == 0) 00106 base_type::m_p_root = p_next; 00107 else 00108 p_next->m_p_prev_or_parent->m_p_next_sibling = p_next; 00109 00110 if (base_type::m_p_max == p_nd) 00111 base_type::m_p_max = p_next; 00112 00113 base_type::make_child_of(p_nd, p_next); 00114 00115 ++p_next->m_metadata; 00116 00117 return p_next; 00118 } 00119 00120 p_nd->m_p_next_sibling = p_next->m_p_next_sibling; 00121 00122 if (p_nd->m_p_next_sibling != 0) 00123 p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd; 00124 00125 if (base_type::m_p_max == p_next) 00126 base_type::m_p_max = p_nd; 00127 00128 base_type::make_child_of(p_next, p_nd); 00129 00130 ++p_nd->m_metadata; 00131 00132 return p_nd; 00133 } 00134 00135 PB_DS_CLASS_T_DEC 00136 void 00137 PB_DS_CLASS_C_DEC:: 00138 make_0_exposed() 00139 { 00140 if (m_rc.empty()) 00141 return; 00142 00143 node_pointer p_nd = m_rc.top(); 00144 00145 m_rc.pop(); 00146 00147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling != 0); 00148 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata); 00149 00150 node_pointer p_res = link_with_next_sibling(p_nd); 00151 00152 if (p_res->m_p_next_sibling != 0&& p_res->m_metadata == p_res->m_p_next_sibling->m_metadata) 00153 m_rc.push(p_res); 00154 }