191 lines
4.9 KiB
C++
191 lines
4.9 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <map>
|
|
|
|
// class map
|
|
|
|
// map& operator=(map&& m);
|
|
|
|
#include <map>
|
|
#include <cassert>
|
|
|
|
#include "MoveOnly.h"
|
|
#include "../../../test_compare.h"
|
|
#include "test_allocator.h"
|
|
#include "min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
{
|
|
typedef std::pair<MoveOnly, MoveOnly> V;
|
|
typedef std::pair<const MoveOnly, MoveOnly> VC;
|
|
typedef test_compare<std::less<MoveOnly> > C;
|
|
typedef test_allocator<VC> A;
|
|
typedef std::map<MoveOnly, MoveOnly, C, A> M;
|
|
typedef std::move_iterator<V*> I;
|
|
V a1[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
|
|
V a2[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
|
|
M m3(C(3), A(7));
|
|
m3 = std::move(m1);
|
|
assert(m3 == m2);
|
|
assert(m3.get_allocator() == A(7));
|
|
assert(m3.key_comp() == C(5));
|
|
assert(m1.empty());
|
|
}
|
|
{
|
|
typedef std::pair<MoveOnly, MoveOnly> V;
|
|
typedef std::pair<const MoveOnly, MoveOnly> VC;
|
|
typedef test_compare<std::less<MoveOnly> > C;
|
|
typedef test_allocator<VC> A;
|
|
typedef std::map<MoveOnly, MoveOnly, C, A> M;
|
|
typedef std::move_iterator<V*> I;
|
|
V a1[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
|
|
V a2[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
|
|
M m3(C(3), A(5));
|
|
m3 = std::move(m1);
|
|
assert(m3 == m2);
|
|
assert(m3.get_allocator() == A(5));
|
|
assert(m3.key_comp() == C(5));
|
|
assert(m1.empty());
|
|
}
|
|
{
|
|
typedef std::pair<MoveOnly, MoveOnly> V;
|
|
typedef std::pair<const MoveOnly, MoveOnly> VC;
|
|
typedef test_compare<std::less<MoveOnly> > C;
|
|
typedef other_allocator<VC> A;
|
|
typedef std::map<MoveOnly, MoveOnly, C, A> M;
|
|
typedef std::move_iterator<V*> I;
|
|
V a1[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
|
|
V a2[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7));
|
|
M m3(C(3), A(5));
|
|
m3 = std::move(m1);
|
|
assert(m3 == m2);
|
|
assert(m3.get_allocator() == A(7));
|
|
assert(m3.key_comp() == C(5));
|
|
assert(m1.empty());
|
|
}
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
typedef std::pair<MoveOnly, MoveOnly> V;
|
|
typedef std::pair<const MoveOnly, MoveOnly> VC;
|
|
typedef test_compare<std::less<MoveOnly> > C;
|
|
typedef min_allocator<VC> A;
|
|
typedef std::map<MoveOnly, MoveOnly, C, A> M;
|
|
typedef std::move_iterator<V*> I;
|
|
V a1[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A());
|
|
V a2[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 2),
|
|
V(1, 3),
|
|
V(2, 1),
|
|
V(2, 2),
|
|
V(2, 3),
|
|
V(3, 1),
|
|
V(3, 2),
|
|
V(3, 3)
|
|
};
|
|
M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A());
|
|
M m3(C(3), A());
|
|
m3 = std::move(m1);
|
|
assert(m3 == m2);
|
|
assert(m3.get_allocator() == A());
|
|
assert(m3.key_comp() == C(5));
|
|
assert(m1.empty());
|
|
}
|
|
#endif
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
}
|