blob: 9c1ca18c3054ea14d4a28074ca97abfbfc5e8a4b (
plain) (
blame)
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
|
//===----------------------------------------------------------------------===//
//
// 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
// size_type max_size() const;
#include <unordered_map>
#include <cassert>
#include "min_allocator.h"
int main()
{
{
std::unordered_map<int, int> u;
assert(u.max_size() > 0);
}
#if TEST_STD_VER >= 11
{
std::unordered_map<int, int, std::hash<int>, std::equal_to<int>,
min_allocator<std::pair<const int, int>>> u;
assert(u.max_size() > 0);
}
#endif
}
|