libstdc++-v3/testsuite/performance/23_containers/insert_from_sorted/set.cc

   1 // Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 2, or (at your option)
   7 // any later version.
   8
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING.  If not, write to the Free
  16 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  17 // USA.
  18
  19 // As a special exception, you may use this file as part of a free software
  20 // library without restriction.  Specifically, if other files instantiate
  21 // templates or use macros or inline functions from this file, or you compile
  22 // this file and link it with other files to produce an executable, this
  23 // file does not by itself cause the resulting executable to be covered by
  24 // the GNU General Public License.  This exception does not however
  25 // invalidate any other reasons why the executable file might be covered by
  26 // the GNU General Public License.
  27
  28 #include <testsuite_performance.h>
  29
  30 template<typename Container, int Iter>
  31   void
  32   do_loop()
  33   {
  34     // avoid excessive swap file use!
  35     static const unsigned max_size = 250000;
  36
  37     // make results less random while
  38     static const unsigned iterations = 10;
  39
  40     // keeping the total time reasonable
  41     static const unsigned step = 50000;
  42
  43     using namespace std;
  44     typedef int test_type;
  45     typedef Container container_type;
  46     typedef vector<test_type> vector_type;
  47
  48     // Initialize sorted array.
  49     vector_type v(max_size, 0);
  50     for (unsigned int i = 0; i != max_size; ++i)
  51       v[i] = i;
  52
  53     for (unsigned int count = step; count <= max_size; count += step)
  54       {
  55         for (unsigned i = 0; i != iterations; ++i)
  56           {
  57             container_type test_set;
  58             typename container_type::iterator iter = test_set.end();
  59
  60             // Each insert in amortized constant time (Table 69)
  61             for (unsigned j = 0; j != count; ++j)
  62               iter = test_set.insert(iter, v[j]);
  63           }
  64     }
  65
  66   }
  67
  68 int
  69 main()
  70 {
  71 #ifdef TEST_S1
  72 #define thread_type false
  73 #endif
  74
  75 #ifdef TEST_T1
  76 #define thread_type true
  77 #endif
  78
  79   typedef __gnu_test::sets<int, thread_type>::type container_types;
  80   typedef test_sequence<thread_type> test_type;
  81   test_type test("insert_from_sorted");
  82   __gnu_cxx::typelist::apply(test, container_types());
  83
  84   return 0;
  85 }
  86