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 class for a pairing 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_new_nd
= base_type::get_new_node_for_insert(r_val
);
58 _GLIBCXX_DEBUG_ONLY(assert_valid();)
60 return point_iterator(p_new_nd
);
66 push_imp(node_pointer p_nd
)
68 p_nd
->m_p_l_child
= NULL
;
70 if (base_type::m_p_root
== NULL
)
72 p_nd
->m_p_next_sibling
= p_nd
->m_p_prev_or_parent
= NULL
;
74 base_type::m_p_root
= p_nd
;
76 else if (Cmp_Fn::operator()(base_type::m_p_root
->m_value
, p_nd
->m_value
))
78 p_nd
->m_p_next_sibling
= p_nd
->m_p_prev_or_parent
= NULL
;
80 base_type::make_child_of(base_type::m_p_root
, p_nd
);
81 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd
, false));
83 base_type::m_p_root
= p_nd
;
87 base_type::make_child_of(p_nd
, base_type::m_p_root
);
88 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(base_type::m_p_root
, false));
95 modify(point_iterator it
, const_reference r_new_val
)
97 _GLIBCXX_DEBUG_ONLY(assert_valid();)
99 remove_node(it
.m_p_nd
);
101 it
.m_p_nd
->m_value
= r_new_val
;
105 _GLIBCXX_DEBUG_ONLY(assert_valid();)