test/std/containers/unord/unord.set/unord.set.cnstr/init_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_set
  15
  16 // unordered_set(initializer_list<value_type> il, size_type n);
  17
  18 #include <unordered_set>
  19 #include <cassert>
  20 #include <cfloat>
  21 #include <cmath>
  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 std::unordered_set<int,
  33                                    test_hash<std::hash<int> >,
  34                                    test_compare<std::equal_to<int> >,
  35                                    test_allocator<int>
  36                                    > C;
  37         typedef int P;
  38         C c({
  39                 P(1),
  40                 P(2),
  41                 P(3),
  42                 P(4),
  43                 P(1),
  44                 P(2)
  45             },
  46             7
  47            );
  48         assert(c.bucket_count() == 7);
  49         assert(c.size() == 4);
  50         assert(c.count(1) == 1);
  51         assert(c.count(2) == 1);
  52         assert(c.count(3) == 1);
  53         assert(c.count(4) == 1);
  54         assert(c.hash_function() == test_hash<std::hash<int> >());
  55         assert(c.key_eq() == test_compare<std::equal_to<int> >());
  56         assert(c.get_allocator() == test_allocator<int>());
  57         assert(!c.empty());
  58         assert(std::distance(c.begin(), c.end()) == c.size());
  59         assert(std::distance(c.cbegin(), c.cend()) == c.size());
  60         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
  61         assert(c.max_load_factor() == 1);
  62     }
  63 #if __cplusplus >= 201103L
  64     {
  65         typedef std::unordered_set<int,
  66                                    test_hash<std::hash<int> >,
  67                                    test_compare<std::equal_to<int> >,
  68                                    min_allocator<int>
  69                                    > C;
  70         typedef int P;
  71         C c({
  72                 P(1),
  73                 P(2),
  74                 P(3),
  75                 P(4),
  76                 P(1),
  77                 P(2)
  78             },
  79             7
  80            );
  81         assert(c.bucket_count() == 7);
  82         assert(c.size() == 4);
  83         assert(c.count(1) == 1);
  84         assert(c.count(2) == 1);
  85         assert(c.count(3) == 1);
  86         assert(c.count(4) == 1);
  87         assert(c.hash_function() == test_hash<std::hash<int> >());
  88         assert(c.key_eq() == test_compare<std::equal_to<int> >());
  89         assert(c.get_allocator() == min_allocator<int>());
  90         assert(!c.empty());
  91         assert(std::distance(c.begin(), c.end()) == c.size());
  92         assert(std::distance(c.cbegin(), c.cend()) == c.size());
  93         assert(std::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 }