Home | History | Annotate | Download | only in unord.map.cnstr
      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,
     17 //               const hasher& hf, const key_equal& eql);
     18 
     19 #include <unordered_map>
     20 #include <string>
     21 #include <cassert>
     22 #include <cfloat>
     23 
     24 #include "../../../test_compare.h"
     25 #include "../../../test_hash.h"
     26 #include "../../../test_allocator.h"
     27 
     28 int main()
     29 {
     30 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
     31     {
     32         typedef std::unordered_map<int, std::string,
     33                                    test_hash<std::hash<int> >,
     34                                    test_compare<std::equal_to<int> >,
     35                                    test_allocator<std::pair<const int, std::string> >
     36                                    > C;
     37         typedef std::pair<int, std::string> P;
     38         C c({
     39                 P(1, "one"),
     40                 P(2, "two"),
     41                 P(3, "three"),
     42                 P(4, "four"),
     43                 P(1, "four"),
     44                 P(2, "four"),
     45             },
     46             7,
     47             test_hash<std::hash<int> >(8),
     48             test_compare<std::equal_to<int> >(9)
     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> >(9));
     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(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
     64         assert(c.max_load_factor() == 1);
     65     }
     66 #endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
     67 }
     68