|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/><meta http-equiv="X-UA-Compatible" content="IE=9"/><meta name="generator" content="Doxygen 1.8.4"/><title>tbb::interface5::concurrent_priority_queue< T, Compare, A > Class Template Reference</title><link href="tabs.css" rel="stylesheet" type="text/css"/><script type="text/javascript" src="jquery.js"></script><script type="text/javascript" src="dynsections.js"></script><link href="doxygen.css" rel="stylesheet" type="text/css" /></head><body><div id="top"><!-- do not remove this div, it is closed by doxygen! --><!-- end header part --><!-- Generated by Doxygen 1.8.4 --> <div id="navrow1" class="tabs"> <ul class="tablist"> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="pages.html"><span>Related Pages</span></a></li> <li><a href="modules.html"><span>Modules</span></a></li> <li><a href="namespaces.html"><span>Namespaces</span></a></li> <li class="current"><a href="annotated.html"><span>Classes</span></a></li> <li><a href="files.html"><span>Files</span></a></li> </ul> </div> <div id="navrow2" class="tabs2"> <ul class="tablist"> <li><a href="annotated.html"><span>Class List</span></a></li> <li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li> <li><a href="functions.html"><span>Class Members</span></a></li> </ul> </div><div id="nav-path" class="navpath"> <ul><li class="navelem"><a class="el" href="a00222.html">tbb</a></li><li class="navelem"><b>interface5</b></li><li class="navelem"><a class="el" href="a00037.html">concurrent_priority_queue</a></li> </ul></div></div><!-- top --><div class="header"> <div class="summary"><a href="#nested-classes">Classes</a> |<a href="#pub-types">Public Types</a> |<a href="#pub-methods">Public Member Functions</a> |<a href="a00339.html">List of all members</a> </div> <div class="headertitle"><div class="title">tbb::interface5::concurrent_priority_queue< T, Compare, A > Class Template Reference</div> </div></div><!--header--><div class="contents">
<p>Concurrent priority queue. <a href="a00037.html#details">More...</a></p>
<p><code>#include <concurrent_priority_queue.h></code></p><table class="memberdecls"><tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>Public Types</h2></td></tr><tr class="memitem:a2c75d97ae429019363ab6fd1a872512e"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a2c75d97ae429019363ab6fd1a872512e"></a>typedef T </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a2c75d97ae429019363ab6fd1a872512e">value_type</a></td></tr><tr class="memdesc:a2c75d97ae429019363ab6fd1a872512e"><td class="mdescLeft"> </td><td class="mdescRight">Element type in the queue. <br/></td></tr><tr class="separator:a2c75d97ae429019363ab6fd1a872512e"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ae4b7ed2ddc8ec6cc910f935c9d299c7a"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ae4b7ed2ddc8ec6cc910f935c9d299c7a"></a>typedef T & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#ae4b7ed2ddc8ec6cc910f935c9d299c7a">reference</a></td></tr><tr class="memdesc:ae4b7ed2ddc8ec6cc910f935c9d299c7a"><td class="mdescLeft"> </td><td class="mdescRight">Reference type. <br/></td></tr><tr class="separator:ae4b7ed2ddc8ec6cc910f935c9d299c7a"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a0bd617fe8e4657777e86f0ae15d8094f"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a0bd617fe8e4657777e86f0ae15d8094f"></a>typedef const T & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a0bd617fe8e4657777e86f0ae15d8094f">const_reference</a></td></tr><tr class="memdesc:a0bd617fe8e4657777e86f0ae15d8094f"><td class="mdescLeft"> </td><td class="mdescRight">Const reference type. <br/></td></tr><tr class="separator:a0bd617fe8e4657777e86f0ae15d8094f"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a7d3da9b47ec58e1c09e3550f702edcfc"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a7d3da9b47ec58e1c09e3550f702edcfc"></a>typedef size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a7d3da9b47ec58e1c09e3550f702edcfc">size_type</a></td></tr><tr class="memdesc:a7d3da9b47ec58e1c09e3550f702edcfc"><td class="mdescLeft"> </td><td class="mdescRight">Integral type for representing size of the queue. <br/></td></tr><tr class="separator:a7d3da9b47ec58e1c09e3550f702edcfc"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ae010b1fa9c0942504737228474b51a0b"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ae010b1fa9c0942504737228474b51a0b"></a>typedef ptrdiff_t </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#ae010b1fa9c0942504737228474b51a0b">difference_type</a></td></tr><tr class="memdesc:ae010b1fa9c0942504737228474b51a0b"><td class="mdescLeft"> </td><td class="mdescRight">Difference type for iterator. <br/></td></tr><tr class="separator:ae010b1fa9c0942504737228474b51a0b"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a1d2cebf242fa83d88eebdc3ad6891fb1"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a1d2cebf242fa83d88eebdc3ad6891fb1"></a>typedef A </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a></td></tr><tr class="memdesc:a1d2cebf242fa83d88eebdc3ad6891fb1"><td class="mdescLeft"> </td><td class="mdescRight">Allocator type. <br/></td></tr><tr class="separator:a1d2cebf242fa83d88eebdc3ad6891fb1"><td class="memSeparator" colspan="2"> </td></tr></table><table class="memberdecls"><tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>Public Member Functions</h2></td></tr><tr class="memitem:a405be01bac4048f214797c287e2571a1"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a405be01bac4048f214797c287e2571a1"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a405be01bac4048f214797c287e2571a1">concurrent_priority_queue</a> (const <a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a> &a=<a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a>())</td></tr><tr class="memdesc:a405be01bac4048f214797c287e2571a1"><td class="mdescLeft"> </td><td class="mdescRight">Constructs a new <a class="el" href="a00037.html" title="Concurrent priority queue. ">concurrent_priority_queue</a> with default capacity. <br/></td></tr><tr class="separator:a405be01bac4048f214797c287e2571a1"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a43c3917ea8a19cf1fec947e29ad4ff3e"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a43c3917ea8a19cf1fec947e29ad4ff3e"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a43c3917ea8a19cf1fec947e29ad4ff3e">concurrent_priority_queue</a> (<a class="el" href="a00037.html#a7d3da9b47ec58e1c09e3550f702edcfc">size_type</a> init_capacity, const <a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a> &a=<a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a>())</td></tr><tr class="memdesc:a43c3917ea8a19cf1fec947e29ad4ff3e"><td class="mdescLeft"> </td><td class="mdescRight">Constructs a new <a class="el" href="a00037.html" title="Concurrent priority queue. ">concurrent_priority_queue</a> with init_sz capacity. <br/></td></tr><tr class="separator:a43c3917ea8a19cf1fec947e29ad4ff3e"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a0cebee26cc0d00d4dcbb1c74e08029f7"><td class="memTemplParams" colspan="2"><a class="anchor" id="a0cebee26cc0d00d4dcbb1c74e08029f7"></a>template<typename InputIterator > </td></tr><tr class="memitem:a0cebee26cc0d00d4dcbb1c74e08029f7"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00037.html#a0cebee26cc0d00d4dcbb1c74e08029f7">concurrent_priority_queue</a> (InputIterator begin, InputIterator end, const <a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a> &a=<a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a>())</td></tr><tr class="memdesc:a0cebee26cc0d00d4dcbb1c74e08029f7"><td class="mdescLeft"> </td><td class="mdescRight">[begin,end) constructor <br/></td></tr><tr class="separator:a0cebee26cc0d00d4dcbb1c74e08029f7"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a111763d621fa792f281c2a13bd3e5edf"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a111763d621fa792f281c2a13bd3e5edf"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a111763d621fa792f281c2a13bd3e5edf">concurrent_priority_queue</a> (std::initializer_list< T > const &init_list, const <a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a> &a=<a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a>())</td></tr><tr class="memdesc:a111763d621fa792f281c2a13bd3e5edf"><td class="mdescLeft"> </td><td class="mdescRight">Constructor from std::initializer_list. <br/></td></tr><tr class="separator:a111763d621fa792f281c2a13bd3e5edf"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a332d26234f9c37a6b7ba269c648815d0"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a332d26234f9c37a6b7ba269c648815d0">concurrent_priority_queue</a> (const <a class="el" href="a00037.html">concurrent_priority_queue</a> &src)</td></tr><tr class="memdesc:a332d26234f9c37a6b7ba269c648815d0"><td class="mdescLeft"> </td><td class="mdescRight">Copy constructor. <a href="#a332d26234f9c37a6b7ba269c648815d0">More...</a><br/></td></tr><tr class="separator:a332d26234f9c37a6b7ba269c648815d0"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:aa52cea369b6630699ee78cc42622be9d"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#aa52cea369b6630699ee78cc42622be9d">concurrent_priority_queue</a> (const <a class="el" href="a00037.html">concurrent_priority_queue</a> &src, const <a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a> &a)</td></tr><tr class="memdesc:aa52cea369b6630699ee78cc42622be9d"><td class="mdescLeft"> </td><td class="mdescRight">Copy constructor with specific allocator. <a href="#aa52cea369b6630699ee78cc42622be9d">More...</a><br/></td></tr><tr class="separator:aa52cea369b6630699ee78cc42622be9d"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ac0c3f41b10f04547f3438517c40cf8a5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00037.html">concurrent_priority_queue</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#ac0c3f41b10f04547f3438517c40cf8a5">operator=</a> (const <a class="el" href="a00037.html">concurrent_priority_queue</a> &src)</td></tr><tr class="memdesc:ac0c3f41b10f04547f3438517c40cf8a5"><td class="mdescLeft"> </td><td class="mdescRight">Assignment operator. <a href="#ac0c3f41b10f04547f3438517c40cf8a5">More...</a><br/></td></tr><tr class="separator:ac0c3f41b10f04547f3438517c40cf8a5"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ac64c7b627708f0d6b2e5421fb0d49150"><td class="memTemplParams" colspan="2"><a class="anchor" id="ac64c7b627708f0d6b2e5421fb0d49150"></a>template<typename InputIterator > </td></tr><tr class="memitem:ac64c7b627708f0d6b2e5421fb0d49150"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00037.html#ac64c7b627708f0d6b2e5421fb0d49150">assign</a> (InputIterator begin, InputIterator end)</td></tr><tr class="memdesc:ac64c7b627708f0d6b2e5421fb0d49150"><td class="mdescLeft"> </td><td class="mdescRight">Assign the queue from [begin,end) range, not thread-safe. <br/></td></tr><tr class="separator:ac64c7b627708f0d6b2e5421fb0d49150"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ada4a58867572d9ff340c6692a226d457"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ada4a58867572d9ff340c6692a226d457"></a>void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#ada4a58867572d9ff340c6692a226d457">assign</a> (std::initializer_list< T > const &il)</td></tr><tr class="memdesc:ada4a58867572d9ff340c6692a226d457"><td class="mdescLeft"> </td><td class="mdescRight">Assign the queue from std::initializer_list, not thread-safe. <br/></td></tr><tr class="separator:ada4a58867572d9ff340c6692a226d457"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a32eb9c65caf399b62fac7c13e65af05f"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a32eb9c65caf399b62fac7c13e65af05f"></a><a class="el" href="a00037.html">concurrent_priority_queue</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a32eb9c65caf399b62fac7c13e65af05f">operator=</a> (std::initializer_list< T > const &il)</td></tr><tr class="memdesc:a32eb9c65caf399b62fac7c13e65af05f"><td class="mdescLeft"> </td><td class="mdescRight">Assign from std::initializer_list, not thread-safe. <br/></td></tr><tr class="separator:a32eb9c65caf399b62fac7c13e65af05f"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a8dec2dd0e8b22af14f1753eaef1bf5eb"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a8dec2dd0e8b22af14f1753eaef1bf5eb">empty</a> () const </td></tr><tr class="memdesc:a8dec2dd0e8b22af14f1753eaef1bf5eb"><td class="mdescLeft"> </td><td class="mdescRight">Returns true if empty, false otherwise. <a href="#a8dec2dd0e8b22af14f1753eaef1bf5eb">More...</a><br/></td></tr><tr class="separator:a8dec2dd0e8b22af14f1753eaef1bf5eb"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a7d86ba200474b51ec99a6b917429c6bb"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00037.html#a7d3da9b47ec58e1c09e3550f702edcfc">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a7d86ba200474b51ec99a6b917429c6bb">size</a> () const </td></tr><tr class="memdesc:a7d86ba200474b51ec99a6b917429c6bb"><td class="mdescLeft"> </td><td class="mdescRight">Returns the current number of elements contained in the queue. <a href="#a7d86ba200474b51ec99a6b917429c6bb">More...</a><br/></td></tr><tr class="separator:a7d86ba200474b51ec99a6b917429c6bb"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a1bfa0e7269b3407d6bb5c706264d2406"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a1bfa0e7269b3407d6bb5c706264d2406">push</a> (<a class="el" href="a00037.html#a0bd617fe8e4657777e86f0ae15d8094f">const_reference</a> elem)</td></tr><tr class="memdesc:a1bfa0e7269b3407d6bb5c706264d2406"><td class="mdescLeft"> </td><td class="mdescRight">Pushes elem onto the queue, increasing capacity of queue if necessary. <a href="#a1bfa0e7269b3407d6bb5c706264d2406">More...</a><br/></td></tr><tr class="separator:a1bfa0e7269b3407d6bb5c706264d2406"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a954177b09e184cf3db47f1b180a7ef5e"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a954177b09e184cf3db47f1b180a7ef5e">try_pop</a> (<a class="el" href="a00037.html#ae4b7ed2ddc8ec6cc910f935c9d299c7a">reference</a> elem)</td></tr><tr class="memdesc:a954177b09e184cf3db47f1b180a7ef5e"><td class="mdescLeft"> </td><td class="mdescRight">Gets a reference to and removes highest priority element. <a href="#a954177b09e184cf3db47f1b180a7ef5e">More...</a><br/></td></tr><tr class="separator:a954177b09e184cf3db47f1b180a7ef5e"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a2459166998a4103880d603b237c429e6"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a2459166998a4103880d603b237c429e6">clear</a> ()</td></tr><tr class="memdesc:a2459166998a4103880d603b237c429e6"><td class="mdescLeft"> </td><td class="mdescRight">Clear the queue; not thread-safe. <a href="#a2459166998a4103880d603b237c429e6">More...</a><br/></td></tr><tr class="separator:a2459166998a4103880d603b237c429e6"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:aa6ee6d356e538b67a7cb4e242e6e36c9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#aa6ee6d356e538b67a7cb4e242e6e36c9">swap</a> (<a class="el" href="a00037.html">concurrent_priority_queue</a> &q)</td></tr><tr class="memdesc:aa6ee6d356e538b67a7cb4e242e6e36c9"><td class="mdescLeft"> </td><td class="mdescRight">Swap this queue with another; not thread-safe. <a href="#aa6ee6d356e538b67a7cb4e242e6e36c9">More...</a><br/></td></tr><tr class="separator:aa6ee6d356e538b67a7cb4e242e6e36c9"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a312e88e51246da4c516d35abbb30721a"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a312e88e51246da4c516d35abbb30721a"></a><a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00037.html#a312e88e51246da4c516d35abbb30721a">get_allocator</a> () const </td></tr><tr class="memdesc:a312e88e51246da4c516d35abbb30721a"><td class="mdescLeft"> </td><td class="mdescRight">Return allocator object. <br/></td></tr><tr class="separator:a312e88e51246da4c516d35abbb30721a"><td class="memSeparator" colspan="2"> </td></tr></table><a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2><div class="textblock"><h3>template<typename T, typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>><br/>class tbb::interface5::concurrent_priority_queue< T, Compare, A ></h3>
<p>Concurrent priority queue. </p></div><h2 class="groupheader">Constructor & Destructor Documentation</h2><a class="anchor" id="a332d26234f9c37a6b7ba269c648815d0"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname"><a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::<a class="el" href="a00037.html">concurrent_priority_queue</a> </td> <td>(</td> <td class="paramtype">const <a class="el" href="a00037.html">concurrent_priority_queue</a>< T, Compare, A > & </td> <td class="paramname"><em>src</em>)</td><td></td> <td></td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td> </tr></table></div><div class="memdoc">
<p>Copy constructor. </p><p>This operation is unsafe if there are pending concurrent operations on the src queue. </p>
</div></div><a class="anchor" id="aa52cea369b6630699ee78cc42622be9d"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname"><a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::<a class="el" href="a00037.html">concurrent_priority_queue</a> </td> <td>(</td> <td class="paramtype">const <a class="el" href="a00037.html">concurrent_priority_queue</a>< T, Compare, A > & </td> <td class="paramname"><em>src</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">const <a class="el" href="a00037.html#a1d2cebf242fa83d88eebdc3ad6891fb1">allocator_type</a> & </td> <td class="paramname"><em>a</em> </td> </tr> <tr> <td></td> <td>)</td> <td></td><td></td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Copy constructor with specific allocator. </p><p>This operation is unsafe if there are pending concurrent operations on the src queue. </p>
</div></div><h2 class="groupheader">Member Function Documentation</h2><a class="anchor" id="a2459166998a4103880d603b237c429e6"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">void <a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::clear </td> <td>(</td> <td class="paramname">)</td><td></td> <td></td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Clear the queue; not thread-safe. </p><p>This operation is unsafe if there are pending concurrent operations on the queue. Resets size, effectively emptying queue; does not free space. May not clear elements added in pending operations. </p>
</div></div><a class="anchor" id="a8dec2dd0e8b22af14f1753eaef1bf5eb"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">bool <a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::empty </td> <td>(</td> <td class="paramname">)</td><td></td> <td> const</td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Returns true if empty, false otherwise. </p><p>Returned value may not reflect results of pending operations. This operation reads shared data and will trigger a race condition. </p>
</div></div><a class="anchor" id="ac0c3f41b10f04547f3438517c40cf8a5"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname"><a class="el" href="a00037.html">concurrent_priority_queue</a>& <a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::operator= </td> <td>(</td> <td class="paramtype">const <a class="el" href="a00037.html">concurrent_priority_queue</a>< T, Compare, A > & </td> <td class="paramname"><em>src</em>)</td><td></td> <td></td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Assignment operator. </p><p>This operation is unsafe if there are pending concurrent operations on the src queue. </p>
</div></div><a class="anchor" id="a1bfa0e7269b3407d6bb5c706264d2406"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">void <a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::push </td> <td>(</td> <td class="paramtype"><a class="el" href="a00037.html#a0bd617fe8e4657777e86f0ae15d8094f">const_reference</a> </td> <td class="paramname"><em>elem</em>)</td><td></td> <td></td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Pushes elem onto the queue, increasing capacity of queue if necessary. </p><p>This operation can be safely used concurrently with other push, try_pop or reserve operations. </p>
</div></div><a class="anchor" id="a7d86ba200474b51ec99a6b917429c6bb"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname"><a class="el" href="a00037.html#a7d3da9b47ec58e1c09e3550f702edcfc">size_type</a> <a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::size </td> <td>(</td> <td class="paramname">)</td><td></td> <td> const</td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Returns the current number of elements contained in the queue. </p><p>Returned value may not reflect results of pending operations. This operation reads shared data and will trigger a race condition. </p>
</div></div><a class="anchor" id="aa6ee6d356e538b67a7cb4e242e6e36c9"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">void <a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::swap </td> <td>(</td> <td class="paramtype"><a class="el" href="a00037.html">concurrent_priority_queue</a>< T, Compare, A > & </td> <td class="paramname"><em>q</em>)</td><td></td> <td></td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Swap this queue with another; not thread-safe. </p><p>This operation is unsafe if there are pending concurrent operations on the queue. </p>
</div></div><a class="anchor" id="a954177b09e184cf3db47f1b180a7ef5e"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , typename Compare = std::less<T>, typename A = cache_aligned_allocator<T>> </div><table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">bool <a class="el" href="a00037.html">tbb::interface5::concurrent_priority_queue</a>< T, Compare, A >::try_pop </td> <td>(</td> <td class="paramtype"><a class="el" href="a00037.html#ae4b7ed2ddc8ec6cc910f935c9d299c7a">reference</a> </td> <td class="paramname"><em>elem</em>)</td><td></td> <td></td> </tr> </table> </td> <td class="mlabels-right"><span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr></table></div><div class="memdoc">
<p>Gets a reference to and removes highest priority element. </p><p>If a highest priority element was found, sets elem and returns true, otherwise returns false. This operation can be safely used concurrently with other push, try_pop or reserve operations. </p>
</div></div><hr/>The documentation for this class was generated from the following file:<ul><li>concurrent_priority_queue.h</li></ul></div><!-- contents --><hr><p></p>Copyright © 2005-2014 Intel Corporation. All Rights Reserved.<p></p>Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune areregistered trademarks or trademarks of Intel Corporation or itssubsidiaries in the United States and other countries.<p></p>* Other names and brands may be claimed as the property of others.
|
