| Index: gcc/libstdc++-v3/testsuite/23_containers/deque/modifiers/erase/2.cc
|
| diff --git a/gcc/libstdc++-v3/testsuite/23_containers/deque/modifiers/erase/2.cc b/gcc/libstdc++-v3/testsuite/23_containers/deque/modifiers/erase/2.cc
|
| deleted file mode 100644
|
| index 2d592d7b4f9772c9c29f39cbba5adc2c859a73e0..0000000000000000000000000000000000000000
|
| --- a/gcc/libstdc++-v3/testsuite/23_containers/deque/modifiers/erase/2.cc
|
| +++ /dev/null
|
| @@ -1,114 +0,0 @@
|
| -// 2005-11-25 Paolo Carlini <pcarlini@suse.de>
|
| -
|
| -// Copyright (C) 2005, 2006, 2007, 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/>.
|
| -
|
| -// 23.2.1.3 deque modifiers
|
| -
|
| -#include <deque>
|
| -#include <testsuite_hooks.h>
|
| -
|
| -const int A[] = {-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,
|
| - 13, 14, 15};
|
| -const int A0[] = {-5, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
|
| -const int A1[] = {-5, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
|
| -const int A2[] = {-5, 0, 1, 2, 8, 9, 10, 11, 12, 13, 14, 15};
|
| -const int A3[] = {-5, 0, 1, 2, 8, 9, 10, 11};
|
| -const int A4[] = {2, 8, 9, 10, 11};
|
| -const int A5[] = {2, 8, 10, 11};
|
| -const int A6[] = {2, 8, 10};
|
| -const unsigned N = sizeof(A) / sizeof(int);
|
| -const unsigned N0 = sizeof(A0) / sizeof(int);
|
| -const unsigned N1 = sizeof(A1) / sizeof(int);
|
| -const unsigned N2 = sizeof(A2) / sizeof(int);
|
| -const unsigned N3 = sizeof(A3) / sizeof(int);
|
| -const unsigned N4 = sizeof(A4) / sizeof(int);
|
| -const unsigned N5 = sizeof(A5) / sizeof(int);
|
| -const unsigned N6 = sizeof(A6) / sizeof(int);
|
| -
|
| -template<int Size>
|
| - class My_class
|
| - {
|
| - double dummy[Size];
|
| - int data;
|
| -
|
| - public:
|
| - My_class(int num)
|
| - : data(num) { }
|
| -
|
| - operator int() const
|
| - { return data; }
|
| - };
|
| -
|
| -template<typename T>
|
| - void
|
| - test01()
|
| - {
|
| - bool test __attribute__((unused)) = true;
|
| -
|
| - typedef std::deque<T> deque_type;
|
| - typedef typename deque_type::iterator iterator_type;
|
| -
|
| - deque_type v(A, A + N);
|
| -
|
| - iterator_type it0 = v.erase(v.begin() + 1, v.begin() + 4);
|
| - VERIFY( it0 == v.begin() + 1 );
|
| - VERIFY( v.size() == N0 );
|
| - VERIFY( std::equal(v.begin(), v.end(), A0) );
|
| -
|
| - iterator_type it1 = v.erase(v.begin() + 1);
|
| - VERIFY( it1 == v.begin() + 1 );
|
| - VERIFY( v.size() == N1 );
|
| - VERIFY( std::equal(v.begin(), v.end(), A1) );
|
| -
|
| - iterator_type it2 = v.erase(v.begin() + 4, v.begin() + 9);
|
| - VERIFY( it2 == v.begin() + 4 );
|
| - VERIFY( v.size() == N2 );
|
| - VERIFY( std::equal(v.begin(), v.end(), A2) );
|
| -
|
| - iterator_type it3 = v.erase(v.begin() + 8, v.end());
|
| - VERIFY( it3 == v.begin() + 8 );
|
| - VERIFY( v.size() == N3 );
|
| - VERIFY( std::equal(v.begin(), v.end(), A3) );
|
| -
|
| - iterator_type it4 = v.erase(v.begin(), v.begin() + 3);
|
| - VERIFY( it4 == v.begin() );
|
| - VERIFY( v.size() == N4 );
|
| - VERIFY( std::equal(v.begin(), v.end(), A4) );
|
| -
|
| - iterator_type it5 = v.erase(v.begin() + 2);
|
| - VERIFY( it5 == v.begin() + 2 );
|
| - VERIFY( v.size() == N5 );
|
| - VERIFY( std::equal(v.begin(), v.end(), A5) );
|
| -
|
| - iterator_type it6 = v.erase(v.begin() + 3, v.end());
|
| - VERIFY( it6 == v.begin() + 3 );
|
| - VERIFY( v.size() == N6 );
|
| - VERIFY( std::equal(v.begin(), v.end(), A6) );
|
| -
|
| - iterator_type it7 = v.erase(v.begin(), v.end());
|
| - VERIFY( it7 == v.begin() );
|
| - VERIFY( v.empty() );
|
| - }
|
| -
|
| -int main()
|
| -{
|
| - test01<My_class<1> >();
|
| - test01<My_class<8> >();
|
| - test01<My_class<32> >();
|
| - return 0;
|
| -}
|
|
|