equal_range_const.pass.cpp revision bc8d3f97eb5c958007f2713238472e0c1c8fe02c 
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// pair<const_iterator, const_iterator> equal_range(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 C::const_iterator I;
27        typedef std::pair<int, std::string> P;
28        P a[] =
29        {
30            P(10, "ten"),
31            P(20, "twenty"),
32            P(30, "thirty"),
33            P(40, "fourty"),
34            P(50, "fifty"),
35            P(60, "sixty"),
36            P(70, "seventy"),
37            P(80, "eighty"),
38        };
39        const C c(std::begin(a), std::end(a));
40        std::pair<I, I> r = c.equal_range(30);
41        assert(std::distance(r.first, r.second) == 1);
42        assert(r.first->first == 30);
43        assert(r.first->second == "thirty");
44        r = c.equal_range(5);
45        assert(std::distance(r.first, r.second) == 0);
46    }
47}
48