libstdc++-v3/testsuite/23_containers/set/modifiers/16728.cc

   1 // Copyright (C) 2004 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, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  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 /*
  29  * The goal with this application is to compare the performance
  30  * between different std::allocator implementations. The results are
  31  * influenced by the underlying allocator in the "C" library, malloc.
  32  */
  33
  34 #include <set>
  35 #include <sstream>
  36 #include <testsuite_performance.h>
  37
  38 using namespace std;
  39
  40 typedef int test_type;
  41
  42 // The number of iterations to be performed.
  43 int iterations = 10000;
  44
  45 // The number of values to insert in the container, 32 will cause 5
  46 // (re)allocations to be performed (sizes 4, 8, 16, 32 and 64)
  47 // This means that all allocations are within _MAX_BYTES = 128 as
  48 // defined in stl_alloc.h for __pool_alloc.  Whether or not this
  49 // value is relevant in "the real world" or not I don't know and
  50 // should probably be investigated in more detail.
  51 int insert_values = 128;
  52
  53 template<typename TestType>
  54   struct value_type : public pair<TestType, TestType>
  55   {
  56     value_type() : pair<TestType, TestType>(0, 0) { }
  57
  58     inline value_type operator++() { return ++this->first, *this; }
  59     inline operator TestType() const { return this->first; }
  60   };
  61
  62 template<typename Container>
  63   void
  64   do_loop()
  65   {
  66     Container obj;
  67     int test_iterations = 0;
  68     value_type<test_type> test_value;
  69     while (test_iterations < iterations)
  70       {
  71         for (int j = 0; j < insert_values; ++j)
  72           obj.insert(obj.end(), ++test_value);
  73         ++test_iterations;
  74       }
  75   }
  76
  77 template<typename Container>
  78   void
  79   test_container(Container obj, bool run_threaded = false)
  80   {
  81     do_loop<Container>();
  82     std::ostringstream comment;
  83     if (run_threaded)
  84       comment << "4-way threaded iterations: " << iterations*4 << '\t';
  85     else
  86       comment << "iterations: " << iterations << '\t';
  87   }
  88
  89 // http://gcc.gnu.org/ml/libstdc++/2001-05/msg00105.html
  90 // http://gcc.gnu.org/ml/libstdc++/2003-05/msg00231.html
  91 int main(void)
  92 {
  93   typedef less<test_type> compare_type;
  94   test_container(set<test_type, compare_type>());
  95   return 0;
  96 }