From: Benjamin Kosnik Date: Mon, 15 Aug 2011 00:51:06 +0000 (+0000) Subject: make_graph_test_infos.xml: Edit. X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=154c4a088e477b9154a0ba8540aeafe06d2ce1f3;p=gcc.git make_graph_test_infos.xml: Edit. 2011-08-14 Benjamin Kosnik * testsuite/data/make_graph_test_infos.xml: Edit. * testsuite/data/make_graph_htmls.xml: Remove * scripts/make_graph.py: Edit, fix. * scripts/make_graphs.py: Remove. * doc/Makefile.am (doc-svg-performance): New. (doc-html-performance): Remove. * doc/Makefile.in: Regenerate. * doc/xml/manual/test_policy_data_structures.xml: Markup changes. * doc/xml/manual/policy_data_structures.xml: Same. * doc/xml/manual/locale.xml: Same. Testsuite renames. * performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc: Rename. * performance/ext/pb_ds/random_int_find_timing.cc: Same. * performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp * performance/ext/pb_ds/multimap_text_find_timing.hpp * performance/ext/pb_ds/priority_queue_random_int_push_timing.cc: Same. * performance/ext/pb_ds/priority_queue_text_modify_timing.hpp * performance/ext/pb_ds/tree_order_statistics_timing.cc: Same. * performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc: Same. * performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc: Same. * performance/ext/pb_ds/priority_queue_text_join_timing.cc: Same. * performance/ext/pb_ds/multimap_text_insert_timing_small.cc: Same. * performance/ext/pb_ds/random_int_subscript_insert_timing.cc: Same. * performance/ext/pb_ds/tree_text_lor_find_timing.cc: Same. * performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc: Same. * performance/ext/pb_ds/multimap_text_find_timing_small.cc: Same. * performance/ext/pb_ds/text_find_timing.cc: Same. * performance/ext/pb_ds/tree_text_insert_timing.cc: Same. * performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc: Same. * performance/ext/pb_ds/random_int_subscript_find_timing.cc: Same. * performance/ext/pb_ds/priority_queue_text_push_timing.cc: Same. * performance/ext/pb_ds/tree_split_join_timing.cc: Same. * performance/ext/pb_ds/multimap_text_insert_timing_large.cc: Same. * performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc: Same. * performance/ext/pb_ds/multimap_text_find_timing_large.cc: Same. * performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc: Same. * performance/ext/pb_ds/multimap_text_insert_timing.hpp * performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc: Same. * performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc: Same. * performance/ext/pb_ds/all_int_find.cc: To these new files... * performance/ext/pb_ds/all_int_subscript_find.cc: ...this. * performance/ext/pb_ds/all_int_subscript_insert.cc: ...this. * performance/ext/pb_ds/all_text_find.cc: ...this. * performance/ext/pb_ds/hash_int_erase_mem.cc: ...this. * performance/ext/pb_ds/hash_zlob_int_find.cc: ...this. * performance/ext/pb_ds/multimap_text_find.hpp * performance/ext/pb_ds/multimap_text_find_large.cc: ...this. * performance/ext/pb_ds/multimap_text_find_small.cc: ...this. * performance/ext/pb_ds/multimap_text_insert.hpp * performance/ext/pb_ds/multimap_text_insert_large.cc: ...this. * performance/ext/pb_ds/multimap_text_insert_mem.hpp * performance/ext/pb_ds/multimap_text_insert_mem_large.cc: ...this. * performance/ext/pb_ds/multimap_text_insert_mem_small.cc: ...this. * performance/ext/pb_ds/multimap_text_insert_small.cc: ...this. * performance/ext/pb_ds/priority_queue_int_push.cc: ...this. * performance/ext/pb_ds/priority_queue_int_push_pop.cc: ...this. * performance/ext/pb_ds/priority_queue_text_join.cc: ...this. * performance/ext/pb_ds/priority_queue_text_modify_down.cc: ...this. * performance/ext/pb_ds/priority_queue_text_modify.hpp * performance/ext/pb_ds/priority_queue_text_modify_up.cc: ...this. * performance/ext/pb_ds/priority_queue_text_pop_mem.cc: ...this. * performance/ext/pb_ds/priority_queue_text_push.cc: ...this. * performance/ext/pb_ds/priority_queue_text_push_pop.cc: ...this. * performance/ext/pb_ds/tree_order_statistics.cc: ...this. * performance/ext/pb_ds/tree_split_join.cc: ...this. * performance/ext/pb_ds/tree_text_insert.cc: ...this. * performance/ext/pb_ds/tree_text_lor_find.cc: ...this. * doc/xml/images/*: Image and image filename changes. From-SVN: r177756 --- diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 587ddd5c16a..f95e4a6f5d4 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,81 @@ +2011-08-14 Benjamin Kosnik + + * testsuite/data/make_graph_test_infos.xml: Edit. + * testsuite/data/make_graph_htmls.xml: Remove + * scripts/make_graph.py: Edit, fix. + * scripts/make_graphs.py: Remove. + + * doc/Makefile.am (doc-svg-performance): New. + (doc-html-performance): Remove. + * doc/Makefile.in: Regenerate. + + * doc/xml/manual/test_policy_data_structures.xml: Markup changes. + * doc/xml/manual/policy_data_structures.xml: Same. + * doc/xml/manual/locale.xml: Same. + + Testsuite renames. + * performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc: + Rename. + * performance/ext/pb_ds/random_int_find_timing.cc: Same. + * performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp + * performance/ext/pb_ds/multimap_text_find_timing.hpp + * performance/ext/pb_ds/priority_queue_random_int_push_timing.cc: Same. + * performance/ext/pb_ds/priority_queue_text_modify_timing.hpp + * performance/ext/pb_ds/tree_order_statistics_timing.cc: Same. + * performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc: Same. + * performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc: Same. + * performance/ext/pb_ds/priority_queue_text_join_timing.cc: Same. + * performance/ext/pb_ds/multimap_text_insert_timing_small.cc: Same. + * performance/ext/pb_ds/random_int_subscript_insert_timing.cc: Same. + * performance/ext/pb_ds/tree_text_lor_find_timing.cc: Same. + * performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc: Same. + * performance/ext/pb_ds/multimap_text_find_timing_small.cc: Same. + * performance/ext/pb_ds/text_find_timing.cc: Same. + * performance/ext/pb_ds/tree_text_insert_timing.cc: Same. + * performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc: Same. + * performance/ext/pb_ds/random_int_subscript_find_timing.cc: Same. + * performance/ext/pb_ds/priority_queue_text_push_timing.cc: Same. + * performance/ext/pb_ds/tree_split_join_timing.cc: Same. + * performance/ext/pb_ds/multimap_text_insert_timing_large.cc: Same. + * performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc: Same. + * performance/ext/pb_ds/multimap_text_find_timing_large.cc: Same. + * performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc: + Same. + * performance/ext/pb_ds/multimap_text_insert_timing.hpp + * performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc: Same. + * performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc: Same. + + * performance/ext/pb_ds/all_int_find.cc: To these new files... + * performance/ext/pb_ds/all_int_subscript_find.cc: ...this. + * performance/ext/pb_ds/all_int_subscript_insert.cc: ...this. + * performance/ext/pb_ds/all_text_find.cc: ...this. + * performance/ext/pb_ds/hash_int_erase_mem.cc: ...this. + * performance/ext/pb_ds/hash_zlob_int_find.cc: ...this. + * performance/ext/pb_ds/multimap_text_find.hpp + * performance/ext/pb_ds/multimap_text_find_large.cc: ...this. + * performance/ext/pb_ds/multimap_text_find_small.cc: ...this. + * performance/ext/pb_ds/multimap_text_insert.hpp + * performance/ext/pb_ds/multimap_text_insert_large.cc: ...this. + * performance/ext/pb_ds/multimap_text_insert_mem.hpp + * performance/ext/pb_ds/multimap_text_insert_mem_large.cc: ...this. + * performance/ext/pb_ds/multimap_text_insert_mem_small.cc: ...this. + * performance/ext/pb_ds/multimap_text_insert_small.cc: ...this. + * performance/ext/pb_ds/priority_queue_int_push.cc: ...this. + * performance/ext/pb_ds/priority_queue_int_push_pop.cc: ...this. + * performance/ext/pb_ds/priority_queue_text_join.cc: ...this. + * performance/ext/pb_ds/priority_queue_text_modify_down.cc: ...this. + * performance/ext/pb_ds/priority_queue_text_modify.hpp + * performance/ext/pb_ds/priority_queue_text_modify_up.cc: ...this. + * performance/ext/pb_ds/priority_queue_text_pop_mem.cc: ...this. + * performance/ext/pb_ds/priority_queue_text_push.cc: ...this. + * performance/ext/pb_ds/priority_queue_text_push_pop.cc: ...this. + * performance/ext/pb_ds/tree_order_statistics.cc: ...this. + * performance/ext/pb_ds/tree_split_join.cc: ...this. + * performance/ext/pb_ds/tree_text_insert.cc: ...this. + * performance/ext/pb_ds/tree_text_lor_find.cc: ...this. + + * doc/xml/images/*: Image and image filename changes. + 2011-08-12 Paolo Carlini * include/c_global/cmath (fmod(_Tp, _Up)): Add. diff --git a/libstdc++-v3/doc/Makefile.am b/libstdc++-v3/doc/Makefile.am index 7815221f14e..71b6e69f28c 100644 --- a/libstdc++-v3/doc/Makefile.am +++ b/libstdc++-v3/doc/Makefile.am @@ -360,97 +360,104 @@ xml_sources = \ ${xml_sources_manual} \ ${xml_sources_extra} -image_dir = ${xml_dir}/images -xml_images = \ - ${image_dir}/confdeps.png \ - ${image_dir}/pbds_balls_and_bins.png \ - ${image_dir}/pbds_binary_priority_queue_random_int_push_timing_test_local.png \ - ${image_dir}/pbds_cc_hash_random_int_find_timing_test_local.png \ - ${image_dir}/pbds_cc_hash_random_int_subscript_timing_test_find_local.png \ - ${image_dir}/pbds_cc_hash_random_int_subscript_timing_test_insert_local.png \ - ${image_dir}/pbds_container_tag_hierarchy.png \ - ${image_dir}/pbds_different_underlying_dss_1.png \ - ${image_dir}/pbds_different_underlying_dss_2.png \ - ${image_dir}/pbds_embedded_lists_1.png \ - ${image_dir}/pbds_embedded_lists_2.png \ - ${image_dir}/pbds_embedded_lists_3.png \ - ${image_dir}/pbds_exception_hierarchy.png \ - ${image_dir}/pbds_gp_hash_random_int_find_timing_test_local.png \ - ${image_dir}/pbds_gp_hash_random_int_subscript_timing_test_find_local.png \ - ${image_dir}/pbds_gp_hash_random_int_subscript_timing_test_insert_local.png \ - ${image_dir}/pbds_hash_policy_cd.png \ - ${image_dir}/pbds_hash_random_int_erase_mem_usage_test_local.png \ - ${image_dir}/pbds_hash_ranged_hash_range_hashing_fns.png \ - ${image_dir}/pbds_hash_range_hashing_seq_diagram2.png \ - ${image_dir}/pbds_hash_range_hashing_seq_diagram.png \ - ${image_dir}/pbds_hash_zlob_random_int_find_timing_test_local.png \ - ${image_dir}/pbds_insert_resize_sequence_diagram1.png \ - ${image_dir}/pbds_insert_resize_sequence_diagram2.png \ - ${image_dir}/pbds_insert_resize_sequence_diagram3.png \ - ${image_dir}/pbds_invalidation_guarantee_erase.png \ - ${image_dir}/pbds_invalidation_tag_hierarchy.png \ - ${image_dir}/pbds_list_update.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_large_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_large_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_small_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_small_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.png \ - ${image_dir}/pbds_node_invariants.png \ - ${image_dir}/pbds_pairing_priority_queue_text_push_pop_timing_test_local.png \ - ${image_dir}/pbds_pairing_priority_queue_text_push_timing_test_local.png \ - ${image_dir}/pbds_pat_trie.png \ - ${image_dir}/pbds_point_iterator_hierarchy.png \ - ${image_dir}/pbds_point_iterators_range_ops_1.png \ - ${image_dir}/pbds_point_iterators_range_ops_2.png \ - ${image_dir}/pbds_priority_queue_different_underlying_dss.png \ - ${image_dir}/pbds_priority_queue_random_int_push_pop_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_random_int_push_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_tag_hierarchy.png \ - ${image_dir}/pbds_priority_queue_text_join_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_down_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_up_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.png \ - ${image_dir}/pbds_priority_queue_text_pop_mem_usage_test_local.png \ - ${image_dir}/pbds_priority_queue_text_push_pop_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_push_timing_test_local.png \ - ${image_dir}/pbds_rationale_null_node_updator.png \ - ${image_dir}/pbds_resize_policy_cd.png \ - ${image_dir}/pbds_restoring_node_invariants.png \ - ${image_dir}/pbds_simple_list.png \ - ${image_dir}/pbds_text_find_timing_test_hash_local.png \ - ${image_dir}/pbds_text_find_timing_test_tree_like_local.png \ - ${image_dir}/pbds_tree_node_invalidations.png \ - ${image_dir}/pbds_tree_node_invariants.png \ - ${image_dir}/pbds_tree_node_updator_policy_cd.png \ - ${image_dir}/pbds_tree_order_statistics_timing_test_local.png \ - ${image_dir}/pbds_tree_split_join_timing_test_local.png \ - ${image_dir}/pbds_tree_text_insert_timing_test_node_tree_local.png \ - ${image_dir}/pbds_tree_text_insert_timing_test_pat_trie_local.png \ - ${image_dir}/pbds_tree_text_insert_timing_test_vector_tree_local.png \ - ${image_dir}/pbds_tree_text_lor_find_timing_test_local.png \ - ${image_dir}/pbds_trie_node_updator_policy_cd.png \ - ${image_dir}/pbds_update_seq_diagram.png +xml_image_dir = ${xml_dir}/images +xml_image_basic = \ + ${xml_image_dir}/confdeps.png \ + ${xml_image_dir}/pbds_balls_and_bins.png \ + ${xml_image_dir}/pbds_container_tag_hierarchy.png \ + ${xml_image_dir}/pbds_different_underlying_dss_1.png \ + ${xml_image_dir}/pbds_different_underlying_dss_2.png \ + ${xml_image_dir}/pbds_embedded_lists_1.png \ + ${xml_image_dir}/pbds_embedded_lists_2.png \ + ${xml_image_dir}/pbds_embedded_lists_3.png \ + ${xml_image_dir}/pbds_exception_hierarchy.png \ + ${xml_image_dir}/pbds_hash_policy_cd.png \ + ${xml_image_dir}/pbds_hash_ranged_hash_range_hashing_fns.png \ + ${xml_image_dir}/pbds_hash_range_hashing_seq_diagram2.png \ + ${xml_image_dir}/pbds_hash_range_hashing_seq_diagram.png \ + ${xml_image_dir}/pbds_insert_resize_sequence_diagram1.png \ + ${xml_image_dir}/pbds_insert_resize_sequence_diagram2.png \ + ${xml_image_dir}/pbds_insert_resize_sequence_diagram3.png \ + ${xml_image_dir}/pbds_invalidation_guarantee_erase.png \ + ${xml_image_dir}/pbds_invalidation_tag_hierarchy.png \ + ${xml_image_dir}/pbds_list_update.png \ + ${xml_image_dir}/pbds_node_invariants.png \ + ${xml_image_dir}/pbds_pat_trie.png \ + ${xml_image_dir}/pbds_point_iterator_hierarchy.png \ + ${xml_image_dir}/pbds_point_iterators_range_ops_1.png \ + ${xml_image_dir}/pbds_point_iterators_range_ops_2.png \ + ${xml_image_dir}/pbds_priority_queue_different_underlying_dss.png \ + ${xml_image_dir}/pbds_priority_queue_tag_hierarchy.png \ + ${xml_image_dir}/pbds_rationale_null_node_updator.png \ + ${xml_image_dir}/pbds_resize_policy_cd.png \ + ${xml_image_dir}/pbds_restoring_node_invariants.png \ + ${xml_image_dir}/pbds_simple_list.png \ + ${xml_image_dir}/pbds_tree_node_invalidations.png \ + ${xml_image_dir}/pbds_tree_node_invariants.png \ + ${xml_image_dir}/pbds_tree_node_updator_policy_cd.png \ + ${xml_image_dir}/pbds_trie_node_updator_policy_cd.png \ + ${xml_image_dir}/pbds_update_seq_diagram.png + +xml_image_generated = \ + ${xml_image_dir}/pbds_binary_priority_queue_int_push_pop.png \ + ${xml_image_dir}/pbds_binary_priority_queue_int_push.png \ + ${xml_image_dir}/pbds_ccgp_hash_int_subscript_insert.png \ + ${xml_image_dir}/pbds_cc_hash_int_find.png \ + ${xml_image_dir}/pbds_cc_hash_int_subscript_find.png \ + ${xml_image_dir}/pbds_cc_hash_int_subscript_insert.png \ + ${xml_image_dir}/pbds_gp_hash_int_find.png \ + ${xml_image_dir}/pbds_gp_hash_int_subscript_find.png \ + ${xml_image_dir}/pbds_gp_hash_int_subscript_insert.png \ + ${xml_image_dir}/pbds_hash_int_erase_mem.png \ + ${xml_image_dir}/pbds_hash_text_find.png \ + ${xml_image_dir}/pbds_hash_zlob_int_find.png \ + ${xml_image_dir}/pbds_multimap_text_find_large_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_find_large_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_find_small_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_find_small_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_large_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_large_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_large_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_large_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_small_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_small_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_small_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_small_s2p_tree.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_modify_down_thin.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_modify_up_thin.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_push_pop.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_push.png \ + ${xml_image_dir}/pbds_priority_queue_int_push_pop.png \ + ${xml_image_dir}/pbds_priority_queue_int_push.png \ + ${xml_image_dir}/pbds_priority_queue_text_join.png \ + ${xml_image_dir}/pbds_priority_queue_text_modify_down.png \ + ${xml_image_dir}/pbds_priority_queue_text_modify_up.png \ + ${xml_image_dir}/pbds_priority_queue_text_pop_mem.png \ + ${xml_image_dir}/pbds_priority_queue_text_push_pop.png \ + ${xml_image_dir}/pbds_priority_queue_text_push.png \ + ${xml_image_dir}/pbds_tree_int_find.png \ + ${xml_image_dir}/pbds_tree_order_statistics.png \ + ${xml_image_dir}/pbds_tree_split_join.png \ + ${xml_image_dir}/pbds_tree_text_find.png \ + ${xml_image_dir}/pbds_tree_text_insert_node.png \ + ${xml_image_dir}/pbds_tree_text_insert_trie.png \ + ${xml_image_dir}/pbds_tree_text_insert_vector.png \ + ${xml_image_dir}/pbds_tree_text_lor_find.png + +xml_images = ${xml_image_basic} ${xml_image_generated} xml_extradir = ${glibcxx_srcdir}/doc/html/ext xml_extra = \ ${xml_extradir}/lwg-active.html \ ${xml_extradir}/lwg-closed.html \ - ${xml_extradir}/lwg-defects.html + ${xml_extradir}/lwg-defects.html xml_noinst = \ ${xml_dir}/book.txml \ ${xml_dir}/chapter.txml \ ${xml_dir}/class.txml \ - ${image_dir}/confdeps.dot \ - ${image_dir}/confdeps.pdf + ${xml_image_dir}/confdeps.dot \ + ${xml_image_dir}/confdeps.pdf XSLTPROC = xsltproc XSLT_FLAGS = --nonet --xinclude @@ -481,6 +488,7 @@ ${docbook_outdir}/texinfo: ${docbook_outdir}/xml: mkdir -p ${docbook_outdir}/xml + mkdir -p ${docbook_outdir}/xml/images # Validate existing XML structure. XMLLINT = xmllint @@ -553,7 +561,7 @@ doc-fo-docbook: stamp-fo-docbook # PDF, via dblatex manual_pdf = ${docbook_outdir}/pdf/libstdc++-manual.pdf -DBLATEX_FLAGS = --dump --verbose --pdf +DBLATEX_FLAGS = --dump --verbose --pdf stamp-pdf-docbook: $(xml_sources) ${docbook_outdir}/pdf @echo "Generating pdf dblatex files..." dblatex $(DBLATEX_FLAGS) \ @@ -599,16 +607,14 @@ doc-epub-docbook: stamp-epub-docbook # Performance doc and graph configuration. # Assumes pychart, beautiful soup installed. -# Generates the plots and graphs for performance testing. -# XXX this needs to be re-worked to create only the SVG charts -doc_performance_script=${top_srcdir}/scripts/make_graphs.py -doc-html-performance: +# Generates the plots/graph imagery for performance testing. +doc_performance_script=${top_srcdir}/scripts/make_graph.py +doc-svg-performance: ${docbook_outdir}/xml -@(chmod + ${doc_performance_script}; \ - ${doc_performance_script} ${top_srcdir} \ + ${doc_performance_script} \ + ${top_srcdir}/testsuite/data/make_graph_test_infos.xml \ ${glibcxx_builddir}/testsuite \ - ${top_srcdir}/testsuite/data/make_graph_htmls.xml \ - ${top_srcdir}/testsuite/data/make_graph_test_infos.xml local g++) - + ${glibcxx_builddir}/doc/docbook/xml/images) .PHONY: doc-doxygen-html doc-doxygen-man doc-performance diff --git a/libstdc++-v3/doc/Makefile.in b/libstdc++-v3/doc/Makefile.in index 26222ad5353..7734453e40b 100644 --- a/libstdc++-v3/doc/Makefile.in +++ b/libstdc++-v3/doc/Makefile.in @@ -413,97 +413,103 @@ xml_sources = \ ${xml_sources_manual} \ ${xml_sources_extra} -image_dir = ${xml_dir}/images -xml_images = \ - ${image_dir}/confdeps.png \ - ${image_dir}/pbds_balls_and_bins.png \ - ${image_dir}/pbds_binary_priority_queue_random_int_push_timing_test_local.png \ - ${image_dir}/pbds_cc_hash_random_int_find_timing_test_local.png \ - ${image_dir}/pbds_cc_hash_random_int_subscript_timing_test_find_local.png \ - ${image_dir}/pbds_cc_hash_random_int_subscript_timing_test_insert_local.png \ - ${image_dir}/pbds_container_tag_hierarchy.png \ - ${image_dir}/pbds_different_underlying_dss_1.png \ - ${image_dir}/pbds_different_underlying_dss_2.png \ - ${image_dir}/pbds_embedded_lists_1.png \ - ${image_dir}/pbds_embedded_lists_2.png \ - ${image_dir}/pbds_embedded_lists_3.png \ - ${image_dir}/pbds_exception_hierarchy.png \ - ${image_dir}/pbds_gp_hash_random_int_find_timing_test_local.png \ - ${image_dir}/pbds_gp_hash_random_int_subscript_timing_test_find_local.png \ - ${image_dir}/pbds_gp_hash_random_int_subscript_timing_test_insert_local.png \ - ${image_dir}/pbds_hash_policy_cd.png \ - ${image_dir}/pbds_hash_random_int_erase_mem_usage_test_local.png \ - ${image_dir}/pbds_hash_ranged_hash_range_hashing_fns.png \ - ${image_dir}/pbds_hash_range_hashing_seq_diagram2.png \ - ${image_dir}/pbds_hash_range_hashing_seq_diagram.png \ - ${image_dir}/pbds_hash_zlob_random_int_find_timing_test_local.png \ - ${image_dir}/pbds_insert_resize_sequence_diagram1.png \ - ${image_dir}/pbds_insert_resize_sequence_diagram2.png \ - ${image_dir}/pbds_insert_resize_sequence_diagram3.png \ - ${image_dir}/pbds_invalidation_guarantee_erase.png \ - ${image_dir}/pbds_invalidation_tag_hierarchy.png \ - ${image_dir}/pbds_list_update.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_large_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_large_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_small_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_find_timing_test_small_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.png \ - ${image_dir}/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.png \ - ${image_dir}/pbds_node_invariants.png \ - ${image_dir}/pbds_pairing_priority_queue_text_push_pop_timing_test_local.png \ - ${image_dir}/pbds_pairing_priority_queue_text_push_timing_test_local.png \ - ${image_dir}/pbds_pat_trie.png \ - ${image_dir}/pbds_point_iterator_hierarchy.png \ - ${image_dir}/pbds_point_iterators_range_ops_1.png \ - ${image_dir}/pbds_point_iterators_range_ops_2.png \ - ${image_dir}/pbds_priority_queue_different_underlying_dss.png \ - ${image_dir}/pbds_priority_queue_random_int_push_pop_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_random_int_push_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_tag_hierarchy.png \ - ${image_dir}/pbds_priority_queue_text_join_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_down_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_up_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.png \ - ${image_dir}/pbds_priority_queue_text_pop_mem_usage_test_local.png \ - ${image_dir}/pbds_priority_queue_text_push_pop_timing_test_local.png \ - ${image_dir}/pbds_priority_queue_text_push_timing_test_local.png \ - ${image_dir}/pbds_rationale_null_node_updator.png \ - ${image_dir}/pbds_resize_policy_cd.png \ - ${image_dir}/pbds_restoring_node_invariants.png \ - ${image_dir}/pbds_simple_list.png \ - ${image_dir}/pbds_text_find_timing_test_hash_local.png \ - ${image_dir}/pbds_text_find_timing_test_tree_like_local.png \ - ${image_dir}/pbds_tree_node_invalidations.png \ - ${image_dir}/pbds_tree_node_invariants.png \ - ${image_dir}/pbds_tree_node_updator_policy_cd.png \ - ${image_dir}/pbds_tree_order_statistics_timing_test_local.png \ - ${image_dir}/pbds_tree_split_join_timing_test_local.png \ - ${image_dir}/pbds_tree_text_insert_timing_test_node_tree_local.png \ - ${image_dir}/pbds_tree_text_insert_timing_test_pat_trie_local.png \ - ${image_dir}/pbds_tree_text_insert_timing_test_vector_tree_local.png \ - ${image_dir}/pbds_tree_text_lor_find_timing_test_local.png \ - ${image_dir}/pbds_trie_node_updator_policy_cd.png \ - ${image_dir}/pbds_update_seq_diagram.png - +xml_image_dir = ${xml_dir}/images +xml_image_basic = \ + ${xml_image_dir}/confdeps.png \ + ${xml_image_dir}/pbds_balls_and_bins.png \ + ${xml_image_dir}/pbds_container_tag_hierarchy.png \ + ${xml_image_dir}/pbds_different_underlying_dss_1.png \ + ${xml_image_dir}/pbds_different_underlying_dss_2.png \ + ${xml_image_dir}/pbds_embedded_lists_1.png \ + ${xml_image_dir}/pbds_embedded_lists_2.png \ + ${xml_image_dir}/pbds_embedded_lists_3.png \ + ${xml_image_dir}/pbds_exception_hierarchy.png \ + ${xml_image_dir}/pbds_hash_policy_cd.png \ + ${xml_image_dir}/pbds_hash_ranged_hash_range_hashing_fns.png \ + ${xml_image_dir}/pbds_hash_range_hashing_seq_diagram2.png \ + ${xml_image_dir}/pbds_hash_range_hashing_seq_diagram.png \ + ${xml_image_dir}/pbds_insert_resize_sequence_diagram1.png \ + ${xml_image_dir}/pbds_insert_resize_sequence_diagram2.png \ + ${xml_image_dir}/pbds_insert_resize_sequence_diagram3.png \ + ${xml_image_dir}/pbds_invalidation_guarantee_erase.png \ + ${xml_image_dir}/pbds_invalidation_tag_hierarchy.png \ + ${xml_image_dir}/pbds_list_update.png \ + ${xml_image_dir}/pbds_node_invariants.png \ + ${xml_image_dir}/pbds_pat_trie.png \ + ${xml_image_dir}/pbds_point_iterator_hierarchy.png \ + ${xml_image_dir}/pbds_point_iterators_range_ops_1.png \ + ${xml_image_dir}/pbds_point_iterators_range_ops_2.png \ + ${xml_image_dir}/pbds_priority_queue_different_underlying_dss.png \ + ${xml_image_dir}/pbds_priority_queue_tag_hierarchy.png \ + ${xml_image_dir}/pbds_rationale_null_node_updator.png \ + ${xml_image_dir}/pbds_resize_policy_cd.png \ + ${xml_image_dir}/pbds_restoring_node_invariants.png \ + ${xml_image_dir}/pbds_simple_list.png \ + ${xml_image_dir}/pbds_tree_node_invalidations.png \ + ${xml_image_dir}/pbds_tree_node_invariants.png \ + ${xml_image_dir}/pbds_tree_node_updator_policy_cd.png \ + ${xml_image_dir}/pbds_trie_node_updator_policy_cd.png \ + ${xml_image_dir}/pbds_update_seq_diagram.png + +xml_image_generated = \ + ${xml_image_dir}/pbds_binary_priority_queue_int_push_pop.png \ + ${xml_image_dir}/pbds_binary_priority_queue_int_push.png \ + ${xml_image_dir}/pbds_ccgp_hash_int_subscript_insert.png \ + ${xml_image_dir}/pbds_cc_hash_int_find.png \ + ${xml_image_dir}/pbds_cc_hash_int_subscript_find.png \ + ${xml_image_dir}/pbds_cc_hash_int_subscript_insert.png \ + ${xml_image_dir}/pbds_gp_hash_int_find.png \ + ${xml_image_dir}/pbds_gp_hash_int_subscript_find.png \ + ${xml_image_dir}/pbds_gp_hash_int_subscript_insert.png \ + ${xml_image_dir}/pbds_hash_int_erase_mem.png \ + ${xml_image_dir}/pbds_hash_text_find.png \ + ${xml_image_dir}/pbds_hash_zlob_int_find.png \ + ${xml_image_dir}/pbds_multimap_text_find_large_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_find_large_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_find_small_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_find_small_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_large_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_large_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_large_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_large_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_small_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_mem_small_s2p_tree.png \ + ${xml_image_dir}/pbds_multimap_text_insert_small_s2p_hash.png \ + ${xml_image_dir}/pbds_multimap_text_insert_small_s2p_tree.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_modify_down_thin.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_modify_up_thin.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_push_pop.png \ + ${xml_image_dir}/pbds_pairing_priority_queue_text_push.png \ + ${xml_image_dir}/pbds_priority_queue_int_push_pop.png \ + ${xml_image_dir}/pbds_priority_queue_int_push.png \ + ${xml_image_dir}/pbds_priority_queue_text_join.png \ + ${xml_image_dir}/pbds_priority_queue_text_modify_down.png \ + ${xml_image_dir}/pbds_priority_queue_text_modify_up.png \ + ${xml_image_dir}/pbds_priority_queue_text_pop_mem.png \ + ${xml_image_dir}/pbds_priority_queue_text_push_pop.png \ + ${xml_image_dir}/pbds_priority_queue_text_push.png \ + ${xml_image_dir}/pbds_tree_int_find.png \ + ${xml_image_dir}/pbds_tree_order_statistics.png \ + ${xml_image_dir}/pbds_tree_split_join.png \ + ${xml_image_dir}/pbds_tree_text_find.png \ + ${xml_image_dir}/pbds_tree_text_insert_node.png \ + ${xml_image_dir}/pbds_tree_text_insert_trie.png \ + ${xml_image_dir}/pbds_tree_text_insert_vector.png \ + ${xml_image_dir}/pbds_tree_text_lor_find.png + +xml_images = ${xml_image_basic} ${xml_image_generated} xml_extradir = ${glibcxx_srcdir}/doc/html/ext xml_extra = \ ${xml_extradir}/lwg-active.html \ ${xml_extradir}/lwg-closed.html \ - ${xml_extradir}/lwg-defects.html + ${xml_extradir}/lwg-defects.html xml_noinst = \ ${xml_dir}/book.txml \ ${xml_dir}/chapter.txml \ ${xml_dir}/class.txml \ - ${image_dir}/confdeps.dot \ - ${image_dir}/confdeps.pdf + ${xml_image_dir}/confdeps.dot \ + ${xml_image_dir}/confdeps.pdf XSLT_FLAGS = --nonet --xinclude XSLT_PARAM = --param toc.section.depth 4 @@ -530,7 +536,7 @@ manual_html = ${docbook_outdir}/html/libstdc++-manual-single.html # PDF, via dblatex manual_pdf = ${docbook_outdir}/pdf/libstdc++-manual.pdf -DBLATEX_FLAGS = --dump --verbose --pdf +DBLATEX_FLAGS = --dump --verbose --pdf # TEXINFO, via docbook2X # NB: Both experimental and tempermental @@ -548,9 +554,8 @@ manual_epub = ${docbook_outdir}/epub/libstdc++-manual.epub # Performance doc and graph configuration. # Assumes pychart, beautiful soup installed. -# Generates the plots and graphs for performance testing. -# XXX this needs to be re-worked to create only the SVG charts -doc_performance_script = ${top_srcdir}/scripts/make_graphs.py +# Generates the plots/graph imagery for performance testing. +doc_performance_script = ${top_srcdir}/scripts/make_graph.py # By adding these files here, automake will remove them for 'make clean' CLEANFILES = *.log stamp* @@ -882,6 +887,7 @@ ${docbook_outdir}/texinfo: ${docbook_outdir}/xml: mkdir -p ${docbook_outdir}/xml + mkdir -p ${docbook_outdir}/xml/images doc-xml-validate-docbook: $(xml_sources) $(xml_images) @echo "Generating XML validation log..." $(XMLLINT) $(XMLLINT_VALID_FLAGS) ${top_srcdir}/doc/xml/spine.xml @@ -962,12 +968,12 @@ stamp-epub-docbook: stamp-xml-single-docbook ${docbook_outdir}/epub $(STAMP) stamp-epub-docbook doc-epub-docbook: stamp-epub-docbook -doc-html-performance: +doc-svg-performance: ${docbook_outdir}/xml -@(chmod + ${doc_performance_script}; \ - ${doc_performance_script} ${top_srcdir} \ + ${doc_performance_script} \ + ${top_srcdir}/testsuite/data/make_graph_test_infos.xml \ ${glibcxx_builddir}/testsuite \ - ${top_srcdir}/testsuite/data/make_graph_htmls.xml \ - ${top_srcdir}/testsuite/data/make_graph_test_infos.xml local g++) + ${glibcxx_builddir}/doc/docbook/xml/images) .PHONY: doc-doxygen-html doc-doxygen-man doc-performance diff --git a/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.pdf deleted file mode 100644 index 0349bc7d62d..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.png deleted file mode 100644 index 41bf7476c00..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.svg deleted file mode 100644 index 14a8c06bf87..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_binary_priority_queue_random_int_push_timing_test_local.svg +++ /dev/null @@ -1,446 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.34e-06 - - - - 2.68e-06 - - - - 4.02e-06 - - - - 5.36e-06 - - - - 6.70e-06 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - binary_heap - - - - - - - - - n_pq_deque - - - - - - - - - n_pq_vector - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.pdf deleted file mode 100644 index 49f928156de..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.png deleted file mode 100644 index 6d1f5d2c80e..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.svg deleted file mode 100644 index 949ed5f0a57..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_find_timing_test_local.svg +++ /dev/null @@ -1,597 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 3.62e-09 - - - - 7.24e-09 - - - - 1.09e-08 - - - - 1.45e-08 - - - - 1.81e-08 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_hash_map_ncah - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.pdf b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.pdf deleted file mode 100644 index a778ac26385..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.png b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.png deleted file mode 100644 index d2d60354edd..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.svg b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.svg deleted file mode 100644 index 065aed6d4b2..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_find_local.svg +++ /dev/null @@ -1,597 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 3.63e-09 - - - - 7.26e-09 - - - - 1.09e-08 - - - - 1.45e-08 - - - - 1.82e-08 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_hash_map_ncah - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.pdf b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.pdf deleted file mode 100644 index 6a62da8ae30..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.png b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.png deleted file mode 100644 index 71b62064e74..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.svg b/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.svg deleted file mode 100644 index 9cb1af8a92c..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_cc_hash_random_int_subscript_timing_test_insert_local.svg +++ /dev/null @@ -1,598 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - - 0.00e+00 - - - - 2.66e-08 - - - - 5.31e-08 - - - - 7.97e-08 - - - - 1.06e-07 - - - - 1.33e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map - - - - - - - - - n_hash_map_ncah - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.pdf deleted file mode 100644 index 7b570b0695d..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.png deleted file mode 100644 index 1e8fdf1ede7..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.svg deleted file mode 100644 index 92a2914bff8..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_find_timing_test_local.svg +++ /dev/null @@ -1,369 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 6.07e-09 - - - - 1.21e-08 - - - - 1.82e-08 - - - - 2.43e-08 - - - - 3.03e-08 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map - - - - - - - - - n_hash_map_ncah - - - - - - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.pdf b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.pdf deleted file mode 100644 index 1e7f06c9ed2..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.png b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.png deleted file mode 100644 index 47c19ca203f..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.svg b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.svg deleted file mode 100644 index be324e4cdcb..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_find_local.svg +++ /dev/null @@ -1,369 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 6.38e-09 - - - - 1.28e-08 - - - - 1.91e-08 - - - - 2.55e-08 - - - - 3.19e-08 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map - - - - - - - - - n_hash_map_ncah - - - - - - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.pdf b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.pdf deleted file mode 100644 index f8880451bb7..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.png b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.png deleted file mode 100644 index a5d4fb54845..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.svg b/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.svg deleted file mode 100644 index d85deab745f..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_gp_hash_random_int_subscript_timing_test_insert_local.svg +++ /dev/null @@ -1,369 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 3.03e-08 - - - - 6.07e-08 - - - - 9.10e-08 - - - - 1.21e-07 - - - - 1.52e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_hash_map_ncah - - - - - - - - - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map - - - - - - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.pdf deleted file mode 100644 index 60a649e5429..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.png b/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.png deleted file mode 100644 index 7b6263b99c6..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.svg deleted file mode 100644 index 83dee9a3756..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_hash_random_int_erase_mem_usage_test_local.svg +++ /dev/null @@ -1,416 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - - - 0.00e+00 - - - - 3.25e+03 - - - - 6.50e+03 - - - - 9.75e+03 - - - - 1.30e+04 - - - - 1.63e+04 - - - - 1.95e+04 - - - - 2.28e+04 - - - Memory (bytes) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_hash_set_ncah - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_set - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_set - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.pdf deleted file mode 100644 index 63d18071aa2..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.png deleted file mode 100644 index 9119cd197c8..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.svg deleted file mode 100644 index c2594418449..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_hash_zlob_random_int_find_timing_test_local.svg +++ /dev/null @@ -1,560 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 6.22e-08 - - - - 1.24e-07 - - - - 1.87e-07 - - - - 2.49e-07 - - - - 3.11e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map - - - - - - - - - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map - - - - - - - - - n_hash_map_ncah - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.pdf deleted file mode 100644 index 65b9b30c0c8..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.png deleted file mode 100644 index 40877824fb9..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.svg deleted file mode 100644 index 563fc893c58..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_hash_local.svg +++ /dev/null @@ -1,239 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 9.12e-08 - - - - 1.82e-07 - - - - 2.74e-07 - - - - 3.65e-07 - - - - 4.56e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_hash_mmap - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - lu_mtf_set - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.pdf deleted file mode 100644 index 5669985f26b..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.png deleted file mode 100644 index 5dd805a254e..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.svg deleted file mode 100644 index 0bdda44a63e..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_large_s2p_tree_local.svg +++ /dev/null @@ -1,281 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.21e-07 - - - - 2.42e-07 - - - - 3.63e-07 - - - - 4.84e-07 - - - - 6.05e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_mmap - - - - - - - - - rb_tree_ - - - mmap_ - - - lu_mtf_set - - - - - - rb_tree_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.pdf deleted file mode 100644 index 258e0fc19dc..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.png deleted file mode 100644 index 55d25a5bf5c..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.svg deleted file mode 100644 index 6ce9719dd38..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_hash_local.svg +++ /dev/null @@ -1,239 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 3.08e-08 - - - - 6.16e-08 - - - - 9.23e-08 - - - - 1.23e-07 - - - - 1.54e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_hash_mmap - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - lu_mtf_set - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.pdf deleted file mode 100644 index ad058078261..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.png deleted file mode 100644 index 95c1d8791f8..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.svg deleted file mode 100644 index fe45e74e8a7..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_find_timing_test_small_s2p_tree_local.svg +++ /dev/null @@ -1,281 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 9.08e-08 - - - - 1.82e-07 - - - - 2.72e-07 - - - - 3.63e-07 - - - - 4.54e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_mmap - - - - - - rb_tree_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - - - - rb_tree_ - - - mmap_ - - - lu_mtf_set - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.pdf deleted file mode 100644 index 58af87574b3..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.png deleted file mode 100644 index c68826a8b92..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.svg deleted file mode 100644 index b3ad54d73c3..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_hash_local.svg +++ /dev/null @@ -1,244 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - - - - - - - - - - 1.00e+04 - - - - 2.91e+04 - - - - 4.83e+04 - - - - 6.74e+04 - - - - 8.65e+04 - - - Memory (bytes) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - - - - n_hash_mmap - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - lu_mtf_set - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.pdf deleted file mode 100644 index 8dddc241f5a..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.png deleted file mode 100644 index 1991e4d4737..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.svg deleted file mode 100644 index 0e2ecb709b5..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_large_s2p_tree_local.svg +++ /dev/null @@ -1,286 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - - - - - - - - - - 1.00e+04 - - - - 2.92e+04 - - - - 4.85e+04 - - - - 6.77e+04 - - - - 8.69e+04 - - - Memory (bytes) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - rb_tree_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - - - - n_mmap - - - - - - - - - rb_tree_ - - - mmap_ - - - lu_mtf_set - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.pdf deleted file mode 100644 index c97c24be2cf..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.png deleted file mode 100644 index 09ab7bc873f..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.svg deleted file mode 100644 index cb47139a4ad..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_hash_local.svg +++ /dev/null @@ -1,253 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - - - 0.00e+00 - - - - 2.79e+04 - - - - 5.58e+04 - - - - 8.36e+04 - - - - 1.12e+05 - - - - 1.39e+05 - - - - 1.67e+05 - - - - 1.95e+05 - - - - 2.23e+05 - - - Memory (bytes) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - lu_mtf_set - - - - - - - - - n_hash_mmap - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.pdf deleted file mode 100644 index 4caca02c65b..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.png deleted file mode 100644 index 666e4a2a40d..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.svg deleted file mode 100644 index f9a835ed852..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_mem_usage_test_small_s2p_tree_local.svg +++ /dev/null @@ -1,295 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - - - 0.00e+00 - - - - 2.82e+04 - - - - 5.64e+04 - - - - 8.46e+04 - - - - 1.13e+05 - - - - 1.41e+05 - - - - 1.69e+05 - - - - 1.97e+05 - - - - 2.26e+05 - - - Memory (bytes) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - rb_tree_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - - - - n_mmap - - - - - - - - - rb_tree_ - - - mmap_ - - - lu_mtf_set - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.pdf deleted file mode 100644 index 17b3400afd1..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.png deleted file mode 100644 index 77b902c9e48..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.svg deleted file mode 100644 index ede137c86d3..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_hash_local.svg +++ /dev/null @@ -1,239 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 8.71e-08 - - - - 1.74e-07 - - - - 2.61e-07 - - - - 3.48e-07 - - - - 4.35e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_hash_mmap - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - lu_mtf_set - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.pdf deleted file mode 100644 index cbacc907d5f..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.png deleted file mode 100644 index 42c7afa84a9..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.svg deleted file mode 100644 index c3060808d3e..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_large_s2p_tree_local.svg +++ /dev/null @@ -1,281 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.71e-07 - - - - 3.41e-07 - - - - 5.12e-07 - - - - 6.83e-07 - - - - 8.53e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_mmap - - - - - - rb_tree_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - - - - rb_tree_ - - - mmap_ - - - lu_mtf_set - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.pdf deleted file mode 100644 index 941c80b3807..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.png deleted file mode 100644 index c30ecbe1657..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.svg deleted file mode 100644 index 4602fc1a2fd..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_hash_local.svg +++ /dev/null @@ -1,239 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.35e-07 - - - - 2.69e-07 - - - - 4.04e-07 - - - - 5.39e-07 - - - - 6.74e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - - - - n_hash_mmap - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_ - - - mmap_ - - - lu_mtf_set - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.pdf deleted file mode 100644 index cd433bd577c..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.png deleted file mode 100644 index a9872209b87..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.svg deleted file mode 100644 index 9af96f35298..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_multimap_text_insert_timing_test_small_s2p_tree_local.svg +++ /dev/null @@ -1,281 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.56e-07 - - - - 3.12e-07 - - - - 4.68e-07 - - - - 6.24e-07 - - - - 7.80e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - rb_tree_ - - - mmap_ - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set - - - - - - - - - n_mmap - - - - - - - - - rb_tree_ - - - mmap_ - - - lu_mtf_set - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.pdf deleted file mode 100644 index caaa7fd6ac0..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.png deleted file mode 100644 index 6bee356d1e5..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.svg deleted file mode 100644 index 650a12bb38b..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_pop_timing_test_local.svg +++ /dev/null @@ -1,369 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 8.70e-08 - - - - 1.74e-07 - - - - 2.61e-07 - - - - 3.48e-07 - - - - 4.35e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_pq_deque - - - - - - pairing_heap - - - - - - - - - n_pq_vector - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.pdf deleted file mode 100644 index 86a2d4a015a..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.png deleted file mode 100644 index 5aa7e244843..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.svg deleted file mode 100644 index cc8d7c729d0..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_pairing_priority_queue_text_push_timing_test_local.svg +++ /dev/null @@ -1,483 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.90e-08 - - - - 3.79e-08 - - - - 5.69e-08 - - - - 7.58e-08 - - - - 9.48e-08 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_pq_deque - - - - - - - - - n_pq_vector - - - - - - - - - thin_heap - - - - - - pairing_heap - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.pdf deleted file mode 100644 index e7f1987665f..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.png deleted file mode 100644 index fee52420eb8..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.svg deleted file mode 100644 index dbe8258059a..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_pop_timing_test_local.svg +++ /dev/null @@ -1,825 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.34e-06 - - - - 2.68e-06 - - - - 4.02e-06 - - - - 5.36e-06 - - - - 6.70e-06 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - binary_heap - - - - - - - - - thin_heap - - - - - - - - - rc_binomial_heap - - - - - - - - - binomial_heap - - - - - - pairing_heap - - - - - - - - - n_pq_deque - - - - - - - - - n_pq_vector - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.pdf deleted file mode 100644 index 3807a726d8d..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.png deleted file mode 100644 index 337ff0b7583..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.svg deleted file mode 100644 index bc5456de84b..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_random_int_push_timing_test_local.svg +++ /dev/null @@ -1,825 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.34e-06 - - - - 2.68e-06 - - - - 4.02e-06 - - - - 5.36e-06 - - - - 6.70e-06 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - binary_heap - - - - - - - - - rc_binomial_heap - - - - - - - - - binomial_heap - - - - - - - - - thin_heap - - - - - - pairing_heap - - - - - - - - - n_pq_deque - - - - - - - - - n_pq_vector - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.pdf deleted file mode 100644 index e5ac57b21d5..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.png deleted file mode 100644 index 7cdeb8ce191..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.svg deleted file mode 100644 index 9564567b8de..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_join_timing_test_local.svg +++ /dev/null @@ -1,825 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 3.33e-07 - - - - 6.67e-07 - - - - 1.00e-06 - - - - 1.33e-06 - - - - 1.67e-06 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_pq_deque - - - - - - - - - n_pq_vector - - - - - - - - - binary_heap - - - - - - - - - thin_heap - - - - - - - - - binomial_heap - - - - - - pairing_heap - - - - - - - - - rc_binomial_heap - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.pdf deleted file mode 100644 index a0d0180b455..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.png deleted file mode 100644 index 4441a9ce769..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.svg deleted file mode 100644 index 3f0ea1491f6..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_local.svg +++ /dev/null @@ -1,793 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 100 - - - - 300 - - - - 500 - - - - 700 - - - - 900 - - - Size - - - - - 0.00e+00 - - - - 8.12e-05 - - - - 1.62e-04 - - - - 2.44e-04 - - - - 3.25e-04 - - - - 4.06e-04 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_pq_deque - - - - - - - - - n_pq_vector - - - - - - - - - binary_heap - - - - - - - - - thin_heap - - - - - - - - - rc_binomial_heap - - - - - - - - - binomial_heap - - - - - - pairing_heap - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.pdf deleted file mode 100644 index ee77fee93c5..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.png deleted file mode 100644 index 215edaf2b47..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.svg deleted file mode 100644 index bff59b93b56..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_down_timing_test_pairing_thin_local.svg +++ /dev/null @@ -1,223 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 100 - - - - 300 - - - - 500 - - - - 700 - - - - 900 - - - Size - - - - - 0.00e+00 - - - - 1.26e-07 - - - - 2.51e-07 - - - - 3.77e-07 - - - - 5.02e-07 - - - - 6.28e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - thin_heap - - - - - - pairing_heap - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.pdf deleted file mode 100644 index 083fe8b8e14..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.png deleted file mode 100644 index 1a3c8694aba..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.svg deleted file mode 100644 index e0dfa4fd322..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_local.svg +++ /dev/null @@ -1,793 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 100 - - - - 300 - - - - 500 - - - - 700 - - - - 900 - - - Size - - - - - 0.00e+00 - - - - 8.64e-05 - - - - 1.73e-04 - - - - 2.59e-04 - - - - 3.46e-04 - - - - 4.32e-04 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_pq_deque - - - - - - - - - n_pq_vector - - - - - - - - - binary_heap - - - - - - - - - rc_binomial_heap - - - - - - pairing_heap - - - - - - - - - binomial_heap - - - - - - - - - thin_heap - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.pdf deleted file mode 100644 index 226713cedc9..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.png deleted file mode 100644 index eb7843d66be..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.svg deleted file mode 100644 index a10ca2524e8..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_modify_up_timing_test_pairing_thin_local.svg +++ /dev/null @@ -1,224 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 100 - - - - 300 - - - - 500 - - - - 700 - - - - 900 - - - Size - - - - - - 0.00e+00 - - - - 2.57e-08 - - - - 5.14e-08 - - - - 7.71e-08 - - - - 1.03e-07 - - - - 1.29e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - pairing_heap - - - - - - - - - thin_heap - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.pdf deleted file mode 100644 index 6a83d6d9ca1..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.png deleted file mode 100644 index 4debf447af5..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.svg deleted file mode 100644 index 28519d76a28..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_pop_mem_usage_test_local.svg +++ /dev/null @@ -1,835 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - - - 0.00e+00 - - - - 3.28e+03 - - - - 6.55e+03 - - - - 9.83e+03 - - - - 1.31e+04 - - - - 1.64e+04 - - - - 1.97e+04 - - - - 2.29e+04 - - - Memory (bytes) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_pq_vector - - - - - - - - - n_pq_deque - - - - - - - - - binary_heap - - - - - - - - - thin_heap - - - - - - - - - binomial_heap - - - - - - - - - rc_binomial_heap - - - - - - pairing_heap - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.pdf deleted file mode 100644 index 16e0325a0c4..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.png deleted file mode 100644 index 78205310809..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.svg deleted file mode 100644 index 81ebb401aec..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_pop_timing_test_local.svg +++ /dev/null @@ -1,825 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.14e-05 - - - - 2.27e-05 - - - - 3.41e-05 - - - - 4.55e-05 - - - - 5.68e-05 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - binary_heap - - - - - - - - - rc_binomial_heap - - - - - - - - - thin_heap - - - - - - - - - binomial_heap - - - - - - - - - n_pq_deque - - - - - - pairing_heap - - - - - - - - - n_pq_vector - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.pdf deleted file mode 100644 index 1217db04d62..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.png deleted file mode 100644 index 09bd6b013a6..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.svg deleted file mode 100644 index 169e2b434d3..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_priority_queue_text_push_timing_test_local.svg +++ /dev/null @@ -1,825 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.13e-05 - - - - 2.27e-05 - - - - 3.40e-05 - - - - 4.53e-05 - - - - 5.67e-05 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - binary_heap - - - - - - - - - rc_binomial_heap - - - - - - - - - n_pq_deque - - - - - - - - - binomial_heap - - - - - - - - - n_pq_vector - - - - - - - - - thin_heap - - - - - - pairing_heap - - - - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.pdf b/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.pdf deleted file mode 100644 index 7f1614766a0..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.png b/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.png deleted file mode 100644 index 1909c1b3c12..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.svg b/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.svg deleted file mode 100644 index 578056dd2df..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_hash_local.svg +++ /dev/null @@ -1,483 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.03e-08 - - - - 2.07e-08 - - - - 3.10e-08 - - - - 4.13e-08 - - - - 5.17e-08 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map - - - - - - - - - cc_hash_mask_exp_nea_lc_1div8_1div2_sth_map - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.pdf b/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.pdf deleted file mode 100644 index cc094f788aa..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.png b/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.png deleted file mode 100644 index 937b343e8f9..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.svg b/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.svg deleted file mode 100644 index a12fbdaefef..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_text_find_timing_test_tree_like_local.svg +++ /dev/null @@ -1,542 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 8.16e-08 - - - - 1.63e-07 - - - - 2.45e-07 - - - - 3.27e-07 - - - - 4.08e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - splay_tree_map - - - - - - - - - n_map - - - - - - - - ov_tree_map - - - - - - - - - rb_tree_map - - - - - - pat_trie_map - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.pdf deleted file mode 100644 index bf8bf8a47f4..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.png deleted file mode 100644 index ea82ea03e11..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.svg deleted file mode 100644 index 323dd9a3e97..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_tree_order_statistics_timing_test_local.svg +++ /dev/null @@ -1,446 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 1.70e-06 - - - - 3.40e-06 - - - - 5.10e-06 - - - - 6.80e-06 - - - - 8.50e-06 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_set - - - - - - - - - splay_tree_ost_set - - - - - - - - - rb_tree_ost_set - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.pdf deleted file mode 100644 index 08ffc543474..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.png deleted file mode 100644 index 4fa7e32445c..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.svg deleted file mode 100644 index e103d8cb2bf..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_tree_split_join_timing_test_local.svg +++ /dev/null @@ -1,505 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 4.52e-05 - - - - 9.03e-05 - - - - 1.35e-04 - - - - 1.81e-04 - - - - 2.26e-04 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - n_set - - - - - - - - - splay_tree_set - - - - - - - - - rb_tree_set - - - - - - - - ov_tree_set - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.pdf deleted file mode 100644 index b5b73a6b343..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.png deleted file mode 100644 index ac137322d2b..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.svg deleted file mode 100644 index 5a5fb2b7281..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_node_tree_local.svg +++ /dev/null @@ -1,446 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 7.81e-08 - - - - 1.56e-07 - - - - 2.34e-07 - - - - 3.13e-07 - - - - 3.91e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - splay_tree_map - - - - - - - - - n_map - - - - - - - - - rb_tree_map - - - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.pdf b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.pdf deleted file mode 100644 index 57630241743..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.png b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.png deleted file mode 100644 index 6967044ceeb..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.svg b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.svg deleted file mode 100644 index 137ce0a69c8..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_pat_trie_local.svg +++ /dev/null @@ -1,255 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 8.32e-08 - - - - 1.66e-07 - - - - 2.50e-07 - - - - 3.33e-07 - - - - 4.16e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - pat_trie_map - - - - - - - - - n_map - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.pdf b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.pdf deleted file mode 100644 index 8b649d61ac5..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.png b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.png deleted file mode 100644 index 6da29328dd2..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.svg b/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.svg deleted file mode 100644 index c4cda79fbbf..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_tree_text_insert_timing_test_vector_tree_local.svg +++ /dev/null @@ -1,277 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 4.53e-07 - - - - 9.07e-07 - - - - 1.36e-06 - - - - 1.81e-06 - - - - 2.27e-06 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ov_tree_map - - - - - - - - - n_map - - - - diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.pdf b/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.pdf deleted file mode 100644 index 2d196155db6..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.pdf and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.png b/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.png deleted file mode 100644 index 9959143a2b3..00000000000 Binary files a/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.png and /dev/null differ diff --git a/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.svg b/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.svg deleted file mode 100644 index b6f98f41bbd..00000000000 --- a/libstdc++-v3/doc/xml/images/pbds_tree_text_lor_find_timing_test_local.svg +++ /dev/null @@ -1,505 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 0 - - - - 200 - - - - 400 - - - - 600 - - - - 800 - - - - 1000 - - - - 1200 - - - - 1400 - - - - 1600 - - - - 1800 - - - - 2000 - - - - 2200 - - - - 2400 - - - Size - - - - - 0.00e+00 - - - - 4.44e-08 - - - - 8.89e-08 - - - - 1.33e-07 - - - - 1.78e-07 - - - - 2.22e-07 - - - Average time (sec.) - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - ov_tree_map - - - - - - - - - rb_tree_map - - - - - - - - - n_map - - - - - - - - - splay_tree_map - - - - - - diff --git a/libstdc++-v3/doc/xml/manual/locale.xml b/libstdc++-v3/doc/xml/manual/locale.xml index 4dabea41f47..9e3197647d8 100644 --- a/libstdc++-v3/doc/xml/manual/locale.xml +++ b/libstdc++-v3/doc/xml/manual/locale.xml @@ -562,11 +562,12 @@ global locale" (emphasis Paolo), that is: - - - + + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://www.opengroup.org/austin/"> System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) - </citetitle> + </link> + 2008 diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml index 07ae2289aca..4ecb933a0e5 100644 --- a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml @@ -1196,10 +1196,9 @@ results in compilation, execution, or both. - Further dependencies are necessary to create the visual output for the - performance tests. To create these graphs, two additional packages - will be needed: pychart and Beautiful - Soup. + Further dependencies are necessary to create the visual output + for the performance tests. To create these graphs, an + additional package is needed: pychart. diff --git a/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml index d03e594f93b..2cad15ceea9 100644 --- a/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml @@ -102,11 +102,11 @@ + fileref="../images/pbds_hash_text_find.pdf"/> + fileref="../images/pbds_hash_text_find.png"/> @@ -162,7 +162,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map + cc_hash_mod_prime_1div1_nsth_map @@ -208,7 +208,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div2_sth_map + cc_hash_mask_exp_1div2_sth_map @@ -256,7 +256,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map + cc_hash_mask_exp_1div1_nsth_map @@ -302,7 +302,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map + cc_hash_mask_exp_1div2_nsth_map @@ -429,11 +429,11 @@ + fileref="../images/pbds_cc_hash_int_find.pdf"/> + fileref="../images/pbds_cc_hash_int_find.png"/> @@ -489,7 +489,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map + cc_hash_mod_prime_1div1_nsth_map @@ -535,7 +535,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map + cc_hash_mod_prime_1div2_nsth_map @@ -583,7 +583,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map + cc_hash_mask_exp_1div1_nsth_map @@ -629,7 +629,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map + cc_hash_mask_exp_1div2_nsth_map @@ -690,11 +690,11 @@ + fileref="../images/pbds_gp_hash_int_find.pdf"/> + fileref="../images/pbds_gp_hash_int_find.png"/> @@ -750,7 +750,7 @@ - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map + gp_hash_mod_quadp_prime_1div2_nsth_map @@ -806,7 +806,7 @@ - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map + gp_hash_mask_linp_exp_1div2_nsth_map @@ -949,11 +949,11 @@ + fileref="../images/pbds_cc_hash_int_subscript_find.pdf"/> + fileref="../images/pbds_cc_hash_int_subscript_find.png"/> @@ -1008,7 +1008,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map + cc_hash_mod_prime_1div1_nsth_map @@ -1054,7 +1054,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map + cc_hash_mod_prime_1div2_nsth_map @@ -1100,7 +1100,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map + cc_hash_mask_exp_1div1_nsth_map @@ -1146,7 +1146,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map + cc_hash_mask_exp_1div2_nsth_map @@ -1208,11 +1208,11 @@ + fileref="../images/pbds_gp_hash_int_subscript_find.pdf"/> + fileref="../images/pbds_gp_hash_int_subscript_find.png"/> @@ -1268,7 +1268,7 @@ - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map + gp_hash_mod_quadp_prime_1div2_nsth_map @@ -1324,7 +1324,7 @@ - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map + gp_hash_mask_linp_exp_1div2_nsth_map @@ -1448,11 +1448,11 @@ + fileref="../images/pbds_cc_hash_int_subscript_insert.pdf"/> + fileref="../images/pbds_cc_hash_int_subscript_insert.png"/> @@ -1507,7 +1507,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map + cc_hash_mod_prime_1div1_nsth_map @@ -1553,7 +1553,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map + cc_hash_mod_prime_1div2_nsth_map @@ -1599,7 +1599,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map + cc_hash_mask_exp_1div1_nsth_map @@ -1645,7 +1645,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map + cc_hash_mask_exp_1div2_nsth_map @@ -1707,11 +1707,11 @@ + fileref="../images/pbds_gp_hash_int_subscript_insert.pdf"/> + fileref="../images/pbds_gp_hash_int_subscript_insert.png"/> @@ -1767,7 +1767,7 @@ - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map + gp_hash_mod_quadp_prime_1div2_nsth_map @@ -1823,7 +1823,7 @@ - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map + gp_hash_mask_linp_exp_1div2_nsth_map @@ -1979,11 +1979,11 @@ + fileref="../images/pbds_hash_zlob_int_find.pdf"/> + fileref="../images/pbds_hash_zlob_int_find.png"/> @@ -2039,7 +2039,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map + cc_hash_mod_prime_1div1_nsth_map @@ -2085,7 +2085,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map + cc_hash_mask_exp_1div1_nsth_map @@ -2133,7 +2133,7 @@ - gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map + gp_hash_mod_quadp_prime_1div2_nsth_map @@ -2278,11 +2278,11 @@ + fileref="../images/pbds_hash_int_erase_mem.pdf"/> + fileref="../images/pbds_hash_int_erase_mem.png"/> @@ -2338,7 +2338,7 @@ - cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map + cc_hash_mod_prime_1div1_nsth_map @@ -2384,7 +2384,7 @@ - cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map + cc_hash_mask_exp_1div2_nsth_map @@ -2432,7 +2432,7 @@ - gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_set + gp_hash_mask_linp_exp_1div2_nsth_set @@ -2564,11 +2564,11 @@ + fileref="../images/pbds_tree_text_insert_node.pdf"/> + fileref="../images/pbds_tree_text_insert_node.png"/> @@ -2683,11 +2683,11 @@ + fileref="../images/pbds_tree_text_insert_vector.pdf"/> + fileref="../images/pbds_tree_text_insert_vector.png"/> @@ -2775,11 +2775,11 @@ + fileref="../images/pbds_tree_text_insert_trie.pdf"/> + fileref="../images/pbds_tree_text_insert_trie.png"/> @@ -2937,11 +2937,11 @@ + fileref="../images/pbds_tree_text_find.pdf"/> + fileref="../images/pbds_tree_text_find.png"/> @@ -3209,11 +3209,11 @@ + fileref="../images/pbds_tree_text_lor_find.pdf"/> + fileref="../images/pbds_tree_text_lor_find.png"/> @@ -3452,11 +3452,11 @@ + fileref="../images/pbds_tree_split_join.pdf"/> + fileref="../images/pbds_tree_split_join.png"/> @@ -3712,11 +3712,11 @@ + fileref="../images/pbds_tree_order_statistics.pdf"/> + fileref="../images/pbds_tree_order_statistics.png"/> @@ -3909,11 +3909,11 @@ + fileref="../images/pbds_multimap_text_find_small_s2p_tree.png"/> + fileref="../images/pbds_multimap_text_find_small_s2p_tree.pdf"/> @@ -4013,7 +4013,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -4095,11 +4095,11 @@ + fileref="../images/pbds_multimap_text_find_small_s2p_hash.png"/> + fileref="../images/pbds_multimap_text_find_small_s2p_hash.pdf"/> @@ -4217,7 +4217,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -4374,11 +4374,11 @@ + fileref="../images/pbds_multimap_text_find_large_s2p_tree.png"/> + fileref="../images/pbds_multimap_text_find_large_s2p_tree.pdf"/> @@ -4478,7 +4478,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -4560,11 +4560,11 @@ + fileref="../images/pbds_multimap_text_find_large_s2p_hash.png"/> + fileref="../images/pbds_multimap_text_find_large_s2p_hash.pdf"/> @@ -4682,7 +4682,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -4843,11 +4843,11 @@ + fileref="../images/pbds_multimap_text_insert_small_s2p_tree.png"/> + fileref="../images/pbds_multimap_text_insert_small_s2p_tree.pdf"/> @@ -4947,7 +4947,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -5029,11 +5029,11 @@ + fileref="../images/pbds_multimap_text_find_small_s2p_hash.png"/> + fileref="../images/pbds_multimap_text_find_small_s2p_hash.pdf"/> @@ -5151,7 +5151,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -5312,11 +5312,11 @@ + fileref="../images/pbds_multimap_text_insert_large_s2p_tree.png"/> + fileref="../images/pbds_multimap_text_insert_large_s2p_tree.pdf"/> @@ -5416,7 +5416,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -5498,11 +5498,11 @@ + fileref="../images/pbds_multimap_text_find_large_s2p_hash.png"/> + fileref="../images/pbds_multimap_text_find_large_s2p_hash.pdf"/> @@ -5620,7 +5620,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -5775,11 +5775,11 @@ + fileref="../images/pbds_multimap_text_insert_mem_small_s2p_tree.png"/> + fileref="../images/pbds_multimap_text_insert_mem_small_s2p_tree.pdf"/> @@ -5879,7 +5879,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -5961,11 +5961,11 @@ + fileref="../images/pbds_multimap_text_find_large_s2p_hash.png"/> + fileref="../images/pbds_multimap_text_find_large_s2p_hash.pdf"/> @@ -6083,7 +6083,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -6237,11 +6237,11 @@ + fileref="../images/pbds_multimap_text_insert_mem_large_s2p_tree.png"/> + fileref="../images/pbds_multimap_text_insert_mem_large_s2p_tree.pdf"/> @@ -6341,7 +6341,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -6423,11 +6423,11 @@ + fileref="../images/pbds_multimap_text_find_large_s2p_hash.png"/> + fileref="../images/pbds_multimap_text_find_large_s2p_hash.pdf"/> @@ -6545,7 +6545,7 @@ - rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set + rb_tree_mmap_cc_hash_mask_exp_1div2_nsth_set @@ -6706,11 +6706,11 @@ + fileref="../images/pbds_priority_queue_text_push.pdf"/> + fileref="../images/pbds_priority_queue_text_push.png"/> @@ -6894,11 +6894,11 @@ + fileref="../images/pbds_pairing_priority_queue_text_push.pdf"/> + fileref="../images/pbds_pairing_priority_queue_text_push.png"/> @@ -7093,11 +7093,11 @@ + fileref="../images/pbds_priority_queue_text_push_pop.pdf"/> + fileref="../images/pbds_priority_queue_text_push_pop.png"/> @@ -7281,11 +7281,11 @@ + fileref="../images/pbds_pairing_priority_queue_text_push_pop.pdf"/> + fileref="../images/pbds_pairing_priority_queue_text_push_pop.png"/> @@ -7460,11 +7460,11 @@ + fileref="../images/pbds_priority_queue_int_push.pdf"/> + fileref="../images/pbds_priority_queue_int_push.png"/> @@ -7648,11 +7648,11 @@ + fileref="../images/pbds_binary_priority_queue_int_push.pdf"/> + fileref="../images/pbds_binary_priority_queue_int_push.png"/> @@ -7812,11 +7812,11 @@ + fileref="../images/pbds_priority_queue_int_push_pop.pdf"/> + fileref="../images/pbds_priority_queue_int_push_pop.png"/> @@ -8077,11 +8077,11 @@ + fileref="../images/pbds_priority_queue_text_pop_mem.pdf"/> + fileref="../images/pbds_priority_queue_text_pop_mem.png"/> @@ -8329,11 +8329,11 @@ + fileref="../images/pbds_priority_queue_text_join.pdf"/> + fileref="../images/pbds_priority_queue_text_join.png"/> @@ -8588,11 +8588,11 @@ + fileref="../images/pbds_priority_queue_text_modify_up.pdf"/> + fileref="../images/pbds_priority_queue_text_modify_up.png"/> @@ -8776,11 +8776,11 @@ + fileref="../images/pbds_pairing_priority_queue_text_modify_up_thin.pdf"/> + fileref="../images/pbds_pairing_priority_queue_text_modify_up_thin.png"/> @@ -8950,11 +8950,11 @@ + fileref="../images/pbds_priority_queue_text_modify_down.pdf"/> + fileref="../images/pbds_priority_queue_text_modify_down.png"/> @@ -9138,11 +9138,11 @@ + fileref="../images/pbds_pairing_priority_queue_text_modify_down_thin.pdf"/> + fileref="../images/pbds_pairing_priority_queue_text_modify_down_thin.png"/> diff --git a/libstdc++-v3/scripts/make_graph.py b/libstdc++-v3/scripts/make_graph.py index 88b8d38fdf8..8daba6ecc68 100755 --- a/libstdc++-v3/scripts/make_graph.py +++ b/libstdc++-v3/scripts/make_graph.py @@ -3,9 +3,6 @@ import string import sys import re -import os -import platform -import commands from Numeric import * from pychart import * from xml.dom import minidom @@ -14,22 +11,6 @@ class exception: pass -def comp_platform_info(compiler): - ret = '
    \n' - so = commands.getstatusoutput('cat /proc/cpuinfo | grep \'cpu MHz\'') - if so[0] == 0: - ret += '
  • CPU speed - %s
    • \n' % so[1] - so = commands.getstatusoutput('cat /proc/meminfo | grep \'MemTotal\'') - if so[0] == 0: - ret += '
  • Memory - %s
    • \n' % so[1] - ret += '
  • Platform - %s
    • \n' % platform.platform() - so = commands.getstatusoutput(compiler + ' --version') - if so[0] == 0: - ret += '
  • Compiler - %s
    • \n' % so[1] - ret += '
\n' - return ret - - class res: """ A 'structure' representing the results of a test. @@ -85,7 +66,7 @@ class res_getter: label = string.strip(label) return label - def __parse_res_sets(self, f_name, cntnr_list): + def __parse_result_sets(self, f_name, cntnr_list): tst_dat = minidom.parse(f_name) x_label = self.__get_label(tst_dat, 'x_name') y_label = self.__get_label(tst_dat, 'y_name') @@ -112,7 +93,7 @@ class res_getter: def get(self, res_dir, test_name): cntnr_list = self.__test_to_container_res_sets[test_name] f_name = res_dir + '/' + self.__test_to_f_names[test_name] - parsed = self.__parse_res_sets(f_name, cntnr_list) + parsed = self.__parse_result_sets(f_name, cntnr_list) x_label = parsed[0] y_label = parsed[1] cntnr_descs = parsed[2] @@ -121,18 +102,18 @@ class res_getter: return res(x_label, y_label, cntnr_list, cntnr_descs, res_sets) -class png_maker: +class image_maker: """ - This class creates a png file from a result set. + This class creates a svg file from a result set. """ class __style_chooser: def __init__(self): self.native_re = re.compile(r'n_(?:.*?)') - self.native_tick_mark_0 = tick_mark.Circle(size = 4) - self.native_tick_mark_1 = tick_mark.Square(size = 4) - self.native_line_style_0 = line_style.T(color = color.black, width=2) - self.native_line_style_1 = line_style.T(color = color.black, width=2) + self.native_tick_mark_0 = tick_mark.blackdtri + self.native_tick_mark_1 = tick_mark.blackdia + self.native_line_style_0 = line_style.gray50_dash1 + self.native_line_style_1 = line_style.gray50_dash2 self.mask_re = re.compile(r'mask(?:.*?)') self.mod_re = re.compile(r'mod(?:.*?)') @@ -186,8 +167,8 @@ class png_maker: sys.stderr.write(cntnr + '\n') raise exception - # mask / mod - if cntnr.find('lc_1div8_1div') <> -1: + # mask / mod + if cntnr.find('lc_1div8_1div') <> -1: if cntnr.find('mask') <> -1: # mask if self.lc_1div8_1div2_re.search(cntnr): @@ -198,24 +179,24 @@ class png_maker: if self.lc_1div8_1div1_re.search(cntnr): if cntnr.find('nsth') <> -1: tm = tick_mark.dia - else: + else: tm = tick_mark.circle3 - else: - # mod + else: + # mod if self.lc_1div8_1div2_re.search(cntnr): if cntnr.find('nsth') <> -1: tm = tick_mark.tri else: - tm = tick_mark.square + tm = tick_mark.square if self.lc_1div8_1div1_re.search(cntnr): if cntnr.find('nsth') <> -1: - tm = tick_mark.dtri - else: - tm = tick_mark.star + tm = tick_mark.dtri + else: + tm = tick_mark.star if self.mcolc_1div2_re.search(cntnr): tm = tick_mark.circle3 - + return (tm, line_style.T(color = clr, width = 2)) @@ -227,356 +208,107 @@ class png_maker: return self.__mmap_re.sub('\nmmap_\n', cntnr) def make(self, res, of_name): + print of_name + + # theme settings + theme.debug_level = 3 theme.output_format = 'svg' - theme.output_file = of_name theme.scale_factor = 2 - theme.default_font_family = "Gill Sans Std" theme.default_line_width = 0.5 - theme.default_font_size = 7 + theme.default_font_size = 8 theme.use_color = 1 theme.reinitialize() + + # canvas settings + f = file(of_name, "w") + can = canvas.init(f, "svg") + + # axes y_tick_interval = self.__get_y_tics(res) -# xaxis = axis.X(format = '/a90/hL%d', - xaxis = axis.X(format = "/a-50{}%d", + xaxis = axis.X(format = "/6/i/a-90{}%d", tic_interval = 200, - label = res.x_label) -# yaxis = axis.Y(format = '%.2e', - yaxis = axis.Y(format = "/a-50{}%.2e", - tic_interval = y_tick_interval, - label = res.y_label) + label = res.x_label, label_offset = (0, -20)) + yaxis = axis.Y(format = "/6/i/a0{}%.2e", + tic_interval = y_tick_interval, tic_label_offset = (-25, 0), + label = res.y_label, label_offset = (-15, 0)) + + # legend legend_lines = len(res.cntnr_list) - legend_vloc = 50 + (legend_lines * 10) + legend_vloc = 80 + (legend_lines * 10) legend_hloc = -0 - ar = area.T(x_axis = xaxis, y_axis = yaxis, - legend = legend.T(loc=(legend_hloc,-legend_vloc), - frame_line_style=None, - inter_row_sep=2), - size=(240,110)) + lg = legend.T(loc=(legend_hloc,-legend_vloc), + frame_line_style = None, inter_row_sep = 2) + + # plot datasets + ar = area.T(x_axis = xaxis, y_axis = yaxis, legend = lg, size = (240,110), x_range = (0, 2200)) plot_list = [] for cntnr in res.cntnr_list: style = self.__sc.choose(cntnr) - print cntnr - pl = line_plot.T(label = self.__container_label_name(cntnr), - data = res.res_sets[cntnr], - tick_mark = style[0], - line_style = style[1]) + pl = line_plot.T(label = self.__container_label_name(cntnr), + data = res.res_sets[cntnr], + tick_mark = style[0], + line_style = style[1]) plot_list.append(pl) + for plot in plot_list: ar.add_plot(plot) - ar.draw() + # render image + ar.draw(can) + can.close() - def __get_y_tics(self, res): + + def __get_y_max_min(self, res): mx = 0 + nx = 0 for cntnr in res.cntnr_list: m = max(d[1] for d in res.res_sets[cntnr]) mx = max(m, mx) - return mx / 5 - - - -def make_tt(s): - return '' + s + '' - -def make_b(s): - return '' + s + '' - -def make_ttb(s): - return '' + s + '' - -def make_i(s): - return '' + s + '' - -def make_pb_ds_class_href(c_name): - return '' + make_tt(c_name) + '\n' - -def build_value_to_pb_ds_class_href(s_desc): - value = s_desc.attributes['value'].value - ret = make_pb_ds_class_href(value) - return ret - -class hash_desc_to_html_builder: - def build_specific_comb_hash_fn(self, s_desc): - comb_hash_fn_desc = s_desc.getElementsByTagName('Comb_Hash_Fn')[0] - ret = make_tt('Comb_Hash_Fn') - ret = ret + ' = ' - ret = ret + build_value_to_pb_ds_class_href(comb_hash_fn_desc) - return ret - - def __build_nom_denom(self, s_desc): - nom_denom = s_desc.attributes['nom'].value + '/' + s_desc.attributes['denom'].value - return make_i(nom_denom) - - def __build_lc_trigger_desc(self, s_desc): - ret = build_value_to_pb_ds_class_href(s_desc) - ret = ret + ' with ' + make_i('αmin') - ret = ret + ' = ' + self.__build_nom_denom(s_desc.getElementsByTagName('alpha_min')[0]) - ret = ret + ' and ' + make_i('αmax') - ret = ret + ' = ' + self.__build_nom_denom(s_desc.getElementsByTagName('alpha_max')[0]) - return ret - - def build_specific_resize_policy(self, s_desc): - ret = make_tt('Resize_Policy') - ret = ret + ' = ' - resize_policy_desc = s_desc.getElementsByTagName('Resize_Policy')[0] - ret = ret + build_value_to_pb_ds_class_href(resize_policy_desc) - ret = ret + ' with ' + make_tt('Size_Policy') - ret = ret + ' = ' - size_policy_desc = resize_policy_desc.getElementsByTagName('Size_Policy')[0] - ret = ret + build_value_to_pb_ds_class_href(size_policy_desc) - ret = ret + ', and ' + make_tt('Trigger_Policy') - ret = ret + ' = ' - trigger_policy_desc = resize_policy_desc.getElementsByTagName('Trigger_Policy')[0] - if trigger_policy_desc.attributes['value'].value == 'hash_load_check_resize_trigger': - ret = ret + self.__build_lc_trigger_desc(trigger_policy_desc) - else: - raise exception - return ret - - -class cc_hash_desc_to_html_builder: - def __init__(self): - self.__hash_builder = hash_desc_to_html_builder() - - def build(self, s_desc): - ret = build_value_to_pb_ds_class_href(s_desc) - ret = ret + 'with ' + self.__hash_builder.build_specific_comb_hash_fn(s_desc) - ret = ret + ', and ' + self.__hash_builder.build_specific_resize_policy(s_desc) - return ret + n = min(d[1] for d in res.res_sets[cntnr]) + nx = min(n, nx) + return (mx, nx) + def __get_x_max_min(self, res): + mx = 0 + nx = 0 + for cntnr in res.cntnr_list: + m = max(d[0] for d in res.res_sets[cntnr]) + mx = max(m, mx) + n = min(d[0] for d in res.res_sets[cntnr]) + nx = min(n, nx) + return (mx, nx) -class gp_hash_desc_to_html_builder: - def __init__(self): - self.__hash_builder = hash_desc_to_html_builder() - - def build(self, s_desc): - ret = build_value_to_pb_ds_class_href(s_desc) - ret = ret + ' with ' + self.__hash_builder.build_specific_comb_hash_fn(s_desc) - ret = ret + ', ' + self.__hash_builder.build_specific_resize_policy(s_desc) - ret = ret + ', and ' + make_tt('Probe_Fn') - ret = ret + ' = ' - probe_fn = s_desc.getElementsByTagName('Probe_Fn')[0].attributes['value'].value - ret = ret + make_pb_ds_class_href(probe_fn) - return ret - - -class basic_tree_like_desc_to_html_builder: - def build_tag(self, s_desc): - ret = make_tt('Tag') - ret = ret + ' = ' - tag_desc = s_desc.getElementsByTagName('Tag')[0] - ret = ret + build_value_to_pb_ds_class_href(tag_desc) - return ret - - def build_node_update(self, s_desc): - ret = make_tt('Node_Update') - ret = ret + ' = ' - node_update_desc = s_desc.getElementsByTagName('Node_Update')[0] - ret = ret + build_value_to_pb_ds_class_href(node_update_desc) - return ret - - -class basic_tree_desc_to_html_builder: - def __init__(self): - self.__tree_like_builder = basic_tree_like_desc_to_html_builder() + def __get_y_tics(self, res): + mx = 0 + for cntnr in res.cntnr_list: + m = max(d[1] for d in res.res_sets[cntnr]) + mx = max(m, mx) + return mx / 5 - def build(self, s_desc): - ret = build_value_to_pb_ds_class_href(s_desc) - ret = ret + ' with ' + self.__tree_like_builder.build_tag(s_desc) - ret = ret + ', and ' + self.__tree_like_builder.build_node_update(s_desc) - return ret +def main(test_infos_f_name, res_dir, doc_dir): + xmls_dat = minidom.parse(test_infos_f_name) + for test in xmls_dat.getElementsByTagName('test'): -class basic_trie_desc_to_html_builder: - def __init__(self): - self.__tree_like_builder = basic_tree_like_desc_to_html_builder() - - def build(self, s_desc): - ret = build_value_to_pb_ds_class_href(s_desc) - ret = ret + ' with ' + self.__tree_like_builder.build_tag(s_desc) - ret = ret + ', and ' + self.__tree_like_builder.build_node_update(s_desc) - return ret - -class lu_desc_to_html_builder: - def build(self, s_desc): - ret = build_value_to_pb_ds_class_href(s_desc) - ret = ret + ' with ' + make_tt('Update_Policy') - ret = ret + ' = ' - update_policy_desc = s_desc.getElementsByTagName('Update_Policy')[0] - ret = ret + build_value_to_pb_ds_class_href(update_policy_desc) - return ret - - -class std_desc_to_html_builder: - def build(self, s_desc): - value = s_desc.attributes['value'].value - return make_tt(value.replace('std_', 'std::')) - - -class std_tr1_desc_to_html_builder: - def build(self, s_desc): - value = s_desc.attributes['value'].value - ret = make_tt(value.replace('std_tr1_', 'std::tr1::')) - ret = ret + ' with ' + make_tt('cache_hash_code') - ret = ret + ' = ' - cache_hash_code = s_desc.getElementsByTagName('cache_hash_code')[0].attributes['value'].value - ret = ret + make_ttb(cache_hash_code) - return ret - -class gnucxx_desc_to_html_builder: - def build(self, s_desc): - value = s_desc.attributes['value'].value - return make_tt(value.replace('__gnucxx_', '__gnucxx::')) - -class stdext_desc_to_html_builder: - def build(self, s_desc): - value = s_desc.attributes['value'].value - return make_tt(value.replace('stdext_', 'stdext::')) - -class npq_desc_to_html_builder: - def build(self, vector): - if vector: - under = make_tt('std::vector') - else: - under = make_tt('std::deque') - - return make_tt('std::priority_queue') + ' adapting ' + under - -class binary_heap_desc_to_html_builder: - def build(self, s_desc): - ret = make_pb_ds_class_href('priority_queue') - ret = ret + ' with ' + make_tt('Tag') - ret = ret + ' = ' + make_pb_ds_class_href('binary_heap_tag') - return ret - -class thin_heap_desc_to_html_builder: - def build(self, s_desc): - ret = make_pb_ds_class_href('priority_queue') - ret = ret + ' with ' + make_tt('Tag') - ret = ret + ' = ' + make_pb_ds_class_href('thin_heap_tag') - return ret - -class binomial_heap_desc_to_html_builder: - def build(self, s_desc): - ret = make_pb_ds_class_href('priority_queue') - ret = ret + ' with ' + make_tt('Tag') - ret = ret + ' = ' + make_pb_ds_class_href('binomial_heap_tag') - return ret - -class rc_binomial_heap_desc_to_html_builder: - def build(self, s_desc): - ret = make_pb_ds_class_href('priority_queue') - ret = ret + ' with ' + make_tt('Tag') - ret = ret + ' = ' + make_pb_ds_class_href('rc_binomial_heap_tag') - return ret - -class pairing_heap_desc_to_html_builder: - def build(self, s_desc): - ret = make_pb_ds_class_href('priority_queue') - ret = ret + ' with ' + make_tt('Tag') - ret = ret + ' = ' + make_pb_ds_class_href('pairing_heap_tag') - return ret - -class legend_desc_builder: - """ - Returns a string corresponding to a specific container type. - """ - def __init__(self): - self.__cc_hash_builder = cc_hash_desc_to_html_builder() - self.__gp_hash_builder = gp_hash_desc_to_html_builder() - self.__basic_tree_builder = basic_tree_desc_to_html_builder() - self.__basic_trie_builder = basic_trie_desc_to_html_builder() - self.__lu_builder = lu_desc_to_html_builder() - self.__std_builder = std_desc_to_html_builder() - self.__std_tr1_builder = std_tr1_desc_to_html_builder() - self.__gnucxx_builder = gnucxx_desc_to_html_builder() - self.__stdext_builder = stdext_desc_to_html_builder() - self.__npq_builder = npq_desc_to_html_builder() - self.__thin_heap_builder = thin_heap_desc_to_html_builder() - self.__thin_heap_builder = thin_heap_desc_to_html_builder() - self.__binary_heap_builder = binary_heap_desc_to_html_builder() - self.__binomial_heap_builder = binomial_heap_desc_to_html_builder() - self.__rc_binomial_heap_builder = rc_binomial_heap_desc_to_html_builder() - self.__pairing_heap_builder = pairing_heap_desc_to_html_builder() - - def __build_specific(self, s_desc): - type = s_desc.attributes['value'].value - - if type == 'thin_heap': - return self.__thin_heap_builder.build(s_desc) - if type == 'binary_heap': - return self.__binary_heap_builder.build(s_desc) - if type == 'binomial_heap': - return self.__binomial_heap_builder.build(s_desc) - if type == 'rc_binomial_heap': - return self.__rc_binomial_heap_builder.build(s_desc) - if type == 'pairing_heap': - return self.__pairing_heap_builder.build(s_desc) - if type == 'cc_hash_table': - ret = self.__cc_hash_builder.build(s_desc) - elif type == 'gp_hash_table': - ret = self.__gp_hash_builder.build(s_desc) - elif type == 'tree': - ret = self.__basic_tree_builder.build(s_desc) - elif type == 'trie': - ret = self.__basic_trie_builder.build(s_desc) - elif type == 'list_update': - ret = self.__lu_builder.build(s_desc) - elif type == 'std::priority_queue_vector': - return self.__npq_builder.build(True) - elif type == 'std::priority_queue_deque': - return self.__npq_builder.build(False) - elif type == 'std_set' or type == 'std_map' or type == 'std_multimap': - return self.__std_builder.build(s_desc) - elif type == 'std_tr1_unordered_set' or type == 'std_tr1_unordered_map': - return self.__std_tr1_builder.build(s_desc) - elif type == 'stdext_hash_set' or type == 'stdext_hash_map' or type == 'stdext_hash_multimap': - return self.__stdext_builder.build(s_desc) - elif type == '__gnucxx_hash_set' or type == '__gnucxx_hash_map' or type == '__gnucxx_hash_multimap': - return self.__gnucxx_builder.build(s_desc) - else: - sys.stderr.write('cannot recognize %s\n' % type) - raise exception - return ret - - - def build(self, desc): - s_descs = desc.getElementsByTagName('type') - if s_descs.length == 0: - print desc.toxml() - raise exception - ret = '' - count = 0 - for s_desc in s_descs: - if count > 0: - ret = ret + ', mapping each key to ' - ret = ret + self.__build_specific(s_desc) - count = count + 1 - return ret - - -def main(doc_dir, res_dir, test_infos_f_name, test_name, build_name): - res_gtr = res_getter(test_infos_f_name) - res = res_gtr.get(res_dir, test_name) - png_mkr = png_maker() -# png_of_name = doc_dir + '/' + test_name + '_' + build_name + '.png' - png_of_name = doc_dir + '/' + test_name + '_' + build_name + '.svg' - print png_of_name - png_mkr.make(res, png_of_name) + # parse results + test_name = test.attributes['name'].value + res_gtr = res_getter(test_infos_f_name) + res = res_gtr.get(res_dir, test_name) + # generate image + image_mkr = image_maker() + svg_of_name = doc_dir + '/pbds_' + test_name + '.svg' + image_mkr.make(res, svg_of_name) if __name__ == "__main__": """ - This module takes 6 parameters from the command line: - Docs directory - Results directory + This module takes 3 parameters from the command line: Tests info XML file name - Test name - Build name - Compiler name + Test results directory + Image output directory """ - usg = "make_graph.py \n" - if len(sys.argv) != 6: + usg = "make_graph.py \n" + if len(sys.argv) != 4: sys.stderr.write(usg) raise exception - main(sys.argv[1], sys.argv[2], sys.argv[3], sys.argv[4], sys.argv[5]) + main(sys.argv[1], sys.argv[2], sys.argv[3]) diff --git a/libstdc++-v3/scripts/make_graphs.py b/libstdc++-v3/scripts/make_graphs.py deleted file mode 100755 index e230e7a9983..00000000000 --- a/libstdc++-v3/scripts/make_graphs.py +++ /dev/null @@ -1,160 +0,0 @@ -#!/usr/bin/python - -import sys -import commands -import re -from xml.dom import minidom -from BeautifulSoup import BeautifulSoup -import make_graph - -class exception: - pass - -res_div_re = re.compile('(.*?)_res_div') -settings_div_re = re.compile('(.*?)_settings_div') - - -gray_border_div_str = '
' -space_div_str = '
' - - - -def logical_build_from_build(build): - if build == 'gcc': - return 'g++' - if build == 'msvc': - return 'msvc++' - if build == 'local': - return 'local' - sys.stderr.write(build) - raise exception - - -def img_title_from_origs(label, title, base_build_ref, build_name, logical_build_name): - title = title.replace('_tt_', '') - title = title.replace('_455tt_', '') - title = title.replace('_b_', '') - title = title.replace('_455b_', '') - title = title.replace('_456', ',') - title = title.replace('_457', '[]') - title = title.replace('_', ' ') - return '%s: %s - %s' % ( - label, - title, - base_build_ref, - build_name, - logical_build_name) - - -def make_png(src_dir, doc_dir, res_dir, tests_info_xml_f_name, build_name, test_name): - cmd_str = '%s/scripts/make_graph.py %s %s %s %s %s' % ( - src_dir, doc_dir, - res_dir, - tests_info_xml_f_name, - test_name, - build_name) - # Must start a new process for pychart - otherwise pngs overlap. - so = commands.getstatusoutput(cmd_str) - if(so[0] != 0): - sys.stderr.write(cmd_str + '\n') - sys.stderr.write(so[1] + '\n') - sys.exit(-1) - - -def make_png_str(label, test_name, build): - ret = '
' - ret += '' % (label, label) - ret += ' - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/libstdc++-v3/testsuite/data/make_graph_test_infos.xml b/libstdc++-v3/testsuite/data/make_graph_test_infos.xml index 0c2da1b3099..66e9fc54cfc 100644 --- a/libstdc++-v3/testsuite/data/make_graph_test_infos.xml +++ b/libstdc++-v3/testsuite/data/make_graph_test_infos.xml @@ -1,128 +1,128 @@ - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + @@ -131,14 +131,14 @@ - - + + - - + + @@ -147,15 +147,15 @@ - - + + - - + + @@ -164,15 +164,15 @@ - - + + - - + + @@ -181,14 +181,14 @@ - - + + - - + + @@ -197,8 +197,8 @@ - - + + @@ -207,18 +207,18 @@ - - + + - - + + - - + + @@ -227,8 +227,8 @@ - - + + @@ -237,74 +237,74 @@ - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_find.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_find.cc new file mode 100644 index 00000000000..cdf15105113 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_find.cc @@ -0,0 +1,126 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 random_int_find_timing_test.cpp + * Contains test for finding random integers. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector< std::pair< int, char> > vec_t; + vec_t a_v(vm); + twister_rand_gen g; + for (size_t i = 0; i < vm; ++i) + a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); + vec_t::const_iterator b = a_v.begin(); + + typedef find_test< vec_t::const_iterator> test_t; + test_t tst(b, b, vn, vs, vm, vn, vs, vm); + { + typedef native_hash_map< int, char> native_t; + tst(native_t()); + } + + { + typedef native_map< int, char> native_t; + tst(native_t()); + } + + { + typedef hash_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef tree_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: hash_random_int_find_timing_test " << + endl << endl; + + cerr << + "This test checks the performance of various associative containers " + "using their find method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of random integers " << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Performs a sequence of find operations. At each iteration, " + "it finds, for each integer in the vector, its entry in the " + "container, using the find method"; + cerr << "* Repeats the above test a number of times" << endl; + + cerr << endl << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_subscript_find.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_subscript_find.cc new file mode 100644 index 00000000000..1680ff4ffcb --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_subscript_find.cc @@ -0,0 +1,126 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 random_int_subscript_find_timing_test.cpp + * Contains test for subscripting random integers. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + twister_rand_gen g; + for (size_t i = 0; i < vm; ++i) + a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); + vec_t::const_iterator b = a_v.begin(); + + typedef subscript_find_test test_t; + test_t tst(b, b, vn, vs, vm, vn, vs, vm); + { + typedef hash_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef tree_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_hash_map native_t; + tst(native_t()); + } + + { + typedef native_map< int, size_t> native_t; + tst(native_t()); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: hash_random_int_subscript_find_timing_test " << + endl << endl; + + cerr << + "This test checks the performance of various associative containers " + "using their find method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of random integers " << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Performs a sequence of find operations. At each iteration, " + "it finds, for each integer in the vector, its entry in the " + "container, using the subscript operator"; + cerr << "* Repeats the above test a number of times" << endl; + + cerr << endl << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_subscript_insert.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_subscript_insert.cc new file mode 100644 index 00000000000..07d644e4fec --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_int_subscript_insert.cc @@ -0,0 +1,123 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 random_int_subscript_insert_timing_test.cpp + * Contains test for subscripting random integers. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + twister_rand_gen g; + + for (size_t i = 0; i < vm; ++i) + a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); + vec_t::const_iterator b = a_v.begin(); + + typedef subscript_insert_test test_t; + test_t tst(b, b, vn, vs, vm, vn, vs, vm); + { + typedef hash_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef tree_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_hash_map< int, size_t> native_t; + tst(native_t()); + } + + { + typedef native_map< int, size_t> native_t; + tst(native_t()); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: hash_random_int_subscript_insert_timing_test " + << endl << endl; + + cerr << + "This test checks the performance of various associative containers " + "using their find method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of random integers " << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Repeats the above test a number of times" << endl; + + cerr << endl << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/all_text_find.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_text_find.cc new file mode 100644 index 00000000000..b997a5ee9cb --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/all_text_find.cc @@ -0,0 +1,145 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 text_find_timing_test.cpp + * Contains test for finding text. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +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; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + typedef std::vector > vec_t; + + vec_t a_v(vm); + text_populate(f_name, a_v); + typedef find_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, b, vn, vs, vm, vn, vs, vm); + { + typedef trie_common_types::performance_tl pat_trie_tl_t; + + typedef tree_common_types::performance_tl tree_tl_t; + + typedef hash_common_types::performance_tl hash_tl_t; + + typedef __gnu_cxx::typelist::append::type>::type tl_t; + + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_map native_map_t; + tst(native_map_t()); + +#ifdef PB_DS_USE_TR1 + typedef native_hash_map native_hash_map_t; + tst(native_hash_map_t()); + + typedef + native_hash_map< + std::string, + char, + 8, + string_hash_fn, + std::equal_to< + std::string>, + std::less< + std::string>, + std::allocator< + char>, + true> + sth_native_hash_map_t; + + tst(sth_native_hash_map_t()); +#endif + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: text_find_timing_test " << + endl << endl; + + cerr << + "This test checks the performance of various associative containers " + "using their find method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of text words " << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Performs a sequence of find operations. At each iteration, " + "it finds, for each word in the vector, its entry in the " + "container, using the find method" << endl; + cerr << "* Repeats the above test a number of times) " + << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_int_erase_mem.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_int_erase_mem.cc new file mode 100644 index 00000000000..f80c77b8a2e --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_int_erase_mem.cc @@ -0,0 +1,118 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009, 2011 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 +// 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 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 hash_random_int_erase_mem_usage_test.cpp + * Contains test for erasing random integers. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +struct int_hash : public std::unary_function +{ + inline int + operator()(int i) const + { return i; } +}; + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + try + { + xml_test_performance_formatter fmt("Size", "Memory (bytes)"); + + typedef std::vector vec_t; + vec_t a_v(vm); + twister_rand_gen g; + for (size_t i = 0; i < vm; ++i) + a_v[i] = static_cast(g.get_unsigned_long()); + + vec_t::const_iterator b = a_v.begin(); + erase_test tst(b, vn, vs, vm); + typedef __gnu_test::tracker_allocator alloc_t; + { + typedef hash_common_types, alloc_t>::performance_tl tl_t; + + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_hash_set, std::less, alloc_t> native_t; + + tst(native_t()); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: hash_random_int_erase_if_test " + << endl << endl; + + cerr << "This test checks the performance of various associative containers " + "using their erase method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of random integers " << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Erases all the elements, except one, from the constainer" + << endl << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc deleted file mode 100644 index f80c77b8a2e..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc +++ /dev/null @@ -1,118 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009, 2011 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 -// 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 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 hash_random_int_erase_mem_usage_test.cpp - * Contains test for erasing random integers. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -struct int_hash : public std::unary_function -{ - inline int - operator()(int i) const - { return i; } -}; - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - try - { - xml_test_performance_formatter fmt("Size", "Memory (bytes)"); - - typedef std::vector vec_t; - vec_t a_v(vm); - twister_rand_gen g; - for (size_t i = 0; i < vm; ++i) - a_v[i] = static_cast(g.get_unsigned_long()); - - vec_t::const_iterator b = a_v.begin(); - erase_test tst(b, vn, vs, vm); - typedef __gnu_test::tracker_allocator alloc_t; - { - typedef hash_common_types, alloc_t>::performance_tl tl_t; - - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_hash_set, std::less, alloc_t> native_t; - - tst(native_t()); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: hash_random_int_erase_if_test " - << endl << endl; - - cerr << "This test checks the performance of various associative containers " - "using their erase method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of random integers " << endl; - cerr << "* Inserts the elements into the container" << endl; - cerr << "* Erases all the elements, except one, from the constainer" - << endl << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_int_find.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_int_find.cc new file mode 100644 index 00000000000..82abb640bb0 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_int_find.cc @@ -0,0 +1,119 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 hash_zlob_random_int_find_timing_test.cpp + * Contains test for finding random integers. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + twister_rand_gen g; + + for (size_t i = 0; i < vm; ++i) + { + int k = static_cast(g.get_unsigned_long()); + a_v[i] = std::make_pair(k << 8, 0); + if ((a_v[i].first& 127) != 0) + throw std::logic_error("Fucked!"); + } + + vec_t::const_iterator b = a_v.begin(); + typedef find_test test_t; + test_t tst(b, b, vn, vs, vm, vn, vs, vm); + { + typedef native_hash_map native_t; + tst(native_t()); + } + + { + typedef hash_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: hash_zlob_random_int_find_timing_test " << + endl << endl; + + cerr << + "This test checks the performance of various associative containers " + "using their find method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of zero low-order bit random integers " << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Performs a sequence of find operations. At each iteration, " + "it finds, for each integer in the vector, its entry in the " + "container, using the find method"; + cerr << "* Repeats the above test a number of times" << endl; + + cerr << endl << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc deleted file mode 100644 index 82abb640bb0..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc +++ /dev/null @@ -1,119 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 hash_zlob_random_int_find_timing_test.cpp - * Contains test for finding random integers. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - twister_rand_gen g; - - for (size_t i = 0; i < vm; ++i) - { - int k = static_cast(g.get_unsigned_long()); - a_v[i] = std::make_pair(k << 8, 0); - if ((a_v[i].first& 127) != 0) - throw std::logic_error("Fucked!"); - } - - vec_t::const_iterator b = a_v.begin(); - typedef find_test test_t; - test_t tst(b, b, vn, vs, vm, vn, vs, vm); - { - typedef native_hash_map native_t; - tst(native_t()); - } - - { - typedef hash_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: hash_zlob_random_int_find_timing_test " << - endl << endl; - - cerr << - "This test checks the performance of various associative containers " - "using their find method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of zero low-order bit random integers " << endl; - cerr << "* Inserts the elements into the container" << endl; - cerr << "* Performs a sequence of find operations. At each iteration, " - "it finds, for each integer in the vector, its entry in the " - "container, using the find method"; - cerr << "* Repeats the above test a number of times" << endl; - - cerr << endl << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find.hpp new file mode 100644 index 00000000000..3b850840bf4 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find.hpp @@ -0,0 +1,137 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 multimap_text_find_timing_test.cpp + * Contains test for inserting text words. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +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 __gnu_pbds::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", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v_init(prm); + distinct_text_populate(f_name, a_v_init); + + 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(a_v_init[j].first, + static_cast(g.get_unsigned_long()))); + + vec_t::const_iterator b = a_v.begin(); + { + typedef mmap_tl_t >::type mmap_tl_tl; + mmap_tl_tl tl; + + typedef multimap_find_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_hash_multimap native_t; + typedef multimap_find_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + tst(native_t()); + } + + { + typedef native_multimap native_t; + typedef multimap_find_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + tst(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 " + << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_large.cc new file mode 100644 index 00000000000..68fd9792fbf --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_large.cc @@ -0,0 +1,41 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "multimap_text_find.hpp" + +void +set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) +{ + prm = 100; + n = 3; + s = 4; + m = 20; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_small.cc new file mode 100644 index 00000000000..113a01810d4 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_small.cc @@ -0,0 +1,42 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "multimap_text_find.hpp" + +void +set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) +{ + prm = 400; + n = 1; + s = 1; + m = 6; +} + diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp deleted file mode 100644 index 3b850840bf4..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp +++ /dev/null @@ -1,137 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 multimap_text_find_timing_test.cpp - * Contains test for inserting text words. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -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 __gnu_pbds::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", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v_init(prm); - distinct_text_populate(f_name, a_v_init); - - 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(a_v_init[j].first, - static_cast(g.get_unsigned_long()))); - - vec_t::const_iterator b = a_v.begin(); - { - typedef mmap_tl_t >::type mmap_tl_tl; - mmap_tl_tl tl; - - typedef multimap_find_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_hash_multimap native_t; - typedef multimap_find_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - tst(native_t()); - } - - { - typedef native_multimap native_t; - typedef multimap_find_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - tst(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 " - << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc deleted file mode 100644 index b4b2179e9df..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc +++ /dev/null @@ -1,41 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "multimap_text_find_timing.hpp" - -void -set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) -{ - prm = 100; - n = 3; - s = 4; - m = 20; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc deleted file mode 100644 index 75cfa8ed325..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc +++ /dev/null @@ -1,42 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "multimap_text_find_timing.hpp" - -void -set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) -{ - prm = 400; - n = 1; - s = 1; - m = 6; -} - diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert.hpp new file mode 100644 index 00000000000..79f08126341 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert.hpp @@ -0,0 +1,137 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 multimap_text_insert_timing_test.cpp + * Contains test for inserting text words. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +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 __gnu_pbds::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", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v_init(prm); + distinct_text_populate(f_name, a_v_init); + + 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(a_v_init[j].first, + static_cast(g.get_unsigned_long()))); + + vec_t::const_iterator b = a_v.begin(); + { + typedef mmap_tl_t >::type mmap_tl_tl; + mmap_tl_tl tl; + typedef multimap_insert_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_hash_multimap native_t; + typedef multimap_insert_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + tst(native_t()); + } + + { + typedef native_multimap native_t; + typedef multimap_insert_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + tst(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 " << + 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_large.cc new file mode 100644 index 00000000000..1da0f2a0a37 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_large.cc @@ -0,0 +1,41 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "multimap_text_insert.hpp" + +void +set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) +{ + prm = 100; + n = 3; + s = 4; + m = 20; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem.hpp new file mode 100644 index 00000000000..881960fc804 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem.hpp @@ -0,0 +1,155 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 multimap_text_insert_mem_usage_test.cpp + * Contains test for inserting text words. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +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 __gnu_pbds::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 > init_vec_t; + init_vec_t a_v_init(prm); + distinct_text_populate(f_name, a_v_init); + + typedef __gnu_test::tracker_allocator alloc_t; + typedef std::basic_string, alloc_t> string_t; + typedef std::vector > 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(g.get_unsigned_long()))); + + vec_t::const_iterator b = a_v.begin(); + { + typedef mmap_tl_t::type tl_t; + tl_t tl; + typedef multimap_insert_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef mmap_tl_t< string_t, int, alloc_t>::type tl_t; + tl_t tl; + typedef multimap_insert_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + __gnu_cxx::typelist::apply(tst, tl); + } + + typedef multimap_insert_test test_type; + test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); + { + typedef native_multimap, alloc_t> native_t; + tst(native_t()); + } + + { + typedef + native_hash_multimap< + string_t, + int, + 8, + string_hash_fn, std::equal_to, + std::less, + alloc_t> + native_t; + + tst(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 " << + 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_large.cc new file mode 100644 index 00000000000..7143278e272 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_large.cc @@ -0,0 +1,41 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "multimap_text_insert_mem.hpp" + +void +set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) +{ + prm = 100; + n = 3; + s = 4; + m = 20; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_small.cc new file mode 100644 index 00000000000..c152a84cb08 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_small.cc @@ -0,0 +1,41 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "multimap_text_insert_mem.hpp" + +void +set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) +{ + prm = 400; + n = 1; + s = 1; + m = 6; +} 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 deleted file mode 100644 index 881960fc804..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp +++ /dev/null @@ -1,155 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 multimap_text_insert_mem_usage_test.cpp - * Contains test for inserting text words. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -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 __gnu_pbds::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 > init_vec_t; - init_vec_t a_v_init(prm); - distinct_text_populate(f_name, a_v_init); - - typedef __gnu_test::tracker_allocator alloc_t; - typedef std::basic_string, alloc_t> string_t; - typedef std::vector > 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(g.get_unsigned_long()))); - - vec_t::const_iterator b = a_v.begin(); - { - typedef mmap_tl_t::type tl_t; - tl_t tl; - typedef multimap_insert_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef mmap_tl_t< string_t, int, alloc_t>::type tl_t; - tl_t tl; - typedef multimap_insert_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - __gnu_cxx::typelist::apply(tst, tl); - } - - typedef multimap_insert_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - { - typedef native_multimap, alloc_t> native_t; - tst(native_t()); - } - - { - typedef - native_hash_multimap< - string_t, - int, - 8, - string_hash_fn, std::equal_to, - std::less, - alloc_t> - native_t; - - tst(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 " << - 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc deleted file mode 100644 index 3968645529a..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc +++ /dev/null @@ -1,41 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "multimap_text_insert_mem_usage.hpp" - -void -set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) -{ - prm = 100; - n = 3; - s = 4; - m = 20; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc deleted file mode 100644 index 1dd88df6c30..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc +++ /dev/null @@ -1,41 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "multimap_text_insert_mem_usage.hpp" - -void -set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) -{ - prm = 400; - n = 1; - s = 1; - m = 6; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_small.cc new file mode 100644 index 00000000000..ef28c2d59e6 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_small.cc @@ -0,0 +1,41 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "multimap_text_insert.hpp" + +void +set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) +{ + prm = 400; + n = 1; + s = 1; + m = 6; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp deleted file mode 100644 index 79f08126341..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp +++ /dev/null @@ -1,137 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 multimap_text_insert_timing_test.cpp - * Contains test for inserting text words. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -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 __gnu_pbds::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", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v_init(prm); - distinct_text_populate(f_name, a_v_init); - - 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(a_v_init[j].first, - static_cast(g.get_unsigned_long()))); - - vec_t::const_iterator b = a_v.begin(); - { - typedef mmap_tl_t >::type mmap_tl_tl; - mmap_tl_tl tl; - typedef multimap_insert_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_hash_multimap native_t; - typedef multimap_insert_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - tst(native_t()); - } - - { - typedef native_multimap native_t; - typedef multimap_insert_test test_type; - test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m); - tst(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 " << - 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc deleted file mode 100644 index 70c3dafafca..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc +++ /dev/null @@ -1,41 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "multimap_text_insert_timing.hpp" - -void -set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) -{ - prm = 100; - n = 3; - s = 4; - m = 20; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc deleted file mode 100644 index 57deebb1443..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc +++ /dev/null @@ -1,41 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "multimap_text_insert_timing.hpp" - -void -set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m) -{ - prm = 400; - n = 1; - s = 1; - m = 6; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_int_push.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_int_push.cc new file mode 100644 index 00000000000..5245521c85c --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_int_push.cc @@ -0,0 +1,116 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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_random_int_push_timing_test.cpp + * Contains test for finding random_int. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + twister_rand_gen g; + for (size_t i = 0; i < vm; ++i) + a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); + + typedef push_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, vn, vs, vm); + { + typedef pq_common_types::performance_tl pq_tl_t; + pq_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: priority_queue_random_int_push_timing_test " << + endl << endl; + + cerr << + "This test checks the performance of various priority_queue containers " + "using their push method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of random integers " << endl; + cerr << "* Pushes the elements into the container" << endl; + cerr << "* Repeats the above test a number of times " + << endl; + + cerr << endl << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_int_push_pop.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_int_push_pop.cc new file mode 100644 index 00000000000..6e59bdcd83b --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_int_push_pop.cc @@ -0,0 +1,118 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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_random_int_push_pop_timing_test.cpp + * Contains test for finding random_int. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vector_type; + vector_type a_v(vm); + twister_rand_gen g; + + for (size_t i = 0; i < vm; ++i) + a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); + vector_type::const_iterator b = a_v.begin(); + + typedef push_pop_test test_type; + test_type tst(b, vn, vs, vm); + { + typedef pq_common_types::performance_tl pq_tl_t; + pq_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + std::cerr << "usage: priority_queue_random_int_push_pop_timing_test " << + std::endl << std::endl; + + std::cerr << + "This test checks the performance of various priority_queue containers " + "using their push and pop method. " << std::endl; + std::cerr << "Specifically, it does the following:" << std::endl; + std::cerr << "* Creates a vector of random integers " << std::endl; + std::cerr << "* Pushes the elements into the container" << std::endl; + std::cerr << "* Pops the elements from the container" << std::endl; + std::cerr << "* Repeats the above test a number of times " + << std::endl; + + std::cerr << std::endl << std::endl; + + std::cerr << "vn = minimum size of the vector" << std::endl; + std::cerr << "vs = step size of the vector" << std::endl; + std::cerr << "vm = maximum size of the vector" << std::endl; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc deleted file mode 100644 index 6e59bdcd83b..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc +++ /dev/null @@ -1,118 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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_random_int_push_pop_timing_test.cpp - * Contains test for finding random_int. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vector_type; - vector_type a_v(vm); - twister_rand_gen g; - - for (size_t i = 0; i < vm; ++i) - a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); - vector_type::const_iterator b = a_v.begin(); - - typedef push_pop_test test_type; - test_type tst(b, vn, vs, vm); - { - typedef pq_common_types::performance_tl pq_tl_t; - pq_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - std::cerr << "usage: priority_queue_random_int_push_pop_timing_test " << - std::endl << std::endl; - - std::cerr << - "This test checks the performance of various priority_queue containers " - "using their push and pop method. " << std::endl; - std::cerr << "Specifically, it does the following:" << std::endl; - std::cerr << "* Creates a vector of random integers " << std::endl; - std::cerr << "* Pushes the elements into the container" << std::endl; - std::cerr << "* Pops the elements from the container" << std::endl; - std::cerr << "* Repeats the above test a number of times " - << std::endl; - - std::cerr << std::endl << std::endl; - - std::cerr << "vn = minimum size of the vector" << std::endl; - std::cerr << "vs = step size of the vector" << std::endl; - std::cerr << "vm = maximum size of the vector" << std::endl; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc deleted file mode 100644 index 5245521c85c..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc +++ /dev/null @@ -1,116 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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_random_int_push_timing_test.cpp - * Contains test for finding random_int. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - twister_rand_gen g; - for (size_t i = 0; i < vm; ++i) - a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); - - typedef push_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, vn, vs, vm); - { - typedef pq_common_types::performance_tl pq_tl_t; - pq_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: priority_queue_random_int_push_timing_test " << - endl << endl; - - cerr << - "This test checks the performance of various priority_queue containers " - "using their push method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of random integers " << endl; - cerr << "* Pushes the elements into the container" << endl; - cerr << "* Repeats the above test a number of times " - << endl; - - cerr << endl << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join.cc new file mode 100644 index 00000000000..cad1d3596b7 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join.cc @@ -0,0 +1,113 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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_join_timing_test.cpp + * Contains test for finding text. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage() +{ + using namespace std; + cerr << "usage: priority_queue_text_join_timing_test "; + cerr << endl << endl; + + cerr << "This test checks the performance of various priority_queueiative containers " + "using their join method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of text words " << endl; + cerr << "* Pushes the elements into two containers" << endl; + cerr << "* Joins the two containers (and measures this time)" << endl; + cerr << "* Repeats the above test a number of times " << 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; +} + +int +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; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + text_populate(f_name, a_v); + + typedef join_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, vn, vs, vm); + { + typedef pq_common_types::performance_tl pq_tl_t; + pq_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc deleted file mode 100644 index cad1d3596b7..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc +++ /dev/null @@ -1,113 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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_join_timing_test.cpp - * Contains test for finding text. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage() -{ - using namespace std; - cerr << "usage: priority_queue_text_join_timing_test "; - cerr << endl << endl; - - cerr << "This test checks the performance of various priority_queueiative containers " - "using their join method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of text words " << endl; - cerr << "* Pushes the elements into two containers" << endl; - cerr << "* Joins the two containers (and measures this time)" << endl; - cerr << "* Repeats the above test a number of times " << 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; -} - -int -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; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - text_populate(f_name, a_v); - - typedef join_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, vn, vs, vm); - { - typedef pq_common_types::performance_tl pq_tl_t; - pq_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify.hpp new file mode 100644 index 00000000000..8f31e11d924 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify.hpp @@ -0,0 +1,127 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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_modify_timing_test.cpp + * Contains test for finding text. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +void +set_test_parameters(bool& b); + +int +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 = 100; + size_t vs = 100; + size_t vm = 1100; + bool modify_up; + + set_test_parameters(modify_up); + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + text_populate(f_name, a_v); + + typedef modify_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, vn, vs, vm, modify_up); + { + typedef pq_common_types::performance_tl pq_tl_t; + pq_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: priority_queue_text_modify_timing_test " << + endl << endl; + + cerr << + "This test checks the performance of various priority_queueiative containers " + "using their modify method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of text words " << endl; + cerr << "* Pushes the elements into the container" << endl; + cerr << "* Modifies the words in the container. If modify_up == 't', then" << endl; + cerr << "* it modifies them to the largest word. If modify_up == 'f', then" << endl; + cerr << "* it modifies them to the smallest word." << endl; + cerr << "* Repeats the above test a number of times " + << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down.cc new file mode 100644 index 00000000000..5435956ff42 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down.cc @@ -0,0 +1,37 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "priority_queue_text_modify.hpp" + +void +set_test_parameters(bool& b) +{ b = false; } + diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc deleted file mode 100644 index ce7f3ff4979..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc +++ /dev/null @@ -1,37 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "priority_queue_text_modify_timing.hpp" - -void -set_test_parameters(bool& b) -{ b = false; } - diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp deleted file mode 100644 index 8f31e11d924..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp +++ /dev/null @@ -1,127 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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_modify_timing_test.cpp - * Contains test for finding text. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -void -set_test_parameters(bool& b); - -int -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 = 100; - size_t vs = 100; - size_t vm = 1100; - bool modify_up; - - set_test_parameters(modify_up); - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - text_populate(f_name, a_v); - - typedef modify_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, vn, vs, vm, modify_up); - { - typedef pq_common_types::performance_tl pq_tl_t; - pq_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: priority_queue_text_modify_timing_test " << - endl << endl; - - cerr << - "This test checks the performance of various priority_queueiative containers " - "using their modify method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of text words " << endl; - cerr << "* Pushes the elements into the container" << endl; - cerr << "* Modifies the words in the container. If modify_up == 't', then" << endl; - cerr << "* it modifies them to the largest word. If modify_up == 'f', then" << endl; - cerr << "* it modifies them to the smallest word." << endl; - cerr << "* Repeats the above test a number of times " - << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up.cc new file mode 100644 index 00000000000..ecb786a3dff --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up.cc @@ -0,0 +1,37 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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. + +#include "priority_queue_text_modify.hpp" + +void +set_test_parameters(bool& b) +{ b = true; } + diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc deleted file mode 100644 index cf6e499936f..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc +++ /dev/null @@ -1,37 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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. - -#include "priority_queue_text_modify_timing.hpp" - -void -set_test_parameters(bool& b) -{ b = true; } - diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem.cc new file mode 100644 index 00000000000..50423db3d79 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem.cc @@ -0,0 +1,122 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +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; + try + { + xml_test_performance_formatter fmt("Size", "Memory (bytes)"); + typedef __gnu_test::tracker_allocator allocator_type; + typedef std::char_traits traits_type; + typedef std::basic_string string_t; + typedef std::less cmp_type; + + typedef std::vector > vec_t; + vec_t a_v(vm); + text_populate(f_name, a_v); + + typedef pop_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, vn, vs, vm); + { + typedef pq_common_types::performance_tl pq_tl_t; + pq_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: priority_queue_text_pop_mem_usage_test " << + 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc deleted file mode 100644 index 50423db3d79..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc +++ /dev/null @@ -1,122 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -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; - try - { - xml_test_performance_formatter fmt("Size", "Memory (bytes)"); - typedef __gnu_test::tracker_allocator allocator_type; - typedef std::char_traits traits_type; - typedef std::basic_string string_t; - typedef std::less cmp_type; - - typedef std::vector > vec_t; - vec_t a_v(vm); - text_populate(f_name, a_v); - - typedef pop_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, vn, vs, vm); - { - typedef pq_common_types::performance_tl pq_tl_t; - pq_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: priority_queue_text_pop_mem_usage_test " << - 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push.cc new file mode 100644 index 00000000000..ca5ff6d2a80 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push.cc @@ -0,0 +1,117 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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_timing_test.cpp + * Contains test for finding text. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +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; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + text_populate(f_name, a_v); + + typedef push_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, vn, vs, vm); + { + typedef pq_common_types::performance_tl pq_tl_t; + pq_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: priority_queue_text_push_timing_test " + << endl << endl; + + cerr << + "This test checks the performance of various priority_queue 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" << endl; + cerr << "* Repeats the above test a number of times " + << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop.cc new file mode 100644 index 00000000000..a55a61e7b4f --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop.cc @@ -0,0 +1,116 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +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; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + text_populate(f_name, a_v); + + typedef push_pop_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, vn, vs, vm); + { + typedef pq_common_types::performance_tl pq_tl_t; + pq_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + + { + typedef native_priority_queue native_pq_t; + tst(native_pq_t()); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: priority_queue_text_push_pop_timing_test " + " " << endl << endl; + + cerr << "This test checks the performance of various" + "priority_queue 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 << "* Repeats the above test a number of times) " + << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc deleted file mode 100644 index a55a61e7b4f..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc +++ /dev/null @@ -1,116 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -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; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - text_populate(f_name, a_v); - - typedef push_pop_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, vn, vs, vm); - { - typedef pq_common_types::performance_tl pq_tl_t; - pq_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: priority_queue_text_push_pop_timing_test " - " " << endl << endl; - - cerr << "This test checks the performance of various" - "priority_queue 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 << "* Repeats the above test a number of times) " - << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc deleted file mode 100644 index ca5ff6d2a80..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc +++ /dev/null @@ -1,117 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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_timing_test.cpp - * Contains test for finding text. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -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; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - text_populate(f_name, a_v); - - typedef push_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, vn, vs, vm); - { - typedef pq_common_types::performance_tl pq_tl_t; - pq_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - - { - typedef native_priority_queue native_pq_t; - tst(native_pq_t()); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: priority_queue_text_push_timing_test " - << endl << endl; - - cerr << - "This test checks the performance of various priority_queue 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" << endl; - cerr << "* Repeats the above test a number of times " - << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc deleted file mode 100644 index cdf15105113..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc +++ /dev/null @@ -1,126 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 random_int_find_timing_test.cpp - * Contains test for finding random integers. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector< std::pair< int, char> > vec_t; - vec_t a_v(vm); - twister_rand_gen g; - for (size_t i = 0; i < vm; ++i) - a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); - vec_t::const_iterator b = a_v.begin(); - - typedef find_test< vec_t::const_iterator> test_t; - test_t tst(b, b, vn, vs, vm, vn, vs, vm); - { - typedef native_hash_map< int, char> native_t; - tst(native_t()); - } - - { - typedef native_map< int, char> native_t; - tst(native_t()); - } - - { - typedef hash_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef tree_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: hash_random_int_find_timing_test " << - endl << endl; - - cerr << - "This test checks the performance of various associative containers " - "using their find method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of random integers " << endl; - cerr << "* Inserts the elements into the container" << endl; - cerr << "* Performs a sequence of find operations. At each iteration, " - "it finds, for each integer in the vector, its entry in the " - "container, using the find method"; - cerr << "* Repeats the above test a number of times" << endl; - - cerr << endl << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc deleted file mode 100644 index 1680ff4ffcb..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc +++ /dev/null @@ -1,126 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 random_int_subscript_find_timing_test.cpp - * Contains test for subscripting random integers. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - twister_rand_gen g; - for (size_t i = 0; i < vm; ++i) - a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); - vec_t::const_iterator b = a_v.begin(); - - typedef subscript_find_test test_t; - test_t tst(b, b, vn, vs, vm, vn, vs, vm); - { - typedef hash_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef tree_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_hash_map native_t; - tst(native_t()); - } - - { - typedef native_map< int, size_t> native_t; - tst(native_t()); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: hash_random_int_subscript_find_timing_test " << - endl << endl; - - cerr << - "This test checks the performance of various associative containers " - "using their find method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of random integers " << endl; - cerr << "* Inserts the elements into the container" << endl; - cerr << "* Performs a sequence of find operations. At each iteration, " - "it finds, for each integer in the vector, its entry in the " - "container, using the subscript operator"; - cerr << "* Repeats the above test a number of times" << endl; - - cerr << endl << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc deleted file mode 100644 index 07d644e4fec..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc +++ /dev/null @@ -1,123 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 random_int_subscript_insert_timing_test.cpp - * Contains test for subscripting random integers. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - twister_rand_gen g; - - for (size_t i = 0; i < vm; ++i) - a_v[i] = std::make_pair(static_cast(g.get_unsigned_long()), 0); - vec_t::const_iterator b = a_v.begin(); - - typedef subscript_insert_test test_t; - test_t tst(b, b, vn, vs, vm, vn, vs, vm); - { - typedef hash_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef tree_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_hash_map< int, size_t> native_t; - tst(native_t()); - } - - { - typedef native_map< int, size_t> native_t; - tst(native_t()); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: hash_random_int_subscript_insert_timing_test " - << endl << endl; - - cerr << - "This test checks the performance of various associative containers " - "using their find method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of random integers " << endl; - cerr << "* Inserts the elements into the container" << endl; - cerr << "* Repeats the above test a number of times" << endl; - - cerr << endl << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc deleted file mode 100644 index b997a5ee9cb..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc +++ /dev/null @@ -1,145 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 text_find_timing_test.cpp - * Contains test for finding text. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -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; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - typedef std::vector > vec_t; - - vec_t a_v(vm); - text_populate(f_name, a_v); - typedef find_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, b, vn, vs, vm, vn, vs, vm); - { - typedef trie_common_types::performance_tl pat_trie_tl_t; - - typedef tree_common_types::performance_tl tree_tl_t; - - typedef hash_common_types::performance_tl hash_tl_t; - - typedef __gnu_cxx::typelist::append::type>::type tl_t; - - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_map native_map_t; - tst(native_map_t()); - -#ifdef PB_DS_USE_TR1 - typedef native_hash_map native_hash_map_t; - tst(native_hash_map_t()); - - typedef - native_hash_map< - std::string, - char, - 8, - string_hash_fn, - std::equal_to< - std::string>, - std::less< - std::string>, - std::allocator< - char>, - true> - sth_native_hash_map_t; - - tst(sth_native_hash_map_t()); -#endif - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: text_find_timing_test " << - endl << endl; - - cerr << - "This test checks the performance of various associative containers " - "using their find method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of text words " << endl; - cerr << "* Inserts the elements into the container" << endl; - cerr << "* Performs a sequence of find operations. At each iteration, " - "it finds, for each word in the vector, its entry in the " - "container, using the find method" << endl; - cerr << "* Repeats the above test a number of times) " - << 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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics.cc new file mode 100644 index 00000000000..eab8950a9f4 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics.cc @@ -0,0 +1,105 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009, 2011 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 +// 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 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 tree_order_statistics_timing_test.cpp + * Contains test for order_statisticsing trees. + */ + +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + { + typedef tree_order_statistics_test< true> test_t; + test_t tst(vn, vs, vm); + typedef tree_common_types, __gnu_pbds::tree_order_statistics_node_update>::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef tree_order_statistics_test test_t; + test_t tst(vn, vs, vm); + typedef native_set native_set_t; + tst(native_set_t()); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: tree_order_statistics_timing_test.out " << + endl << endl; + + cerr << "This test checks the performance of order statistics" + " in tree based containers. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a tree" << endl; + cerr << "* Inserts integers into the tree" << endl; + cerr << "* Checks the order-statistics of each entry in the tree" << endl; + cerr << "* Repeats the above test some times" + << endl; + + cerr << endl << endl; + + cerr << "vn = minimum size of the tree" << endl; + cerr << "vs = step size of the tree" << endl; + cerr << "vm = maximum size of the tree" << endl; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc deleted file mode 100644 index eab8950a9f4..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc +++ /dev/null @@ -1,105 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009, 2011 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 -// 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 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 tree_order_statistics_timing_test.cpp - * Contains test for order_statisticsing trees. - */ - -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - { - typedef tree_order_statistics_test< true> test_t; - test_t tst(vn, vs, vm); - typedef tree_common_types, __gnu_pbds::tree_order_statistics_node_update>::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef tree_order_statistics_test test_t; - test_t tst(vn, vs, vm); - typedef native_set native_set_t; - tst(native_set_t()); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: tree_order_statistics_timing_test.out " << - endl << endl; - - cerr << "This test checks the performance of order statistics" - " in tree based containers. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a tree" << endl; - cerr << "* Inserts integers into the tree" << endl; - cerr << "* Checks the order-statistics of each entry in the tree" << endl; - cerr << "* Repeats the above test some times" - << endl; - - cerr << endl << endl; - - cerr << "vn = minimum size of the tree" << endl; - cerr << "vs = step size of the tree" << endl; - cerr << "vm = maximum size of the tree" << endl; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join.cc new file mode 100644 index 00000000000..a9423e2576a --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join.cc @@ -0,0 +1,107 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009, 2011 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 +// 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 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 tree_split_join_timing_test.cpp + * Contains test for joining trees. + */ + +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +main(int argc, char* a_p_argv[]) +{ + using namespace __gnu_pbds::test; + size_t vn = 200; + size_t vs = 200; + size_t vm = 2100; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + { + typedef tree_split_join_test test_t; + test_t tst(vn, vs, vm); + + typedef tree_common_types::performance_tl tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef tree_split_join_test test_t; + test_t tst(vn, vs, vm); + typedef native_set native_set_t; + tst(native_set_t()); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: tree_split_join_test.cpp " << + endl << endl; + + cerr << "This test checks the performance of splitting joining" + "tree based containers. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a tree " << endl; + cerr << "* Inserts integers into the tree" << endl; + cerr << "* Splits half the tree into a different tree" << endl; + cerr << "* Joins the trees" << endl; + cerr << "* Repeats the above test a given number of times) " + << endl; + + cerr << endl << endl; + + cerr << "vn = minimum size of the tree" << endl; + cerr << "vs = step size of the tree" << endl; + cerr << "vm = maximum size of the tree" << endl; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc deleted file mode 100644 index a9423e2576a..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc +++ /dev/null @@ -1,107 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009, 2011 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 -// 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 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 tree_split_join_timing_test.cpp - * Contains test for joining trees. - */ - -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -main(int argc, char* a_p_argv[]) -{ - using namespace __gnu_pbds::test; - size_t vn = 200; - size_t vs = 200; - size_t vm = 2100; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - { - typedef tree_split_join_test test_t; - test_t tst(vn, vs, vm); - - typedef tree_common_types::performance_tl tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef tree_split_join_test test_t; - test_t tst(vn, vs, vm); - typedef native_set native_set_t; - tst(native_set_t()); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: tree_split_join_test.cpp " << - endl << endl; - - cerr << "This test checks the performance of splitting joining" - "tree based containers. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a tree " << endl; - cerr << "* Inserts integers into the tree" << endl; - cerr << "* Splits half the tree into a different tree" << endl; - cerr << "* Joins the trees" << endl; - cerr << "* Repeats the above test a given number of times) " - << endl; - - cerr << endl << endl; - - cerr << "vn = minimum size of the tree" << endl; - cerr << "vs = step size of the tree" << endl; - cerr << "vm = maximum size of the tree" << endl; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert.cc new file mode 100644 index 00000000000..43466a2bfd6 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert.cc @@ -0,0 +1,116 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 tree_text_insert_timing_test.cpp + * Contains test for finding text. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +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; + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + text_populate(f_name, a_v); + + typedef insert_test< vec_t::const_iterator> test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, vn, vs, vm); + { + typedef trie_common_types::performance_tl pat_trie_tl_t; + typedef tree_common_types::performance_tl tree_tl_t; + typedef __gnu_cxx::typelist::append::type tl_t; + tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + + { + typedef native_map native_map_t; + tst(native_map_t()); + } + } + catch (...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: tree_text_insert_timing_test " << + 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 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 << "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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc deleted file mode 100644 index 43466a2bfd6..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc +++ /dev/null @@ -1,116 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 tree_text_insert_timing_test.cpp - * Contains test for finding text. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -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; - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - text_populate(f_name, a_v); - - typedef insert_test< vec_t::const_iterator> test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, vn, vs, vm); - { - typedef trie_common_types::performance_tl pat_trie_tl_t; - typedef tree_common_types::performance_tl tree_tl_t; - typedef __gnu_cxx::typelist::append::type tl_t; - tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - - { - typedef native_map native_map_t; - tst(native_map_t()); - } - } - catch (...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: tree_text_insert_timing_test " << - 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 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 << "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; -} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find.cc new file mode 100644 index 00000000000..dc205547d76 --- /dev/null +++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find.cc @@ -0,0 +1,115 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006, 2009 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 +// 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 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 tree_text_lor_find_timing_test.cpp + * Contains test for finding text with locality of reference. + */ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +void +usage(); + +int +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; + + try + { + xml_test_performance_formatter fmt("Size", "Average time (sec.)"); + + typedef std::vector > vec_t; + vec_t a_v(vm); + text_populate(f_name, a_v); + + typedef find_test test_t; + vec_t::const_iterator b = a_v.begin(); + test_t tst(b, b, vn, vs, vm, vn, vs, vm); + { + typedef native_map native_set_t; + tst(native_set_t()); + } + + { + typedef tree_common_types::performance_tl tree_tl_t; + tree_tl_t tl; + __gnu_cxx::typelist::apply(tst, tl); + } + } + catch(...) + { + std::cerr << "Test failed" << std::endl; + return -1; + } + return 0; +} + +void +usage() +{ + using namespace std; + cerr << "usage: tree_text_lor_find_performance_test " + << endl << endl; + + cerr << + "This test checks the performance of various associative containers " + "using their find method. " << endl; + cerr << "Specifically, it does the following:" << endl; + cerr << "* Creates a vector of text words " << endl; + cerr << "* Inserts the elements into the container" << endl; + cerr << "* Performs a sequence of find operations. At each iteration, " + "it finds, for each word in the vector, its entry in the " + "container, using the find method" << endl; + cerr << "* Repeats the above test a number of times" << 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; +} diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc deleted file mode 100644 index dc205547d76..00000000000 --- a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc +++ /dev/null @@ -1,115 +0,0 @@ -// -*- C++ -*- - -// Copyright (C) 2005, 2006, 2009 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 -// 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 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 tree_text_lor_find_timing_test.cpp - * Contains test for finding text with locality of reference. - */ - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -void -usage(); - -int -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; - - try - { - xml_test_performance_formatter fmt("Size", "Average time (sec.)"); - - typedef std::vector > vec_t; - vec_t a_v(vm); - text_populate(f_name, a_v); - - typedef find_test test_t; - vec_t::const_iterator b = a_v.begin(); - test_t tst(b, b, vn, vs, vm, vn, vs, vm); - { - typedef native_map native_set_t; - tst(native_set_t()); - } - - { - typedef tree_common_types::performance_tl tree_tl_t; - tree_tl_t tl; - __gnu_cxx::typelist::apply(tst, tl); - } - } - catch(...) - { - std::cerr << "Test failed" << std::endl; - return -1; - } - return 0; -} - -void -usage() -{ - using namespace std; - cerr << "usage: tree_text_lor_find_performance_test " - << endl << endl; - - cerr << - "This test checks the performance of various associative containers " - "using their find method. " << endl; - cerr << "Specifically, it does the following:" << endl; - cerr << "* Creates a vector of text words " << endl; - cerr << "* Inserts the elements into the container" << endl; - cerr << "* Performs a sequence of find operations. At each iteration, " - "it finds, for each word in the vector, its entry in the " - "container, using the find method" << endl; - cerr << "* Repeats the above test a number of times" << 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; -}