Home | History | Annotate | Download | only in unord.multiset
      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_size(size_type n) const
     17 
     18 #ifdef _LIBCPP_DEBUG
     19 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
     20 #endif
     21 
     22 #include <unordered_set>
     23 #include <cassert>
     24 
     25 #include "test_macros.h"
     26 #include "min_allocator.h"
     27 
     28 int main()
     29 {
     30     {
     31         typedef std::unordered_multiset<int> C;
     32         typedef int P;
     33         P a[] =
     34         {
     35             P(1),
     36             P(2),
     37             P(3),
     38             P(4),
     39             P(1),
     40             P(2)
     41         };
     42         const C c(std::begin(a), std::end(a));
     43         assert(c.bucket_count() >= 7);
     44         LIBCPP_ASSERT(c.bucket_size(0) == 0);
     45         LIBCPP_ASSERT(c.bucket_size(1) == 2);
     46         LIBCPP_ASSERT(c.bucket_size(2) == 2);
     47         LIBCPP_ASSERT(c.bucket_size(3) == 1);
     48         LIBCPP_ASSERT(c.bucket_size(4) == 1);
     49         LIBCPP_ASSERT(c.bucket_size(5) == 0);
     50         LIBCPP_ASSERT(c.bucket_size(6) == 0);
     51     }
     52 #if TEST_STD_VER >= 11
     53     {
     54         typedef std::unordered_multiset<int, std::hash<int>,
     55                                       std::equal_to<int>, min_allocator<int>> C;
     56         typedef int P;
     57         P a[] =
     58         {
     59             P(1),
     60             P(2),
     61             P(3),
     62             P(4),
     63             P(1),
     64             P(2)
     65         };
     66         const C c(std::begin(a), std::end(a));
     67         assert(c.bucket_count() >= 7);
     68         LIBCPP_ASSERT(c.bucket_size(0) == 0);
     69         LIBCPP_ASSERT(c.bucket_size(1) == 2);
     70         LIBCPP_ASSERT(c.bucket_size(2) == 2);
     71         LIBCPP_ASSERT(c.bucket_size(3) == 1);
     72         LIBCPP_ASSERT(c.bucket_size(4) == 1);
     73         LIBCPP_ASSERT(c.bucket_size(5) == 0);
     74         LIBCPP_ASSERT(c.bucket_size(6) == 0);
     75     }
     76 #endif
     77 #if _LIBCPP_DEBUG_LEVEL >= 1
     78     {
     79         typedef std::unordered_multiset<int> C;
     80         C c;
     81         C::size_type i = c.bucket_size(3);
     82         assert(false);
     83     }
     84 #endif
     85 }
     86