39 lines
1 KiB
C++
39 lines
1 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_set>
|
||
|
|
||
|
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
||
|
// class Alloc = allocator<Value>>
|
||
|
// class unordered_multiset
|
||
|
|
||
|
// size_type max_bucket_count() const;
|
||
|
|
||
|
#include <unordered_set>
|
||
|
#include <cassert>
|
||
|
|
||
|
#include "../../min_allocator.h"
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
{
|
||
|
typedef std::unordered_multiset<int> C;
|
||
|
const C c;
|
||
|
assert(c.max_bucket_count() > 0);
|
||
|
}
|
||
|
#if __cplusplus >= 201103L
|
||
|
{
|
||
|
typedef std::unordered_multiset<int, std::hash<int>,
|
||
|
std::equal_to<int>, min_allocator<int>> C;
|
||
|
const C c;
|
||
|
assert(c.max_bucket_count() > 0);
|
||
|
}
|
||
|
#endif
|
||
|
}
|