blob: afb59e50aa51eddb46be75643bd046dd0ae0e548 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
// { dg-do run { target c++11 } }
//
// Copyright (C) 2013-2018 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/>.
#include <unordered_map>
#include <string>
#include <testsuite_hooks.h>
void test01()
{
{
std::unordered_multimap<std::string, std::string> mymmap;
std::pair<std::string, std::string> mypair{std::string("key"),
std::string("value")};
mymmap.insert(mypair);
VERIFY( mypair.first.length() && mypair.second.length() );
}
{
std::unordered_multimap<std::string, std::string> mymmap;
std::pair<std::string, std::string> mypair{std::string("key"),
std::string("value")};
mymmap.insert(mymmap.begin(), mypair);
VERIFY( mypair.first.length() && mypair.second.length() );
}
}
int main()
{
test01();
return 0;
}
|
