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_multimap/] [insert/] [multimap_range.cc] - Rev 516
Compare with Previous | Blame | View Log
// { dg-do run } // 2005-2-17 Matt Austern <austern@apple.com> // // Copyright (C) 2005, 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.6 unordered_multimap // range insert #include <string> #include <iterator> #include <algorithm> #include <tr1/unordered_map> #include "testsuite_hooks.h" bool test __attribute__((unused)) = true; void test01() { typedef std::tr1::unordered_multimap<std::string, int> Map; typedef std::pair<const std::string, int> Pair; Map m; VERIFY(m.empty()); Pair A[5] = { Pair("red", 5), Pair("green", 9), Pair("blue", 3), Pair("cyan", 8), Pair("magenta", 7) }; m.insert(A+0, A+5); VERIFY(m.size() == 5); VERIFY(std::distance(m.begin(), m.end()) == 5); for (int i = 0; i < 5; ++i) VERIFY(std::find(m.begin(), m.end(), A[i]) != m.end()); } void test02() { typedef std::tr1::unordered_multimap<std::string, int> Map; typedef std::pair<const std::string, int> Pair; Map m; VERIFY(m.empty()); Pair A[9] = { Pair("red", 5), Pair("green", 9), Pair("red", 19), Pair("blue", 3), Pair("blue", 60), Pair("cyan", 8), Pair("magenta", 7), Pair("blue", 99), Pair("green", 33) }; m.insert(A+0, A+9); VERIFY(m.size() == 9); VERIFY(std::distance(m.begin(), m.end()) == 9); for (int i = 0; i < 9; ++i) VERIFY(std::find(m.begin(), m.end(), A[i]) != m.end()); } int main() { test01(); test02(); return 0; }