1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <unordered_map> 11 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 13 // class Alloc = allocator<pair<const Key, T>>> 14 // class unordered_map 15 16 // size_type count(const key_type& k) const; 17 18 #include <unordered_map> 19 #include <string> 20 #include <cassert> 21 22 #include "min_allocator.h" 23 24 int main() 25 { 26 { 27 typedef std::unordered_map<int, std::string> C; 28 typedef std::pair<int, std::string> P; 29 P a[] = 30 { 31 P(10, "ten"), 32 P(20, "twenty"), 33 P(30, "thirty"), 34 P(40, "forty"), 35 P(50, "fifty"), 36 P(60, "sixty"), 37 P(70, "seventy"), 38 P(80, "eighty"), 39 }; 40 const C c(std::begin(a), std::end(a)); 41 assert(c.count(30) == 1); 42 assert(c.count(5) == 0); 43 } 44 #if TEST_STD_VER >= 11 45 { 46 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, 47 min_allocator<std::pair<const int, std::string>>> C; 48 typedef std::pair<int, std::string> P; 49 P a[] = 50 { 51 P(10, "ten"), 52 P(20, "twenty"), 53 P(30, "thirty"), 54 P(40, "forty"), 55 P(50, "fifty"), 56 P(60, "sixty"), 57 P(70, "seventy"), 58 P(80, "eighty"), 59 }; 60 const C c(std::begin(a), std::end(a)); 61 assert(c.count(30) == 1); 62 assert(c.count(5) == 0); 63 } 64 #endif 65 } 66
