]>
Commit | Line | Data |
---|---|---|
36fed23c | 1 | // -*- C++ -*- |
2 | ||
fbd26352 | 3 | // Copyright (C) 2005-2019 Free Software Foundation, Inc. |
36fed23c | 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 | |
6bc9506f | 8 | // Foundation; either version 3, or (at your option) any later |
36fed23c | 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 | ||
6bc9506f | 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. | |
36fed23c | 19 | |
6bc9506f | 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/>. | |
36fed23c | 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 | /** | |
4f4a327e | 37 | * @file binomial_heap_base_/insert_fn_imps.hpp |
36fed23c | 38 | * Contains an implementation class for a base of binomial heaps. |
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 | { | |
bba93ee2 | 46 | PB_DS_ASSERT_VALID_COND((*this),true) |
2548203e | 47 | node_pointer p_nd = base_type::get_new_node_for_insert(r_val); |
36fed23c | 48 | insert_node(p_nd); |
e4bb1925 | 49 | m_p_max = 0; |
bba93ee2 | 50 | PB_DS_ASSERT_VALID_COND((*this),true) |
2548203e | 51 | return point_iterator(p_nd); |
36fed23c | 52 | } |
53 | ||
54 | PB_DS_CLASS_T_DEC | |
55 | inline void | |
56 | PB_DS_CLASS_C_DEC:: | |
57 | insert_node(node_pointer p_nd) | |
58 | { | |
e4bb1925 | 59 | if (base_type::m_p_root == 0) |
36fed23c | 60 | { |
4f4a327e | 61 | p_nd->m_p_next_sibling = 0; |
62 | p_nd->m_p_prev_or_parent = 0; | |
63 | p_nd->m_p_l_child = 0; | |
36fed23c | 64 | p_nd->m_metadata = 0; |
36fed23c | 65 | base_type::m_p_root = p_nd; |
36fed23c | 66 | return; |
67 | } | |
68 | ||
69 | if (base_type::m_p_root->m_metadata > 0) | |
70 | { | |
e4bb1925 | 71 | p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0; |
36fed23c | 72 | p_nd->m_p_next_sibling = base_type::m_p_root; |
36fed23c | 73 | base_type::m_p_root->m_p_prev_or_parent = p_nd; |
36fed23c | 74 | base_type::m_p_root = p_nd; |
36fed23c | 75 | p_nd->m_metadata = 0; |
36fed23c | 76 | return; |
77 | } | |
78 | ||
79 | if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) | |
80 | { | |
81 | p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling; | |
e4bb1925 | 82 | p_nd->m_p_prev_or_parent = 0; |
36fed23c | 83 | p_nd->m_metadata = 1; |
36fed23c | 84 | p_nd->m_p_l_child = base_type::m_p_root; |
36fed23c | 85 | base_type::m_p_root->m_p_prev_or_parent = p_nd; |
e4bb1925 | 86 | base_type::m_p_root->m_p_next_sibling = 0; |
36fed23c | 87 | base_type::m_p_root = p_nd; |
88 | } | |
89 | else | |
90 | { | |
e4bb1925 | 91 | p_nd->m_p_next_sibling = 0; |
e4bb1925 | 92 | p_nd->m_p_l_child = 0; |
36fed23c | 93 | p_nd->m_p_prev_or_parent = base_type::m_p_root; |
36fed23c | 94 | p_nd->m_metadata = 0; |
2b31bec4 | 95 | _GLIBCXX_DEBUG_ASSERT(base_type::m_p_root->m_p_l_child == 0); |
36fed23c | 96 | base_type::m_p_root->m_p_l_child = p_nd; |
36fed23c | 97 | base_type::m_p_root->m_metadata = 1; |
98 | } | |
99 | ||
100 | base_type::m_p_root = fix(base_type::m_p_root); | |
101 | } | |
102 | ||
103 | PB_DS_CLASS_T_DEC | |
104 | inline typename PB_DS_CLASS_C_DEC::node_pointer | |
105 | PB_DS_CLASS_C_DEC:: | |
106 | fix(node_pointer p_nd) const | |
107 | { | |
4f4a327e | 108 | while (p_nd->m_p_next_sibling != 0 && |
36fed23c | 109 | p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata) |
110 | { | |
111 | node_pointer p_next = p_nd->m_p_next_sibling; | |
36fed23c | 112 | if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) |
4f4a327e | 113 | { |
114 | p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; | |
36fed23c | 115 | |
e4bb1925 | 116 | if (p_nd->m_p_prev_or_parent != 0) |
36fed23c | 117 | p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next; |
118 | ||
119 | base_type::make_child_of(p_nd, p_next); | |
36fed23c | 120 | ++p_next->m_metadata; |
36fed23c | 121 | p_nd = p_next; |
4f4a327e | 122 | } |
36fed23c | 123 | else |
4f4a327e | 124 | { |
36fed23c | 125 | p_nd->m_p_next_sibling = p_next->m_p_next_sibling; |
126 | ||
e4bb1925 | 127 | if (p_nd->m_p_next_sibling != 0) |
128 | p_next->m_p_next_sibling = 0; | |
36fed23c | 129 | |
130 | base_type::make_child_of(p_next, p_nd); | |
36fed23c | 131 | ++p_nd->m_metadata; |
4f4a327e | 132 | } |
36fed23c | 133 | } |
134 | ||
e4bb1925 | 135 | if (p_nd->m_p_next_sibling != 0) |
36fed23c | 136 | p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd; |
137 | ||
138 | return p_nd; | |
139 | } | |
140 | ||
141 | PB_DS_CLASS_T_DEC | |
142 | void | |
143 | PB_DS_CLASS_C_DEC:: | |
144 | modify(point_iterator it, const_reference r_new_val) | |
145 | { | |
bba93ee2 | 146 | PB_DS_ASSERT_VALID_COND((*this),true) |
2548203e | 147 | node_pointer p_nd = it.m_p_nd; |
36fed23c | 148 | |
e4bb1925 | 149 | _GLIBCXX_DEBUG_ASSERT(p_nd != 0); |
2548203e | 150 | PB_DS_ASSERT_BASE_NODE_CONSISTENT(p_nd, false) |
36fed23c | 151 | |
2548203e | 152 | const bool bubble_up = Cmp_Fn::operator()(p_nd->m_value, r_new_val); |
36fed23c | 153 | p_nd->m_value = r_new_val; |
154 | ||
155 | if (bubble_up) | |
156 | { | |
157 | node_pointer p_parent = base_type::parent(p_nd); | |
4f4a327e | 158 | while (p_parent != 0 && |
36fed23c | 159 | Cmp_Fn::operator()(p_parent->m_value, p_nd->m_value)) |
4f4a327e | 160 | { |
36fed23c | 161 | base_type::swap_with_parent(p_nd, p_parent); |
36fed23c | 162 | p_parent = base_type::parent(p_nd); |
4f4a327e | 163 | } |
36fed23c | 164 | |
e4bb1925 | 165 | if (p_nd->m_p_prev_or_parent == 0) |
36fed23c | 166 | base_type::m_p_root = p_nd; |
167 | ||
e4bb1925 | 168 | m_p_max = 0; |
bba93ee2 | 169 | PB_DS_ASSERT_VALID_COND((*this),true) |
4f4a327e | 170 | return; |
36fed23c | 171 | } |
172 | ||
173 | base_type::bubble_to_top(p_nd); | |
36fed23c | 174 | remove_parentless_node(p_nd); |
36fed23c | 175 | insert_node(p_nd); |
e4bb1925 | 176 | m_p_max = 0; |
bba93ee2 | 177 | PB_DS_ASSERT_VALID_COND((*this),true) |
2548203e | 178 | } |