summaryrefslogtreecommitdiffstats
path: root/libcxx/test/containers/associative/map/map.cons/move.pass.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'libcxx/test/containers/associative/map/map.cons/move.pass.cpp')
-rw-r--r--libcxx/test/containers/associative/map/map.cons/move.pass.cpp120
1 files changed, 0 insertions, 120 deletions
diff --git a/libcxx/test/containers/associative/map/map.cons/move.pass.cpp b/libcxx/test/containers/associative/map/map.cons/move.pass.cpp
deleted file mode 100644
index c06f2ee5021..00000000000
--- a/libcxx/test/containers/associative/map/map.cons/move.pass.cpp
+++ /dev/null
@@ -1,120 +0,0 @@
-//===----------------------------------------------------------------------===//
-//
-// 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(map&& m);
-
-#include <map>
-#include <cassert>
-
-#include "../../../test_compare.h"
-#include "test_allocator.h"
-#include "min_allocator.h"
-
-int main()
-{
-#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
- typedef std::pair<const int, double> V;
- {
- typedef test_compare<std::less<int> > C;
- typedef test_allocator<V> A;
- std::map<int, double, C, A> mo(C(5), A(7));
- std::map<int, double, C, A> m = std::move(mo);
- assert(m.get_allocator() == A(7));
- assert(m.key_comp() == C(5));
- assert(m.size() == 0);
- assert(distance(m.begin(), m.end()) == 0);
-
- assert(mo.get_allocator() == A(7));
- assert(mo.key_comp() == C(5));
- assert(mo.size() == 0);
- assert(distance(mo.begin(), mo.end()) == 0);
- }
- {
- V ar[] =
- {
- V(1, 1),
- V(1, 1.5),
- V(1, 2),
- V(2, 1),
- V(2, 1.5),
- V(2, 2),
- V(3, 1),
- V(3, 1.5),
- V(3, 2),
- };
- typedef test_compare<std::less<int> > C;
- typedef test_allocator<V> A;
- std::map<int, double, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A(7));
- std::map<int, double, C, A> m = std::move(mo);
- assert(m.get_allocator() == A(7));
- assert(m.key_comp() == C(5));
- assert(m.size() == 3);
- assert(distance(m.begin(), m.end()) == 3);
- assert(*m.begin() == V(1, 1));
- assert(*next(m.begin()) == V(2, 1));
- assert(*next(m.begin(), 2) == V(3, 1));
-
- assert(mo.get_allocator() == A(7));
- assert(mo.key_comp() == C(5));
- assert(mo.size() == 0);
- assert(distance(mo.begin(), mo.end()) == 0);
- }
-#if __cplusplus >= 201103L
- {
- typedef test_compare<std::less<int> > C;
- typedef min_allocator<V> A;
- std::map<int, double, C, A> mo(C(5), A());
- std::map<int, double, C, A> m = std::move(mo);
- assert(m.get_allocator() == A());
- assert(m.key_comp() == C(5));
- assert(m.size() == 0);
- assert(distance(m.begin(), m.end()) == 0);
-
- assert(mo.get_allocator() == A());
- assert(mo.key_comp() == C(5));
- assert(mo.size() == 0);
- assert(distance(mo.begin(), mo.end()) == 0);
- }
- {
- V ar[] =
- {
- V(1, 1),
- V(1, 1.5),
- V(1, 2),
- V(2, 1),
- V(2, 1.5),
- V(2, 2),
- V(3, 1),
- V(3, 1.5),
- V(3, 2),
- };
- typedef test_compare<std::less<int> > C;
- typedef min_allocator<V> A;
- std::map<int, double, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A());
- std::map<int, double, C, A> m = std::move(mo);
- assert(m.get_allocator() == A());
- assert(m.key_comp() == C(5));
- assert(m.size() == 3);
- assert(distance(m.begin(), m.end()) == 3);
- assert(*m.begin() == V(1, 1));
- assert(*next(m.begin()) == V(2, 1));
- assert(*next(m.begin(), 2) == V(3, 1));
-
- assert(mo.get_allocator() == A());
- assert(mo.key_comp() == C(5));
- assert(mo.size() == 0);
- assert(distance(mo.begin(), mo.end()) == 0);
- }
-#endif
-#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
-}
OpenPOWER on IntegriCloud