blob: 2664d76eb57ffc677dbc74f5d6329a2c29485e78 (
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
55
56
57
58
59
60
61
|
// { dg-do run }
// 2005-2-17 Matt Austern <austern@apple.com>
//
// Copyright (C) 2005 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
// USA.
// 6.3.4.4 unordered_map
// Array version of insert
#include <string>
#include <iterator>
#include <tr1/unordered_map>
#include "testsuite_hooks.h"
bool test __attribute__((unused)) = true;
void test01()
{
typedef std::tr1::unordered_map<std::string, int> Map;
typedef std::pair<const std::string, int> Pair;
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;
}
|
