blob: f4b588247f15564cf89ba758da5733eb9591cfdd [file] [log] [blame]
// -*- C++ -*-
// Copyright (C) 2005-2021 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 3, 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
// 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 COPYING3. If not see
// <>.
// 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 priority_queue_text_push_pop_timing_test.cpp
* Contains test for finding text.
#include <iostream>
#include <vector>
#include <ext/typelist.h>
#include <testsuite_allocator.h>
#include <performance/io/xml_formatter.hpp>
#include <io/verified_cmd_line_input.hpp>
#include <common_type/priority_queue/common_type.hpp>
#include <performance/priority_queue/mem_usage/pop_test.hpp>
#include <io/text_populate.hpp>
#include <native_type/native_priority_queue.hpp>
main(int argc, char* a_p_argv[])
using namespace __gnu_pbds::test;
std::string f_name = "thirty_years_among_the_dead_preproc.txt";
size_t vn = 200;
size_t vs = 200;
size_t vm = 2100;
xml_test_performance_formatter fmt("Size", "Memory (bytes)");
typedef __gnu_test::tracker_allocator<char> allocator_type;
typedef std::char_traits<char> traits_type;
typedef std::basic_string<char, traits_type, allocator_type> string_t;
typedef std::less<string_t> cmp_type;
typedef std::vector<std::pair<string_t, char> > vec_t;
vec_t a_v(vm);
text_populate(f_name, a_v);
typedef pop_test<vec_t::const_iterator> test_t;
vec_t::const_iterator b = a_v.begin();
test_t tst(b, vn, vs, vm);
typedef pq_common_types<string_t, cmp_type, allocator_type>::performance_tl pq_tl_t;
pq_tl_t tl;
__gnu_cxx::typelist::apply(tst, tl);
typedef native_priority_queue<string_t, true, cmp_type,
allocator_type> native_pq_t;
typedef native_priority_queue<string_t, false, cmp_type,
allocator_type> native_pq_t;
catch (...)
std::cerr << "Test failed" << std::endl;
return -1;
return 0;
using namespace std;
cerr << "usage: priority_queue_text_pop_mem_usage_test <f_name> <vn> <vs> <vm>" <<
endl << endl;
cerr <<
"This test checks the performance of various priority_queueiative containers "
"using their push method. " << endl;
cerr << "Specifically, it does the following:" << endl;
cerr << "* Creates a vector of text words " << endl;
cerr << "* Pushes the elements into the container, then pops until it's empty." << endl;
cerr << endl << endl;
cerr << "f_name = file name containing the text words. "
"Each line should contain one word." << endl;
cerr << "vn = minimum size of the vector" << endl;
cerr << "vs = step size of the vector" << endl;
cerr << "vm = maximum size of the vector" << endl;