PageRenderTime 27ms CodeModel.GetById 0ms RepoModel.GetById 0ms app.codeStats 0ms

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

https://bitbucket.org/pizzafactory/pf-gcc
HTML | 126 lines | 125 code | 1 blank | 0 comment | 0 complexity | 4577714d81f67f75cff79de36581e4ce 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>Tree Text Locality of Reference Find 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>Tree-Based Locality-of-Reference Text <tt>find</tt> Find
    13. 

  13.     Timing 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, then performs a series of finds using
    18. 

  18.     <tt>find</tt> . It is different than <a href="tree_text_find_find_timing_test.html">Tree-Based and
    19. 

  19.     Trie-Based Text <tt>find</tt> Find Timing Test</a> in the
    20. 

  20.     sequence of finds it performs: this test performs multiple
    21. 

  21.     <tt>find</tt> s on the same key before moving on to the next
    22. 

  22.     key. It measures the average time for <tt>find</tt> as a
    23. 

  23.     function of the number of values inserted.</p>
    24. 

  24. <p>(The test was executed with <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc"><tt>tree_text_lor_find_timing_test</tt></a>
    25. 

  25.     thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
    26. 

  26. <h2><a name="purpose" id="purpose">Purpose</a></h2>
    27. 

  27. <p>The test checks the effect of different underlying
    28. 

  28.     data structures in a locality-of-reference setting.</p>
    29. 

  29. <h2><a name="results" id="results">Results</a></h2>
    30. 

  30. <p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
    31. 

  31.     <a href="#NTL">NTL</a> show the results for the native and
    32. 

  32.     <tt>pb_ds</tt> tree-based types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a> and
    33. 

  33.     <a href="assoc_performance_tests.html#local"><u>local</u></a>,
    34. 

  34.     respectively.</p>
    35. 

  35. <div id="NTG_res_div">
    36. 

  36. <div id="NTG_gcc">
    37. 

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

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

  39. <div id="NTG_Native_and_tree-based_locality-of-reference_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="tree_text_lor_find_timing_test_gcc.png" alt="no image" /></a></h6>NTG: Native and tree-based locality-of-reference text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
    40. 

  40. <ol>
    41. 

  41. <li>
    42. 

  42. ov_tree_map-
    43. 

  43. <a href="tree.html"><tt>tree</tt></a>
    44. 

  44.  with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
    45. 

  45. , and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
    46. 

  46. </li>
    47. 

  47. <li>
    48. 

  48. rb_tree_map-
    49. 

  49. <a href="tree.html"><tt>tree</tt></a>
    50. 

  50.  with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
    51. 

  51. , and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
    52. 

  52. </li>
    53. 

  53. <li>
    54. 

  54. n_map-
    55. 

  55. <tt>std::map</tt></li>
    56. 

  56. <li>
    57. 

  57. splay_tree_map-
    58. 

  58. <a href="tree.html"><tt>tree</tt></a>
    59. 

  59.  with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
    60. 

  60. , and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
    61. 

  61. </li>
    62. 

  62. </ol>
    63. 

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

  64. </div>
    65. 

  65. </div>
    66. 

  66. </div>
    67. 

  67. </div>
    68. 

  68. <div id="NTM_res_div">
    69. 

  69. <div id="NTM_msvc">
    70. 

  70. <div id="NTM_tree_text_lor_find_timing_test">
    71. 

  71. <div id="NTM_assoc">
    72. 

  72. <div id="NTM_Native_and_tree-based_locality-of-reference_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="tree_text_lor_find_timing_test_msvc.png" alt="no image" /></a></h6>NTM: Native and tree-based locality-of-reference text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
    73. 

  73. <ol>
    74. 

  74. <li>
    75. 

  75. ov_tree_map-
    76. 

  76. <a href="tree.html"><tt>tree</tt></a>
    77. 

  77.  with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
    78. 

  78. , and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
    79. 

  79. </li>
    80. 

  80. <li>
    81. 

  81. rb_tree_map-
    82. 

  82. <a href="tree.html"><tt>tree</tt></a>
    83. 

  83.  with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
    84. 

  84. , and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
    85. 

  85. </li>
    86. 

  86. <li>
    87. 

  87. n_map-
    88. 

  88. <tt>std::map</tt></li>
    89. 

  89. <li>
    90. 

  90. splay_tree_map-
    91. 

  91. <a href="tree.html"><tt>tree</tt></a>
    92. 

  92.  with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
    93. 

  93. , and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
    94. 

  94. </li>
    95. 

  95. </ol>
    96. 

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

  97. </div>
    98. 

  98. </div>
    99. 

  99. </div>
    100. 

  100. </div>
    101. 

  101. <div id="NTL_res_div">
    102. 

  102. <div id="NTL_local">
    103. 

  103. <div id="NTL_tree_text_lor_find_timing_test">
    104. 

  104. <div id="NTL_assoc">
    105. 

  105. <div id="NTL_Native_and_tree-based_locality-of-reference_text_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="tree_text_lor_find_timing_test_local.png" alt="no image" /></a></h6>NTL: Native and tree-based locality-of-reference text find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
    106. 

  106. </div>
    107. 

  107. </div>
    108. 

  108. </div>
    109. 

  109. </div>
    110. 

  110. <h2><a name="observations" id="observations">Observations</a></h2>
    111. 

  111. <p>For this setting, an ordered-vector tree ( <a href="tree.html"><tt>tree</tt></a>
    112. 

  112.     with <tt>Tag =</tt> <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a> ), a
    113. 

  113.     red-black tree ( <a href="tree.html"><tt>tree</tt></a>
    114. 

  114.     with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>rb_tree_tag</tt></a> ), and the
    115. 

  115.     native red-black tree all share approximately the same
    116. 

  116.     performance.</p>
    117. 

  117. <p>A splay tree ( <a href="tree.html"><tt>tree</tt></a>
    118. 

  118.     with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a> ) does
    119. 

  119.     much better, since each (successful) find "bubbles" the
    120. 

  120.     corresponding node to the root of the tree.</p>
    121. 

  121. <p><a href="assoc_performance_tests.html#tree_like_based_types">Observations::Tree-Like-Based
    122. 

  122.     Container Types</a> summarizes some observations on tree-based
    123. 

  123.     and trie-based containers.</p>
    124. 

  124. </div>
    125. 

  125. </body>
    126. 

  126. </html>
    127. 

  127.