]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
7adcbafe | 3 | // Copyright (C) 2005-2022 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 tree_split_join_timing_test.cpp | |
34 | * Contains test for joining trees. | |
35 | */ | |
36 | ||
d7f245b1 | 37 | #include <ext/typelist.h> |
4569a895 AT |
38 | #include <performance/io/xml_formatter.hpp> |
39 | #include <io/verified_cmd_line_input.hpp> | |
2e3f9c21 | 40 | #include <testsuite_rng.h> |
4569a895 AT |
41 | #include <common_type/assoc/common_type.hpp> |
42 | #include <performance/assoc/timing/tree_split_join_test.hpp> | |
4569a895 AT |
43 | #include <iostream> |
44 | #include <vector> | |
45 | ||
46 | void | |
47 | usage(); | |
48 | ||
49 | int | |
50 | main(int argc, char* a_p_argv[]) | |
51 | { | |
5e11f978 | 52 | using namespace __gnu_pbds::test; |
4569a895 AT |
53 | size_t vn = 200; |
54 | size_t vs = 200; | |
55 | size_t vm = 2100; | |
56 | ||
57 | try | |
58 | { | |
59 | xml_test_performance_formatter fmt("Size", "Average time (sec.)"); | |
60 | ||
61 | { | |
62 | typedef tree_split_join_test<true> test_t; | |
63 | test_t tst(vn, vs, vm); | |
64 | ||
a345e45d | 65 | typedef tree_common_types<int, __gnu_pbds::null_type>::performance_tl tl_t; |
4569a895 | 66 | tl_t tl; |
d7f245b1 | 67 | __gnu_cxx::typelist::apply(tst, tl); |
4569a895 AT |
68 | } |
69 | ||
70 | { | |
71 | typedef tree_split_join_test<false> test_t; | |
72 | test_t tst(vn, vs, vm); | |
73 | typedef native_set<int> native_set_t; | |
3441f106 | 74 | tst(native_set_t()); |
4569a895 AT |
75 | } |
76 | } | |
77 | catch(...) | |
78 | { | |
79 | std::cerr << "Test failed" << std::endl; | |
80 | return -1; | |
81 | } | |
82 | return 0; | |
83 | } | |
84 | ||
85 | void | |
86 | usage() | |
87 | { | |
88 | using namespace std; | |
89 | cerr << "usage: tree_split_join_test.cpp <vn> <vs> <vm>" << | |
90 | endl << endl; | |
91 | ||
92 | cerr << "This test checks the performance of splitting joining" | |
93 | "tree based containers. " << endl; | |
94 | cerr << "Specifically, it does the following:" << endl; | |
95 | cerr << "* Creates a tree " << endl; | |
96 | cerr << "* Inserts integers into the tree" << endl; | |
97 | cerr << "* Splits half the tree into a different tree" << endl; | |
98 | cerr << "* Joins the trees" << endl; | |
99 | cerr << "* Repeats the above test a given number of times) " | |
100 | << endl; | |
101 | ||
102 | cerr << endl << endl; | |
103 | ||
104 | cerr << "vn = minimum size of the tree" << endl; | |
105 | cerr << "vs = step size of the tree" << endl; | |
106 | cerr << "vm = maximum size of the tree" << endl; | |
107 | } |