PageRenderTime 39ms CodeModel.GetById 21ms RepoModel.GetById 0ms app.codeStats 0ms

/libstdc++-v3/doc/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html

https://bitbucket.org/pizzafactory/pf-gcc
HTML | 209 lines | 208 code | 1 blank | 0 comment | 0 complexity | 8f97a1aceb509c839990083401241352 MD5 | raw file
    

  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
    2. 

  2.     "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
    3. 

  3. 

  4. <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
    5. 

  5. <head>
    6. 

  6. <meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
    7. 

  7. <title>Priority Queue Text Push Pop Timing Test</title>
    8. 

  8. <meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
    9. 

  9. </head>
    10. 

  10. <body>
    11. 

  11. <div id="page">
    12. 

  12. <h1>Priority Queue Text <tt>push</tt> and <tt>pop</tt> Timing
    13. 

  13.     Test</h1>
    14. 

  14. <h2><a name="description" id="description">Description</a></h2>
    15. 

  15. <p>This test inserts a number of values with keys from an
    16. 

  16.     arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
    17. 

  17.     a container using <tt>push</tt> , then removes them using
    18. 

  18.     <tt>pop</tt> . It measures the average time for <tt>push</tt>
    19. 

  19.     as a function of the number of values.</p>
    20. 

  20. <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_text_push_pop_timing.cc"><tt>
    21. 

  21.     priority_queue_text_push_pop_timing_test</tt></a>
    22. 

  22.     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
    23. 

  23. <h2><a name="purpose" id="purpose">Purpose</a></h2>
    24. 

  24. <p>The test checks the effect of different underlying
    25. 

  25.     data structures (see <a href="pq_design.html#pq_imp">Design::Priority
    26. 

  26.     Queues::Implementations</a>).</p>
    27. 

  27. <h2><a name="results" id="results">Results</a></h2>
    28. 

  28. <p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
    29. 

  29.     <a href="#NPL">NPL</a> show the results for the native priority
    30. 

  30.     queues and <tt>pb_ds</tt> 's priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
    31. 

  31.     <a href="pq_performance_tests.html#local"><u>local</u></a>,
    32. 

  32.     respectively; Figures <a href="#NBRG">NBRG</a>, <a href="#NBRM">NBRM</a>, and <a href="#NBRL">NBRL</a> show the results
    33. 

  33.     for the native priority queues and <tt>pb_ds</tt>'s pairing
    34. 

  34.     queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
    35. 

  35.     <a href="pq_performance_tests.html#local"><u>local</u></a>,
    36. 

  36.     respectively.</p>
    37. 

  37. <div id="NPG_res_div">
    38. 

  38. <div id="NPG_gcc">
    39. 

  39. <div id="NPG_priority_queue_text_push_pop_timing_test">
    40. 

  40. <div id="NPG_pq">
    41. 

  41. <div id="NPG_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__and__tt_pop_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_text_push_pop_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> and <tt>pop</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>
    42. 

  42. <ol>
    43. 

  43. <li>
    44. 

  44. n_pq_vector-
    45. 

  45. <tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
    46. 

  46. <li>
    47. 

  47. n_pq_deque-
    48. 

  48. <tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
    49. 

  49. <li>
    50. 

  50. thin_heap-
    51. 

  51. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    52. 

  52.  with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
    53. 

  53. </li>
    54. 

  54. <li>
    55. 

  55. rc_binomial_heap-
    56. 

  56. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    57. 

  57.  with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
    58. 

  58. </li>
    59. 

  59. <li>
    60. 

  60. binomial_heap-
    61. 

  61. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    62. 

  62.  with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
    63. 

  63. </li>
    64. 

  64. <li>
    65. 

  65. binary_heap-
    66. 

  66. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    67. 

  67.  with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
    68. 

  68. </li>
    69. 

  69. <li>
    70. 

  70. pairing_heap-
    71. 

  71. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    72. 

  72.  with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
    73. 

  73. </li>
    74. 

  74. </ol>
    75. 

  75. </div><div style="width: 100%; height: 20px"></div></div>
    76. 

  76. </div>
    77. 

  77. </div>
    78. 

  78. </div>
    79. 

  79. </div>
    80. 

  80. <div id="NPM_res_div">
    81. 

  81. <div id="NPM_msvc">
    82. 

  82. <div id="NPM_priority_queue_text_push_pop_timing_test">
    83. 

  83. <div id="NPM_pq">
    84. 

  84. <div id="NPM_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__and__tt_pop_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_text_push_pop_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> and <tt>pop</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>
    85. 

  85. <ol>
    86. 

  86. <li>
    87. 

  87. n_pq_deque-
    88. 

  88. <tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
    89. 

  89. <li>
    90. 

  90. n_pq_vector-
    91. 

  91. <tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
    92. 

  92. <li>
    93. 

  93. thin_heap-
    94. 

  94. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    95. 

  95.  with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
    96. 

  96. </li>
    97. 

  97. <li>
    98. 

  98. rc_binomial_heap-
    99. 

  99. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    100. 

  100.  with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
    101. 

  101. </li>
    102. 

  102. <li>
    103. 

  103. binomial_heap-
    104. 

  104. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    105. 

  105.  with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
    106. 

  106. </li>
    107. 

  107. <li>
    108. 

  108. pairing_heap-
    109. 

  109. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    110. 

  110.  with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
    111. 

  111. </li>
    112. 

  112. <li>
    113. 

  113. binary_heap-
    114. 

  114. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    115. 

  115.  with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
    116. 

  116. </li>
    117. 

  117. </ol>
    118. 

  118. </div><div style="width: 100%; height: 20px"></div></div>
    119. 

  119. </div>
    120. 

  120. </div>
    121. 

  121. </div>
    122. 

  122. </div>
    123. 

  123. <div id="NPL_res_div">
    124. 

  124. <div id="NPL_local">
    125. 

  125. <div id="NPL_priority_queue_text_push_pop_timing_test">
    126. 

  126. <div id="NPL_pq">
    127. 

  127. <div id="NPL_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__and__tt_pop_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_text_push_pop_timing_test_local.png" alt="no image" /></a></h6>NPL: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
    128. 

  128. </div>
    129. 

  129. </div>
    130. 

  130. </div>
    131. 

  131. </div>
    132. 

  132. <div id="NBRG_res_div">
    133. 

  133. <div id="NBRG_gcc">
    134. 

  134. <div id="NBRG_pairing_priority_queue_text_push_pop_timing_test">
    135. 

  135. <div id="NBRG_pq">
    136. 

  136. <div id="NBRG_Native_tree_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRG" id="NBRG"><img src="pairing_priority_queue_text_push_pop_timing_test_gcc.png" alt="no image" /></a></h6>NBRG: Native tree and <tt>pb ds</tt> pairing priority queue <tt>push</tt> and <tt>pop</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>
    137. 

  137. <ol>
    138. 

  138. <li>
    139. 

  139. n_pq_vector-
    140. 

  140. <tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
    141. 

  141. <li>
    142. 

  142. n_pq_deque-
    143. 

  143. <tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
    144. 

  144. <li>
    145. 

  145. pairing_heap-
    146. 

  146. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    147. 

  147.  with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
    148. 

  148. </li>
    149. 

  149. </ol>
    150. 

  150. </div><div style="width: 100%; height: 20px"></div></div>
    151. 

  151. </div>
    152. 

  152. </div>
    153. 

  153. </div>
    154. 

  154. </div>
    155. 

  155. <div id="NBRM_res_div">
    156. 

  156. <div id="NBRM_msvc">
    157. 

  157. <div id="NBRM_pairing_priority_queue_text_push_pop_timing_test">
    158. 

  158. <div id="NBRM_pq">
    159. 

  159. <div id="NBRM_Native_tree_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRM" id="NBRM"><img src="pairing_priority_queue_text_push_pop_timing_test_msvc.png" alt="no image" /></a></h6>NBRM: Native tree and <tt>pb ds</tt> pairing priority queue <tt>push</tt> and <tt>pop</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>
    160. 

  160. <ol>
    161. 

  161. <li>
    162. 

  162. n_pq_deque-
    163. 

  163. <tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
    164. 

  164. <li>
    165. 

  165. n_pq_vector-
    166. 

  166. <tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
    167. 

  167. <li>
    168. 

  168. pairing_heap-
    169. 

  169. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    170. 

  170.  with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
    171. 

  171. </li>
    172. 

  172. </ol>
    173. 

  173. </div><div style="width: 100%; height: 20px"></div></div>
    174. 

  174. </div>
    175. 

  175. </div>
    176. 

  176. </div>
    177. 

  177. </div>
    178. 

  178. <div id="NBRL_res_div">
    179. 

  179. <div id="NBRL_local">
    180. 

  180. <div id="NBRL_pairing_priority_queue_text_push_pop_timing_test">
    181. 

  181. <div id="NBRL_pq">
    182. 

  182. <div id="NBRL_Native_tree_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRL" id= "NBRL"><img src="pairing_priority_queue_text_push_pop_timing_test_local.png" alt="no image" /></a></h6>NBRL: Native tree and <tt>pb ds</tt> pairing priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
    183. 

  183. </div>
    184. 

  184. </div>
    185. 

  185. </div>
    186. 

  186. </div>
    187. 

  187. <h2><a name="observations" id="observations">Observations</a></h2>
    188. 

  188. <p>These results are very similar to <a href="priority_queue_text_push_timing_test.html">Priority Queue Text
    189. 

  189.     <tt>push</tt> Timing Test</a>. As stated there, pairing heaps
    190. 

  190.     (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
    191. 

  191.     <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>)
    192. 

  192.     are most suited for <tt>push</tt> and <tt>pop</tt> sequences of
    193. 

  193.     non-primitive types such as strings. Observing these two tests,
    194. 

  194.     one can note that a pairing heap outperforms the others in
    195. 

  195.     terms of <tt>push</tt> operations, but equals binary heaps
    196. 

  196.     (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
    197. 

  197.     <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>) if
    198. 

  198.     the number of <tt>push</tt> and <tt>pop</tt> operations is
    199. 

  199.     equal. As the number of <tt>pop</tt> operations is at most
    200. 

  200.     equal to the number of <tt>push</tt> operations, pairing heaps
    201. 

  201.     are better in this case. See <a href="priority_queue_random_int_push_pop_timing_test.html">Priority
    202. 

  202.     Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
    203. 

  203.     Test</a> for a case which is different.</p>
    204. 

  204. <p><a href="pq_performance_tests.html#pq_observations">Priority-Queue
    205. 

  205.     Performance Tests::Observations</a> discusses this further and
    206. 

  206.     summarizes.</p>
    207. 

  207. </div>
    208. 

  208. </body>
    209. 

  209. </html>
    210. 

  210.