URL
https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk
Subversion Repositories openrisc_2011-10-31
[/] [openrisc/] [tags/] [gnu-src/] [gcc-4.5.1/] [gcc-4.5.1-or32-1.0rc3/] [libstdc++-v3/] [testsuite/] [tr1/] [6_containers/] [unordered_multiset/] [erase/] [1.cc] - Rev 516
Compare with Previous | Blame | View Log
// 2007-02-22 Paolo Carlini <pcarlini@suse.de> // // Copyright (C) 2007, 2009 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License along // with this library; see the file COPYING3. If not see // <http://www.gnu.org/licenses/>. // 6.3.4.5 Class template unordered_multiset #include <tr1/unordered_set> #include <string> #include <testsuite_hooks.h> // In the occasion of libstdc++/25896 void test01() { bool test __attribute__((unused)) = true; typedef std::tr1::unordered_multiset<std::string> Mset; typedef Mset::iterator iterator; typedef Mset::const_iterator const_iterator; Mset ms1; ms1.insert("because to why"); ms1.insert("the stockholm syndrome"); ms1.insert("a cereous night"); ms1.insert("eeilo"); ms1.insert("protean"); ms1.insert("the way you are when"); ms1.insert("tillsammans"); ms1.insert("umbra/penumbra"); ms1.insert("belonging (no longer mix)"); ms1.insert("one line behind"); VERIFY( ms1.size() == 10 ); VERIFY( ms1.erase("eeilo") == 1 ); VERIFY( ms1.size() == 9 ); iterator it1 = ms1.find("eeilo"); VERIFY( it1 == ms1.end() ); VERIFY( ms1.erase("tillsammans") == 1 ); VERIFY( ms1.size() == 8 ); iterator it2 = ms1.find("tillsammans"); VERIFY( it2 == ms1.end() ); // Must work (see DR 526) iterator it3 = ms1.find("belonging (no longer mix)"); VERIFY( it3 != ms1.end() ); VERIFY( ms1.erase(*it3) == 1 ); VERIFY( ms1.size() == 7 ); it3 = ms1.find("belonging (no longer mix)"); VERIFY( it3 == ms1.end() ); VERIFY( !ms1.erase("abra") ); VERIFY( ms1.size() == 7 ); VERIFY( !ms1.erase("eeilo") ); VERIFY( ms1.size() == 7 ); VERIFY( ms1.erase("because to why") == 1 ); VERIFY( ms1.size() == 6 ); iterator it4 = ms1.find("because to why"); VERIFY( it4 == ms1.end() ); iterator it5 = ms1.find("umbra/penumbra"); iterator it6 = ms1.find("one line behind"); VERIFY( it5 != ms1.end() ); VERIFY( it6 != ms1.end() ); VERIFY( ms1.find("the stockholm syndrome") != ms1.end() ); VERIFY( ms1.find("a cereous night") != ms1.end() ); VERIFY( ms1.find("the way you are when") != ms1.end() ); VERIFY( ms1.find("a cereous night") != ms1.end() ); VERIFY( ms1.erase(*it5) == 1 ); VERIFY( ms1.size() == 5 ); it5 = ms1.find("umbra/penumbra"); VERIFY( it5 == ms1.end() ); VERIFY( ms1.erase(*it6) == 1 ); VERIFY( ms1.size() == 4 ); it6 = ms1.find("one line behind"); VERIFY( it6 == ms1.end() ); iterator it7 = ms1.begin(); iterator it8 = it7; ++it8; iterator it9 = it8; ++it9; VERIFY( ms1.erase(*it8) == 1 ); VERIFY( ms1.size() == 3 ); VERIFY( ++it7 == it9 ); iterator it10 = it9; ++it10; iterator it11 = it10; VERIFY( ms1.erase(*it9) == 1 ); VERIFY( ms1.size() == 2 ); VERIFY( ++it10 == ms1.end() ); VERIFY( ms1.erase(ms1.begin()) != ms1.end() ); VERIFY( ms1.size() == 1 ); VERIFY( ms1.begin() == it11 ); VERIFY( ms1.erase(*ms1.begin()) == 1 ); VERIFY( ms1.size() == 0 ); VERIFY( ms1.begin() == ms1.end() ); } int main() { test01(); return 0; }