blob: c95e83bcceef38c13a3cd842b657fc8785d0d97d (
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
50
51
52
53
54
|
// { dg-do run { target c++11 } }
// Copyright (C) 2010-2019 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/>.
// Array version of insert
#include <string>
#include <iterator>
#include <unordered_map>
#include <testsuite_hooks.h>
void test01()
{
typedef std::unordered_map<std::string, int> Map;
Map m;
VERIFY( m.empty() );
m["red"] = 17;
VERIFY( m.size() == 1 );
VERIFY( m.begin()->first == "red" );
VERIFY( m.begin()->second == 17 );
VERIFY( m["red"] == 17 );
m["blue"] = 9;
VERIFY( m.size() == 2 );
VERIFY( m["blue"] == 9 );
m["red"] = 5;
VERIFY( m.size() == 2 );
VERIFY( m["red"] == 5 );
VERIFY( m["blue"] == 9 );
}
int main()
{
test01();
return 0;
}
|
