3 // Copyright (C) 2005, 2006 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 2, 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 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
43 * @file insert_fn_imps.hpp
44 * Contains an implementation for thin_heap_.
48 inline typename PB_DS_CLASS_C_DEC::point_iterator
50 push(const_reference r_val)
52 _GLIBCXX_DEBUG_ONLY(assert_valid();)
54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
58 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL;
60 if (base_type::m_p_root == NULL)
62 p_nd->m_p_next_sibling = NULL;
64 m_p_max = base_type::m_p_root = p_nd;
66 _GLIBCXX_DEBUG_ONLY(assert_valid();)
68 return point_iterator(p_nd);
71 p_nd->m_p_next_sibling = base_type::m_p_root;
73 base_type::m_p_root->m_p_prev_or_parent = NULL;
75 base_type::m_p_root = p_nd;
79 _GLIBCXX_DEBUG_ONLY(assert_valid();)
81 return point_iterator(p_nd);
87 make_root(node_pointer p_nd)
90 p_nd->m_p_l_child == NULL?
92 1 + p_nd->m_p_l_child->m_metadata;
98 make_root_and_link(node_pointer p_nd)
102 p_nd->m_p_prev_or_parent = NULL;
104 p_nd->m_p_next_sibling = base_type::m_p_root;
106 if (base_type::m_p_root != NULL)
107 base_type::m_p_root->m_p_prev_or_parent = NULL;
109 base_type::m_p_root = p_nd;
117 fix(node_pointer p_y)
121 if (p_y->m_p_prev_or_parent == NULL)
127 else if (p_y->m_metadata == 1&& p_y->m_p_next_sibling == NULL)
129 if (p_y->m_p_l_child != NULL)
131 fix_sibling_rank_1_unmarked(p_y);
136 fix_sibling_rank_1_marked(p_y);
138 p_y = p_y->m_p_prev_or_parent;
140 else if (p_y->m_metadata > p_y->m_p_next_sibling->m_metadata + 1)
142 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_l_child != NULL);
144 if (p_y->m_metadata != p_y->m_p_l_child->m_metadata + 2)
146 fix_sibling_general_unmarked(p_y);
151 fix_sibling_general_marked(p_y);
153 p_y = p_y->m_p_prev_or_parent;
155 else if ((p_y->m_p_l_child == NULL&&
156 p_y->m_metadata == 2) ||(p_y->m_p_l_child != NULL&&
157 p_y->m_metadata == p_y->m_p_l_child->m_metadata + 3))
159 node_pointer p_z = p_y->m_p_prev_or_parent;
173 fix_root(node_pointer p_y)
175 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent == NULL);
179 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, true);)
185 fix_sibling_rank_1_unmarked(node_pointer p_y)
187 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL);
189 _GLIBCXX_DEBUG_ONLY(node_pointer p_w = p_y->m_p_l_child;)
190 _GLIBCXX_DEBUG_ASSERT(p_w != NULL);
191 _GLIBCXX_DEBUG_ASSERT(p_w->m_p_next_sibling == NULL);
192 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_next_sibling == NULL);
194 p_y->m_p_next_sibling = p_y->m_p_l_child;
196 p_y->m_p_next_sibling->m_p_prev_or_parent = p_y;
198 p_y->m_p_l_child = NULL;
200 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);)
206 fix_sibling_rank_1_marked(node_pointer p_y)
208 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL);
209 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_l_child == NULL);
213 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);)
219 fix_sibling_general_unmarked(node_pointer p_y)
221 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL);
223 node_pointer p_w = p_y->m_p_l_child;
224 _GLIBCXX_DEBUG_ASSERT(p_w != NULL);
225 _GLIBCXX_DEBUG_ASSERT(p_w->m_p_next_sibling != NULL);
227 p_y->m_p_l_child = p_w->m_p_next_sibling;
228 p_w->m_p_next_sibling->m_p_prev_or_parent = p_y;
230 p_w->m_p_next_sibling = p_y->m_p_next_sibling;
231 _GLIBCXX_DEBUG_ASSERT(p_w->m_p_next_sibling != NULL);
232 p_w->m_p_next_sibling->m_p_prev_or_parent = p_w;
234 p_y->m_p_next_sibling = p_w;
235 p_w->m_p_prev_or_parent = p_y;
237 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);)
243 fix_sibling_general_marked(node_pointer p_y)
245 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL);
249 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);)
255 fix_child(node_pointer p_y)
257 _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL);
259 if (p_y->m_p_next_sibling != NULL)
260 p_y->m_p_next_sibling->m_p_prev_or_parent = p_y->m_p_prev_or_parent;
262 if (p_y->m_p_prev_or_parent->m_p_l_child == p_y)
263 p_y->m_p_prev_or_parent->m_p_l_child = p_y->m_p_next_sibling;
265 p_y->m_p_prev_or_parent->m_p_next_sibling = p_y->m_p_next_sibling;
267 make_root_and_link(p_y);
273 modify(point_iterator it, const_reference r_new_val)
275 _GLIBCXX_DEBUG_ONLY(assert_valid();)
276 node_pointer p_nd = it.m_p_nd;
278 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
280 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value);
282 p_nd->m_value = r_new_val;
288 p_nd->m_p_l_child = NULL;
290 make_root_and_link(p_nd);
292 _GLIBCXX_DEBUG_ONLY(assert_valid();)
297 if (p_nd->m_p_prev_or_parent == NULL)
301 _GLIBCXX_DEBUG_ONLY(assert_valid();)
306 node_pointer p_y = p_nd->m_p_prev_or_parent;
307 _GLIBCXX_DEBUG_ASSERT(p_y != NULL);
309 if (p_nd->m_p_next_sibling != NULL)
310 p_nd->m_p_next_sibling->m_p_prev_or_parent = p_y;
312 if (p_y->m_p_l_child == p_nd)
313 p_y->m_p_l_child = p_nd->m_p_next_sibling;
315 p_y->m_p_next_sibling = p_nd->m_p_next_sibling;
319 make_root_and_link(p_nd);
321 _GLIBCXX_DEBUG_ONLY(assert_valid();)
327 update_max(node_pointer p_nd)
329 if (m_p_max == NULL || Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))