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
  //
  //===----------------------------------------------------------------------===//
  
  // <unordered_map>
  
  // template <class Key, class T, class Hash, class Pred, class Alloc>
  // bool
  // operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
  //            const unordered_map<Key, T, Hash, Pred, Alloc>& y);
  //
  // template <class Key, class T, class Hash, class Pred, class Alloc>
  // bool
  // operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
  //            const unordered_map<Key, T, Hash, Pred, Alloc>& y);
  
  #include <unordered_map>
  #include <string>
  #include <cassert>
  
  #include "min_allocator.h"
  
  int main(int, char**)
  {
      {
          typedef std::unordered_map<int, std::string> C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(10, "ten"),
              P(20, "twenty"),
              P(30, "thirty"),
              P(40, "forty"),
              P(50, "fifty"),
              P(60, "sixty"),
              P(70, "seventy"),
              P(80, "eighty"),
          };
          const C c1(std::begin(a), std::end(a));
          const C c2;
          assert(!(c1 == c2));
          assert( (c1 != c2));
      }
      {
          typedef std::unordered_map<int, std::string> C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(10, "ten"),
              P(20, "twenty"),
              P(30, "thirty"),
              P(40, "forty"),
              P(50, "fifty"),
              P(60, "sixty"),
              P(70, "seventy"),
              P(80, "eighty"),
          };
          const C c1(std::begin(a), std::end(a));
          const C c2 = c1;
          assert( (c1 == c2));
          assert(!(c1 != c2));
      }
      {
          typedef std::unordered_map<int, std::string> C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(10, "ten"),
              P(20, "twenty"),
              P(30, "thirty"),
              P(40, "forty"),
              P(50, "fifty"),
              P(60, "sixty"),
              P(70, "seventy"),
              P(80, "eighty"),
          };
          C c1(std::begin(a), std::end(a));
          C c2 = c1;
          c2.rehash(30);
          assert( (c1 == c2));
          assert(!(c1 != c2));
          c2.insert(P(90, "ninety"));
          assert(!(c1 == c2));
          assert( (c1 != c2));
          c1.insert(P(90, "ninety"));
          assert( (c1 == c2));
          assert(!(c1 != c2));
      }
  #if TEST_STD_VER >= 11
      {
          typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
                              min_allocator<std::pair<const int, std::string>>> C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(10, "ten"),
              P(20, "twenty"),
              P(30, "thirty"),
              P(40, "forty"),
              P(50, "fifty"),
              P(60, "sixty"),
              P(70, "seventy"),
              P(80, "eighty"),
          };
          const C c1(std::begin(a), std::end(a));
          const C c2;
          assert(!(c1 == c2));
          assert( (c1 != c2));
      }
      {
          typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
                              min_allocator<std::pair<const int, std::string>>> C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(10, "ten"),
              P(20, "twenty"),
              P(30, "thirty"),
              P(40, "forty"),
              P(50, "fifty"),
              P(60, "sixty"),
              P(70, "seventy"),
              P(80, "eighty"),
          };
          const C c1(std::begin(a), std::end(a));
          const C c2 = c1;
          assert( (c1 == c2));
          assert(!(c1 != c2));
      }
      {
          typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
                              min_allocator<std::pair<const int, std::string>>> C;
          typedef std::pair<int, std::string> P;
          P a[] =
          {
              P(10, "ten"),
              P(20, "twenty"),
              P(30, "thirty"),
              P(40, "forty"),
              P(50, "fifty"),
              P(60, "sixty"),
              P(70, "seventy"),
              P(80, "eighty"),
          };
          C c1(std::begin(a), std::end(a));
          C c2 = c1;
          c2.rehash(30);
          assert( (c1 == c2));
          assert(!(c1 != c2));
          c2.insert(P(90, "ninety"));
          assert(!(c1 == c2));
          assert( (c1 != c2));
          c1.insert(P(90, "ninety"));
          assert( (c1 == c2));
          assert(!(c1 != c2));
      }
  #endif
  
    return 0;
  }
  