bc8d3f97eb
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103490 91177308-0d34-0410-b5e6-96231b3b80d8
65 lines
1.7 KiB
C++
65 lines
1.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊ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 begin();
|
|
// iterator end();
|
|
// const_iterator begin() const;
|
|
// const_iterator end() const;
|
|
// const_iterator cbegin() const;
|
|
// const_iterator cend() const;
|
|
|
|
#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]));
|
|
assert(c.bucket_count() >= 7);
|
|
assert(c.size() == 6);
|
|
assert(std::distance(c.begin(), c.end()) == c.size());
|
|
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
|
}
|
|
{
|
|
typedef std::unordered_multiset<int> C;
|
|
typedef int P;
|
|
P a[] =
|
|
{
|
|
P(1),
|
|
P(2),
|
|
P(3),
|
|
P(4),
|
|
P(1),
|
|
P(2)
|
|
};
|
|
const C c(a, a + sizeof(a)/sizeof(a[0]));
|
|
assert(c.bucket_count() >= 7);
|
|
assert(c.size() == 6);
|
|
assert(std::distance(c.begin(), c.end()) == c.size());
|
|
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
|
}
|
|
}
|