max_bucket_count.pass.cpp revision 061d0cc4db18d17bf01ed14c5db0be098205bd47 
1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. 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// size_type max_bucket_count() const;
17
18#include <unordered_map>
19#include <string>
20#include <cassert>
21
22#include "min_allocator.h"
23
24int main()
25{
26    {
27        typedef std::unordered_map<int, std::string> C;
28        typedef C::const_iterator I;
29        typedef std::pair<int, std::string> P;
30        const C c;
31        assert(c.max_bucket_count() > 0);
32    }
33#if __cplusplus >= 201103L
34    {
35        typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
36                            min_allocator<std::pair<const int, std::string>>> C;
37        typedef C::const_iterator I;
38        typedef std::pair<int, std::string> P;
39        const C c;
40        assert(c.max_bucket_count() > 0);
41    }
42#endif
43}
44