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 erase_fn_imps.hpp
44 * Containsert a random regression test for a specific container type.
56 PB_DS_SET_DESTRUCT_PRINT
58 m_alloc.set_throw_prob(0);
61 test_traits::generate_key(m_g, m_m);
63 m_alloc.set_throw_prob(m_tp);
67 const bool cntnd = m_p_c->find(k) != m_p_c->end();
69 PB_DS_THROW_IF_FAILED(
70 cntnd ==(m_native_c.find(test_traits::native_key(k)) != m_native_c.end()),
71 test_traits::key_to_string(k),
75 const bool ersd = m_p_c->erase(k);
77 const bool native_ersd =
78 m_native_c.erase(test_traits::native_key(k)) != 0;
80 PB_DS_THROW_IF_FAILED(
82 ersd << " " << native_ersd,
86 PB_DS_THROW_IF_FAILED(
87 m_p_c->find(k) == m_p_c->end(),
92 catch(forced_exception& )
96 PB_DS_THROW_IF_FAILED( container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
99 PB_DS_COND_COMPARE(*m_p_c, m_native_c);
101 PB_DS_CANCEL_DESTRUCT_PRINT
111 PB_DS_TRACE("erase_if");
115 PB_DS_SET_DESTRUCT_PRINT
120 typename std::iterator_traits<
121 typename cntnr::iterator>::reference
125 typename test_traits::template erase_if_fn<
129 m_alloc.set_throw_prob(m_tp);
132 m_p_c->erase_if(erase_if_fn_t());
134 const size_t native_ersd =
135 test_traits::erase_if(m_native_c);
137 PB_DS_THROW_IF_FAILED(
139 static_cast<unsigned long>(ersd) << " " <<
140 static_cast<unsigned long>(native_ersd),
144 catch(forced_exception& )
148 PB_DS_THROW_IF_FAILED( container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
151 PB_DS_COND_COMPARE(*m_p_c, m_native_c);
153 PB_DS_CANCEL_DESTRUCT_PRINT
166 container_traits::order_preserving
169 return (erase_it_imp(pb_ds::detail::integral_constant<int,erase_iterators>()));
175 erase_it_imp(pb_ds::detail::false_type)
183 erase_it_imp(pb_ds::detail::true_type)
185 PB_DS_TRACE("erase_it");
189 PB_DS_SET_DESTRUCT_PRINT
193 m_alloc.set_throw_prob(0);
196 test_traits::generate_key(m_g, m_m);
198 m_alloc.set_throw_prob(m_tp);
200 typename cntnr::iterator found_it = m_p_c->find(k);
202 typename native_type::iterator native_it = m_native_c.find(
203 test_traits::native_key(k));
205 const bool found = found_it != m_p_c->end();
206 const bool native_found = native_it != m_native_c.end();
208 PB_DS_THROW_IF_FAILED(
209 found == native_found,
210 found << " " << native_found,
214 typename cntnr::const_iterator next_it = found_it;
215 if (next_it != m_p_c->end())
218 typename cntnr::iterator next_ers_it =
219 m_p_c->erase(found_it);
221 if (native_it != m_native_c.end())
222 m_native_c.erase(native_it);
224 bool range_guarantee =
225 pb_ds::detail::is_same<
226 typename container_traits::invalidation_guarantee,
227 pb_ds::range_invalidation_guarantee>::value ;
230 PB_DS_THROW_IF_FAILED( next_ers_it == next_it, "", m_p_c, & m_native_c);
232 catch(forced_exception& )
236 PB_DS_THROW_IF_FAILED( container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
239 PB_DS_COND_COMPARE(*m_p_c, m_native_c);
241 PB_DS_CANCEL_DESTRUCT_PRINT
254 container_traits::order_preserving&&
255 container_traits::reverse_iteration
258 return (erase_rev_it_imp(pb_ds::detail::integral_constant<int,erase_iterators>()));
264 erase_rev_it_imp(pb_ds::detail::false_type)
272 erase_rev_it_imp(pb_ds::detail::true_type)
274 PB_DS_TRACE("erase_rev_it");
278 PB_DS_SET_DESTRUCT_PRINT
282 m_alloc.set_throw_prob(0);
285 test_traits::generate_key(m_g, m_m);
287 m_alloc.set_throw_prob(m_tp);
289 typename cntnr::iterator found_it = m_p_c->find(k);
291 typename native_type::iterator native_it = m_native_c.find(
292 test_traits::native_key(k));
294 typename cntnr::const_reverse_iterator next_it = found_it;
295 if (next_it != m_p_c->end())
298 typename cntnr::reverse_iterator next_ers_it =
299 m_p_c->erase((typename cntnr::reverse_iterator)found_it);
301 PB_DS_THROW_IF_FAILED( next_ers_it == next_it, "", m_p_c, & m_native_c);
303 if (native_it != m_native_c.end())
304 m_native_c.erase(native_it);
306 catch(forced_exception& )
310 PB_DS_THROW_IF_FAILED( container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
313 PB_DS_COND_COMPARE(*m_p_c, m_native_c);
315 PB_DS_CANCEL_DESTRUCT_PRINT