| Index: gcc/libstdc++-v3/testsuite/ext/slist/check_construct_destroy.cc
|
| diff --git a/gcc/libstdc++-v3/testsuite/ext/slist/check_construct_destroy.cc b/gcc/libstdc++-v3/testsuite/ext/slist/check_construct_destroy.cc
|
| deleted file mode 100644
|
| index c310515adb18eca0400cfb3297f0c0ed6db7c3de..0000000000000000000000000000000000000000
|
| --- a/gcc/libstdc++-v3/testsuite/ext/slist/check_construct_destroy.cc
|
| +++ /dev/null
|
| @@ -1,78 +0,0 @@
|
| -// 2004-07-26 Matt Austern <austern@apple.com>
|
| -//
|
| -// Copyright (C) 2003, 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/>.
|
| -//
|
| -
|
| -#include <ext/slist>
|
| -#include <iterator>
|
| -#include <testsuite_allocator.h>
|
| -
|
| -using namespace __gnu_test;
|
| -
|
| -int main()
|
| -{
|
| - typedef __gnu_cxx::slist<int, tracker_allocator<int> > Container;
|
| - const int arr10[10] = { 2, 4, 1, 7, 3, 8, 10, 5, 9, 6 };
|
| - bool ok = true;
|
| -
|
| - tracker_allocator_counter::reset();
|
| - {
|
| - Container c;
|
| - ok = check_construct_destroy("empty container", 0, 0) && ok;
|
| - }
|
| - ok = check_construct_destroy("empty container", 0, 0) && ok;
|
| -
|
| -
|
| - tracker_allocator_counter::reset();
|
| - {
|
| - Container c(arr10, arr10 + 10);
|
| - ok = check_construct_destroy("Construct from range", 10, 0) && ok;
|
| - }
|
| - ok = check_construct_destroy("Construct from range", 10, 10) && ok;
|
| -
|
| - {
|
| - Container c(arr10, arr10 + 10);
|
| - tracker_allocator_counter::reset();
|
| - c.insert(c.begin(), arr10[0]);
|
| - ok = check_construct_destroy("Insert element", 1, 0) && ok;
|
| - }
|
| - ok = check_construct_destroy("Insert element", 1, 11) && ok;
|
| -
|
| - {
|
| - Container c(arr10, arr10 + 10);
|
| - tracker_allocator_counter::reset();
|
| - Container::iterator i5 = c.begin();
|
| - std::advance(i5, 5);
|
| - c.insert(i5, arr10, arr10+3);
|
| - ok = check_construct_destroy("Insert short range", 3, 0) && ok;
|
| - }
|
| - ok = check_construct_destroy("Insert short range", 3, 13) && ok;
|
| -
|
| - {
|
| - Container c(arr10, arr10 + 10);
|
| - tracker_allocator_counter::reset();
|
| - Container::iterator i7 = c.begin();
|
| - std::advance(i7, 5);
|
| - c.insert(i7, arr10, arr10+10);
|
| - ok = check_construct_destroy("Insert long range", 10, 0) && ok;
|
| - }
|
| - ok = check_construct_destroy("Insert long range", 10, 20) && ok;
|
| -
|
| - return ok ? 0 : 1;
|
| -}
|
| -
|
|
|