051c848e88
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@188019 91177308-0d34-0410-b5e6-96231b3b80d8
125 lines
3.3 KiB
C++
125 lines
3.3 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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_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>
|
|
|
|
#include "../../min_allocator.h"
|
|
|
|
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());
|
|
C::iterator i;
|
|
}
|
|
{
|
|
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());
|
|
C::const_iterator i;
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::unordered_multiset<int, std::hash<int>,
|
|
std::equal_to<int>, min_allocator<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());
|
|
C::iterator i;
|
|
}
|
|
{
|
|
typedef std::unordered_multiset<int, std::hash<int>,
|
|
std::equal_to<int>, min_allocator<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());
|
|
C::const_iterator i;
|
|
}
|
|
#endif
|
|
#if _LIBCPP_STD_VER > 11
|
|
{ // N3644 testing
|
|
typedef std::unordered_multiset<int> C;
|
|
C::iterator ii1{}, ii2{};
|
|
C::iterator ii4 = ii1;
|
|
C::const_iterator cii{};
|
|
assert ( ii1 == ii2 );
|
|
assert ( ii1 == ii4 );
|
|
assert ( ii1 == cii );
|
|
|
|
assert ( !(ii1 != ii2 ));
|
|
assert ( !(ii1 != cii ));
|
|
}
|
|
#endif
|
|
}
|