re PR libstdc++/28587 (vector<bool> is extremely slow (900x slower than it should be))
2006-08-05 Paolo Carlini <pcarlini@suse.de> PR libstdc++/28587 * include/bits/stl_bvector.h (vector<bool>::_M_fill): New. (vector<bool>::_M_fill_insert): Use it. * testsuite/performance/23_containers/resize/vector_bool.cc: New. * testsuite/23_containers/vector/bool/modifiers/insert/1.cc: New. * testsuite/23_containers/vector/bool/capacity/1.cc: Likewise. From-SVN: r115947
This commit is contained in:
Paolo Carlini
Paolo Carlini
parent
76b63f3c5f
commit
15ecde8ebf
5 changed files with 384 additions and 2 deletions
|
|
@ -1,3 +1,13 @@
|
|||
2006-08-05 Paolo Carlini <pcarlini@suse.de>
|
||||
|
||||
PR libstdc++/28587
|
||||
* include/bits/stl_bvector.h (vector<bool>::_M_fill): New.
|
||||
(vector<bool>::_M_fill_insert): Use it.
|
||||
* testsuite/performance/23_containers/resize/vector_bool.cc: New.
|
||||
|
||||
* testsuite/23_containers/vector/bool/modifiers/insert/1.cc: New.
|
||||
* testsuite/23_containers/vector/bool/capacity/1.cc: Likewise.
|
||||
|
||||
2006-08-04 Paolo Carlini <pcarlini@suse.de>
|
||||
|
||||
* include/bits/stl_queue.h (priority_queue<>::push,
|
||||
|
|
|
|||
|
|
@ -740,6 +740,19 @@ template<typename _Alloc>
|
|||
|
||||
protected:
|
||||
|
||||
void
|
||||
_M_fill(iterator __first, iterator __last, bool __x)
|
||||
{
|
||||
if (__first._M_p != __last._M_p)
|
||||
{
|
||||
std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
|
||||
std::fill(__first, iterator(__first._M_p + 1, 0), __x);
|
||||
std::fill(iterator(__last._M_p, 0), __last, __x);
|
||||
}
|
||||
else
|
||||
std::fill(__first, __last, __x);
|
||||
}
|
||||
|
||||
void
|
||||
_M_initialize(size_type __n)
|
||||
{
|
||||
|
|
@ -873,7 +886,7 @@ template<typename _Alloc>
|
|||
{
|
||||
std::copy_backward(__position, end(),
|
||||
this->_M_impl._M_finish + difference_type(__n));
|
||||
std::fill(__position, __position + difference_type(__n), __x);
|
||||
_M_fill(__position, __position + difference_type(__n), __x);
|
||||
this->_M_impl._M_finish += difference_type(__n);
|
||||
}
|
||||
else
|
||||
|
|
@ -881,7 +894,7 @@ template<typename _Alloc>
|
|||
const size_type __len = size() + std::max(size(), __n);
|
||||
_Bit_type * __q = this->_M_allocate(__len);
|
||||
iterator __i = std::copy(begin(), __position, iterator(__q, 0));
|
||||
std::fill_n(__i, __n, __x);
|
||||
_M_fill(__i, __i + difference_type(__n), __x);
|
||||
this->_M_impl._M_finish = std::copy(__position, end(),
|
||||
__i + difference_type(__n));
|
||||
this->_M_deallocate();
|
||||
|
|
|
|||
138
libstdc++-v3/testsuite/23_containers/vector/bool/capacity/1.cc
Normal file
138
libstdc++-v3/testsuite/23_containers/vector/bool/capacity/1.cc
Normal file
|
|
@ -0,0 +1,138 @@
|
|||
// 2006-08-05 Paolo Carlini <pcarlini@suse.de>
|
||||
|
||||
// Copyright (C) 2006 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 2, 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 COPYING. If not, write to the Free
|
||||
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
||||
// USA.
|
||||
|
||||
// 23.2.5 vector<bool> resize
|
||||
|
||||
#include <vector>
|
||||
#include <testsuite_hooks.h>
|
||||
|
||||
const bool A1[] = {0};
|
||||
const bool A2[] = {0, 0, 0};
|
||||
const bool A3[] = {0, 0};
|
||||
const bool A4[] = {0, 0, 1, 1, 1, 1, 1};
|
||||
const bool A5[] = {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
|
||||
const bool A6[] = {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1};
|
||||
const bool A7[] = {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0};
|
||||
const bool A8[] = {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
|
||||
const bool A9[] = {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
|
||||
const bool A10[] = {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1};
|
||||
const bool A11[] = {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0};
|
||||
|
||||
const unsigned N1 = sizeof(A1) / sizeof(bool);
|
||||
const unsigned N2 = sizeof(A2) / sizeof(bool);
|
||||
const unsigned N3 = sizeof(A3) / sizeof(bool);
|
||||
const unsigned N4 = sizeof(A4) / sizeof(bool);
|
||||
const unsigned N5 = sizeof(A5) / sizeof(bool);
|
||||
const unsigned N6 = sizeof(A6) / sizeof(bool);
|
||||
const unsigned N7 = sizeof(A7) / sizeof(bool);
|
||||
const unsigned N8 = sizeof(A8) / sizeof(bool);
|
||||
const unsigned N9 = sizeof(A9) / sizeof(bool);
|
||||
const unsigned N10 = sizeof(A10) / sizeof(bool);
|
||||
const unsigned N11 = sizeof(A11) / sizeof(bool);
|
||||
|
||||
void
|
||||
test01()
|
||||
{
|
||||
bool test __attribute__((unused)) = true;
|
||||
|
||||
typedef std::vector<bool> vec_type;
|
||||
|
||||
vec_type v;
|
||||
|
||||
v.resize(1);
|
||||
VERIFY( v.size() == 1 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A1) );
|
||||
|
||||
v.resize(3);
|
||||
VERIFY( v.size() == 3 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A2) );
|
||||
|
||||
v.resize(2);
|
||||
VERIFY( v.size() == 2 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A3) );
|
||||
|
||||
v.resize(7, true);
|
||||
VERIFY( v.size() == 7 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A4) );
|
||||
|
||||
v.resize(18, false);
|
||||
VERIFY( v.size() == 18 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A5) );
|
||||
|
||||
v.resize(40, true);
|
||||
VERIFY( v.size() == 40 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A6) );
|
||||
|
||||
v.resize(80, false);
|
||||
VERIFY( v.size() == 80 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A7) );
|
||||
|
||||
v.resize(90, true);
|
||||
VERIFY( v.size() == 90 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A8) );
|
||||
|
||||
v.resize(100, false);
|
||||
VERIFY( v.size() == 100 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A9) );
|
||||
|
||||
v.resize(200, true);
|
||||
VERIFY( v.size() == 200 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A10) );
|
||||
|
||||
v.resize(13, true);
|
||||
VERIFY( v.size() == 13 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A11) );
|
||||
|
||||
v.resize(13, false);
|
||||
VERIFY( v.size() == 13 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A11) );
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
test01();
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,172 @@
|
|||
// 2006-08-05 Paolo Carlini <pcarlini@suse.de>
|
||||
|
||||
// Copyright (C) 2006 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 2, 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 COPYING. If not, write to the Free
|
||||
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
||||
// USA.
|
||||
|
||||
// 23.2.5 vector<bool> insert
|
||||
|
||||
#include <vector>
|
||||
#include <testsuite_hooks.h>
|
||||
|
||||
const bool A1[] = {1, 1, 1, 1, 1, 1, 1};
|
||||
const bool A2[] = {1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1};
|
||||
const bool A3[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
|
||||
1};
|
||||
const bool A4[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 1, 1};
|
||||
const bool A5[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1,
|
||||
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1};
|
||||
const bool A6[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 1, 1};
|
||||
const bool A7[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 1, 1, 0};
|
||||
const bool A8[] = {0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 1, 1, 0};
|
||||
const bool A9[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
|
||||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||||
1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 1, 1, 0};
|
||||
|
||||
const unsigned N1 = sizeof(A1) / sizeof(bool);
|
||||
const unsigned N2 = sizeof(A2) / sizeof(bool);
|
||||
const unsigned N3 = sizeof(A3) / sizeof(bool);
|
||||
const unsigned N4 = sizeof(A4) / sizeof(bool);
|
||||
const unsigned N5 = sizeof(A5) / sizeof(bool);
|
||||
const unsigned N6 = sizeof(A6) / sizeof(bool);
|
||||
const unsigned N7 = sizeof(A7) / sizeof(bool);
|
||||
const unsigned N8 = sizeof(A8) / sizeof(bool);
|
||||
const unsigned N9 = sizeof(A9) / sizeof(bool);
|
||||
|
||||
void
|
||||
test01()
|
||||
{
|
||||
bool test __attribute__((unused)) = true;
|
||||
|
||||
typedef std::vector<bool> vec_type;
|
||||
|
||||
vec_type v;
|
||||
|
||||
v.insert(v.begin(), 7, true);
|
||||
VERIFY( v.size() == 7 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A1) );
|
||||
|
||||
v.insert(v.begin() + 5, 10, false);
|
||||
VERIFY( v.size() == 17 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A2) );
|
||||
|
||||
v.insert(v.begin(), 20, false);
|
||||
VERIFY( v.size() == 37 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A3) );
|
||||
|
||||
v.insert(v.begin(), 40, true);
|
||||
VERIFY( v.size() == 77 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A4) );
|
||||
|
||||
v.insert(v.begin() + 18, 80, false);
|
||||
VERIFY( v.size() == 157 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A5) );
|
||||
|
||||
v.insert(v.begin() + 54, 80, true);
|
||||
VERIFY( v.size() == 237 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A6) );
|
||||
|
||||
v.insert(v.end(), 1, false);
|
||||
VERIFY( v.size() == 238 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A7) );
|
||||
|
||||
v.insert(v.begin(), 1, false);
|
||||
VERIFY( v.size() == 239 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A8) );
|
||||
|
||||
v.insert(v.begin(), 180, true);
|
||||
VERIFY( v.size() == 419 );
|
||||
VERIFY( std::equal(v.begin(), v.end(), A9) );
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
test01();
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,49 @@
|
|||
// Copyright (C) 2006 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 2, 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 COPYING. If not, write to the Free
|
||||
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
||||
// USA.
|
||||
|
||||
// As a special exception, you may use this file as part of a free software
|
||||
// library without restriction. Specifically, if other files instantiate
|
||||
// templates or use macros or inline functions from this file, or you compile
|
||||
// this file and link it with other files to produce an executable, this
|
||||
// file does not by itself cause the resulting executable to be covered by
|
||||
// the GNU General Public License. This exception does not however
|
||||
// invalidate any other reasons why the executable file might be covered by
|
||||
// the GNU General Public License.
|
||||
|
||||
#include <vector>
|
||||
#include <testsuite_performance.h>
|
||||
|
||||
// libstdc++/28587
|
||||
int main()
|
||||
{
|
||||
using namespace __gnu_test;
|
||||
|
||||
time_counter time;
|
||||
resource_counter resource;
|
||||
|
||||
start_counters(time, resource);
|
||||
for (unsigned i = 0; i < 200000; ++i)
|
||||
{
|
||||
std::vector<bool> vec;
|
||||
vec.resize(i);
|
||||
}
|
||||
stop_counters(time, resource);
|
||||
report_performance(__FILE__, "", time, resource);
|
||||
|
||||
return 0;
|
||||
}
|
||||
Loading…
Add table
Reference in a new issue