]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
99dee823 | 3 | // Copyright (C) 2005-2021 Free Software Foundation, Inc. |
4569a895 AT |
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 | |
748086b7 | 8 | // Foundation; either version 3, or (at your option) any later |
4569a895 AT |
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 | |
748086b7 JJ |
17 | // along with this library; see the file COPYING3. If not see |
18 | // <http://www.gnu.org/licenses/>. | |
4569a895 | 19 | |
4569a895 AT |
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_insert_mem_usage_test.cpp | |
34 | * Contains test for inserting text words. | |
35 | */ | |
36 | ||
9f9900db BK |
37 | #include <iostream> |
38 | #include <vector> | |
d7f245b1 | 39 | #include <ext/typelist.h> |
9f9900db | 40 | #include <testsuite_allocator.h> |
4569a895 AT |
41 | #include <io/text_populate.hpp> |
42 | #include <performance/io/xml_formatter.hpp> | |
2e3f9c21 BK |
43 | #include <native_type/native_hash_multimap.hpp> |
44 | #include <native_type/native_multimap.hpp> | |
4569a895 | 45 | #include <io/verified_cmd_line_input.hpp> |
2e3f9c21 | 46 | #include <testsuite_rng.h> |
4569a895 AT |
47 | #include <common_type/assoc/common_type.hpp> |
48 | #include <performance/assoc/mem_usage/multimap_insert_test.hpp> | |
49 | #include <performance/assoc/multimap_common_type.hpp> | |
4569a895 | 50 | #include <hash_fn/string_hash_fn.hpp> |
4569a895 AT |
51 | |
52 | void | |
53 | usage(); | |
54 | ||
55 | void | |
56 | set_test_parameters(size_t& n, size_t&s, size_t& m, size_t& prm); | |
57 | ||
58 | int | |
59 | main(int argc, char* a_p_argv[]) | |
60 | { | |
5e11f978 | 61 | using namespace __gnu_pbds::test; |
4569a895 AT |
62 | |
63 | std::string f_name = "thirty_years_among_the_dead_preproc.txt"; | |
64 | size_t prm; | |
65 | size_t ratio_n; | |
66 | size_t ratio_s; | |
67 | size_t ratio_m; | |
68 | ||
69 | set_test_parameters(prm, ratio_n, ratio_s, ratio_m); | |
70 | ||
71 | try | |
72 | { | |
73 | xml_test_performance_formatter fmt("Size", "Memory (bytes)"); | |
74 | ||
75 | typedef std::vector<std::pair<std::string, int> > init_vec_t; | |
76 | init_vec_t a_v_init(prm); | |
77 | distinct_text_populate(f_name, a_v_init); | |
78 | ||
9f9900db | 79 | typedef __gnu_test::tracker_allocator<char> alloc_t; |
4569a895 AT |
80 | typedef std::basic_string<char, std::char_traits<char>, alloc_t> string_t; |
81 | typedef std::vector<std::pair<string_t, int> > vec_t; | |
82 | vec_t a_v; | |
83 | twister_rand_gen g; | |
84 | for (size_t i = 0; i < ratio_m; ++i) | |
85 | for (size_t j = 0; j < a_v_init.size(); ++j) | |
86 | a_v.push_back(std::make_pair(string_t(a_v_init[j].first.begin(), a_v_init[j].first.end()), static_cast<int>(g.get_unsigned_long()))); | |
87 | ||
88 | vec_t::const_iterator b = a_v.begin(); | |
89 | { | |
90 | typedef mmap_tl_t<string_t, int, alloc_t>::type tl_t; | |
91 | tl_t tl; | |
92 | typedef multimap_insert_test<vec_t::const_iterator, false> test_type; | |
93 | test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); | |
d7f245b1 | 94 | __gnu_cxx::typelist::apply(tst, tl); |
4569a895 AT |
95 | } |
96 | ||
97 | { | |
98 | typedef mmap_tl_t< string_t, int, alloc_t>::type tl_t; | |
99 | tl_t tl; | |
100 | typedef multimap_insert_test<vec_t::const_iterator, false> test_type; | |
101 | test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); | |
d7f245b1 | 102 | __gnu_cxx::typelist::apply(tst, tl); |
4569a895 AT |
103 | } |
104 | ||
105 | typedef multimap_insert_test<vec_t::const_iterator, true> test_type; | |
106 | test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); | |
107 | { | |
108 | typedef native_multimap<string_t, int, std::less<string_t>, alloc_t> native_t; | |
3441f106 | 109 | tst(native_t()); |
4569a895 AT |
110 | } |
111 | ||
112 | { | |
113 | typedef | |
114 | native_hash_multimap< | |
115 | string_t, | |
116 | int, | |
117 | 8, | |
118 | string_hash_fn, std::equal_to<string_t>, | |
119 | std::less<string_t>, | |
120 | alloc_t> | |
121 | native_t; | |
122 | ||
3441f106 | 123 | tst(native_t()); |
4569a895 AT |
124 | } |
125 | } | |
126 | catch (...) | |
127 | { | |
128 | std::cerr << "Test failed" << std::endl; | |
129 | return -1; | |
130 | } | |
131 | return 0; | |
132 | } | |
133 | ||
134 | void | |
135 | usage() | |
136 | { | |
137 | using namespace std; | |
138 | cerr << "usage: multimap_text_insert_test.out <prm> <ratio_n> <ratio_s> <ratio_m>" << | |
139 | endl << endl; | |
140 | ||
141 | cerr << | |
142 | "This test checks the performance of various associative containers " | |
143 | "using their insert method. " << endl; | |
144 | cerr << "Specifically, it does the following:" << endl; | |
145 | cerr << "* Creates a vector of pairs of text words" << endl; | |
146 | cerr << "* Inserts the elements into the container" << endl; | |
147 | cerr << "* Repeats the above test a number of times" << endl; | |
148 | ||
149 | cerr << endl << endl; | |
150 | ||
151 | cerr << "prm = maximum size of distinct pair-first entries" << endl; | |
152 | cerr << "ratio_n = minimum ratio of secondary keys to primary keys" << endl; | |
153 | cerr << "ratio_s = step ratio of secondary keys to primary keys" << endl; | |
154 | cerr << "ratio_m = maximum ratio of secondary keys to primary keys" << endl; | |
155 | } |