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