blob: d22321b244029820b23ce897473f61d7a0bdff54 [file] [log] [blame]
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <list>
// void splice(const_iterator position, list& x, iterator first, iterator last);
#include <list>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
int main(int, char**)
{
int a1[] = {1, 2, 3};
int a2[] = {4, 5, 6};
{
std::list<int> l1(a1, a1+3);
l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
assert(l1.size() == 3);
assert(distance(l1.begin(), l1.end()) == 3);
std::list<int>::const_iterator i = l1.begin();
assert(*i == 1);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
}
{
std::list<int> l1(a1, a1+3);
l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
assert(l1.size() == 3);
assert(distance(l1.begin(), l1.end()) == 3);
std::list<int>::const_iterator i = l1.begin();
assert(*i == 2);
++i;
assert(*i == 1);
++i;
assert(*i == 3);
}
{
std::list<int> l1(a1, a1+3);
l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 3));
assert(l1.size() == 3);
assert(distance(l1.begin(), l1.end()) == 3);
std::list<int>::const_iterator i = l1.begin();
assert(*i == 2);
++i;
assert(*i == 3);
++i;
assert(*i == 1);
}
{
std::list<int> l1(a1, a1+3);
std::list<int> l2(a2, a2+3);
l1.splice(l1.begin(), l2, next(l2.begin()), l2.end());
assert(l1.size() == 5);
assert(distance(l1.begin(), l1.end()) == 5);
std::list<int>::const_iterator i = l1.begin();
assert(*i == 5);
++i;
assert(*i == 6);
++i;
assert(*i == 1);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
assert(l2.size() == 1);
i = l2.begin();
assert(*i == 4);
}
{
std::list<int> l1(a1, a1+3);
std::list<int> l2(a2, a2+3);
l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end());
assert(l1.size() == 5);
assert(distance(l1.begin(), l1.end()) == 5);
std::list<int>::const_iterator i = l1.begin();
assert(*i == 1);
++i;
assert(*i == 5);
++i;
assert(*i == 6);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
assert(l2.size() == 1);
i = l2.begin();
assert(*i == 4);
}
{
std::list<int> l1(a1, a1+3);
std::list<int> l2(a2, a2+3);
l1.splice(l1.end(), l2, next(l2.begin()), l2.end());
assert(l1.size() == 5);
assert(distance(l1.begin(), l1.end()) == 5);
std::list<int>::const_iterator i = l1.begin();
assert(*i == 1);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
++i;
assert(*i == 5);
++i;
assert(*i == 6);
assert(l2.size() == 1);
i = l2.begin();
assert(*i == 4);
}
#if TEST_STD_VER >= 11
{
std::list<int, min_allocator<int>> l1(a1, a1+3);
l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
assert(l1.size() == 3);
assert(distance(l1.begin(), l1.end()) == 3);
std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
assert(*i == 1);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
}
{
std::list<int, min_allocator<int>> l1(a1, a1+3);
l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
assert(l1.size() == 3);
assert(distance(l1.begin(), l1.end()) == 3);
std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
assert(*i == 2);
++i;
assert(*i == 1);
++i;
assert(*i == 3);
}
{
std::list<int, min_allocator<int>> l1(a1, a1+3);
l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 3));
assert(l1.size() == 3);
assert(distance(l1.begin(), l1.end()) == 3);
std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
assert(*i == 2);
++i;
assert(*i == 3);
++i;
assert(*i == 1);
}
{
std::list<int, min_allocator<int>> l1(a1, a1+3);
std::list<int, min_allocator<int>> l2(a2, a2+3);
l1.splice(l1.begin(), l2, next(l2.begin()), l2.end());
assert(l1.size() == 5);
assert(distance(l1.begin(), l1.end()) == 5);
std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
assert(*i == 5);
++i;
assert(*i == 6);
++i;
assert(*i == 1);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
assert(l2.size() == 1);
i = l2.begin();
assert(*i == 4);
}
{
std::list<int, min_allocator<int>> l1(a1, a1+3);
std::list<int, min_allocator<int>> l2(a2, a2+3);
l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end());
assert(l1.size() == 5);
assert(distance(l1.begin(), l1.end()) == 5);
std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
assert(*i == 1);
++i;
assert(*i == 5);
++i;
assert(*i == 6);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
assert(l2.size() == 1);
i = l2.begin();
assert(*i == 4);
}
{
std::list<int, min_allocator<int>> l1(a1, a1+3);
std::list<int, min_allocator<int>> l2(a2, a2+3);
l1.splice(l1.end(), l2, next(l2.begin()), l2.end());
assert(l1.size() == 5);
assert(distance(l1.begin(), l1.end()) == 5);
std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
assert(*i == 1);
++i;
assert(*i == 2);
++i;
assert(*i == 3);
++i;
assert(*i == 5);
++i;
assert(*i == 6);
assert(l2.size() == 1);
i = l2.begin();
assert(*i == 4);
}
#endif
return 0;
}