erase_range.pass.cpp revision a8bf9de8057ad254cc642f33bd7d0a48dc1ae55c 
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_multimap
15
16// iterator erase(const_iterator first, const_iterator last)
17
18#include <unordered_map>
19#include <string>
20#include <cassert>
21
22int main()
23{
24    {
25        typedef std::unordered_multimap<int, std::string> C;
26        typedef std::pair<int, std::string> P;
27        P a[] =
28        {
29            P(1, "one"),
30            P(2, "two"),
31            P(3, "three"),
32            P(4, "four"),
33            P(1, "four"),
34            P(2, "four"),
35        };
36        C c(a, a + sizeof(a)/sizeof(a[0]));
37        C::const_iterator i = c.find(2);
38        C::const_iterator j = next(i, 2);
39        C::iterator k = c.erase(i, i);
40        assert(k == i);
41        assert(c.size() == 6);
42        typedef std::pair<C::iterator, C::iterator> Eq;
43        Eq eq = c.equal_range(1);
44        assert(std::distance(eq.first, eq.second) == 2);
45        k = eq.first;
46        assert(k->first == 1);
47        assert(k->second == "one");
48        ++k;
49        assert(k->first == 1);
50        assert(k->second == "four");
51        eq = c.equal_range(2);
52        assert(std::distance(eq.first, eq.second) == 2);
53        k = eq.first;
54        assert(k->first == 2);
55        assert(k->second == "two");
56        ++k;
57        assert(k->first == 2);
58        assert(k->second == "four");
59        eq = c.equal_range(3);
60        assert(std::distance(eq.first, eq.second) == 1);
61        k = eq.first;
62        assert(k->first == 3);
63        assert(k->second == "three");
64        eq = c.equal_range(4);
65        assert(std::distance(eq.first, eq.second) == 1);
66        k = eq.first;
67        assert(k->first == 4);
68        assert(k->second == "four");
69        assert(std::distance(c.begin(), c.end()) == c.size());
70        assert(std::distance(c.cbegin(), c.cend()) == c.size());
71
72        k = c.erase(i, j);
73        assert(c.size() == 4);
74        eq = c.equal_range(1);
75        assert(std::distance(eq.first, eq.second) == 2);
76        k = eq.first;
77        assert(k->first == 1);
78        assert(k->second == "one");
79        ++k;
80        assert(k->first == 1);
81        assert(k->second == "four");
82        eq = c.equal_range(3);
83        assert(std::distance(eq.first, eq.second) == 1);
84        k = eq.first;
85        assert(k->first == 3);
86        assert(k->second == "three");
87        eq = c.equal_range(4);
88        assert(std::distance(eq.first, eq.second) == 1);
89        k = eq.first;
90        assert(k->first == 4);
91        assert(k->second == "four");
92        assert(std::distance(c.begin(), c.end()) == c.size());
93        assert(std::distance(c.cbegin(), c.cend()) == c.size());
94
95        k = c.erase(c.cbegin(), c.cend());
96        assert(c.size() == 0);
97        assert(k == c.end());
98    }
99}
100