From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 2136) id 96C213957030; Wed, 17 Jun 2020 19:16:02 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 96C213957030 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1592421362; bh=B9TyvoABfSkp2/M7R2fXlI/T5uwDUeceqBTUF8/8ILk=; h=From:To:Subject:Date:From; b=e1im6FmeyKebMv8yw8uNcsj1u51RMg+2W8rSQhjjiz3Eoft58QgZ0vcUVXeGKX9Ik dm+HhcoeWJ+CLb09V3bG/kA4GPoBH+yKjVF46EJX9v1utQNDP8NoyQNREl8HzCFq+3 vYAD+2zaRoUeSxfLuv/1JY4CeqzI1PiADz4Nld5g= Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit From: Aldy Hernandez To: gcc-cvs@gcc.gnu.org, libstdc++-cvs@gcc.gnu.org Subject: [gcc/devel/ranger] libstdc++: -D_GLIBCXX_DEBUG fixes in the constrained algos tests X-Act-Checkin: gcc X-Git-Author: Patrick Palka X-Git-Refname: refs/heads/devel/ranger X-Git-Oldrev: cfeef9acd2cec93ed6338cc0d9fad98bdc0f7599 X-Git-Newrev: 10a32d479861c3a39987d3468f6a400e907499a2 Message-Id: <20200617191602.96C213957030@sourceware.org> Date: Wed, 17 Jun 2020 19:16:02 +0000 (GMT) X-BeenThere: libstdc++-cvs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Libstdc++-cvs mailing list List-Unsubscribe: , List-Archive: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 17 Jun 2020 19:16:02 -0000 https://gcc.gnu.org/g:10a32d479861c3a39987d3468f6a400e907499a2 commit 10a32d479861c3a39987d3468f6a400e907499a2 Author: Patrick Palka Date: Thu Feb 27 10:35:08 2020 -0500 libstdc++: -D_GLIBCXX_DEBUG fixes in the constrained algos tests This fixes the failures in the constrained algos tests when they are run in debug mode. libstdc++-v3/ChangeLog: * testsuite/25_algorithms/copy/constrained.cc: Don't assume that the base() of a vector<>::iterator is a pointer. * testsuite/25_algorithms/copy_backward/constrained.cc: Likewise. * testsuite/25_algorithms/move/constrained.cc: Likewise. * testsuite/25_algorithms/move_backward/constrained.cc: Likewise. * testsuite/25_algorithms/inplace_merge/constrained.cc: Use foo.data() instead of &foo[0]. * testsuite/25_algorithms/partial_sort/constrained.cc: Likewise. * testsuite/25_algorithms/partial_sort_copy/constrained.cc: Likewise. * testsuite/25_algorithms/shuffle/constrained.cc: Likewise. * testsuite/25_algorithms/sort/constrained.cc: Likewise. * testsuite/25_algorithms/stable_sort/constrained.cc: Likewise. Diff: --- libstdc++-v3/ChangeLog | 15 +++++++++++++++ libstdc++-v3/testsuite/25_algorithms/copy/constrained.cc | 16 ++++++++-------- .../testsuite/25_algorithms/copy_backward/constrained.cc | 16 ++++++++-------- .../testsuite/25_algorithms/inplace_merge/constrained.cc | 2 +- libstdc++-v3/testsuite/25_algorithms/move/constrained.cc | 16 ++++++++-------- .../testsuite/25_algorithms/move_backward/constrained.cc | 16 ++++++++-------- .../testsuite/25_algorithms/partial_sort/constrained.cc | 4 ++-- .../25_algorithms/partial_sort_copy/constrained.cc | 8 ++++---- .../testsuite/25_algorithms/shuffle/constrained.cc | 4 ++-- libstdc++-v3/testsuite/25_algorithms/sort/constrained.cc | 4 ++-- .../testsuite/25_algorithms/stable_sort/constrained.cc | 4 ++-- 11 files changed, 60 insertions(+), 45 deletions(-) diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index bd76b541e8f..b3efeae221a 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,18 @@ +2020-02-27 Patrick Palka + + * testsuite/25_algorithms/copy/constrained.cc: Don't assume that the + base() of a vector<>::iterator is a pointer. + * testsuite/25_algorithms/copy_backward/constrained.cc: Likewise. + * testsuite/25_algorithms/move/constrained.cc: Likewise. + * testsuite/25_algorithms/move_backward/constrained.cc: Likewise. + * testsuite/25_algorithms/inplace_merge/constrained.cc: Use foo.data() + instead of &foo[0]. + * testsuite/25_algorithms/partial_sort/constrained.cc: Likewise. + * testsuite/25_algorithms/partial_sort_copy/constrained.cc: Likewise. + * testsuite/25_algorithms/shuffle/constrained.cc: Likewise. + * testsuite/25_algorithms/sort/constrained.cc: Likewise. + * testsuite/25_algorithms/stable_sort/constrained.cc: Likewise. + 2020-02-27 Jonathan Wakely * include/debug/array (operator<=>): Define for C++20. diff --git a/libstdc++-v3/testsuite/25_algorithms/copy/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/copy/constrained.cc index 85f7d649608..aafe845db3a 100644 --- a/libstdc++-v3/testsuite/25_algorithms/copy/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/copy/constrained.cc @@ -70,8 +70,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::copy(x, ranges::begin(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data()+3 ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -81,8 +81,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::copy(x, ranges::begin(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data()+3 ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -93,8 +93,8 @@ test01() auto [in,out] = ranges::copy(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.end())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data() ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -105,8 +105,8 @@ test01() auto [in,out] = ranges::copy(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.end())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data() ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } } diff --git a/libstdc++-v3/testsuite/25_algorithms/copy_backward/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/copy_backward/constrained.cc index 900f78aaa73..9df2a2ff593 100644 --- a/libstdc++-v3/testsuite/25_algorithms/copy_backward/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/copy_backward/constrained.cc @@ -57,8 +57,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::copy_backward(x, ranges::end(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data() ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -68,8 +68,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::copy_backward(x, ranges::end(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data() ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -80,8 +80,8 @@ test01() auto [in,out] = ranges::copy_backward(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.begin())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data()+3 ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -92,8 +92,8 @@ test01() auto [in,out] = ranges::copy_backward(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.begin())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data()+3 ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } } diff --git a/libstdc++-v3/testsuite/25_algorithms/inplace_merge/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/inplace_merge/constrained.cc index 856056865d9..e6e16c85382 100644 --- a/libstdc++-v3/testsuite/25_algorithms/inplace_merge/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/inplace_merge/constrained.cc @@ -40,7 +40,7 @@ test01() v.insert(v.end(), x, x+j); ranges::sort(v); - test_range rz(&v[0], &v[0]+i+j); + test_range rz(v.data(), v.data()+i+j); auto result = ranges::inplace_merge(rz, next(ranges::begin(rz), i)); VERIFY( result == rz.end() ); diff --git a/libstdc++-v3/testsuite/25_algorithms/move/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/move/constrained.cc index d205b3572a1..f15de548709 100644 --- a/libstdc++-v3/testsuite/25_algorithms/move/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/move/constrained.cc @@ -99,8 +99,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::move(x, ranges::begin(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data()+3 ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -110,8 +110,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::move(x, ranges::begin(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data()+3 ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -122,8 +122,8 @@ test01() auto [in,out] = ranges::move(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.end())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data() ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -134,8 +134,8 @@ test01() auto [in,out] = ranges::move(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.end())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data() ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } } diff --git a/libstdc++-v3/testsuite/25_algorithms/move_backward/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/move_backward/constrained.cc index 3c4aa5dc70d..14f215578c7 100644 --- a/libstdc++-v3/testsuite/25_algorithms/move_backward/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/move_backward/constrained.cc @@ -86,8 +86,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::move_backward(x, ranges::end(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data() ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -97,8 +97,8 @@ test01() std::vector y(3); const int z[3] = { 1, 2, 3 }; auto [in, out] = ranges::move_backward(x, ranges::end(y)); - VERIFY( in.base() == x.data()+3 ); - VERIFY( out.base() == y.data() ); + VERIFY( in == x.begin()+3 ); + VERIFY( out == y.begin() ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -109,8 +109,8 @@ test01() auto [in,out] = ranges::move_backward(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.begin())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data()+3 ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } @@ -121,8 +121,8 @@ test01() auto [in,out] = ranges::move_backward(make_reverse_iterator(x.end()), make_reverse_iterator(x.begin()), make_reverse_iterator(y.begin())); - VERIFY( in.base().base() == x.data()+3 ); - VERIFY( out.base().base() == y.data()+3 ); + VERIFY( in.base() == x.begin()+3 ); + VERIFY( out.base() == y.begin()+3 ); VERIFY( ranges::equal(y, z) && ranges::equal(x, z) ); } } diff --git a/libstdc++-v3/testsuite/25_algorithms/partial_sort/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/partial_sort/constrained.cc index 430e3c0b61b..3b61fe73fd7 100644 --- a/libstdc++-v3/testsuite/25_algorithms/partial_sort/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/partial_sort/constrained.cc @@ -40,9 +40,9 @@ test01() std::iota(vref.begin(), vref.end(), 0); std::vector v1(vref), v2(vref); test_container c - = {&v1[0], &v1[0] + size}; + = {v1.data(), v1.data() + size}; test_range r - = {&v2[0], &v2[0] + size}; + = {v2.data(), v2.data() + size}; std::ranlux48_base g1(size), g2(size + 1); ranges::shuffle(c, g1); diff --git a/libstdc++-v3/testsuite/25_algorithms/partial_sort_copy/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/partial_sort_copy/constrained.cc index 6b586f885dd..519c41f2bde 100644 --- a/libstdc++-v3/testsuite/25_algorithms/partial_sort_copy/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/partial_sort_copy/constrained.cc @@ -49,15 +49,15 @@ test01() for (unsigned middle = 0; middle < 10; ++middle) { test_container c - = {&v1[0], &v1[0] + size}; + = {v1.data(), v1.data() + size}; test_range r - = {&v2[0], &v2[0] + size}; + = {v2.data(), v2.data() + size}; std::vector o1(middle), o2(middle); test_range w1 - = {&o1[0], &o1[0]+middle}; + = {o1.data(), o1.data()+middle}; test_range w2 - = {&o2[0], &o2[0]+middle}; + = {o2.data(), o2.data()+middle}; auto [in1, out1] = ranges::partial_sort_copy(c.begin(), c.end(), w1.begin(), w1.end(), diff --git a/libstdc++-v3/testsuite/25_algorithms/shuffle/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/shuffle/constrained.cc index b96343aecce..3f976005b37 100644 --- a/libstdc++-v3/testsuite/25_algorithms/shuffle/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/shuffle/constrained.cc @@ -42,9 +42,9 @@ test01() std::iota(vref.begin(), vref.end(), 0); std::vector v1(vref), v2(vref); test_container c - = {&v1[0], &v1[0] + size}; + = {v1.data(), v1.data() + size}; test_range r - = {&v2[0], &v2[0] + size}; + = {v2.data(), v2.data() + size}; std::ranlux48_base g1(size), g2(size + 1); VERIFY( ranges::shuffle(c, g1) == c.end() ); diff --git a/libstdc++-v3/testsuite/25_algorithms/sort/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/sort/constrained.cc index d8227773ccb..b5a99b73cc3 100644 --- a/libstdc++-v3/testsuite/25_algorithms/sort/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/sort/constrained.cc @@ -40,9 +40,9 @@ test01() std::iota(vref.begin(), vref.end(), 0); std::vector v1(vref), v2(vref); test_container c - = {&v1[0], &v1[0] + size}; + = {v1.data(), v1.data() + size}; test_range r - = {&v2[0], &v2[0] + size}; + = {v2.data(), v2.data() + size}; std::ranlux48_base g1(size), g2(size + 1); ranges::shuffle(c, g1); diff --git a/libstdc++-v3/testsuite/25_algorithms/stable_sort/constrained.cc b/libstdc++-v3/testsuite/25_algorithms/stable_sort/constrained.cc index 23a8c03b519..ef02ccaae45 100644 --- a/libstdc++-v3/testsuite/25_algorithms/stable_sort/constrained.cc +++ b/libstdc++-v3/testsuite/25_algorithms/stable_sort/constrained.cc @@ -44,9 +44,9 @@ test01() std::iota(vref.begin(), vref.end(), 0); std::vector v1(vref), v2(vref); test_container c - = {&v1[0], &v1[0] + size}; + = {v1.data(), v1.data() + size}; test_range r - = {&v2[0], &v2[0] + size}; + = {v2.data(), v2.data() + size}; std::ranlux48_base g1(size), g2(size + 1); ranges::shuffle(c, g1);