test/std/containers/unord/unord.map/unord.map.cnstr/init_size_hash.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_map>
  11
  12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
  13 //           class Alloc = allocator<pair<const Key, T>>>
  14 // class unordered_map
  15
  16 // unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf);
  17
  18 #include <unordered_map>
  19 #include <string>
  20 #include <cassert>
  21 #include <cfloat>
  22 #include <cmath>
  23
  24 #include "../../../test_compare.h"
  25 #include "../../../test_hash.h"
  26 #include "test_allocator.h"
  27 #include "min_allocator.h"
  28
  29 int main()
  30 {
  31 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
  32     {
  33         typedef std::unordered_map<int, std::string,
  34                                    test_hash<std::hash<int> >,
  35                                    test_compare<std::equal_to<int> >,
  36                                    test_allocator<std::pair<const int, std::string> >
  37                                    > C;
  38         typedef std::pair<int, std::string> P;
  39         C c({
  40                 P(1, "one"),
  41                 P(2, "two"),
  42                 P(3, "three"),
  43                 P(4, "four"),
  44                 P(1, "four"),
  45                 P(2, "four"),
  46             },
  47             7,
  48             test_hash<std::hash<int> >(8)
  49            );
  50         assert(c.bucket_count() == 7);
  51         assert(c.size() == 4);
  52         assert(c.at(1) == "one");
  53         assert(c.at(2) == "two");
  54         assert(c.at(3) == "three");
  55         assert(c.at(4) == "four");
  56         assert(c.hash_function() == test_hash<std::hash<int> >(8));
  57         assert(c.key_eq() == test_compare<std::equal_to<int> >());
  58         assert(c.get_allocator() ==
  59                (test_allocator<std::pair<const int, std::string> >()));
  60         assert(!c.empty());
  61         assert(std::distance(c.begin(), c.end()) == c.size());
  62         assert(std::distance(c.cbegin(), c.cend()) == c.size());
  63         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
  64         assert(c.max_load_factor() == 1);
  65     }
  66 #if __cplusplus >= 201103L
  67     {
  68         typedef std::unordered_map<int, std::string,
  69                                    test_hash<std::hash<int> >,
  70                                    test_compare<std::equal_to<int> >,
  71                                    min_allocator<std::pair<const int, std::string> >
  72                                    > C;
  73         typedef std::pair<int, std::string> P;
  74         C c({
  75                 P(1, "one"),
  76                 P(2, "two"),
  77                 P(3, "three"),
  78                 P(4, "four"),
  79                 P(1, "four"),
  80                 P(2, "four"),
  81             },
  82             7,
  83             test_hash<std::hash<int> >(8)
  84            );
  85         assert(c.bucket_count() == 7);
  86         assert(c.size() == 4);
  87         assert(c.at(1) == "one");
  88         assert(c.at(2) == "two");
  89         assert(c.at(3) == "three");
  90         assert(c.at(4) == "four");
  91         assert(c.hash_function() == test_hash<std::hash<int> >(8));
  92         assert(c.key_eq() == test_compare<std::equal_to<int> >());
  93         assert(c.get_allocator() ==
  94                (min_allocator<std::pair<const int, std::string> >()));
  95         assert(!c.empty());
  96         assert(std::distance(c.begin(), c.end()) == c.size());
  97         assert(std::distance(c.cbegin(), c.cend()) == c.size());
  98         assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
  99         assert(c.max_load_factor() == 1);
 100     }
 101 #endif
 102 #endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
 103 }