erase_range.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// 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_map<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, 1);
39        C::iterator k = c.erase(i, i);
40        assert(k == i);
41        assert(c.size() == 4);
42        assert(c.at(1) == "one");
43        assert(c.at(2) == "two");
44        assert(c.at(3) == "three");
45        assert(c.at(4) == "four");
46
47        k = c.erase(i, j);
48        assert(c.size() == 3);
49        assert(k == j);
50        assert(c.at(1) == "one");
51        assert(c.at(3) == "three");
52        assert(c.at(4) == "four");
53
54        k = c.erase(c.cbegin(), c.cend());
55        assert(k == c.cend());
56        assert(c.size() == 0);
57        assert(k == c.end());
58    }
59}
60