test/std/containers/unord/unord.multiset/unord.multiset.cnstr/assign_init.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 // unordered_multiset& operator=(initializer_list<value_type> il);
  17
  18 #include <unordered_set>
  19 #include <cassert>
  20 #include <cfloat>
  21 #include <cstddef>
  22
  23 #include "../../../test_compare.h"
  24 #include "../../../test_hash.h"
  25 #include "test_allocator.h"
  26 #include "min_allocator.h"
  27
  28 int main()
  29 {
  30 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
  31     {
  32         typedef test_allocator<int> A;
  33         typedef std::unordered_multiset<int,
  34                                    test_hash<std::hash<int> >,
  35                                    test_compare<std::equal_to<int> >,
  36                                    A
  37                                    > C;
  38         typedef int P;
  39         C c =   {
  40                     P(4),
  41                     P(1),
  42                     P(2)
  43                 };
  44         c =     {
  45                     P(1),
  46                     P(2),
  47                     P(3),
  48                     P(4),
  49                     P(1),
  50                     P(2)
  51                 };
  52         assert(c.bucket_count() >= 7);
  53         assert(c.size() == 6);
  54         assert(c.count(1) == 2);
  55         assert(c.count(2) == 2);
  56         assert(c.count(3) == 1);
  57         assert(c.count(4) == 1);
  58         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
  59         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
  60         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
  61         assert(c.max_load_factor() == 1);
  62     }
  63 #if TEST_STD_VER >= 11
  64     {
  65         typedef min_allocator<int> A;
  66         typedef std::unordered_multiset<int,
  67                                    test_hash<std::hash<int> >,
  68                                    test_compare<std::equal_to<int> >,
  69                                    A
  70                                    > C;
  71         typedef int P;
  72         C c =   {
  73                     P(4),
  74                     P(1),
  75                     P(2)
  76                 };
  77         c =     {
  78                     P(1),
  79                     P(2),
  80                     P(3),
  81                     P(4),
  82                     P(1),
  83                     P(2)
  84                 };
  85         assert(c.bucket_count() >= 7);
  86         assert(c.size() == 6);
  87         assert(c.count(1) == 2);
  88         assert(c.count(2) == 2);
  89         assert(c.count(3) == 1);
  90         assert(c.count(4) == 1);
  91         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
  92         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
  93         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
  94         assert(c.max_load_factor() == 1);
  95     }
  96 #endif
  97 #endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
  98 }