83 lines · cpp
1//===----------------------------------------------------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8 9// <unordered_map>10 11// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,12// class Alloc = allocator<pair<const Key, T>>>13// class unordered_map14 15// size_type bucket_count() const;16 17#include <unordered_map>18#include <string>19#include <cassert>20#include <iterator>21 22#include "test_macros.h"23#include "min_allocator.h"24 25int main(int, char**) {26 {27 typedef std::unordered_map<int, std::string> C;28 const C c;29 LIBCPP_ASSERT(c.bucket_count() == 0);30 }31 {32 typedef std::unordered_map<int, std::string> C;33 typedef std::pair<int, std::string> P;34 P a[] = {35 P(10, "ten"),36 P(20, "twenty"),37 P(30, "thirty"),38 P(40, "forty"),39 P(50, "fifty"),40 P(60, "sixty"),41 P(70, "seventy"),42 P(80, "eighty"),43 };44 const C c(std::begin(a), std::end(a));45 assert(c.bucket_count() >= 8);46 }47#if TEST_STD_VER >= 1148 {49 typedef std::unordered_map<int,50 std::string,51 std::hash<int>,52 std::equal_to<int>,53 min_allocator<std::pair<const int, std::string>>>54 C;55 const C c;56 LIBCPP_ASSERT(c.bucket_count() == 0);57 }58 {59 typedef std::unordered_map<int,60 std::string,61 std::hash<int>,62 std::equal_to<int>,63 min_allocator<std::pair<const int, std::string>>>64 C;65 typedef std::pair<int, std::string> P;66 P a[] = {67 P(10, "ten"),68 P(20, "twenty"),69 P(30, "thirty"),70 P(40, "forty"),71 P(50, "fifty"),72 P(60, "sixty"),73 P(70, "seventy"),74 P(80, "eighty"),75 };76 const C c(std::begin(a), std::end(a));77 assert(c.bucket_count() >= 8);78 }79#endif80 81 return 0;82}83