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.

60 lines
8.6 KiB

  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
  2. <html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
  3. <title>Member List</title>
  4. <link href="doxygen.css" rel="stylesheet" type="text/css">
  5. <link href="tabs.css" rel="stylesheet" type="text/css">
  6. </head><body>
  7. <!-- Generated by Doxygen 1.4.7 -->
  8. <div class="tabs">
  9. <ul>
  10. <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  11. <li><a href="modules.html"><span>Modules</span></a></li>
  12. <li><a href="namespaces.html"><span>Namespaces</span></a></li>
  13. <li id="current"><a href="annotated.html"><span>Classes</span></a></li>
  14. <li><a href="files.html"><span>Files</span></a></li>
  15. <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  16. </ul></div>
  17. <div class="tabs">
  18. <ul>
  19. <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
  20. <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
  21. <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  22. </ul></div>
  23. <h1>tbb::concurrent_bounded_queue&lt; T, A &gt; Member List</h1>This is the complete list of members for <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>, including all inherited members.<p><table>
  24. <tr class="memlist"><td><a class="el" href="a00280.html#86c77a6c1317239405968f5afc7b10d3">abort</a>()</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  25. <tr class="memlist"><td><a class="el" href="a00280.html#2e2726fccf6d975dc1071608cc0bbf90">allocator_type</a> typedef</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  26. <tr class="memlist"><td><a class="el" href="a00280.html#b2888b3e4e837d7e03f2c731963a402b">capacity</a>() const </td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  27. <tr class="memlist"><td><a class="el" href="a00280.html#90b31e2954c6e4596c7900435a5f4bc1">clear</a>()</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  28. <tr class="memlist"><td><a class="el" href="a00280.html#e3525226732963ff0f13e89d8e6dab5b">concurrent_bounded_queue</a>(const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline, explicit]</code></td></tr>
  29. <tr class="memlist"><td><a class="el" href="a00280.html#7b7fb414d2eaa8a7f5d68fc4cd63ac50">concurrent_bounded_queue</a>(const concurrent_bounded_queue &amp;src, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  30. <tr class="memlist"><td><a class="el" href="a00280.html#a5e04dcd7db9fd9b583b4e7df832246a">concurrent_bounded_queue</a>(InputIterator begin, InputIterator end, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  31. <tr bgcolor="#f0f0f0"><td><b>const_iterator</b> typedef (defined in <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  32. <tr class="memlist"><td><a class="el" href="a00280.html#796713d0b9ba93a4721cbe13e4474068">const_reference</a> typedef</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  33. <tr class="memlist"><td><a class="el" href="a00280.html#4b45c91297e69515d83d5eef85ae1f49">difference_type</a> typedef</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  34. <tr class="memlist"><td><a class="el" href="a00280.html#f64924f2ee9225c368a270fc3c394db9">empty</a>() const </td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  35. <tr class="memlist"><td><a class="el" href="a00280.html#415eb87e53b1c6a266de06ecbc490d16">get_allocator</a>() const </td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  36. <tr bgcolor="#f0f0f0"><td><b>internal::concurrent_queue_iterator</b> (defined in <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [friend]</code></td></tr>
  37. <tr bgcolor="#f0f0f0"><td><b>iterator</b> typedef (defined in <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  38. <tr class="memlist"><td><a class="el" href="a00280.html#41f4c6bd7a82ab070e840bbf81b0b123">pop</a>(T &amp;destination)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  39. <tr class="memlist"><td><a class="el" href="a00280.html#ceb08c743b11ba88c878e73fff8af20b">push</a>(const T &amp;source)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  40. <tr class="memlist"><td><a class="el" href="a00280.html#dcd44ca6a88c0dc7a847a47a10811f0c">reference</a> typedef</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  41. <tr class="memlist"><td><a class="el" href="a00280.html#f3c6c934f85fd02aedbc83a16943193b">set_capacity</a>(size_type new_capacity)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  42. <tr class="memlist"><td><a class="el" href="a00280.html#7dc14d1a579a4cccda9f857585e1768d">size</a>() const </td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  43. <tr class="memlist"><td><a class="el" href="a00280.html#a80e4c11dbb324e4b92a24a77bbcde68">size_type</a> typedef</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  44. <tr class="memlist"><td><a class="el" href="a00280.html#0ca487019bbb00a196442aff78a1e4f7">try_pop</a>(T &amp;destination)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  45. <tr class="memlist"><td><a class="el" href="a00280.html#2bd6232531279fb3ccbd296bea23066b">try_push</a>(const T &amp;source)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  46. <tr bgcolor="#f0f0f0"><td><b>unsafe_begin</b>() (defined in <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  47. <tr bgcolor="#f0f0f0"><td><b>unsafe_begin</b>() const (defined in <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  48. <tr bgcolor="#f0f0f0"><td><b>unsafe_end</b>() (defined in <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  49. <tr bgcolor="#f0f0f0"><td><b>unsafe_end</b>() const (defined in <a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a>)</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td><code> [inline]</code></td></tr>
  50. <tr class="memlist"><td><a class="el" href="a00280.html#98245517a931e5893f6601e66c51fc75">value_type</a> typedef</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  51. <tr class="memlist"><td><a class="el" href="a00280.html#acaf5b510dc0dfc7780b8c956cf773cf">~concurrent_bounded_queue</a>()</td><td><a class="el" href="a00280.html">tbb::concurrent_bounded_queue&lt; T, A &gt;</a></td><td></td></tr>
  52. </table><hr>
  53. <p></p>
  54. Copyright &copy; 2005-2013 Intel Corporation. All Rights Reserved.
  55. <p></p>
  56. Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
  57. registered trademarks or trademarks of Intel Corporation or its
  58. subsidiaries in the United States and other countries.
  59. <p></p>
  60. * Other names and brands may be claimed as the property of others.