PageRenderTime 35ms CodeModel.GetById 0ms RepoModel.GetById 1ms app.codeStats 0ms

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

https://bitbucket.org/pizzafactory/pf-gcc
HTML | 143 lines | 142 code | 1 blank | 0 comment | 0 complexity | 627b65a1739fce8824c99f3387c6c884 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 Pop Memory Use 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>pop</tt> Memory Use Test</h1>
    13. 

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

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

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

  16.     a container, then pops them until only one is left in the
    17. 

  17.     container. It measures the memory use as a function of the
    18. 

  18.     number of values pushed to the container.</p>
    19. 

  19. <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_pop_mem_usage.cc"><tt>priority_queue_text_pop_mem_usage_test</tt></a>
    20. 

  20.     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
    21. 

  21. <h2><a name="purpose" id="purpose">Purpose</a></h2>
    22. 

  22. <p>The test checks the effect of different underlying
    23. 

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

  24.     Queues::Implementations</a>).</p>
    25. 

  25. <h2><a name="results" id="results">Results</a></h2>
    26. 

  26. <p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
    27. 

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

  28.     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
    29. 

  29.     <a href="pq_performance_tests.html#local"><u>local</u></a>,
    30. 

  30.     respectively.</p>
    31. 

  31. <div id="NPG_res_div">
    32. 

  32. <div id="NPG_gcc">
    33. 

  33. <div id="NPG_priority_queue_text_pop_mem_usage_test">
    34. 

  34. <div id="NPG_pq">
    35. 

  35. <div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_pop_455tt__memory-use_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_pop_mem_usage_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>pop</tt> memory-use 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>
    36. 

  36. <ol>
    37. 

  37. <li>
    38. 

  38. n_pq_vector-
    39. 

  39. <tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
    40. 

  40. <li>
    41. 

  41. n_pq_deque-
    42. 

  42. <tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
    43. 

  43. <li>
    44. 

  44. binary_heap-
    45. 

  45. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    46. 

  46.  with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
    47. 

  47. </li>
    48. 

  48. <li>
    49. 

  49. thin_heap-
    50. 

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

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

  52. </li>
    53. 

  53. <li>
    54. 

  54. binomial_heap-
    55. 

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

  56.  with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
    57. 

  57. </li>
    58. 

  58. <li>
    59. 

  59. rc_binomial_heap-
    60. 

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

  61.  with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
    62. 

  62. </li>
    63. 

  63. <li>
    64. 

  64. pairing_heap-
    65. 

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

  66.  with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
    67. 

  67. </li>
    68. 

  68. </ol>
    69. 

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

  70. </div>
    71. 

  71. </div>
    72. 

  72. </div>
    73. 

  73. </div>
    74. 

  74. <div id="NPM_res_div">
    75. 

  75. <div id="NPM_msvc">
    76. 

  76. <div id="NPM_priority_queue_text_pop_mem_usage_test">
    77. 

  77. <div id="NPM_pq">
    78. 

  78. <div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_pop_455tt__memory-use_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_pop_mem_usage_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>pop</tt> memory-use 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>
    79. 

  79. <ol>
    80. 

  80. <li>
    81. 

  81. n_pq_vector-
    82. 

  82. <tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
    83. 

  83. <li>
    84. 

  84. n_pq_deque-
    85. 

  85. <tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
    86. 

  86. <li>
    87. 

  87. binary_heap-
    88. 

  88. <a href="priority_queue.html"><tt>priority_queue</tt></a>
    89. 

  89.  with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
    90. 

  90. </li>
    91. 

  91. <li>
    92. 

  92. thin_heap-
    93. 

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

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

  95. </li>
    96. 

  96. <li>
    97. 

  97. binomial_heap-
    98. 

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

  99.  with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
    100. 

  100. </li>
    101. 

  101. <li>
    102. 

  102. rc_binomial_heap-
    103. 

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

  104.  with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
    105. 

  105. </li>
    106. 

  106. <li>
    107. 

  107. pairing_heap-
    108. 

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

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

  110. </li>
    111. 

  111. </ol>
    112. 

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

  113. </div>
    114. 

  114. </div>
    115. 

  115. </div>
    116. 

  116. </div>
    117. 

  117. <div id="NPL_res_div">
    118. 

  118. <div id="NPL_local">
    119. 

  119. <div id="NPL_priority_queue_text_pop_mem_usage_test">
    120. 

  120. <div id="NPL_pq">
    121. 

  121. <div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_pop_455tt__memory-use_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_pop_mem_usage_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>pop</tt> memory-use test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
    122. 

  122. </div>
    123. 

  123. </div>
    124. 

  124. </div>
    125. 

  125. </div>
    126. 

  126. <h2><a name="observations" id="observations">Observations</a></h2>
    127. 

  127. <p>The priority queue implementations (excluding the STL's) use
    128. 

  128.     memory proportionally to the number of values they hold:
    129. 

  129.     node-based implementations (<i>e.g.</i>, a pairing heap) do so
    130. 

  130.     naturally; <tt>pb_ds</tt>'s binary heap de-allocates memory when
    131. 

  131.     a certain lower threshold is exceeded.</p>
    132. 

  132. <p>Note from <a href="priority_queue_text_push_pop_timing_test.html">Priority Queue
    133. 

  133.     Text <tt>push</tt> and <tt>pop</tt> Timing Test</a> and
    134. 

  134.     <a href="priority_queue_random_int_push_pop_timing_test.html">Priority
    135. 

  135.     Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
    136. 

  136.     Test</a> that this does not impede performance compared to the
    137. 

  137.     STL's priority queues.</p>
    138. 

  138. <p>(See <a href="hash_random_int_erase_mem_usage_test.html">Hash-Based Erase
    139. 

  139.     Memory Use Test</a> for a similar phenomenon regarding priority
    140. 

  140.     queues.)</p>
    141. 

  141. </div>
    142. 

  142. </body>
    143. 

  143. </html>
    144. 

  144.