src/third_party/libc++/trunk/test/containers/unord/unord.map/bucket_count.pass.cpp

   1 //===----------------------------------------------------------------------===//
   2 //
   3 //                     The LLVM Compiler Infrastructure
   4 //
   5 // This file is dual licensed under the MIT and the University of Illinois Open
   6 // Source Licenses. See LICENSE.TXT for details.
   7 //
   8 //===----------------------------------------------------------------------===//
   9
  10 // <unordered_map>
  11
  12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
  13 //           class Alloc = allocator<pair<const Key, T>>>
  14 // class unordered_map
  15
  16 // size_type bucket_count() const;
  17
  18 #include <unordered_map>
  19 #include <string>
  20 #include <cassert>
  21
  22 #include "min_allocator.h"
  23
  24 int main()
  25 {
  26     {
  27         typedef std::unordered_map<int, std::string> C;
  28         typedef C::const_iterator I;
  29         typedef std::pair<int, std::string> P;
  30         const C c;
  31         assert(c.bucket_count() == 0);
  32     }
  33     {
  34         typedef std::unordered_map<int, std::string> C;
  35         typedef C::const_iterator I;
  36         typedef std::pair<int, std::string> P;
  37         P a[] =
  38         {
  39             P(10, "ten"),
  40             P(20, "twenty"),
  41             P(30, "thirty"),
  42             P(40, "forty"),
  43             P(50, "fifty"),
  44             P(60, "sixty"),
  45             P(70, "seventy"),
  46             P(80, "eighty"),
  47         };
  48         const C c(std::begin(a), std::end(a));
  49         assert(c.bucket_count() >= 11);
  50     }
  51 #if __cplusplus >= 201103L
  52     {
  53         typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
  54                             min_allocator<std::pair<const int, std::string>>> C;
  55         typedef C::const_iterator I;
  56         typedef std::pair<int, std::string> P;
  57         const C c;
  58         assert(c.bucket_count() == 0);
  59     }
  60     {
  61         typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
  62                             min_allocator<std::pair<const int, std::string>>> C;
  63         typedef C::const_iterator I;
  64         typedef std::pair<int, std::string> P;
  65         P a[] =
  66         {
  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() >= 11);
  78     }
  79 #endif
  80 }