diff options
Diffstat (limited to 'gcc-4.4.3/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html')
| -rw-r--r-- | gcc-4.4.3/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html | 200 |
1 files changed, 0 insertions, 200 deletions
diff --git a/gcc-4.4.3/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html b/gcc-4.4.3/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html deleted file mode 100644 index ba91f601a..000000000 --- a/gcc-4.4.3/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html +++ /dev/null @@ -1,200 +0,0 @@ -<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" - "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> - -<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> -<head> -<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" /> -<title>Priority Queue Random Int Push Timing Test</title> -<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" /> -</head> -<body> -<div id="page"> -<h1>Priority Queue Random Integer <tt>push</tt> Timing - Test</h1> -<h2><a name="description" id="description">Description</a></h2> -<p>This test inserts a number of values with i.i.d integer keys - into a container using <tt>push</tt> . It measures the average - time for <tt>push</tt> as a function of the number of - values.</p> -<p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc"><tt> - priority_queue_random_intpush_timing_test</tt></a> - thirty_years_among_the_dead_preproc.txt 200 200 2100)</p> -<h2><a name="purpose" id="purpose">Purpose</a></h2> -<p>The test checks the effect of different underlying - data structures (see <a href="pq_design.html#pq_imp">Design::Priority - Queues::Implementations</a>).</p> -<h2><a name="results" id="results">Results</a></h2> -<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and - <a href="#NPL">NPL</a> show the results for the native priority - queues and <tt>pb_ds</tt> 's priority queues in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and - <a href="assoc_performance_tests.html#local"><u>local</u></a>, - respectively; Figures <a href="#NBPG">NBPG</a>, <a href="#NBPM">NBPM</a>, and <a href="#NBPL">NBPL</a> shows the - results for the binary-heap based native priority queues and - <tt>pb_ds</tt> 's priority queues in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and - <a href="assoc_performance_tests.html#local"><u>local</u></a>, - respectively</p> -<div id="NPG_res_div"> -<div id="NPG_gcc"> -<div id="NPG_priority_queue_random_int_push_timing_test"> -<div id="NPG_pq"> -<div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_random_int_push_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p> -<ol> -<li> -rc_binomial_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a> -</li> -<li> -binomial_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a> -</li> -<li> -n_pq_deque- -<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li> -<li> -pairing_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a> -</li> -<li> -thin_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a> -</li> -<li> -n_pq_vector- -<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li> -<li> -binary_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a> -</li> -</ol> -</div><div style="width: 100%; height: 20px"></div></div> -</div> -</div> -</div> -</div> -<div id="NPM_res_div"> -<div id="NPM_msvc"> -<div id="NPM_priority_queue_random_int_push_timing_test"> -<div id="NPM_pq"> -<div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_random_int_push_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p> -<ol> -<li> -rc_binomial_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a> -</li> -<li> -binomial_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a> -</li> -<li> -pairing_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a> -</li> -<li> -thin_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a> -</li> -<li> -n_pq_deque- -<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li> -<li> -n_pq_vector- -<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li> -<li> -binary_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a> -</li> -</ol> -</div><div style="width: 100%; height: 20px"></div></div> -</div> -</div> -</div> -</div> -<div id="NPL_res_div"> -<div id="NPL_local"> -<div id="NPL_priority_queue_random_int_push_timing_test"> -<div id="NPL_pq"> -<div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_random_int_push_timing_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div> -</div> -</div> -</div> -</div> -<div id="NBPG_res_div"> -<div id="NBPG_gcc"> -<div id="NBPG_binary_priority_queue_random_int_push_timing_test"> -<div id="NBPG_pq"> -<div id="NBPG_Native_and__tt_pb_ds_455tt__binary_priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBPG" id="NBPG"><img src="binary_priority_queue_random_int_push_timing_test_gcc.png" alt="no image" /></a></h6>NBPG: Native and <tt>pb ds</tt> binary priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p> -<ol> -<li> -n_pq_deque- -<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li> -<li> -n_pq_vector- -<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li> -<li> -binary_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a> -</li> -</ol> -</div><div style="width: 100%; height: 20px"></div></div> -</div> -</div> -</div> -</div> -<div id="NBPM_res_div"> -<div id="NBPM_msvc"> -<div id="NBPM_binary_priority_queue_random_int_push_timing_test"> -<div id="NBPM_pq"> -<div id="NBPM_Native_and__tt_pb_ds_455tt__binary_priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBPM" id="NBPM"><img src="binary_priority_queue_random_int_push_timing_test_msvc.png" alt="no image" /></a></h6>NBPM: Native and <tt>pb ds</tt> binary priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p> -<ol> -<li> -n_pq_deque- -<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li> -<li> -n_pq_vector- -<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li> -<li> -binary_heap- -<a href="priority_queue.html"><tt>priority_queue</tt></a> - with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a> -</li> -</ol> -</div><div style="width: 100%; height: 20px"></div></div> -</div> -</div> -</div> -</div> -<div id="NBPL_res_div"> -<div id="NBPL_local"> -<div id="NBPL_binary_priority_queue_random_int_push_timing_test"> -<div id="NBPL_pq"> -<div id="NBPL_Native_and__tt_pb_ds_455tt__binary_priority_queue__tt_push_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBPL" id= "NBPL"><img src="binary_priority_queue_random_int_push_timing_test_local.png" alt="no image" /></a></h6>NBPL: Native and <tt>pb ds</tt> binary priority queue <tt>push</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div> -</div> -</div> -</div> -</div> -<h2><a name="observations" id="observations">Observations</a></h2> -<p>Binary heaps are the most suited for sequences of - <tt>push</tt> and <tt>pop</tt> operations of primitive types - (<i>e.g.</i> <tt><b>int</b></tt>s). They are less constrained - than any other type, and since it is very efficient to store - such types in arrays, they outperform even pairing heaps. (See - <a href="priority_queue_text_push_timing_test.html">Priority - Queue Text <tt>push</tt> Timing Test</a> for the case of - non-primitive types.)</p> -<p><a href="pq_performance_tests.html#pq_observations">Priority-Queue - Performance Tests::Observations</a> discusses this further and - summarizes.</p> -</div> -</body> -</html> |