You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

84 lines
11 KiB

  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  2. <html xmlns="http://www.w3.org/1999/xhtml">
  3. <head>
  4. <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
  5. <meta http-equiv="X-UA-Compatible" content="IE=9"/>
  6. <meta name="generator" content="Doxygen 1.8.4"/>
  7. <title>Member List</title>
  8. <link href="tabs.css" rel="stylesheet" type="text/css"/>
  9. <script type="text/javascript" src="jquery.js"></script>
  10. <script type="text/javascript" src="dynsections.js"></script>
  11. <link href="doxygen.css" rel="stylesheet" type="text/css" />
  12. </head>
  13. <body>
  14. <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
  15. <!-- end header part -->
  16. <!-- Generated by Doxygen 1.8.4 -->
  17. <div id="navrow1" class="tabs">
  18. <ul class="tablist">
  19. <li><a href="index.html"><span>Main&#160;Page</span></a></li>
  20. <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
  21. <li><a href="modules.html"><span>Modules</span></a></li>
  22. <li><a href="namespaces.html"><span>Namespaces</span></a></li>
  23. <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
  24. <li><a href="files.html"><span>Files</span></a></li>
  25. </ul>
  26. </div>
  27. <div id="navrow2" class="tabs2">
  28. <ul class="tablist">
  29. <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
  30. <li><a href="hierarchy.html"><span>Class&#160;Hierarchy</span></a></li>
  31. <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
  32. </ul>
  33. </div>
  34. <div id="nav-path" class="navpath">
  35. <ul>
  36. <li class="navelem"><a class="el" href="a00222.html">tbb</a></li><li class="navelem"><a class="el" href="a00034.html">concurrent_bounded_queue</a></li> </ul>
  37. </div>
  38. </div><!-- top -->
  39. <div class="header">
  40. <div class="headertitle">
  41. <div class="title">tbb::concurrent_bounded_queue&lt; T, A &gt; Member List</div> </div>
  42. </div><!--header-->
  43. <div class="contents">
  44. <p>This is the complete list of members for <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>, including all inherited members.</p>
  45. <table class="directory">
  46. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a77a755d94cabf5208905d10d5b57419c">abort</a>()</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  47. <tr><td class="entry"><a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a> typedef</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  48. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a526487063242569685af8c8d778d39e0">capacity</a>() const </td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  49. <tr><td class="entry"><a class="el" href="a00034.html#a246be3920e079ea4847933f106baa98f">clear</a>()</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  50. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a85f8a800cae02b601f36ad7a655a0126">concurrent_bounded_queue</a>(const allocator_type &amp;a=allocator_type())</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
  51. <tr><td class="entry"><a class="el" href="a00034.html#aad6fd2353d64c2c31d074cd99df58c02">concurrent_bounded_queue</a>(const concurrent_bounded_queue &amp;src, const allocator_type &amp;a=allocator_type())</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  52. <tr class="even"><td class="entry"><a class="el" href="a00034.html#afcfdc998e106fdb7b2dfa5df880cd9cf">concurrent_bounded_queue</a>(InputIterator begin, InputIterator end, const allocator_type &amp;a=allocator_type())</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  53. <tr bgcolor="#f0f0f0"><td class="entry"><b>const_iterator</b> typedef (defined in <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  54. <tr class="even"><td class="entry"><a class="el" href="a00034.html#af838e520ce0db2c22369748c019b11cb">const_reference</a> typedef</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  55. <tr><td class="entry"><a class="el" href="a00034.html#a72725361e050c5a981035a20ef1b773e">difference_type</a> typedef</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  56. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a8c59578f28c5fb4718b0eff43776e879">empty</a>() const </td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  57. <tr><td class="entry"><a class="el" href="a00034.html#aaeba11bbcd368a7a3a6e6e2dd3082c9c">get_allocator</a>() const </td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  58. <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>internal::concurrent_queue_iterator</b> (defined in <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">friend</span></td></tr>
  59. <tr bgcolor="#f0f0f0"><td class="entry"><b>iterator</b> typedef (defined in <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  60. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a87926c31967a918ce80690a9ed5d6fa8">pop</a>(T &amp;destination)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  61. <tr><td class="entry"><a class="el" href="a00034.html#ae5e9051772bbc93b2ccb8fd0a98a21f5">push</a>(const T &amp;source)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  62. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a5fa4002bcd265d9d3ed305e3b686f1da">reference</a> typedef</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  63. <tr><td class="entry"><a class="el" href="a00034.html#a768699675813575eec08c1f43afda395">set_capacity</a>(size_type new_capacity)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  64. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a9d6c20fd8c193c12b6a7b0c3101fd966">size</a>() const </td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  65. <tr><td class="entry"><a class="el" href="a00034.html#ae73fa352d781bdb9d01bfb77f2a8bc28">size_type</a> typedef</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  66. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a3086cb4dcdeee245ef5cf34f72fb3e10">try_pop</a>(T &amp;destination)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  67. <tr><td class="entry"><a class="el" href="a00034.html#a03d93a240841a21788396bebd71c51bd">try_push</a>(const T &amp;source)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  68. <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>unsafe_begin</b>() (defined in <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  69. <tr bgcolor="#f0f0f0"><td class="entry"><b>unsafe_begin</b>() const (defined in <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  70. <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>unsafe_end</b>() (defined in <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  71. <tr bgcolor="#f0f0f0"><td class="entry"><b>unsafe_end</b>() const (defined in <a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  72. <tr class="even"><td class="entry"><a class="el" href="a00034.html#a6eb564625fef03dd9a5881d5d4e52f9f">value_type</a> typedef</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  73. <tr><td class="entry"><a class="el" href="a00034.html#ab1291bf6837ecfb8836c24dde5dd80b5">~concurrent_bounded_queue</a>()</td><td class="entry"><a class="el" href="a00034.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td class="entry"></td></tr>
  74. </table></div><!-- contents -->
  75. <hr>
  76. <p></p>
  77. Copyright &copy; 2005-2014 Intel Corporation. All Rights Reserved.
  78. <p></p>
  79. Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
  80. registered trademarks or trademarks of Intel Corporation or its
  81. subsidiaries in the United States and other countries.
  82. <p></p>
  83. * Other names and brands may be claimed as the property of others.