diff options
author | paolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4> | 2009-08-29 19:27:05 +0000 |
---|---|---|
committer | paolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4> | 2009-08-29 19:27:05 +0000 |
commit | 58a61ad555b6410a706105d29d6746a0f5d321d2 (patch) | |
tree | d984898488471f4f866a2e225cabb539f07d3485 /libstdc++-v3/testsuite/25_algorithms | |
parent | 52f5c19d04fe626cee42f247fbab091b8eaedeff (diff) | |
download | ppe42-gcc-58a61ad555b6410a706105d29d6746a0f5d321d2.tar.gz ppe42-gcc-58a61ad555b6410a706105d29d6746a0f5d321d2.zip |
2009-08-29 Chris Jefferson <chris@bubblescope.net>
* include/bits/move.h (_GLIBCXX_FORWARD): Add.
* include/bits/stl_uninitialized.h (__uninitialized_construct_range):
Add.
* include/bits/stl_tempbuf.h (_Temporary_buffer::
_Temporary_buffer(_ForwardIterator, _ForwardIterator)): Use the latter.
* include/bits/stl_construct.h (_Construct(_T1*, _T2&&)): Add in
C++0x mode.
* testsuite/util/testsuite_hooks.h (operator<(const copy_tracker&,
const copy_tracker&)): Add.
* testsuite/25_algorithms/stable_partition/mem_check.cc: New.
* testsuite/25_algorithms/stable_sort/mem_check.cc: Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@151207 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libstdc++-v3/testsuite/25_algorithms')
-rw-r--r-- | libstdc++-v3/testsuite/25_algorithms/stable_partition/mem_check.cc | 71 | ||||
-rw-r--r-- | libstdc++-v3/testsuite/25_algorithms/stable_sort/mem_check.cc | 103 |
2 files changed, 174 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/25_algorithms/stable_partition/mem_check.cc b/libstdc++-v3/testsuite/25_algorithms/stable_partition/mem_check.cc new file mode 100644 index 00000000000..81d816d36ad --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/stable_partition/mem_check.cc @@ -0,0 +1,71 @@ +// Copyright (C) 2009 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 +// <http://www.gnu.org/licenses/>. + +// 25.2.12 [lib.alg.partitions] Partitions. + +#include <algorithm> +#include <testsuite_hooks.h> +#include <testsuite_iterators.h> + +using __gnu_test::test_container; +using __gnu_test::random_access_iterator_wrapper; +using __gnu_test::copy_tracker; +using __gnu_test::copy_constructor; +using __gnu_test::assignment_operator; +using __gnu_test::destructor; + +typedef test_container<copy_tracker, random_access_iterator_wrapper> Container; + +const int A[] = {10, 20, 1, 11, 2, 21, 28, 29, 12, 35, 15, 27, 6, 16, 7, + 25, 17, 8, 23, 18, 9, 19, 24, 30, 13, 4, 14, 22, 26}; + +bool even(const copy_tracker& ct) +{ return ct.id() < 19; } + +void +test1(int throw_count) +{ + bool test __attribute__((unused)) = true; + + copy_tracker vals[30]; + for(int i = 0; i < 30; ++i) + vals[i] = A[i]; + + Container con(vals, vals + 30); + copy_tracker::reset(); + copy_constructor::throw_on(throw_count); + int throw_occurred = 0; + try + { + std::stable_partition(con.begin(), con.end(), even); + } + catch(...) + { + throw_occurred = 1; + } + + // If a throw occurred in copy_constructor, we will end up with one more + // copy_construct than destructor. + VERIFY( destructor::count() == copy_constructor::count() - throw_occurred ); +} + +int main() +{ + for(int i = 0; i < 32; ++i) + test1(i); + return 0; +} diff --git a/libstdc++-v3/testsuite/25_algorithms/stable_sort/mem_check.cc b/libstdc++-v3/testsuite/25_algorithms/stable_sort/mem_check.cc new file mode 100644 index 00000000000..78c14b43ec5 --- /dev/null +++ b/libstdc++-v3/testsuite/25_algorithms/stable_sort/mem_check.cc @@ -0,0 +1,103 @@ +// Copyright (C) 2009 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 +// <http://www.gnu.org/licenses/>. + +// 25.3.1.2 [lib.stable.sort] + +#include <algorithm> +#include <testsuite_hooks.h> +#include <testsuite_iterators.h> + +using __gnu_test::test_container; +using __gnu_test::random_access_iterator_wrapper; +using __gnu_test::copy_tracker; +using __gnu_test::copy_constructor; +using __gnu_test::assignment_operator; +using __gnu_test::destructor; + +typedef test_container<copy_tracker, random_access_iterator_wrapper> Container; + +const int A[] = {10, 20, 1, 11, 2, 21, 28, 29, 12, 35, 15, 27, 6, 16, 7, + 25, 17, 8, 23, 18, 9, 19, 24, 30, 13, 4, 14, 22, 26}; + +void +test_mem1(int throw_count) +{ + bool test __attribute__((unused)) = true; + + copy_tracker vals[30]; + for(int i = 0; i < 30; ++i) + vals[i] = A[i]; + + Container con(vals, vals + 30); + copy_tracker::reset(); + copy_constructor::throw_on(throw_count); + int throw_occurred = 0; + try + { + std::stable_sort(con.begin(), con.end()); + } + catch(...) + { + throw_occurred = 1; + } + + // If a throw occurred in copy_constructor, we will end up with one more + // copy_construct than destructor. + VERIFY( destructor::count() == copy_constructor::count() - throw_occurred ); +} + +bool +is_ordered(const copy_tracker& lhs, const copy_tracker& rhs) +{ return lhs < rhs; } + +void +test_mem2(int throw_count) +{ + bool test __attribute__((unused)) = true; + + copy_tracker vals[30]; + for(int i = 0; i < 30; ++i) + vals[i] = A[i]; + + Container con(vals, vals + 30); + copy_tracker::reset(); + copy_constructor::throw_on(throw_count); + int throw_occurred = 0; + try + { + std::stable_sort(con.begin(), con.end(), is_ordered); + } + catch(...) + { + throw_occurred = 1; + } + + // If a throw occurred in copy_constructor, we will end up with one more + // copy_construct than destructor. + VERIFY( destructor::count() == copy_constructor::count() - throw_occurred ); +} + +int main() +{ + for(int i = 0; i < 60; ++i) + { + test_mem1(i); + test_mem2(i); + } + + return 0; +} |