//===----------------------------------------------------------------------===//
//
// 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 = hash<Key>, class Pred = equal_to<Key>,
//           class Alloc = allocator<pair<const Key, T>>>
// class unordered_map

// mapped_type&       at(const key_type& k);
// const mapped_type& at(const key_type& k) const;

#include <cassert>
#include <stdexcept>
#include <string>
#include <unordered_map>

#include "MoveOnly.h"
#include "min_allocator.h"
#include "test_macros.h"

int main(int, char**) {
  {
    typedef std::unordered_map<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(a, a + sizeof(a) / sizeof(a[0]));
    assert(c.size() == 4);
    c.at(1) = "ONE";
    assert(c.at(1) == "ONE");
#ifndef TEST_HAS_NO_EXCEPTIONS
    try {
      c.at(11) = "eleven";
      assert(false);
    } catch (std::out_of_range&) {
    }
    assert(c.size() == 4);
#endif
  }
  {
    typedef std::unordered_map<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"),
    };
    const C c(a, a + sizeof(a) / sizeof(a[0]));
    assert(c.size() == 4);
    assert(c.at(1) == "one");
#ifndef TEST_HAS_NO_EXCEPTIONS
    try {
      TEST_IGNORE_NODISCARD c.at(11);
      assert(false);
    } catch (std::out_of_range&) {
    }
    assert(c.size() == 4);
#endif
  }
#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(1, "one"),
        P(2, "two"),
        P(3, "three"),
        P(4, "four"),
        P(1, "four"),
        P(2, "four"),
    };
    C c(a, a + sizeof(a) / sizeof(a[0]));
    assert(c.size() == 4);
    c.at(1) = "ONE";
    assert(c.at(1) == "ONE");
#  ifndef TEST_HAS_NO_EXCEPTIONS
    try {
      c.at(11) = "eleven";
      assert(false);
    } catch (std::out_of_range&) {
    }
    assert(c.size() == 4);
#  endif
  }
  {
    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(1, "one"),
        P(2, "two"),
        P(3, "three"),
        P(4, "four"),
        P(1, "four"),
        P(2, "four"),
    };
    const C c(a, a + sizeof(a) / sizeof(a[0]));
    assert(c.size() == 4);
    assert(c.at(1) == "one");
#  ifndef TEST_HAS_NO_EXCEPTIONS
    try {
      TEST_IGNORE_NODISCARD c.at(11);
      assert(false);
    } catch (std::out_of_range&) {
    }
    assert(c.size() == 4);
#  endif
  }
#endif

  return 0;
}