Merge -r 127928:132243 from trunk
[official-gcc.git] / libstdc++-v3 / testsuite / performance / ext / pb_ds / random_int_subscript_find_timing.cc
blobe336114b4895d58120bc862a5393d4ec31b7e7a7
1 // -*- C++ -*-
3 // Copyright (C) 2005, 2006 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 2, or (at your option) any later
9 // version.
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.
16 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
29 // Public License.
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
40 // warranty.
42 /**
43 * @file random_int_subscript_find_timing_test.cpp
44 * Contains test for subscripting random integers.
47 #include <ext/typelist.h>
48 #include <performance/io/xml_formatter.hpp>
49 #include <native_type/assoc/native_hash_map.hpp>
50 #include <native_type/assoc/native_map.hpp>
51 #include <io/verified_cmd_line_input.hpp>
52 #include <rng/twister_rand_gen.hpp>
53 #include <common_type/assoc/common_type.hpp>
54 #include <performance/assoc/timing/subscript_find_test.hpp>
55 #include <iostream>
56 #include <vector>
58 void
59 usage();
61 int
62 main(int argc, char* a_p_argv[])
64 using namespace __gnu_pbds::test;
66 size_t vn = 200;
67 size_t vs = 200;
68 size_t vm = 2100;
70 try
72 xml_test_performance_formatter fmt("Size", "Average time (sec.)");
74 typedef std::vector<std::pair<int, size_t> > vec_t;
75 vec_t a_v(vm);
76 twister_rand_gen g;
77 for (size_t i = 0; i < vm; ++i)
78 a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
79 vec_t::const_iterator b = a_v.begin();
81 typedef subscript_find_test<vec_t::const_iterator> test_t;
82 test_t tst(b, b, vn, vs, vm, vn, vs, vm);
84 typedef hash_common_types<int, size_t>::performance_tl tl_t;
85 tl_t tl;
86 __gnu_cxx::typelist::apply(tst, tl);
90 typedef tree_common_types<int, size_t>::performance_tl tl_t;
91 tl_t tl;
92 __gnu_cxx::typelist::apply(tst, tl);
96 typedef native_hash_map<int, size_t> native_t;
97 tst(native_t());
101 typedef native_map< int, size_t> native_t;
102 tst(native_t());
105 catch (...)
107 std::cerr << "Test failed" << std::endl;
108 return -1;
110 return 0;
113 void
114 usage()
116 using namespace std;
117 cerr << "usage: hash_random_int_subscript_find_timing_test <vn> <vs> <vm>" <<
118 endl << endl;
120 cerr <<
121 "This test checks the performance of various associative containers "
122 "using their find method. " << endl;
123 cerr << "Specifically, it does the following:" << endl;
124 cerr << "* Creates a vector of random integers " << endl;
125 cerr << "* Inserts the elements into the container" << endl;
126 cerr << "* Performs a sequence of find operations. At each iteration, "
127 "it finds, for each integer in the vector, its entry in the "
128 "container, using the subscript operator";
129 cerr << "* Repeats the above test a number of times" << endl;
131 cerr << endl << endl;
133 cerr << "vn = minimum size of the vector" << endl;
134 cerr << "vs = step size of the vector" << endl;
135 cerr << "vm = maximum size of the vector" << endl;