3 // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
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
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file insert_fn_imps.hpp
38 * Contains an implementation for rc_binomial_heap_.
42 inline typename
PB_DS_CLASS_C_DEC::point_iterator
44 push(const_reference r_val
)
46 _GLIBCXX_DEBUG_ONLY(assert_valid();)
50 _GLIBCXX_DEBUG_ONLY(assert_valid();)
52 node_pointer p_nd
= base_type::get_new_node_for_insert(r_val
);
54 p_nd
->m_p_l_child
= p_nd
->m_p_prev_or_parent
= NULL
;
57 if (base_type::m_p_max
== NULL
|| Cmp_Fn::operator()(base_type::m_p_max
->m_value
, r_val
))
58 base_type::m_p_max
= p_nd
;
60 p_nd
->m_p_next_sibling
= base_type::m_p_root
;
62 if (base_type::m_p_root
!= NULL
)
63 base_type::m_p_root
->m_p_prev_or_parent
= p_nd
;
65 base_type::m_p_root
= p_nd
;
67 if (p_nd
->m_p_next_sibling
!= NULL
&& p_nd
->m_p_next_sibling
->m_metadata
== 0)
70 _GLIBCXX_DEBUG_ONLY(assert_valid();)
72 return point_iterator(p_nd
);
78 modify(point_iterator it
, const_reference r_new_val
)
80 _GLIBCXX_DEBUG_ONLY(assert_valid();)
84 base_type::modify(it
, r_new_val
);
86 base_type::find_max();
88 _GLIBCXX_DEBUG_ONLY(assert_valid();)
92 inline typename
PB_DS_CLASS_C_DEC::node_pointer
94 link_with_next_sibling(node_pointer p_nd
)
96 node_pointer p_next
= p_nd
->m_p_next_sibling
;
98 _GLIBCXX_DEBUG_ASSERT(p_next
!= NULL
);
99 _GLIBCXX_DEBUG_ASSERT(p_next
->m_p_prev_or_parent
== p_nd
);
101 if (Cmp_Fn::operator()(p_nd
->m_value
, p_next
->m_value
))
103 p_next
->m_p_prev_or_parent
= p_nd
->m_p_prev_or_parent
;
105 if (p_next
->m_p_prev_or_parent
== NULL
)
106 base_type::m_p_root
= p_next
;
108 p_next
->m_p_prev_or_parent
->m_p_next_sibling
= p_next
;
110 if (base_type::m_p_max
== p_nd
)
111 base_type::m_p_max
= p_next
;
113 base_type::make_child_of(p_nd
, p_next
);
115 ++p_next
->m_metadata
;
120 p_nd
->m_p_next_sibling
= p_next
->m_p_next_sibling
;
122 if (p_nd
->m_p_next_sibling
!= NULL
)
123 p_nd
->m_p_next_sibling
->m_p_prev_or_parent
= p_nd
;
125 if (base_type::m_p_max
== p_next
)
126 base_type::m_p_max
= p_nd
;
128 base_type::make_child_of(p_next
, p_nd
);
143 node_pointer p_nd
= m_rc
.top();
147 _GLIBCXX_DEBUG_ASSERT(p_nd
->m_p_next_sibling
!= NULL
);
148 _GLIBCXX_DEBUG_ASSERT(p_nd
->m_metadata
== p_nd
->m_p_next_sibling
->m_metadata
);
150 node_pointer p_res
= link_with_next_sibling(p_nd
);
152 if (p_res
->m_p_next_sibling
!= NULL
&& p_res
->m_metadata
== p_res
->m_p_next_sibling
->m_metadata
)