text: //===----------------------------------------------------------------------===//
  //
  //                     The LLVM Compiler Infrastructure
  //
  // This file is dual licensed under the MIT and the University of Illinois Open
  // Source Licenses. See LICENSE.TXT for details.
  //
  //===----------------------------------------------------------------------===//
  
  // <unordered_map>
  
  // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
  //           class Alloc = allocator<pair<const Key, T>>>
  // class unordered_map
  
  // template <class InputIterator>
  //     unordered_map(InputIterator first, InputIterator last, size_type n,
  //                   const hasher& hf, const key_equal& eql);
  
  #include <unordered_map>
  #include <string>
  #include <cassert>
  #include <cfloat>
  #include <cmath>
  
  #include "test_iterators.h"
  #include "../../../NotConstructible.h"
  #include "../../../test_compare.h"
  #include "../../../test_hash.h"
  #include "test_allocator.h"
  #include "min_allocator.h"
  
  int main()
  {
      {
          typedef std::unordered_map<int, std::string,
                                     test_hash<std::hash<int> >,
                                     test_compare<std::equal_to<int> >,
                                     test_allocator<std::pair<const int, std::string> >
                                     > C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(1, "one"),
              P(2, "two"),
              P(3, "three"),
              P(4, "four"),
              P(1, "four"),
              P(2, "four"),
          };
          C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
              7,
              test_hash<std::hash<int> >(8),
              test_compare<std::equal_to<int> >(9)
             );
          assert(c.bucket_count() == 7);
          assert(c.size() == 4);
          assert(c.at(1) == "one");
          assert(c.at(2) == "two");
          assert(c.at(3) == "three");
          assert(c.at(4) == "four");
          assert(c.hash_function() == test_hash<std::hash<int> >(8));
          assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
          assert(c.get_allocator() ==
                 (test_allocator<std::pair<const int, std::string> >()));
          assert(!c.empty());
          assert(std::distance(c.begin(), c.end()) == c.size());
          assert(std::distance(c.cbegin(), c.cend()) == c.size());
          assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
          assert(c.max_load_factor() == 1);
      }
  #if TEST_STD_VER >= 11
      {
          typedef std::unordered_map<int, std::string,
                                     test_hash<std::hash<int> >,
                                     test_compare<std::equal_to<int> >,
                                     min_allocator<std::pair<const int, std::string> >
                                     > C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(1, "one"),
              P(2, "two"),
              P(3, "three"),
              P(4, "four"),
              P(1, "four"),
              P(2, "four"),
          };
          C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
              7,
              test_hash<std::hash<int> >(8),
              test_compare<std::equal_to<int> >(9)
             );
          assert(c.bucket_count() == 7);
          assert(c.size() == 4);
          assert(c.at(1) == "one");
          assert(c.at(2) == "two");
          assert(c.at(3) == "three");
          assert(c.at(4) == "four");
          assert(c.hash_function() == test_hash<std::hash<int> >(8));
          assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
          assert(c.get_allocator() ==
                 (min_allocator<std::pair<const int, std::string> >()));
          assert(!c.empty());
          assert(std::distance(c.begin(), c.end()) == c.size());
          assert(std::distance(c.cbegin(), c.cend()) == c.size());
          assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
          assert(c.max_load_factor() == 1);
      }
  #endif
  }
  