URL
https://opencores.org/ocsvn/scarts/scarts/trunk
Subversion Repositories scarts
[/] [scarts/] [trunk/] [toolchain/] [scarts-gcc/] [gcc-4.1.1/] [libstdc++-v3/] [testsuite/] [performance/] [23_containers/] [insert_from_sorted/] [set.cc] - Rev 19
Compare with Previous | Blame | View Log
// Copyright (C) 2003, 2004, 2005 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 <testsuite_common_types.h> template<typename Container, int Iter> void do_loop() { // avoid excessive swap file use! static const unsigned max_size = 250000; // make results less random while static const unsigned iterations = 10; // keeping the total time reasonable static const unsigned step = 50000; using namespace std; typedef int test_type; typedef Container container_type; typedef vector<test_type> vector_type; // Initialize sorted array. vector_type v(max_size, 0); for (unsigned int i = 0; i != max_size; ++i) v[i] = i; for (unsigned int count = step; count <= max_size; count += step) { for (unsigned i = 0; i != iterations; ++i) { container_type test_set; typename container_type::iterator iter = test_set.end(); // Each insert in amortized constant time (Table 69) for (unsigned j = 0; j != count; ++j) iter = test_set.insert(iter, v[j]); } } } int main() { #ifdef TEST_S1 #define thread_type false #endif #ifdef TEST_T1 #define thread_type true #endif using __gnu_test::associative_containers; typedef __gnu_test::sets<int, thread_type>::type container_types; typedef test_sequence<thread_type> test_type; test_type test("insert_from_sorted"); __gnu_cxx::apply<test_type, container_types> applier; applier(test); return 0; }