test/std/containers/unord/unord.multiset/unord.multiset.cnstr/range_size.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 // template <class InputIterator>
  17 //     unordered_multiset(InputIterator first, InputIterator last, size_type n);
  18
  19 #include <unordered_set>
  20 #include <cassert>
  21 #include <cfloat>
  22 #include <cmath>
  23 #include <cstddef>
  24
  25 #include "test_macros.h"
  26 #include "test_iterators.h"
  27 #include "../../../test_compare.h"
  28 #include "../../../test_hash.h"
  29 #include "test_allocator.h"
  30 #include "min_allocator.h"
  31
  32 int main()
  33 {
  34     {
  35         typedef std::unordered_multiset<int,
  36                                    test_hash<std::hash<int> >,
  37                                    test_compare<std::equal_to<int> >,
  38                                    test_allocator<int>
  39                                    > C;
  40         typedef int P;
  41         P a[] =
  42         {
  43             P(1),
  44             P(2),
  45             P(3),
  46             P(4),
  47             P(1),
  48             P(2)
  49         };
  50         C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
  51             7
  52            );
  53         LIBCPP_ASSERT(c.bucket_count() == 7);
  54         assert(c.size() == 6);
  55         assert(c.count(1) == 2);
  56         assert(c.count(2) == 2);
  57         assert(c.count(3) == 1);
  58         assert(c.count(4) == 1);
  59         assert(c.hash_function() == test_hash<std::hash<int> >());
  60         assert(c.key_eq() == test_compare<std::equal_to<int> >());
  61         assert(c.get_allocator() == test_allocator<int>());
  62         assert(!c.empty());
  63         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
  64         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
  65         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
  66         assert(c.max_load_factor() == 1);
  67     }
  68 #if TEST_STD_VER >= 11
  69     {
  70         typedef std::unordered_multiset<int,
  71                                    test_hash<std::hash<int> >,
  72                                    test_compare<std::equal_to<int> >,
  73                                    min_allocator<int>
  74                                    > C;
  75         typedef int P;
  76         P a[] =
  77         {
  78             P(1),
  79             P(2),
  80             P(3),
  81             P(4),
  82             P(1),
  83             P(2)
  84         };
  85         C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
  86             7
  87            );
  88         LIBCPP_ASSERT(c.bucket_count() == 7);
  89         assert(c.size() == 6);
  90         assert(c.count(1) == 2);
  91         assert(c.count(2) == 2);
  92         assert(c.count(3) == 1);
  93         assert(c.count(4) == 1);
  94         assert(c.hash_function() == test_hash<std::hash<int> >());
  95         assert(c.key_eq() == test_compare<std::equal_to<int> >());
  96         assert(c.get_allocator() == min_allocator<int>());
  97         assert(!c.empty());
  98         assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
  99         assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
 100         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
 101         assert(c.max_load_factor() == 1);
 102     }
 103 #endif
 104 }