cxx/test/containers/unord/unord.multimap/max_bucket_count.pass.cpp

44 lines
1.3 KiB
C++
Raw Normal View History

//===----------------------------------------------------------------------===//
//
// 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_multimap
// size_type max_bucket_count() const;
#include <unordered_map>
#include <string>
#include <cassert>
#include "../../min_allocator.h"
int main()
{
{
typedef std::unordered_multimap<int, std::string> C;
typedef C::const_iterator I;
typedef std::pair<int, std::string> P;
const C c;
assert(c.max_bucket_count() > 0);
}
#if __cplusplus >= 201103L
{
typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
min_allocator<std::pair<const int, std::string>>> C;
typedef C::const_iterator I;
typedef std::pair<int, std::string> P;
const C c;
assert(c.max_bucket_count() > 0);
}
#endif
}