//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <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_map
// size_type bucket_size(size_type n) const
#include <unordered_map>
#include <string>
#include <cassert>
#include <iterator>
#include "test_macros.h"
#include "min_allocator.h"
int main(int, char**)
{
{
typedef std::unordered_map<int, std::string> C;
typedef std::pair<int, std::string> P;
P a[] =
{
P(1, "one"),
P(2, "two"),
P(3, "three"),
P(4, "four"),
P(1, "four"),
P(2, "four"),
};
const C c(std::begin(a), std::end(a));
assert(c.bucket_count() >= 5);
LIBCPP_ASSERT(c.bucket_size(0) == 0);
LIBCPP_ASSERT(c.bucket_size(1) == 1);
LIBCPP_ASSERT(c.bucket_size(2) == 1);
LIBCPP_ASSERT(c.bucket_size(3) == 1);
LIBCPP_ASSERT(c.bucket_size(4) == 1);
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
min_allocator<std::pair<const int, std::string>>> C;
typedef std::pair<int, std::string> P;
P a[] =
{
P(1, "one"),
P(2, "two"),
P(3, "three"),
P(4, "four"),
P(1, "four"),
P(2, "four"),
};
const C c(std::begin(a), std::end(a));
assert(c.bucket_count() >= 5);
LIBCPP_ASSERT(c.bucket_size(0) == 0);
LIBCPP_ASSERT(c.bucket_size(1) == 1);
LIBCPP_ASSERT(c.bucket_size(2) == 1);
LIBCPP_ASSERT(c.bucket_size(3) == 1);
LIBCPP_ASSERT(c.bucket_size(4) == 1);
}
#endif
return 0;
}