You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
75 lines
2.4 KiB
C++
75 lines
2.4 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++98, c++03
|
|
|
|
// <deque>
|
|
|
|
// deque(deque&&);
|
|
|
|
#include <deque>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "MoveOnly.h"
|
|
#include "test_allocator.h"
|
|
#include "min_allocator.h"
|
|
|
|
int main(int, char**)
|
|
{
|
|
{
|
|
int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
|
|
int* an = ab + sizeof(ab)/sizeof(ab[0]);
|
|
typedef test_allocator<MoveOnly> A;
|
|
std::deque<MoveOnly, A> c1(A(1));
|
|
for (int* p = ab; p < an; ++p)
|
|
c1.push_back(MoveOnly(*p));
|
|
std::deque<MoveOnly, A> c2(A(2));
|
|
for (int* p = ab; p < an; ++p)
|
|
c2.push_back(MoveOnly(*p));
|
|
A old_a = c1.get_allocator();
|
|
std::deque<MoveOnly, A> c3 = std::move(c1);
|
|
assert(c2 == c3);
|
|
assert(c1.size() == 0);
|
|
assert(c3.get_allocator() == old_a);
|
|
assert(c1.get_allocator() == A(test_alloc_base::moved_value));
|
|
}
|
|
{
|
|
int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
|
|
int* an = ab + sizeof(ab)/sizeof(ab[0]);
|
|
typedef other_allocator<MoveOnly> A;
|
|
std::deque<MoveOnly, A> c1(A(1));
|
|
for (int* p = ab; p < an; ++p)
|
|
c1.push_back(MoveOnly(*p));
|
|
std::deque<MoveOnly, A> c2(A(2));
|
|
for (int* p = ab; p < an; ++p)
|
|
c2.push_back(MoveOnly(*p));
|
|
std::deque<MoveOnly, A> c3 = std::move(c1);
|
|
assert(c2 == c3);
|
|
assert(c1.size() == 0);
|
|
assert(c3.get_allocator() == c1.get_allocator());
|
|
}
|
|
{
|
|
int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45};
|
|
int* an = ab + sizeof(ab)/sizeof(ab[0]);
|
|
typedef min_allocator<MoveOnly> A;
|
|
std::deque<MoveOnly, A> c1(A{});
|
|
for (int* p = ab; p < an; ++p)
|
|
c1.push_back(MoveOnly(*p));
|
|
std::deque<MoveOnly, A> c2(A{});
|
|
for (int* p = ab; p < an; ++p)
|
|
c2.push_back(MoveOnly(*p));
|
|
std::deque<MoveOnly, A> c3 = std::move(c1);
|
|
assert(c2 == c3);
|
|
assert(c1.size() == 0);
|
|
assert(c3.get_allocator() == c1.get_allocator());
|
|
}
|
|
|
|
return 0;
|
|
}
|