2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
2010-11-16 23:09:02 +01:00
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <unordered_set>
|
|
|
|
|
|
|
|
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
|
|
|
// class Alloc = allocator<Value>>
|
|
|
|
// class unordered_multiset
|
|
|
|
|
|
|
|
// size_type bucket_count() const;
|
|
|
|
|
|
|
|
#include <unordered_set>
|
|
|
|
#include <cassert>
|
|
|
|
|
2013-06-22 17:21:29 +02:00
|
|
|
#include "../../min_allocator.h"
|
|
|
|
|
2010-05-11 21:42:16 +02:00
|
|
|
int main()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
typedef std::unordered_multiset<int> C;
|
|
|
|
typedef C::const_iterator I;
|
|
|
|
typedef int P;
|
|
|
|
const C c;
|
|
|
|
assert(c.bucket_count() == 0);
|
|
|
|
}
|
|
|
|
{
|
|
|
|
typedef std::unordered_multiset<int> C;
|
|
|
|
typedef C::const_iterator I;
|
|
|
|
typedef int P;
|
|
|
|
P a[] =
|
|
|
|
{
|
|
|
|
P(10),
|
|
|
|
P(20),
|
|
|
|
P(30),
|
|
|
|
P(40),
|
|
|
|
P(50),
|
|
|
|
P(60),
|
|
|
|
P(70),
|
|
|
|
P(80)
|
|
|
|
};
|
|
|
|
const C c(std::begin(a), std::end(a));
|
|
|
|
assert(c.bucket_count() >= 11);
|
|
|
|
}
|
2013-06-22 17:21:29 +02:00
|
|
|
#if __cplusplus >= 201103L
|
|
|
|
{
|
|
|
|
typedef std::unordered_multiset<int, std::hash<int>,
|
|
|
|
std::equal_to<int>, min_allocator<int>> C;
|
|
|
|
typedef C::const_iterator I;
|
|
|
|
typedef int P;
|
|
|
|
const C c;
|
|
|
|
assert(c.bucket_count() == 0);
|
|
|
|
}
|
|
|
|
{
|
|
|
|
typedef std::unordered_multiset<int, std::hash<int>,
|
|
|
|
std::equal_to<int>, min_allocator<int>> C;
|
|
|
|
typedef C::const_iterator I;
|
|
|
|
typedef int P;
|
|
|
|
P a[] =
|
|
|
|
{
|
|
|
|
P(10),
|
|
|
|
P(20),
|
|
|
|
P(30),
|
|
|
|
P(40),
|
|
|
|
P(50),
|
|
|
|
P(60),
|
|
|
|
P(70),
|
|
|
|
P(80)
|
|
|
|
};
|
|
|
|
const C c(std::begin(a), std::end(a));
|
|
|
|
assert(c.bucket_count() >= 11);
|
|
|
|
}
|
|
|
|
#endif
|
2010-05-11 21:42:16 +02:00
|
|
|
}
|