57 lines
1.4 KiB
C++
57 lines
1.4 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
|||
|
|
//
|
|||
|
|
// This file is distributed under the University of Illinois Open Source
|
|||
|
|
// License. See LICENSE.TXT for details.
|
|||
|
|
//
|
|||
|
|
//===----------------------------------------------------------------------===//
|
|||
|
|
|
|||
|
|
// <unordered_set>
|
|||
|
|
|
|||
|
|
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
|||
|
|
// class Alloc = allocator<Value>>
|
|||
|
|
// class unordered_multiset
|
|||
|
|
|
|||
|
|
// iterator erase(const_iterator first, const_iterator last)
|
|||
|
|
|
|||
|
|
#include <unordered_set>
|
|||
|
|
#include <cassert>
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
{
|
|||
|
|
typedef std::unordered_multiset<int> C;
|
|||
|
|
typedef int P;
|
|||
|
|
P a[] =
|
|||
|
|
{
|
|||
|
|
P(1),
|
|||
|
|
P(2),
|
|||
|
|
P(3),
|
|||
|
|
P(4),
|
|||
|
|
P(1),
|
|||
|
|
P(2)
|
|||
|
|
};
|
|||
|
|
C c(a, a + sizeof(a)/sizeof(a[0]));
|
|||
|
|
C::const_iterator i = c.find(2);
|
|||
|
|
C::const_iterator j = next(i, 2);
|
|||
|
|
C::iterator k = c.erase(i, i);
|
|||
|
|
assert(k == i);
|
|||
|
|
assert(c.size() == 6);
|
|||
|
|
assert(c.count(1) == 2);
|
|||
|
|
assert(c.count(2) == 2);
|
|||
|
|
assert(c.count(3) == 1);
|
|||
|
|
assert(c.count(4) == 1);
|
|||
|
|
|
|||
|
|
k = c.erase(i, j);
|
|||
|
|
assert(c.size() == 4);
|
|||
|
|
assert(c.count(1) == 2);
|
|||
|
|
assert(c.count(3) == 1);
|
|||
|
|
assert(c.count(4) == 1);
|
|||
|
|
|
|||
|
|
k = c.erase(c.cbegin(), c.cend());
|
|||
|
|
assert(c.size() == 0);
|
|||
|
|
assert(k == c.end());
|
|||
|
|
}
|
|||
|
|
}
|