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.

51 lines
6.9 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::interface5::concurrent_priority_queue&lt; T, Compare, A &gt; Member List</h1>This is the complete list of members for <a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a>, including all inherited members.<p><table>
  24. <tr class="memlist"><td><a class="el" href="a00285.html#1712cb3a46bc1821fccc5e2cd83d5cd7">allocator_type</a> typedef</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td></td></tr>
  25. <tr class="memlist"><td><a class="el" href="a00285.html#0bdcdf7cde9fd369edca845bec34ca94">clear</a>()</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  26. <tr class="memlist"><td><a class="el" href="a00285.html#eefa40599afe00ea393897d8f5662e65">concurrent_priority_queue</a>(const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline, explicit]</code></td></tr>
  27. <tr class="memlist"><td><a class="el" href="a00285.html#4555b4a55415a70024c4004b51e9f385">concurrent_priority_queue</a>(size_type init_capacity, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline, explicit]</code></td></tr>
  28. <tr class="memlist"><td><a class="el" href="a00285.html#9147cb4207017c260a0c3929c12cd40f">concurrent_priority_queue</a>(InputIterator begin, InputIterator end, const allocator_type &amp;a=allocator_type())</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  29. <tr class="memlist"><td><a class="el" href="a00285.html#509419e320f200456d89dc54a65140b3">concurrent_priority_queue</a>(const concurrent_priority_queue &amp;src)</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline, explicit]</code></td></tr>
  30. <tr class="memlist"><td><a class="el" href="a00285.html#c8b20e7430c5302936030bef59a562be">concurrent_priority_queue</a>(const concurrent_priority_queue &amp;src, const allocator_type &amp;a)</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  31. <tr class="memlist"><td><a class="el" href="a00285.html#a4ded8601a434098605be0dcc4febc60">const_reference</a> typedef</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td></td></tr>
  32. <tr class="memlist"><td><a class="el" href="a00285.html#77399bc76b3ecd60e33f7e35a5becd87">difference_type</a> typedef</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td></td></tr>
  33. <tr class="memlist"><td><a class="el" href="a00285.html#317c508fa92df218be5d014c26c09bb7">empty</a>() const </td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  34. <tr class="memlist"><td><a class="el" href="a00285.html#d545d444fb0d16148f9b61fd89f9a337">get_allocator</a>() const </td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  35. <tr class="memlist"><td><a class="el" href="a00285.html#2ab7f7808891027ac0f0f5b3a4be51e9">operator=</a>(const concurrent_priority_queue &amp;src)</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  36. <tr class="memlist"><td><a class="el" href="a00285.html#d905af7b8f6defff562f5ae9c3275763">push</a>(const_reference elem)</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  37. <tr class="memlist"><td><a class="el" href="a00285.html#5804b3c708ef4e50d603f918ef2b9e58">reference</a> typedef</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td></td></tr>
  38. <tr class="memlist"><td><a class="el" href="a00285.html#8b2ae25c61338c6fd59e94fe09822ba5">size</a>() const </td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  39. <tr class="memlist"><td><a class="el" href="a00285.html#b679eea8d01d041625a39f719ca2b7ed">size_type</a> typedef</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td></td></tr>
  40. <tr class="memlist"><td><a class="el" href="a00285.html#0ecdc6a04aa259374425d424ca2a6082">swap</a>(concurrent_priority_queue &amp;q)</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  41. <tr class="memlist"><td><a class="el" href="a00285.html#e036461a29cc40902a2bb79abf9f5146">try_pop</a>(reference elem)</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td><code> [inline]</code></td></tr>
  42. <tr class="memlist"><td><a class="el" href="a00285.html#7c611a6b5b8f94b0e7f2afc97e31efb1">value_type</a> typedef</td><td><a class="el" href="a00285.html">tbb::interface5::concurrent_priority_queue&lt; T, Compare, A &gt;</a></td><td></td></tr>
  43. </table><hr>
  44. <p></p>
  45. Copyright &copy; 2005-2013 Intel Corporation. All Rights Reserved.
  46. <p></p>
  47. Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
  48. registered trademarks or trademarks of Intel Corporation or its
  49. subsidiaries in the United States and other countries.
  50. <p></p>
  51. * Other names and brands may be claimed as the property of others.