7a6b7cedcb
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@184635 91177308-0d34-0410-b5e6-96231b3b80d8
116 lines
3.2 KiB
C++
116 lines
3.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <unordered_map>
|
|
|
|
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
|
// class Alloc = allocator<pair<const Key, T>>>
|
|
// class unordered_map
|
|
|
|
// mapped_type& operator[](const key_type& k);
|
|
|
|
#include <unordered_map>
|
|
#include <string>
|
|
#include <cassert>
|
|
|
|
#include "../../../MoveOnly.h"
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::unordered_map<int, std::string> C;
|
|
typedef std::pair<int, std::string> P;
|
|
P a[] =
|
|
{
|
|
P(1, "one"),
|
|
P(2, "two"),
|
|
P(3, "three"),
|
|
P(4, "four"),
|
|
P(1, "four"),
|
|
P(2, "four"),
|
|
};
|
|
C c(a, a + sizeof(a)/sizeof(a[0]));
|
|
assert(c.size() == 4);
|
|
c[1] = "ONE";
|
|
assert(c.at(1) == "ONE");
|
|
c[11] = "eleven";
|
|
assert(c.size() == 5);
|
|
assert(c.at(11) == "eleven");
|
|
}
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
typedef std::unordered_map<MoveOnly, std::string> C;
|
|
typedef std::pair<int, std::string> P;
|
|
P a[] =
|
|
{
|
|
P(1, "one"),
|
|
P(2, "two"),
|
|
P(3, "three"),
|
|
P(4, "four"),
|
|
P(1, "four"),
|
|
P(2, "four"),
|
|
};
|
|
C c(a, a + sizeof(a)/sizeof(a[0]));
|
|
assert(c.size() == 4);
|
|
c[1] = "ONE";
|
|
assert(c.at(1) == "ONE");
|
|
c[11] = "eleven";
|
|
assert(c.size() == 5);
|
|
assert(c.at(11) == "eleven");
|
|
}
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
|
min_allocator<std::pair<const int, std::string>>> C;
|
|
typedef std::pair<int, std::string> P;
|
|
P a[] =
|
|
{
|
|
P(1, "one"),
|
|
P(2, "two"),
|
|
P(3, "three"),
|
|
P(4, "four"),
|
|
P(1, "four"),
|
|
P(2, "four"),
|
|
};
|
|
C c(a, a + sizeof(a)/sizeof(a[0]));
|
|
assert(c.size() == 4);
|
|
c[1] = "ONE";
|
|
assert(c.at(1) == "ONE");
|
|
c[11] = "eleven";
|
|
assert(c.size() == 5);
|
|
assert(c.at(11) == "eleven");
|
|
}
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
typedef std::unordered_map<MoveOnly, std::string, std::hash<MoveOnly>, std::equal_to<MoveOnly>,
|
|
min_allocator<std::pair<const MoveOnly, std::string>>> C;
|
|
typedef std::pair<int, std::string> P;
|
|
P a[] =
|
|
{
|
|
P(1, "one"),
|
|
P(2, "two"),
|
|
P(3, "three"),
|
|
P(4, "four"),
|
|
P(1, "four"),
|
|
P(2, "four"),
|
|
};
|
|
C c(a, a + sizeof(a)/sizeof(a[0]));
|
|
assert(c.size() == 4);
|
|
c[1] = "ONE";
|
|
assert(c.at(1) == "ONE");
|
|
c[11] = "eleven";
|
|
assert(c.size() == 5);
|
|
assert(c.at(11) == "eleven");
|
|
}
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
#endif
|
|
}
|