index.pass.cpp revision 73d21a4f0774d3fadab98e690619a359cfb160a3 
1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <unordered_map>
11
12// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13//           class Alloc = allocator<pair<const Key, T>>>
14// class unordered_map
15
16// mapped_type& operator[](const key_type& k);
17
18#include <unordered_map>
19#include <string>
20#include <cassert>
21
22#include "../../../MoveOnly.h"
23
24int main()
25{
26    {
27        typedef std::unordered_map<int, std::string> C;
28        typedef std::pair<int, std::string> P;
29        P a[] =
30        {
31            P(1, "one"),
32            P(2, "two"),
33            P(3, "three"),
34            P(4, "four"),
35            P(1, "four"),
36            P(2, "four"),
37        };
38        C c(a, a + sizeof(a)/sizeof(a[0]));
39        assert(c.size() == 4);
40        c[1] = "ONE";
41        assert(c.at(1) == "ONE");
42        c[11] = "eleven";
43        assert(c.size() == 5);
44        assert(c.at(11) == "eleven");
45    }
46#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
47    {
48        typedef std::unordered_map<MoveOnly, std::string> C;
49        typedef std::pair<int, std::string> P;
50        P a[] =
51        {
52            P(1, "one"),
53            P(2, "two"),
54            P(3, "three"),
55            P(4, "four"),
56            P(1, "four"),
57            P(2, "four"),
58        };
59        C c(a, a + sizeof(a)/sizeof(a[0]));
60        assert(c.size() == 4);
61        c[1] = "ONE";
62        assert(c.at(1) == "ONE");
63        c[11] = "eleven";
64        assert(c.size() == 5);
65        assert(c.at(11) == "eleven");
66    }
67#endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
68}
69