libstdc++-v3/testsuite/performance/ext/pb_ds/hash_int_erase_mem.cc

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005-2019 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 terms
   7 // of the GNU General Public License as published by the Free Software
   8 // Foundation; either version 3, or (at your option) any later
   9 // version.
  10
  11 // This library is distributed in the hope that it will be useful, but
  12 // WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14 // General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License
  17 // along with this library; see the file COPYING3.  If not see
  18 // <http://www.gnu.org/licenses/>.
  19
  20
  21 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  22
  23 // Permission to use, copy, modify, sell, and distribute this software
  24 // is hereby granted without fee, provided that the above copyright
  25 // notice appears in all copies, and that both that copyright notice
  26 // and this permission notice appear in supporting documentation. None
  27 // of the above authors, nor IBM Haifa Research Laboratories, make any
  28 // representation about the suitability of this software for any
  29 // purpose. It is provided "as is" without express or implied
  30 // warranty.
  31
  32 /**
  33  * @file hash_random_int_erase_mem_usage_test.cpp
  34  * Contains test for erasing random integers.
  35  */
  36
  37 #include <ext/typelist.h>
  38 #include <testsuite_allocator.h>
  39 #include <performance/io/xml_formatter.hpp>
  40 #include <io/verified_cmd_line_input.hpp>
  41 #include <testsuite_rng.h>
  42 #include <common_type/assoc/common_type.hpp>
  43 #include <performance/assoc/mem_usage/erase_test.hpp>
  44 #include <iostream>
  45 #include <vector>
  46 #include <functional>
  47
  48 struct int_hash : public std::unary_function<int, int>
  49 {
  50   inline int
  51   operator()(int i) const
  52   { return i; }
  53 };
  54
  55 void
  56 usage();
  57
  58 int
  59 main(int argc, char* a_p_argv[])
  60 {
  61   using namespace __gnu_pbds::test;
  62
  63   size_t vn = 200;
  64   size_t vs = 200;
  65   size_t vm = 2100;
  66   try
  67     {
  68       xml_test_performance_formatter fmt("Size", "Memory (bytes)");
  69
  70       typedef std::vector<int> vec_t;
  71       vec_t a_v(vm);
  72       twister_rand_gen g;
  73       for (size_t i = 0; i < vm; ++i)
  74         a_v[i] = static_cast<int>(g.get_unsigned_long());
  75
  76       vec_t::const_iterator b = a_v.begin();
  77       erase_test<vec_t::const_iterator> tst(b,  vn, vs, vm);
  78       typedef __gnu_test::tracker_allocator<char> alloc_t;
  79       {
  80         typedef hash_common_types<int, __gnu_pbds::null_type, int_hash, std::equal_to<int>, alloc_t>::performance_tl tl_t;
  81
  82         tl_t tl;
  83         __gnu_cxx::typelist::apply(tst, tl);
  84       }
  85
  86       {
  87         typedef native_hash_set<int, 8, int_hash, std::equal_to<int>, std::less<int>, alloc_t> native_t;
  88
  89         tst(native_t());
  90       }
  91     }
  92   catch (...)
  93     {
  94       std::cerr << "Test failed" << std::endl;
  95       return -1;
  96     }
  97   return 0;
  98 }
  99
 100 void
 101 usage()
 102 {
 103   using namespace std;
 104   cerr << "usage: hash_random_int_erase_if_test <vn> <vs> <vm>"
 105        << endl << endl;
 106
 107   cerr << "This test checks the performance of various associative containers "
 108           "using their erase method. " << endl;
 109   cerr << "Specifically, it does the following:" << endl;
 110   cerr << "*  Creates a vector of random integers " << endl;
 111   cerr << "*  Inserts the elements into the container" << endl;
 112   cerr << "*  Erases all the elements, except one, from the constainer"
 113        << endl << endl;
 114
 115   cerr << "vn = minimum size of the vector" << endl;
 116   cerr << "vs = step size of the vector" << endl;
 117   cerr << "vm = maximum size of the vector" << endl;
 118 }