count.pass.cpp revision f5256e16dfc425c1d466f6308d4026d529ce9e0b 
1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. 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
22int main()
23{
24    {
25        typedef std::unordered_map<int, std::string> C;
26        typedef std::pair<int, std::string> P;
27        P a[] =
28        {
29            P(10, "ten"),
30            P(20, "twenty"),
31            P(30, "thirty"),
32            P(40, "fourty"),
33            P(50, "fifty"),
34            P(60, "sixty"),
35            P(70, "seventy"),
36            P(80, "eighty"),
37        };
38        const C c(std::begin(a), std::end(a));
39        assert(c.count(30) == 1);
40        assert(c.count(5) == 0);
41    }
42}
43