cxx/test/containers/unord/unord.multiset/bucket_count.pass.cpp

49 lines
1.2 KiB
C++
Raw Normal View History

//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. 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 bucket_count() const;
#include <unordered_set>
#include <cassert>
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);
}
}