libstdc++-v3/testsuite/performance/23_containers/sort_search/list.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     // XXX
  35     const int iter = 150000;
  36     typedef Container container_type;
  37     container_type obj;
  38     int ctr = 3;
  39     while (ctr--)
  40       {
  41         for (int i = 0; i < iter; ++i)
  42           obj.push_back(rand()%500001);
  43
  44         //Search for random values that may or may not belong to the list.
  45         for (int i = 0; i < 50; ++i)
  46           std::find(obj.begin(), obj.end(), rand() % 100001);
  47
  48         obj.sort();
  49
  50         //Search for random values that may or may not belong to the list.
  51         for (int i = 0; i < 50; ++i)
  52           {
  53             typedef typename container_type::iterator iterator_type;
  54             iterator_type _liter = std::find(obj.begin(), obj.end(),
  55                                              rand() % 100001);
  56             if (_liter != obj.end())
  57               obj.erase(_liter);
  58           }
  59         obj.clear();
  60       }
  61   }
  62
  63 int
  64 main()
  65 {
  66 #ifdef TEST_S1
  67 #define thread_type false
  68 #endif
  69
  70 #ifdef TEST_T1
  71 #define thread_type true
  72 #endif
  73
  74   typedef __gnu_test::lists<int, thread_type>::type container_types;
  75   typedef test_sequence<thread_type> test_type;
  76   test_type test("sort_search");
  77   __gnu_cxx::typelist::apply(test, container_types());
  78
  79   return 0;
  80 }
  81