diff options
Diffstat (limited to 'libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp')
| -rw-r--r-- | libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp | 166 |
1 files changed, 166 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp new file mode 100644 index 00000000000..896d766753f --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp @@ -0,0 +1,166 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the terms +// of the GNU General Public License as published by the Free Software +// Foundation; either version 2, or (at your option) any later +// version. + +// This library is distributed in the hope that it will be useful, but +// WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +// General Public License for more details. + +// You should have received a copy of the GNU General Public License +// along with this library; see the file COPYING. If not, write to +// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, +// MA 02111-1307, USA. + +// As a special exception, you may use this file as part of a free +// software library without restriction. Specifically, if other files +// instantiate templates or use macros or inline functions from this +// file, or you compile this file and link it with other files to +// produce an executable, this file does not by itself cause the +// resulting executable to be covered by the GNU General Public +// License. This exception does not however invalidate any other +// reasons why the executable file might be covered by the GNU General +// Public License. + +// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. + +// Permission to use, copy, modify, sell, and distribute this software +// is hereby granted without fee, provided that the above copyright +// notice appears in all copies, and that both that copyright notice +// and this permission notice appear in supporting documentation. None +// of the above authors, nor IBM Haifa Research Laboratories, make any +// representation about the suitability of this software for any +// purpose. It is provided "as is" without express or implied +// warranty. + +/** + * @file multimap_text_insert_mem_usage_test.cpp + * Contains test for inserting text words. + */ + +#include <ext/pb_ds/detail/typelist.hpp> +#include <io/text_populate.hpp> +#include <performance/io/xml_formatter.hpp> +#include <native_type/assoc/native_hash_multimap.hpp> +#include <native_type/assoc/native_multimap.hpp> +#include <io/verified_cmd_line_input.hpp> +#include <rng/twister_rand_gen.hpp> +#include <common_type/assoc/common_type.hpp> +#include <performance/assoc/mem_usage/multimap_insert_test.hpp> +#include <performance/assoc/multimap_common_type.hpp> +#include <ext/pb_ds/detail/typelist.hpp> +#include <performance/mem/mem_track_allocator.hpp> +#include <hash_fn/string_hash_fn.hpp> +#include <iostream> +#include <vector> + +void +usage(); + +void +set_test_parameters(size_t& n, size_t&s, size_t& m, size_t& prm); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace pb_ds::test; + + std::string f_name = "thirty_years_among_the_dead_preproc.txt"; + size_t prm; + size_t ratio_n; + size_t ratio_s; + size_t ratio_m; + + set_test_parameters(prm, ratio_n, ratio_s, ratio_m); + + try + { + xml_test_performance_formatter fmt("Size", "Memory (bytes)"); + + typedef std::vector<std::pair<std::string, int> > init_vec_t; + init_vec_t a_v_init(prm); + distinct_text_populate(f_name, a_v_init); + + typedef mem_track_allocator<char> alloc_t; + typedef std::basic_string<char, std::char_traits<char>, alloc_t> string_t; + typedef std::vector<std::pair<string_t, int> > vec_t; + vec_t a_v; + twister_rand_gen g; + for (size_t i = 0; i < ratio_m; ++i) + for (size_t j = 0; j < a_v_init.size(); ++j) + 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()))); + + vec_t::const_iterator b = a_v.begin(); + { + typedef mmap_tl_t<string_t, int, alloc_t>::type tl_t; + tl_t tl; + typedef multimap_insert_test<vec_t::const_iterator, false> test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + pb_ds::detail::typelist_apply(tst, tl); + } + + { + typedef mmap_tl_t< string_t, int, alloc_t>::type tl_t; + tl_t tl; + typedef multimap_insert_test<vec_t::const_iterator, false> test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + pb_ds::detail::typelist_apply(tst, tl); + } + + typedef multimap_insert_test<vec_t::const_iterator, true> test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + { + typedef native_multimap<string_t, int, std::less<string_t>, alloc_t> native_t; + tst(pb_ds::detail::type_to_type<native_t>()); + } + + { + typedef + native_hash_multimap< + string_t, + int, + 8, + string_hash_fn, std::equal_to<string_t>, + std::less<string_t>, + alloc_t> + native_t; + + tst(pb_ds::detail::type_to_type<native_t>()); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: multimap_text_insert_test.out <prm> <ratio_n> <ratio_s> <ratio_m>" << + endl << endl; + + cerr << + "This test checks the performance of various associative containers " + "using their insert method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of pairs of text words" << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Repeats the above test a number of times" << endl; + + cerr << endl << endl; + + cerr << "prm = maximum size of distinct pair-first entries" << endl; + cerr << "ratio_n = minimum ratio of secondary keys to primary keys" << endl; + cerr << "ratio_s = step ratio of secondary keys to primary keys" << endl; + cerr << "ratio_m = maximum ratio of secondary keys to primary keys" << endl; +} |