f5256e16df
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103516 91177308-0d34-0410-b5e6-96231b3b80d8
180 lines
4.2 KiB
C++
180 lines
4.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <map>
|
|
|
|
// class map
|
|
|
|
// template <class Key, class T, class Compare, class Allocator>
|
|
// void
|
|
// swap(map<Key, T, Compare, Allocator>& x, map<Key, T, Compare, Allocator>& y);
|
|
|
|
#include <map>
|
|
#include <cassert>
|
|
#include "../../../test_allocator.h"
|
|
#include "../../../test_compare.h"
|
|
|
|
int main()
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
typedef std::map<int, double> M;
|
|
{
|
|
V ar1[] =
|
|
{
|
|
};
|
|
V ar2[] =
|
|
{
|
|
};
|
|
M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
|
|
M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
|
|
M m1_save = m1;
|
|
M m2_save = m2;
|
|
swap(m1, m2);
|
|
assert(m1 == m2_save);
|
|
assert(m2 == m1_save);
|
|
}
|
|
{
|
|
V ar1[] =
|
|
{
|
|
};
|
|
V ar2[] =
|
|
{
|
|
V(5, 5),
|
|
V(6, 6),
|
|
V(7, 7),
|
|
V(8, 8),
|
|
V(9, 9),
|
|
V(10, 10),
|
|
V(11, 11),
|
|
V(12, 12)
|
|
};
|
|
M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
|
|
M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
|
|
M m1_save = m1;
|
|
M m2_save = m2;
|
|
swap(m1, m2);
|
|
assert(m1 == m2_save);
|
|
assert(m2 == m1_save);
|
|
}
|
|
{
|
|
V ar1[] =
|
|
{
|
|
V(1, 1),
|
|
V(2, 2),
|
|
V(3, 3),
|
|
V(4, 4)
|
|
};
|
|
V ar2[] =
|
|
{
|
|
};
|
|
M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
|
|
M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
|
|
M m1_save = m1;
|
|
M m2_save = m2;
|
|
swap(m1, m2);
|
|
assert(m1 == m2_save);
|
|
assert(m2 == m1_save);
|
|
}
|
|
{
|
|
V ar1[] =
|
|
{
|
|
V(1, 1),
|
|
V(2, 2),
|
|
V(3, 3),
|
|
V(4, 4)
|
|
};
|
|
V ar2[] =
|
|
{
|
|
V(5, 5),
|
|
V(6, 6),
|
|
V(7, 7),
|
|
V(8, 8),
|
|
V(9, 9),
|
|
V(10, 10),
|
|
V(11, 11),
|
|
V(12, 12)
|
|
};
|
|
M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
|
|
M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]));
|
|
M m1_save = m1;
|
|
M m2_save = m2;
|
|
swap(m1, m2);
|
|
assert(m1 == m2_save);
|
|
assert(m2 == m1_save);
|
|
}
|
|
{
|
|
typedef test_allocator<V> A;
|
|
typedef test_compare<std::less<int> > C;
|
|
typedef std::map<int, double, C, A> M;
|
|
V ar1[] =
|
|
{
|
|
V(1, 1),
|
|
V(2, 2),
|
|
V(3, 3),
|
|
V(4, 4)
|
|
};
|
|
V ar2[] =
|
|
{
|
|
V(5, 5),
|
|
V(6, 6),
|
|
V(7, 7),
|
|
V(8, 8),
|
|
V(9, 9),
|
|
V(10, 10),
|
|
V(11, 11),
|
|
V(12, 12)
|
|
};
|
|
M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]), C(1), A(1));
|
|
M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]), C(2), A(2));
|
|
M m1_save = m1;
|
|
M m2_save = m2;
|
|
swap(m1, m2);
|
|
assert(m1 == m2_save);
|
|
assert(m2 == m1_save);
|
|
assert(m1.key_comp() == C(2));
|
|
assert(m1.get_allocator() == A(1));
|
|
assert(m2.key_comp() == C(1));
|
|
assert(m2.get_allocator() == A(2));
|
|
}
|
|
{
|
|
typedef other_allocator<V> A;
|
|
typedef test_compare<std::less<int> > C;
|
|
typedef std::map<int, double, C, A> M;
|
|
V ar1[] =
|
|
{
|
|
V(1, 1),
|
|
V(2, 2),
|
|
V(3, 3),
|
|
V(4, 4)
|
|
};
|
|
V ar2[] =
|
|
{
|
|
V(5, 5),
|
|
V(6, 6),
|
|
V(7, 7),
|
|
V(8, 8),
|
|
V(9, 9),
|
|
V(10, 10),
|
|
V(11, 11),
|
|
V(12, 12)
|
|
};
|
|
M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]), C(1), A(1));
|
|
M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]), C(2), A(2));
|
|
M m1_save = m1;
|
|
M m2_save = m2;
|
|
swap(m1, m2);
|
|
assert(m1 == m2_save);
|
|
assert(m2 == m1_save);
|
|
assert(m1.key_comp() == C(2));
|
|
assert(m1.get_allocator() == A(2));
|
|
assert(m2.key_comp() == C(1));
|
|
assert(m2.get_allocator() == A(1));
|
|
}
|
|
}
|