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(const unordered_map& u);
     17 
     18 #include <unordered_map>
     19 #include <string>
     20 #include <cassert>
     21 #include <cfloat>
     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     {
     31         typedef std::unordered_map<int, std::string,
     32                                    test_hash<std::hash<int> >,
     33                                    test_compare<std::equal_to<int> >,
     34                                    test_allocator<std::pair<const int, std::string> >
     35                                    > C;
     36         typedef std::pair<int, std::string> P;
     37         P a[] =
     38         {
     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         C c0(a, a + sizeof(a)/sizeof(a[0]),
     47             7,
     48             test_hash<std::hash<int> >(8),
     49             test_compare<std::equal_to<int> >(9),
     50             test_allocator<std::pair<const int, std::string> >(10)
     51            );
     52         C c = c0;
     53         assert(c.bucket_count() == 7);
     54         assert(c.size() == 4);
     55         assert(c.at(1) == "one");
     56         assert(c.at(2) == "two");
     57         assert(c.at(3) == "three");
     58         assert(c.at(4) == "four");
     59         assert(c.hash_function() == test_hash<std::hash<int> >(8));
     60         assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
     61         assert(c.get_allocator() ==
     62                (test_allocator<std::pair<const int, std::string> >(10)));
     63         assert(!c.empty());
     64         assert(std::distance(c.begin(), c.end()) == c.size());
     65         assert(std::distance(c.cbegin(), c.cend()) == c.size());
     66         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
     67         assert(c.max_load_factor() == 1);
     68     }
     69 #ifndef _LIBCPP_HAS_NO_ADVANCED_SFINAE
     70     {
     71         typedef std::unordered_map<int, std::string,
     72                                    test_hash<std::hash<int> >,
     73                                    test_compare<std::equal_to<int> >,
     74                                    other_allocator<std::pair<const int, std::string> >
     75                                    > C;
     76         typedef std::pair<int, std::string> P;
     77         P a[] =
     78         {
     79             P(1, "one"),
     80             P(2, "two"),
     81             P(3, "three"),
     82             P(4, "four"),
     83             P(1, "four"),
     84             P(2, "four"),
     85         };
     86         C c0(a, a + sizeof(a)/sizeof(a[0]),
     87             7,
     88             test_hash<std::hash<int> >(8),
     89             test_compare<std::equal_to<int> >(9),
     90             other_allocator<std::pair<const int, std::string> >(10)
     91            );
     92         C c = c0;
     93         assert(c.bucket_count() == 7);
     94         assert(c.size() == 4);
     95         assert(c.at(1) == "one");
     96         assert(c.at(2) == "two");
     97         assert(c.at(3) == "three");
     98         assert(c.at(4) == "four");
     99         assert(c.hash_function() == test_hash<std::hash<int> >(8));
    100         assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
    101         assert(c.get_allocator() ==
    102                (other_allocator<std::pair<const int, std::string> >(-2)));
    103         assert(!c.empty());
    104         assert(std::distance(c.begin(), c.end()) == c.size());
    105         assert(std::distance(c.cbegin(), c.cend()) == c.size());
    106         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
    107         assert(c.max_load_factor() == 1);
    108     }
    109 #endif  // _LIBCPP_HAS_NO_ADVANCED_SFINAE
    110 #if __cplusplus >= 201103L
    111     {
    112         typedef std::unordered_map<int, std::string,
    113                                    test_hash<std::hash<int> >,
    114                                    test_compare<std::equal_to<int> >,
    115                                    min_allocator<std::pair<const int, std::string> >
    116                                    > C;
    117         typedef std::pair<int, std::string> P;
    118         P a[] =
    119         {
    120             P(1, "one"),
    121             P(2, "two"),
    122             P(3, "three"),
    123             P(4, "four"),
    124             P(1, "four"),
    125             P(2, "four"),
    126         };
    127         C c0(a, a + sizeof(a)/sizeof(a[0]),
    128             7,
    129             test_hash<std::hash<int> >(8),
    130             test_compare<std::equal_to<int> >(9),
    131             min_allocator<std::pair<const int, std::string> >()
    132            );
    133         C c = c0;
    134         assert(c.bucket_count() == 7);
    135         assert(c.size() == 4);
    136         assert(c.at(1) == "one");
    137         assert(c.at(2) == "two");
    138         assert(c.at(3) == "three");
    139         assert(c.at(4) == "four");
    140         assert(c.hash_function() == test_hash<std::hash<int> >(8));
    141         assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
    142         assert(c.get_allocator() ==
    143                (min_allocator<std::pair<const int, std::string> >()));
    144         assert(!c.empty());
    145         assert(std::distance(c.begin(), c.end()) == c.size());
    146         assert(std::distance(c.cbegin(), c.cend()) == c.size());
    147         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
    148         assert(c.max_load_factor() == 1);
    149     }
    150 #endif
    151 }
    152