test/std/containers/unord/unord.multiset/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_set>
  11
  12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
  13 //           class Alloc = allocator<Value>>
  14 // class unordered_multiset
  15
  16 // size_type bucket_count() const;
  17
  18 #include <unordered_set>
  19 #include <cassert>
  20
  21 #include "test_macros.h"
  22 #include "min_allocator.h"
  23
  24 int main()
  25 {
  26     {
  27         typedef std::unordered_multiset<int> C;
  28         typedef C::const_iterator I;
  29         typedef int P;
  30         const C c;
  31         LIBCPP_ASSERT(c.bucket_count() == 0);
  32     }
  33     {
  34         typedef std::unordered_multiset<int> C;
  35         typedef C::const_iterator I;
  36         typedef int P;
  37         P a[] =
  38         {
  39             P(10),
  40             P(20),
  41             P(30),
  42             P(40),
  43             P(50),
  44             P(60),
  45             P(70),
  46             P(80)
  47         };
  48         const C c(std::begin(a), std::end(a));
  49         assert(c.bucket_count() >= 8);
  50     }
  51 #if TEST_STD_VER >= 11
  52     {
  53         typedef std::unordered_multiset<int, std::hash<int>,
  54                                       std::equal_to<int>, min_allocator<int>> C;
  55         typedef C::const_iterator I;
  56         typedef int P;
  57         const C c;
  58         LIBCPP_ASSERT(c.bucket_count() == 0);
  59     }
  60     {
  61         typedef std::unordered_multiset<int, std::hash<int>,
  62                                       std::equal_to<int>, min_allocator<int>> C;
  63         typedef C::const_iterator I;
  64         typedef int P;
  65         P a[] =
  66         {
  67             P(10),
  68             P(20),
  69             P(30),
  70             P(40),
  71             P(50),
  72             P(60),
  73             P(70),
  74             P(80)
  75         };
  76         const C c(std::begin(a), std::end(a));
  77         assert(c.bucket_count() >= 8);
  78     }
  79 #endif
  80 }