From: Jonathan Wakely Date: Fri, 8 Jul 2016 16:35:10 +0000 (+0100) Subject: * testsuite/23_containers/vector/modifiers/insert/aliasing.cc: New. X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=d81102f47338747e8b769325012c34a0820a916b;p=gcc.git * testsuite/23_containers/vector/modifiers/insert/aliasing.cc: New. From-SVN: r238169 --- diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 9591b3740a0..f1529c2f1a8 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,7 @@ +2016-07-08 Jonathan Wakely + + * testsuite/23_containers/vector/modifiers/insert/aliasing.cc: New. + 2016-07-07 Jonathan Wakely * doc/xml/manual/status_cxx2014.xml: Update LFTS status table. diff --git a/libstdc++-v3/testsuite/23_containers/vector/modifiers/insert/aliasing.cc b/libstdc++-v3/testsuite/23_containers/vector/modifiers/insert/aliasing.cc new file mode 100644 index 00000000000..2ef13b47ec4 --- /dev/null +++ b/libstdc++-v3/testsuite/23_containers/vector/modifiers/insert/aliasing.cc @@ -0,0 +1,79 @@ +// Copyright (C) 2016 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// You should have received a copy of the GNU General Public License along +// with this library; see the file COPYING3. If not see +// . + +// { dg-options "-std=gnu++14" } + +#include +#include +#include + +// See https://gcc.gnu.org/ml/libstdc++/2016-07/msg00008.html for background. + +struct T +{ + T(int v = 0) : value(v) { } + T(const T& t); + T& operator=(const T& t); + void make_child() { child = std::make_unique(value + 10); } + std::unique_ptr child; + int value; +}; + +T::T(const T& t) : value(t.value) +{ + if (t.child) + child.reset(new T(*t.child)); +} + +T& T::operator=(const T& t) +{ + value = t.value; + if (t.child) + { + if (child) + *child = *t.child; + else + child.reset(new T(*t.child)); + } + else + child.reset(); + return *this; +} + +void +test01() +{ + std::vector v; + v.reserve(3); + v.push_back(T(1)); + v.back().make_child(); + v.push_back(T(2)); + v.back().make_child(); + + VERIFY(v[1].child->value == 12); + VERIFY(v[1].child->child == nullptr); + + v.insert(v.begin(), *v[1].child); + + VERIFY(v[0].value == 12); + VERIFY(v[0].child == nullptr); +} + +int main() +{ + test01(); +}