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 class for a base of binomial heaps.
42 inline typename
PB_DS_CLASS_C_DEC::point_iterator
44 push(const_reference r_val
)
46 _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
48 node_pointer p_nd
= base_type::get_new_node_for_insert(r_val
);
54 _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
56 return point_iterator(p_nd
);
62 insert_node(node_pointer p_nd
)
64 if (base_type::m_p_root
== NULL
)
66 p_nd
->m_p_next_sibling
= p_nd
->m_p_prev_or_parent
=
67 p_nd
->m_p_l_child
= NULL
;
71 base_type::m_p_root
= p_nd
;
76 if (base_type::m_p_root
->m_metadata
> 0)
78 p_nd
->m_p_prev_or_parent
= p_nd
->m_p_l_child
= NULL
;
80 p_nd
->m_p_next_sibling
= base_type::m_p_root
;
82 base_type::m_p_root
->m_p_prev_or_parent
= p_nd
;
84 base_type::m_p_root
= p_nd
;
91 if (Cmp_Fn::operator()(base_type::m_p_root
->m_value
, p_nd
->m_value
))
93 p_nd
->m_p_next_sibling
= base_type::m_p_root
->m_p_next_sibling
;
95 p_nd
->m_p_prev_or_parent
= NULL
;
99 p_nd
->m_p_l_child
= base_type::m_p_root
;
101 base_type::m_p_root
->m_p_prev_or_parent
= p_nd
;
103 base_type::m_p_root
->m_p_next_sibling
= NULL
;
105 base_type::m_p_root
= p_nd
;
109 p_nd
->m_p_next_sibling
= NULL
;
111 p_nd
->m_p_l_child
= NULL
;
113 p_nd
->m_p_prev_or_parent
= base_type::m_p_root
;
115 p_nd
->m_metadata
= 0;
117 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_root
->m_p_l_child
== 0);
118 base_type::m_p_root
->m_p_l_child
= p_nd
;
120 base_type::m_p_root
->m_metadata
= 1;
123 base_type::m_p_root
= fix(base_type::m_p_root
);
127 inline typename
PB_DS_CLASS_C_DEC::node_pointer
129 fix(node_pointer p_nd
) const
131 while (p_nd
->m_p_next_sibling
!= NULL
&&
132 p_nd
->m_metadata
== p_nd
->m_p_next_sibling
->m_metadata
)
134 node_pointer p_next
= p_nd
->m_p_next_sibling
;
136 if (Cmp_Fn::operator()(p_nd
->m_value
, p_next
->m_value
))
138 p_next
->m_p_prev_or_parent
=
139 p_nd
->m_p_prev_or_parent
;
141 if (p_nd
->m_p_prev_or_parent
!= NULL
)
142 p_nd
->m_p_prev_or_parent
->m_p_next_sibling
= p_next
;
144 base_type::make_child_of(p_nd
, p_next
);
146 ++p_next
->m_metadata
;
152 p_nd
->m_p_next_sibling
= p_next
->m_p_next_sibling
;
154 if (p_nd
->m_p_next_sibling
!= NULL
)
155 p_next
->m_p_next_sibling
= NULL
;
157 base_type::make_child_of(p_next
, p_nd
);
163 if (p_nd
->m_p_next_sibling
!= NULL
)
164 p_nd
->m_p_next_sibling
->m_p_prev_or_parent
= p_nd
;
172 modify(point_iterator it
, const_reference r_new_val
)
174 _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
175 node_pointer p_nd
= it
.m_p_nd
;
177 _GLIBCXX_DEBUG_ASSERT(p_nd
!= NULL
);
178 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd
, false);)
180 const bool bubble_up
= Cmp_Fn::operator()(p_nd
->m_value
, r_new_val
);
182 p_nd
->m_value
= r_new_val
;
186 node_pointer p_parent
= base_type::parent(p_nd
);
188 while (p_parent
!= NULL
&&
189 Cmp_Fn::operator()(p_parent
->m_value
, p_nd
->m_value
))
191 base_type::swap_with_parent(p_nd
, p_parent
);
193 p_parent
= base_type::parent(p_nd
);
196 if (p_nd
->m_p_prev_or_parent
== NULL
)
197 base_type::m_p_root
= p_nd
;
201 _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
206 base_type::bubble_to_top(p_nd
);
208 remove_parentless_node(p_nd
);
214 _GLIBCXX_DEBUG_ONLY(assert_valid(true);)