]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
748086b7 | 3 | // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc. |
4569a895 AT |
4 | // |
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 | |
748086b7 | 8 | // Foundation; either version 3, or (at your option) any later |
4569a895 AT |
9 | // version. |
10 | ||
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. | |
15 | ||
748086b7 JJ |
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. | |
19 | ||
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/>. | |
4569a895 AT |
24 | |
25 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
26 | ||
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 | |
34 | // warranty. | |
35 | ||
36 | /** | |
37 | * @file insert_fn_imps.hpp | |
38 | * Contains an implementation class for a pairing heap. | |
39 | */ | |
40 | ||
41 | PB_DS_CLASS_T_DEC | |
42 | inline typename PB_DS_CLASS_C_DEC::point_iterator | |
43 | PB_DS_CLASS_C_DEC:: | |
44 | push(const_reference r_val) | |
45 | { | |
47bea7b8 | 46 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
4569a895 AT |
47 | |
48 | node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val); | |
49 | ||
50 | push_imp(p_new_nd); | |
51 | ||
47bea7b8 | 52 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
4569a895 AT |
53 | |
54 | return point_iterator(p_new_nd); | |
55 | } | |
56 | ||
57 | PB_DS_CLASS_T_DEC | |
58 | inline void | |
59 | PB_DS_CLASS_C_DEC:: | |
60 | push_imp(node_pointer p_nd) | |
61 | { | |
62 | p_nd->m_p_l_child = NULL; | |
63 | ||
64 | if (base_type::m_p_root == NULL) | |
65 | { | |
66 | p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL; | |
67 | ||
68 | base_type::m_p_root = p_nd; | |
69 | } | |
70 | else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) | |
71 | { | |
72 | p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL; | |
73 | ||
74 | base_type::make_child_of(base_type::m_p_root, p_nd); | |
47bea7b8 | 75 | _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd, false)); |
4569a895 AT |
76 | |
77 | base_type::m_p_root = p_nd; | |
78 | } | |
79 | else | |
80 | { | |
81 | base_type::make_child_of(p_nd, base_type::m_p_root); | |
47bea7b8 | 82 | _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false)); |
4569a895 AT |
83 | } |
84 | } | |
85 | ||
86 | PB_DS_CLASS_T_DEC | |
87 | void | |
88 | PB_DS_CLASS_C_DEC:: | |
89 | modify(point_iterator it, const_reference r_new_val) | |
90 | { | |
47bea7b8 | 91 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
4569a895 AT |
92 | |
93 | remove_node(it.m_p_nd); | |
94 | ||
95 | it.m_p_nd->m_value = r_new_val; | |
96 | ||
97 | push_imp(it.m_p_nd); | |
98 | ||
47bea7b8 | 99 | _GLIBCXX_DEBUG_ONLY(assert_valid();) |
4569a895 AT |
100 | } |
101 |