| //===----------------------------------------------------------------------===// |
| // |
| // 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 |
| |
| // size_type count(const key_type& k) const; |
| |
| #include <unordered_map> |
| #include <string> |
| #include <cassert> |
| |
| #include "min_allocator.h" |
| |
| int main() |
| { |
| { |
| 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 c(std::begin(a), std::end(a)); |
| assert(c.count(30) == 1); |
| assert(c.count(5) == 0); |
| } |
| #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 c(std::begin(a), std::end(a)); |
| assert(c.count(30) == 1); |
| assert(c.count(5) == 0); |
| } |
| #endif |
| } |