text: //===----------------------------------------------------------------------===//
  //
  // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  // See https://llvm.org/LICENSE.txt for license information.
  // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  //
  //===----------------------------------------------------------------------===//
  
  // UNSUPPORTED: c++98, c++03
  
  // <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
  
  // unordered_map& operator=(unordered_map&& u);
  
  #include <unordered_map.hxx>
  #include <string.hxx>
  #include <cassert.hxx>
  #include <cfloat.hxx>
  #include <cmath.hxx>
  #include <cstddef.hxx>
  
  #include "test_macros.h"
  #include "../../../test_compare.h"
  #include "../../../test_hash.h"
  #include "test_allocator.h"
  #include "min_allocator.h"
  
  int main(int, char**)
  {
      {
          typedef test_allocator<std::pair<const int, std::string> > A;
          typedef std::unordered_map<int, std::string,
                                     test_hash<std::hash<int> >,
                                     test_compare<std::equal_to<int> >,
                                     A
                                     > 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 c0(a, a + sizeof(a)/sizeof(a[0]),
              7,
              test_hash<std::hash<int> >(8),
              test_compare<std::equal_to<int> >(9),
              A(10)
             );
          C c(a, a + 2,
              7,
              test_hash<std::hash<int> >(2),
              test_compare<std::equal_to<int> >(3),
              A(4)
             );
          c = std::move(c0);
          LIBCPP_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() == A(4));
          assert(!c.empty());
          assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
          assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
          assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
          assert(c.max_load_factor() == 1);
      }
      {
          typedef test_allocator<std::pair<const int, std::string> > A;
          typedef std::unordered_map<int, std::string,
                                     test_hash<std::hash<int> >,
                                     test_compare<std::equal_to<int> >,
                                     A
                                     > 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 c0(a, a + sizeof(a)/sizeof(a[0]),
              7,
              test_hash<std::hash<int> >(8),
              test_compare<std::equal_to<int> >(9),
              A(10)
             );
          C c(a, a + 2,
              7,
              test_hash<std::hash<int> >(2),
              test_compare<std::equal_to<int> >(3),
              A(10)
             );
          c = std::move(c0);
          LIBCPP_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() == A(10));
          assert(!c.empty());
          assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
          assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
          assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
          assert(c.max_load_factor() == 1);
          assert(c0.size() == 0);
      }
      {
          typedef other_allocator<std::pair<const int, std::string> > A;
          typedef std::unordered_map<int, std::string,
                                     test_hash<std::hash<int> >,
                                     test_compare<std::equal_to<int> >,
                                     A
                                     > 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 c0(a, a + sizeof(a)/sizeof(a[0]),
              7,
              test_hash<std::hash<int> >(8),
              test_compare<std::equal_to<int> >(9),
              A(10)
             );
          C c(a, a + 2,
              7,
              test_hash<std::hash<int> >(2),
              test_compare<std::equal_to<int> >(3),
              A(4)
             );
          c = std::move(c0);
          LIBCPP_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() == A(10));
          assert(!c.empty());
          assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
          assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
          assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
          assert(c.max_load_factor() == 1);
          assert(c0.size() == 0);
      }
      {
          typedef min_allocator<std::pair<const int, std::string> > A;
          typedef std::unordered_map<int, std::string,
                                     test_hash<std::hash<int> >,
                                     test_compare<std::equal_to<int> >,
                                     A
                                     > 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 c0(a, a + sizeof(a)/sizeof(a[0]),
              7,
              test_hash<std::hash<int> >(8),
              test_compare<std::equal_to<int> >(9),
              A()
             );
          C c(a, a + 2,
              7,
              test_hash<std::hash<int> >(2),
              test_compare<std::equal_to<int> >(3),
              A()
             );
          c = std::move(c0);
          LIBCPP_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() == A());
          assert(!c.empty());
          assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
          assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
          assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
          assert(c.max_load_factor() == 1);
          assert(c0.size() == 0);
      }
  
    return 0;
  }
  