139 lines
4.0 KiB
C++
139 lines
4.0 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <set>
|
|
|
|
// class multiset
|
|
|
|
// multiset& operator=(const multiset& s);
|
|
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "../../../test_compare.h"
|
|
#include "test_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef int V;
|
|
V ar[] =
|
|
{
|
|
1,
|
|
1,
|
|
1,
|
|
2,
|
|
2,
|
|
2,
|
|
3,
|
|
3,
|
|
3
|
|
};
|
|
typedef test_compare<std::less<int> > C;
|
|
typedef test_allocator<V> A;
|
|
std::multiset<int, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A(2));
|
|
std::multiset<int, C, A> m(ar, ar+sizeof(ar)/sizeof(ar[0])/2, C(3), A(7));
|
|
m = mo;
|
|
assert(m.get_allocator() == A(7));
|
|
assert(m.key_comp() == C(5));
|
|
assert(m.size() == 9);
|
|
assert(distance(m.begin(), m.end()) == 9);
|
|
assert(*next(m.begin(), 0) == 1);
|
|
assert(*next(m.begin(), 1) == 1);
|
|
assert(*next(m.begin(), 2) == 1);
|
|
assert(*next(m.begin(), 3) == 2);
|
|
assert(*next(m.begin(), 4) == 2);
|
|
assert(*next(m.begin(), 5) == 2);
|
|
assert(*next(m.begin(), 6) == 3);
|
|
assert(*next(m.begin(), 7) == 3);
|
|
assert(*next(m.begin(), 8) == 3);
|
|
|
|
assert(mo.get_allocator() == A(2));
|
|
assert(mo.key_comp() == C(5));
|
|
assert(mo.size() == 9);
|
|
assert(distance(mo.begin(), mo.end()) == 9);
|
|
assert(*next(mo.begin(), 0) == 1);
|
|
assert(*next(mo.begin(), 1) == 1);
|
|
assert(*next(mo.begin(), 2) == 1);
|
|
assert(*next(mo.begin(), 3) == 2);
|
|
assert(*next(mo.begin(), 4) == 2);
|
|
assert(*next(mo.begin(), 5) == 2);
|
|
assert(*next(mo.begin(), 6) == 3);
|
|
assert(*next(mo.begin(), 7) == 3);
|
|
assert(*next(mo.begin(), 8) == 3);
|
|
}
|
|
{
|
|
typedef int V;
|
|
const V ar[] =
|
|
{
|
|
1,
|
|
1,
|
|
1,
|
|
2,
|
|
2,
|
|
2,
|
|
3,
|
|
3,
|
|
3
|
|
};
|
|
std::multiset<int> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
std::multiset<int> *p = &m;
|
|
m = *p;
|
|
assert(m.size() == 9);
|
|
assert(std::equal(m.begin(), m.end(), ar));
|
|
}
|
|
{
|
|
typedef int V;
|
|
V ar[] =
|
|
{
|
|
1,
|
|
1,
|
|
1,
|
|
2,
|
|
2,
|
|
2,
|
|
3,
|
|
3,
|
|
3
|
|
};
|
|
typedef test_compare<std::less<int> > C;
|
|
typedef other_allocator<V> A;
|
|
std::multiset<int, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A(2));
|
|
std::multiset<int, C, A> m(ar, ar+sizeof(ar)/sizeof(ar[0])/2, C(3), A(7));
|
|
m = mo;
|
|
assert(m.get_allocator() == A(2));
|
|
assert(m.key_comp() == C(5));
|
|
assert(m.size() == 9);
|
|
assert(distance(m.begin(), m.end()) == 9);
|
|
assert(*next(m.begin(), 0) == 1);
|
|
assert(*next(m.begin(), 1) == 1);
|
|
assert(*next(m.begin(), 2) == 1);
|
|
assert(*next(m.begin(), 3) == 2);
|
|
assert(*next(m.begin(), 4) == 2);
|
|
assert(*next(m.begin(), 5) == 2);
|
|
assert(*next(m.begin(), 6) == 3);
|
|
assert(*next(m.begin(), 7) == 3);
|
|
assert(*next(m.begin(), 8) == 3);
|
|
|
|
assert(mo.get_allocator() == A(2));
|
|
assert(mo.key_comp() == C(5));
|
|
assert(mo.size() == 9);
|
|
assert(distance(mo.begin(), mo.end()) == 9);
|
|
assert(*next(mo.begin(), 0) == 1);
|
|
assert(*next(mo.begin(), 1) == 1);
|
|
assert(*next(mo.begin(), 2) == 1);
|
|
assert(*next(mo.begin(), 3) == 2);
|
|
assert(*next(mo.begin(), 4) == 2);
|
|
assert(*next(mo.begin(), 5) == 2);
|
|
assert(*next(mo.begin(), 6) == 3);
|
|
assert(*next(mo.begin(), 7) == 3);
|
|
assert(*next(mo.begin(), 8) == 3);
|
|
}
|
|
}
|