libstdc++-v3/testsuite/performance/list_create_fill_sort.cc

   1 // 2003-07-07 gp dot bolton at computer dot org
   2
   3 // Copyright (C) 2003 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 2, or (at your option)
   9 // any later version.
  10
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING.  If not, write to the Free
  18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  19 // USA.
  20
  21 #include <list>
  22 #include <testsuite_hooks.h>
  23 #include <testsuite_performance.h>
  24
  25
  26 static void create_and_fill_and_sort(const unsigned int n)
  27 {
  28   typedef std::list<int>  List;
  29   List                    l;
  30
  31   for (unsigned int i = 0; i < n; ++i)
  32   {
  33       l.push_back(n - i);
  34   }
  35   l.sort();
  36 }
  37
  38
  39 int main()
  40 {
  41   using namespace std;
  42   using namespace __gnu_test;
  43
  44   time_counter time;
  45   resource_counter resource;
  46   char comment[80];
  47
  48   for (unsigned int n = 1; n <= 1000; n *= 10)
  49   {
  50       const unsigned int iterations = 10000000/n;
  51
  52       start_counters(time, resource);
  53
  54       for (unsigned int i = 0; i < iterations; ++i)
  55       {
  56           create_and_fill_and_sort( n );
  57       }
  58       stop_counters(time, resource);
  59
  60       sprintf(comment,"Iters: %8u  Size: %4u", iterations, n);
  61       report_performance(__FILE__, comment, time, resource);
  62   }
  63   return 0;
  64 }