42 lines
1.0 KiB
C++
42 lines
1.0 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>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_set
|
|||
|
|
|
|||
|
|
// size_type bucket(const key_type& __k) const;
|
|||
|
|
|
|||
|
|
#include <unordered_set>
|
|||
|
|
#include <cassert>
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
{
|
|||
|
|
typedef std::unordered_set<int> C;
|
|||
|
|
typedef int P;
|
|||
|
|
P a[] =
|
|||
|
|
{
|
|||
|
|
P(1),
|
|||
|
|
P(2),
|
|||
|
|
P(3),
|
|||
|
|
P(4),
|
|||
|
|
P(1),
|
|||
|
|
P(2)
|
|||
|
|
};
|
|||
|
|
const C c(std::begin(a), std::end(a));
|
|||
|
|
size_t bc = c.bucket_count();
|
|||
|
|
assert(bc >= 5);
|
|||
|
|
for (size_t i = 0; i < 13; ++i)
|
|||
|
|
assert(c.bucket(i) == i % bc);
|
|||
|
|
}
|
|||
|
|
}
|