//===----------------------------------------------------------------------===//
//
// 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++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_multimap

// unordered_multimap& operator=(unordered_multimap&& u);

#include <unordered_map>
#include <string>
#include <set>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstddef>

#include "test_macros.h"
#include "../../../check_consecutive.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_multimap<int, std::string, test_hash<int>, test_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<int>(8), test_equal_to<int>(9), A(10));
    C c(a, a + 2, 7, test_hash<int>(2), test_equal_to<int>(3), A(4));
    c = std::move(c0);
    LIBCPP_ASSERT(c.bucket_count() == 7);
    assert(c.size() == 6);
    typedef std::pair<C::const_iterator, C::const_iterator> Eq;
    Eq eq = c.equal_range(1);
    assert(std::distance(eq.first, eq.second) == 2);
    std::multiset<std::string> s;
    s.insert("one");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(1), c.end(), 1, s);
    eq = c.equal_range(2);
    assert(std::distance(eq.first, eq.second) == 2);
    s.insert("two");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(2), c.end(), 2, s);

    eq = c.equal_range(3);
    assert(std::distance(eq.first, eq.second) == 1);
    C::const_iterator i = eq.first;
    assert(i->first == 3);
    assert(i->second == "three");
    eq = c.equal_range(4);
    assert(std::distance(eq.first, eq.second) == 1);
    i = eq.first;
    assert(i->first == 4);
    assert(i->second == "four");
    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_multimap<int, std::string, test_hash<int>, test_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<int>(8), test_equal_to<int>(9), A(10));
    C c(a, a + 2, 7, test_hash<int>(2), test_equal_to<int>(3), A(10));
    C::iterator it0 = c0.begin();
    c               = std::move(c0);
    assert(it0 == c.begin()); // Iterators remain valid
    LIBCPP_ASSERT(c.bucket_count() == 7);
    assert(c.size() == 6);
    typedef std::pair<C::const_iterator, C::const_iterator> Eq;
    Eq eq = c.equal_range(1);
    assert(std::distance(eq.first, eq.second) == 2);
    std::multiset<std::string> s;
    s.insert("one");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(1), c.end(), 1, s);
    eq = c.equal_range(2);
    assert(std::distance(eq.first, eq.second) == 2);
    s.insert("two");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(2), c.end(), 2, s);

    eq = c.equal_range(3);
    assert(std::distance(eq.first, eq.second) == 1);
    C::const_iterator i = eq.first;
    assert(i->first == 3);
    assert(i->second == "three");
    eq = c.equal_range(4);
    assert(std::distance(eq.first, eq.second) == 1);
    i = eq.first;
    assert(i->first == 4);
    assert(i->second == "four");
    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 other_allocator<std::pair<const int, std::string> > A;
    typedef std::unordered_multimap<int, std::string, test_hash<int>, test_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<int>(8), test_equal_to<int>(9), A(10));
    C c(a, a + 2, 7, test_hash<int>(2), test_equal_to<int>(3), A(4));
    C::iterator it0 = c0.begin();
    c               = std::move(c0);
    assert(it0 == c.begin()); // Iterators remain valid
    LIBCPP_ASSERT(c.bucket_count() == 7);
    assert(c.size() == 6);
    typedef std::pair<C::const_iterator, C::const_iterator> Eq;
    Eq eq = c.equal_range(1);
    assert(std::distance(eq.first, eq.second) == 2);
    std::multiset<std::string> s;
    s.insert("one");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(1), c.end(), 1, s);
    eq = c.equal_range(2);
    assert(std::distance(eq.first, eq.second) == 2);
    s.insert("two");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(2), c.end(), 2, s);

    eq = c.equal_range(3);
    assert(std::distance(eq.first, eq.second) == 1);
    C::const_iterator i = eq.first;
    assert(i->first == 3);
    assert(i->second == "three");
    eq = c.equal_range(4);
    assert(std::distance(eq.first, eq.second) == 1);
    i = eq.first;
    assert(i->first == 4);
    assert(i->second == "four");
    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 min_allocator<std::pair<const int, std::string> > A;
    typedef std::unordered_multimap<int, std::string, test_hash<int>, test_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<int>(8), test_equal_to<int>(9), A());
    C c(a, a + 2, 7, test_hash<int>(2), test_equal_to<int>(3), A());
    C::iterator it0 = c0.begin();
    c               = std::move(c0);
    assert(it0 == c.begin()); // Iterators remain valid
    LIBCPP_ASSERT(c.bucket_count() == 7);
    assert(c.size() == 6);
    typedef std::pair<C::const_iterator, C::const_iterator> Eq;
    Eq eq = c.equal_range(1);
    assert(std::distance(eq.first, eq.second) == 2);
    std::multiset<std::string> s;
    s.insert("one");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(1), c.end(), 1, s);
    eq = c.equal_range(2);
    assert(std::distance(eq.first, eq.second) == 2);
    s.insert("two");
    s.insert("four");
    CheckConsecutiveKeys<C::const_iterator>(c.find(2), c.end(), 2, s);

    eq = c.equal_range(3);
    assert(std::distance(eq.first, eq.second) == 1);
    C::const_iterator i = eq.first;
    assert(i->first == 3);
    assert(i->second == "three");
    eq = c.equal_range(4);
    assert(std::distance(eq.first, eq.second) == 1);
    i = eq.first;
    assert(i->first == 4);
    assert(i->second == "four");
    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);
  }

  return 0;
}
