1// -*- C++ -*-
2
3// Copyright (C) 2005, 2006, 2009 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 multimap_text_find_timing_test.cpp
34 * Contains test for inserting text words.
35 */
36
37#include <ext/typelist.h>
38#include <io/text_populate.hpp>
39#include <performance/io/xml_formatter.hpp>
40#include <native_type/native_hash_multimap.hpp>
41#include <native_type/native_multimap.hpp>
42#include <io/verified_cmd_line_input.hpp>
43#include <testsuite_rng.h>
44#include <common_type/assoc/common_type.hpp>
45#include <performance/assoc/timing/multimap_find_test.hpp>
46#include <performance/assoc/multimap_common_type.hpp>
47#include <hash_fn/string_hash_fn.hpp>
48#include <iostream>
49#include <vector>
50
51void
52usage();
53
54void
55set_test_parameters(size_t& n, size_t&s, size_t& m, size_t& prm);
56
57int
58main(int argc, char* a_p_argv[])
59{
60  using namespace __gnu_pbds::test;
61
62  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
63  size_t prm;
64  size_t ratio_n;
65  size_t ratio_s;
66  size_t ratio_m;
67
68
69  set_test_parameters(prm, ratio_n, ratio_s, ratio_m);
70
71  try
72    {
73      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
74
75      typedef std::vector<std::pair<std::string, int> > vec_t;
76      vec_t a_v_init(prm);
77      distinct_text_populate(f_name, a_v_init);
78
79      vec_t a_v;
80      twister_rand_gen g;
81      for (size_t i = 0; i < ratio_m; ++i)
82	for (size_t j = 0; j < a_v_init.size(); ++j)
83	  a_v.push_back(std::make_pair(a_v_init[j].first,
84				       static_cast<int>(g.get_unsigned_long())));
85
86      vec_t::const_iterator b = a_v.begin();
87      {
88	typedef mmap_tl_t<std::string, int, std::allocator<char> >::type mmap_tl_tl;
89	mmap_tl_tl tl;
90
91	typedef multimap_find_test<vec_t::const_iterator, false> test_type;
92	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
93	__gnu_cxx::typelist::apply(tst, tl);
94      }
95
96      {
97	typedef native_hash_multimap<std::string, int, 8, string_hash_fn> native_t;
98	typedef multimap_find_test<vec_t::const_iterator, true> test_type;
99	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
100	tst(native_t());
101      }
102
103      {
104	typedef native_multimap<std::string, int> native_t;
105	typedef multimap_find_test<vec_t::const_iterator, true> test_type;
106	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
107	tst(native_t());
108      }
109    }
110  catch (...)
111    {
112      std::cerr << "Test failed" << std::endl;
113      return -1;
114    }
115  return 0;
116}
117
118void
119usage()
120{
121  using namespace std;
122  cerr << "usage: multimap_text_insert_test.out <prm> <ratio_n> <ratio_s> <ratio_m>"
123       << endl << endl;
124
125  cerr << "This test checks the performance of various associative containers "
126          "using their insert method. " << endl;
127  cerr << "Specifically, it does the following:" << endl;
128  cerr << "*  Creates a vector of pairs of text words" << endl;
129  cerr << "*  Inserts the elements into the container" << endl;
130  cerr << "*  Repeats the above test a number of times" << endl;
131  cerr << endl << endl;
132
133  cerr << "prm = maximum size of distinct pair-first entries" << endl;
134  cerr << "ratio_n = minimum ratio of secondary keys to primary keys" << endl;
135  cerr << "ratio_s = step ratio of secondary keys to primary keys" << endl;
136  cerr << "ratio_m = maximum ratio of secondary keys to primary keys" << endl;
137}
138