//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // void splice(const_iterator position, list& x, iterator i); #if _LIBCPP_DEBUG >= 1 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) #endif #include #include #include "min_allocator.h" int main() { int a1[] = {1, 2, 3}; int a2[] = {4, 5, 6}; { std::list l1; std::list l2(a2, a2+1); l1.splice(l1.end(), l2, l2.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 0); assert(distance(l2.begin(), l2.end()) == 0); std::list::const_iterator i = l1.begin(); assert(*i == 4); } { std::list l1; std::list l2(a2, a2+2); l1.splice(l1.end(), l2, l2.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 1); assert(distance(l2.begin(), l2.end()) == 1); std::list::const_iterator i = l1.begin(); assert(*i == 4); i = l2.begin(); assert(*i == 5); } { std::list l1; std::list l2(a2, a2+2); l1.splice(l1.end(), l2, next(l2.begin())); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 1); assert(distance(l2.begin(), l2.end()) == 1); std::list::const_iterator i = l1.begin(); assert(*i == 5); i = l2.begin(); assert(*i == 4); } { std::list l1; std::list l2(a2, a2+3); l1.splice(l1.end(), l2, l2.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 2); assert(distance(l2.begin(), l2.end()) == 2); std::list::const_iterator i = l1.begin(); assert(*i == 4); i = l2.begin(); assert(*i == 5); ++i; assert(*i == 6); } { std::list l1; std::list l2(a2, a2+3); l1.splice(l1.end(), l2, next(l2.begin())); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 2); assert(distance(l2.begin(), l2.end()) == 2); std::list::const_iterator i = l1.begin(); assert(*i == 5); i = l2.begin(); assert(*i == 4); ++i; assert(*i == 6); } { std::list l1; std::list l2(a2, a2+3); l1.splice(l1.end(), l2, next(l2.begin(), 2)); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 2); assert(distance(l2.begin(), l2.end()) == 2); std::list::const_iterator i = l1.begin(); assert(*i == 6); i = l2.begin(); assert(*i == 4); ++i; assert(*i == 5); } { std::list l1(a1, a1+1); l1.splice(l1.begin(), l1, l1.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); std::list::const_iterator i = l1.begin(); assert(*i == 1); } { std::list l1(a1, a1+1); std::list l2(a2, a2+1); l1.splice(l1.begin(), l2, l2.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); assert(l2.size() == 0); assert(distance(l2.begin(), l2.end()) == 0); std::list::const_iterator i = l1.begin(); assert(*i == 4); ++i; assert(*i == 1); } { std::list l1(a1, a1+1); std::list l2(a2, a2+1); l1.splice(next(l1.begin()), l2, l2.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); assert(l2.size() == 0); assert(distance(l2.begin(), l2.end()) == 0); std::list::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 4); } { std::list l1(a1, a1+2); l1.splice(l1.begin(), l1, l1.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 2); } { std::list l1(a1, a1+2); l1.splice(l1.begin(), l1, next(l1.begin())); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list::const_iterator i = l1.begin(); assert(*i == 2); ++i; assert(*i == 1); } { std::list l1(a1, a1+2); l1.splice(next(l1.begin()), l1, l1.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 2); } { std::list l1(a1, a1+2); l1.splice(next(l1.begin()), l1, next(l1.begin())); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 2); } #if _LIBCPP_DEBUG >= 1 { std::list v1(3); std::list v2(3); v1.splice(v1.begin(), v2, v1.begin()); assert(false); } #endif #if __cplusplus >= 201103L { std::list> l1; std::list> l2(a2, a2+1); l1.splice(l1.end(), l2, l2.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 0); assert(distance(l2.begin(), l2.end()) == 0); std::list>::const_iterator i = l1.begin(); assert(*i == 4); } { std::list> l1; std::list> l2(a2, a2+2); l1.splice(l1.end(), l2, l2.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 1); assert(distance(l2.begin(), l2.end()) == 1); std::list>::const_iterator i = l1.begin(); assert(*i == 4); i = l2.begin(); assert(*i == 5); } { std::list> l1; std::list> l2(a2, a2+2); l1.splice(l1.end(), l2, next(l2.begin())); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 1); assert(distance(l2.begin(), l2.end()) == 1); std::list>::const_iterator i = l1.begin(); assert(*i == 5); i = l2.begin(); assert(*i == 4); } { std::list> l1; std::list> l2(a2, a2+3); l1.splice(l1.end(), l2, l2.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 2); assert(distance(l2.begin(), l2.end()) == 2); std::list>::const_iterator i = l1.begin(); assert(*i == 4); i = l2.begin(); assert(*i == 5); ++i; assert(*i == 6); } { std::list> l1; std::list> l2(a2, a2+3); l1.splice(l1.end(), l2, next(l2.begin())); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 2); assert(distance(l2.begin(), l2.end()) == 2); std::list>::const_iterator i = l1.begin(); assert(*i == 5); i = l2.begin(); assert(*i == 4); ++i; assert(*i == 6); } { std::list> l1; std::list> l2(a2, a2+3); l1.splice(l1.end(), l2, next(l2.begin(), 2)); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); assert(l2.size() == 2); assert(distance(l2.begin(), l2.end()) == 2); std::list>::const_iterator i = l1.begin(); assert(*i == 6); i = l2.begin(); assert(*i == 4); ++i; assert(*i == 5); } { std::list> l1(a1, a1+1); l1.splice(l1.begin(), l1, l1.begin()); assert(l1.size() == 1); assert(distance(l1.begin(), l1.end()) == 1); std::list>::const_iterator i = l1.begin(); assert(*i == 1); } { std::list> l1(a1, a1+1); std::list> l2(a2, a2+1); l1.splice(l1.begin(), l2, l2.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); assert(l2.size() == 0); assert(distance(l2.begin(), l2.end()) == 0); std::list>::const_iterator i = l1.begin(); assert(*i == 4); ++i; assert(*i == 1); } { std::list> l1(a1, a1+1); std::list> l2(a2, a2+1); l1.splice(next(l1.begin()), l2, l2.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); assert(l2.size() == 0); assert(distance(l2.begin(), l2.end()) == 0); std::list>::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 4); } { std::list> l1(a1, a1+2); l1.splice(l1.begin(), l1, l1.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list>::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 2); } { std::list> l1(a1, a1+2); l1.splice(l1.begin(), l1, next(l1.begin())); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list>::const_iterator i = l1.begin(); assert(*i == 2); ++i; assert(*i == 1); } { std::list> l1(a1, a1+2); l1.splice(next(l1.begin()), l1, l1.begin()); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list>::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 2); } { std::list> l1(a1, a1+2); l1.splice(next(l1.begin()), l1, next(l1.begin())); assert(l1.size() == 2); assert(distance(l1.begin(), l1.end()) == 2); std::list>::const_iterator i = l1.begin(); assert(*i == 1); ++i; assert(*i == 2); } #if _LIBCPP_DEBUG >= 1 { std::list> v1(3); std::list> v2(3); v1.splice(v1.begin(), v2, v1.begin()); assert(false); } #endif #endif }