1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
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_multimap
16 // size_type count(const key_type& k) const;
18 #include <unordered_map>
22 #include "min_allocator.h"
27 typedef std::unordered_multimap<int, std::string> C;
28 typedef std::pair<int, std::string> P;
42 const C c(std::begin(a), std::end(a));
43 assert(c.count(30) == 1);
44 assert(c.count(50) == 3);
45 assert(c.count(5) == 0);
47 #if __cplusplus >= 201103L
49 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
50 min_allocator<std::pair<const int, std::string>>> C;
51 typedef std::pair<int, std::string> P;
65 const C c(std::begin(a), std::end(a));
66 assert(c.count(30) == 1);
67 assert(c.count(50) == 3);
68 assert(c.count(5) == 0);