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(size_type n, const hasher& hf);
     17 
     18 #include <unordered_map>
     19 #include <cassert>
     20 
     21 #include "../../../NotConstructible.h"
     22 #include "../../../test_compare.h"
     23 #include "../../../test_hash.h"
     24 #include "test_allocator.h"
     25 #include "min_allocator.h"
     26 
     27 int main()
     28 {
     29     {
     30         typedef std::unordered_map<NotConstructible, NotConstructible,
     31                                    test_hash<std::hash<NotConstructible> >,
     32                                    test_compare<std::equal_to<NotConstructible> >,
     33                                    test_allocator<std::pair<const NotConstructible,
     34                                                                   NotConstructible> >
     35                                    > C;
     36         C c(7,
     37             test_hash<std::hash<NotConstructible> >(8)
     38            );
     39         assert(c.bucket_count() == 7);
     40         assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
     41         assert(c.key_eq() == test_compare<std::equal_to<NotConstructible> >());
     42         assert(c.get_allocator() ==
     43                (test_allocator<std::pair<const NotConstructible, NotConstructible> >()));
     44         assert(c.size() == 0);
     45         assert(c.empty());
     46         assert(std::distance(c.begin(), c.end()) == 0);
     47         assert(c.load_factor() == 0);
     48         assert(c.max_load_factor() == 1);
     49     }
     50 #if __cplusplus >= 201103L
     51     {
     52         typedef std::unordered_map<NotConstructible, NotConstructible,
     53                                    test_hash<std::hash<NotConstructible> >,
     54                                    test_compare<std::equal_to<NotConstructible> >,
     55                                    min_allocator<std::pair<const NotConstructible,
     56                                                                  NotConstructible> >
     57                                    > C;
     58         C c(7,
     59             test_hash<std::hash<NotConstructible> >(8)
     60            );
     61         assert(c.bucket_count() == 7);
     62         assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
     63         assert(c.key_eq() == test_compare<std::equal_to<NotConstructible> >());
     64         assert(c.get_allocator() ==
     65                (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
     66         assert(c.size() == 0);
     67         assert(c.empty());
     68         assert(std::distance(c.begin(), c.end()) == 0);
     69         assert(c.load_factor() == 0);
     70         assert(c.max_load_factor() == 1);
     71     }
     72 #endif
     73 }
     74