3 // Copyright (C) 2005, 2006, 2007, 2008, 2009, 2011
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the terms
8 // of the GNU General Public License as published by the Free Software
9 // Foundation; either version 3, or (at your option) any later
12 // This library is distributed in the hope that it will be useful, but
13 // WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 // General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
26 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
28 // Permission to use, copy, modify, sell, and distribute this software
29 // is hereby granted without fee, provided that the above copyright
30 // notice appears in all copies, and that both that copyright notice
31 // and this permission notice appear in supporting documentation. None
32 // of the above authors, nor IBM Haifa Research Laboratories, make any
33 // representation about the suitability of this software for any
34 // purpose. It is provided "as is" without express or implied
38 * @file erase_fn_imps.hpp
39 * Contains an implementation class for a binary_heap.
47 for (size_type i
= 0; i
< m_size
; ++i
)
48 erase_at(m_a_entries
, i
, s_no_throw_copies_ind
);
52 const size_type actual_size
= resize_policy::get_new_size_for_arbitrary(0);
54 entry_pointer a_entries
= s_entry_allocator
.allocate(actual_size
);
56 resize_policy::notify_arbitrary(actual_size
);
58 s_entry_allocator
.deallocate(m_a_entries
, m_actual_size
);
60 m_actual_size
= actual_size
;
62 m_a_entries
= a_entries
;
69 PB_DS_ASSERT_VALID((*this))
75 erase_at(entry_pointer a_entries
, size_type i
, false_type
)
77 a_entries
[i
]->~value_type();
78 s_value_allocator
.deallocate(a_entries
[i
], 1);
84 erase_at(entry_pointer
, size_type
, true_type
)
92 PB_DS_ASSERT_VALID((*this))
93 _GLIBCXX_DEBUG_ASSERT(!empty());
95 erase_at(m_a_entries
, 0, s_no_throw_copies_ind
);
97 std::pop_heap(m_a_entries
, m_a_entries
+ m_size
,
98 static_cast<entry_cmp
& >(*this));
100 resize_for_erase_if_needed();
102 _GLIBCXX_DEBUG_ASSERT(m_size
> 0);
105 PB_DS_ASSERT_VALID((*this))
109 template<typename Pred
>
110 typename
PB_DS_CLASS_C_DEC::size_type
114 PB_DS_ASSERT_VALID((*this))
116 typedef typename entry_pred
<value_type
, Pred
, simple_value
, Allocator
>::type
119 const size_type left
= partition(pred_t(pred
));
121 _GLIBCXX_DEBUG_ASSERT(m_size
>= left
);
123 const size_type ersd
= m_size
- left
;
125 for (size_type i
= left
; i
< m_size
; ++i
)
126 erase_at(m_a_entries
, i
, s_no_throw_copies_ind
);
130 const size_type actual_size
=
131 resize_policy::get_new_size_for_arbitrary(left
);
133 entry_pointer a_entries
= s_entry_allocator
.allocate(actual_size
);
135 std::copy(m_a_entries
, m_a_entries
+ left
, a_entries
);
137 s_entry_allocator
.deallocate(m_a_entries
, m_actual_size
);
139 m_actual_size
= actual_size
;
141 resize_policy::notify_arbitrary(m_actual_size
);
148 std::make_heap(m_a_entries
, m_a_entries
+ m_size
,
149 static_cast<entry_cmp
& >(*this));
151 PB_DS_ASSERT_VALID((*this))
159 erase(point_iterator it
)
161 PB_DS_ASSERT_VALID((*this))
162 _GLIBCXX_DEBUG_ASSERT(!empty());
164 const size_type fix_pos
= it
.m_p_e
- m_a_entries
;
166 std::swap(*it
.m_p_e
, m_a_entries
[m_size
- 1]);
168 erase_at(m_a_entries
, m_size
- 1, s_no_throw_copies_ind
);
170 resize_for_erase_if_needed();
172 _GLIBCXX_DEBUG_ASSERT(m_size
> 0);
175 _GLIBCXX_DEBUG_ASSERT(fix_pos
<= m_size
);
177 if (fix_pos
!= m_size
)
178 fix(m_a_entries
+ fix_pos
);
180 PB_DS_ASSERT_VALID((*this))
186 resize_for_erase_if_needed()
188 if (!resize_policy::resize_needed_for_shrink(m_size
))
193 const size_type new_actual_size
=
194 resize_policy::get_new_size_for_shrink();
196 entry_pointer a_new_entries
= s_entry_allocator
.allocate(new_actual_size
);
198 resize_policy::notify_shrink_resize();
200 _GLIBCXX_DEBUG_ASSERT(m_size
> 0);
201 std::copy(m_a_entries
, m_a_entries
+ m_size
- 1, a_new_entries
);
203 s_entry_allocator
.deallocate(m_a_entries
, m_actual_size
);
205 m_actual_size
= new_actual_size
;
207 m_a_entries
= a_new_entries
;
214 template<typename Pred
>
215 typename
PB_DS_CLASS_C_DEC::size_type
220 size_type right
= m_size
- 1;
222 while (right
+ 1 != left
)
224 _GLIBCXX_DEBUG_ASSERT(left
<= m_size
);
226 if (!pred(m_a_entries
[left
]))
228 else if (pred(m_a_entries
[right
]))
232 _GLIBCXX_DEBUG_ASSERT(left
< right
);
234 std::swap(m_a_entries
[left
], m_a_entries
[right
]);