blob: b1df0f56d511e5f91e0cea0b7dc6e4e03d447361 [file] [log] [blame]
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <unordered_map>
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
// class Alloc = allocator<pair<const Key, T>>>
// class unordered_multimap
// iterator erase(const_iterator p)
#include <unordered_map>
#include <string>
#include <cassert>
int main()
{
{
typedef std::unordered_multimap<int, std::string> C;
typedef std::pair<int, std::string> P;
P a[] =
{
P(1, "one"),
P(2, "two"),
P(3, "three"),
P(4, "four"),
P(1, "four"),
P(2, "four"),
};
C c(a, a + sizeof(a)/sizeof(a[0]));
C::const_iterator i = c.find(2);
C::iterator j = c.erase(i);
assert(c.size() == 5);
typedef std::pair<C::const_iterator, C::const_iterator> Eq;
Eq eq = c.equal_range(1);
assert(std::distance(eq.first, eq.second) == 2);
C::const_iterator k = eq.first;
assert(k->first == 1);
assert(k->second == "one");
++k;
assert(k->first == 1);
assert(k->second == "four");
eq = c.equal_range(2);
assert(std::distance(eq.first, eq.second) == 1);
k = eq.first;
assert(k->first == 2);
assert(k->second == "four");
eq = c.equal_range(3);
assert(std::distance(eq.first, eq.second) == 1);
k = eq.first;
assert(k->first == 3);
assert(k->second == "three");
eq = c.equal_range(4);
assert(std::distance(eq.first, eq.second) == 1);
k = eq.first;
assert(k->first == 4);
assert(k->second == "four");
assert(std::distance(c.begin(), c.end()) == c.size());
assert(std::distance(c.cbegin(), c.cend()) == c.size());
}
}