|
|
<!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::deprecated::concurrent_queue< T, 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>deprecated</b></li><li class="navelem"><a class="el" href="a00039.html">concurrent_queue</a></li> </ul></div></div><!-- top --><div class="header"> <div class="summary"><a href="#pub-types">Public Types</a> |<a href="#pub-methods">Public Member Functions</a> |<a href="#friends">Friends</a> |<a href="a00307.html">List of all members</a> </div> <div class="headertitle"><div class="title">tbb::deprecated::concurrent_queue< T, A > Class Template Reference</div> </div></div><!--header--><div class="contents">
<p>A high-performance thread-safe blocking concurrent bounded queue. <a href="a00039.html#details">More...</a></p>
<p><code>#include <concurrent_queue.h></code></p><div class="dynheader">Inheritance diagram for tbb::deprecated::concurrent_queue< T, A >:</div><div class="dyncontent"> <div class="center"> <img src="a00039.png" usemap="#tbb::deprecated::concurrent_queue< T, A >_map" alt=""/> <map id="tbb::deprecated::concurrent_queue< T, A >_map" name="tbb::deprecated::concurrent_queue< T, A >_map"><area href="a00034.html" title="A high-performance thread-safe blocking concurrent bounded queue. " alt="tbb::concurrent_bounded_queue< T, A >" shape="rect" coords="0,56,257,80"/></map> </div></div><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:a112f9c42f53dffaa9c40476b3c9f0163"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a112f9c42f53dffaa9c40476b3c9f0163"></a>typedef <br class="typebreak"/><a class="el" href="a00034.html">concurrent_bounded_queue</a>< T, A ><br class="typebreak"/>::iterator </td><td class="memItemRight" valign="bottom"><b>iterator</b></td></tr><tr class="separator:a112f9c42f53dffaa9c40476b3c9f0163"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ada4cdd6e903dd46e3788c9d8feaba85d"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ada4cdd6e903dd46e3788c9d8feaba85d"></a>typedef <br class="typebreak"/><a class="el" href="a00034.html">concurrent_bounded_queue</a>< T, A ><br class="typebreak"/>::const_iterator </td><td class="memItemRight" valign="bottom"><b>const_iterator</b></td></tr><tr class="separator:ada4cdd6e903dd46e3788c9d8feaba85d"><td class="memSeparator" colspan="2"> </td></tr><tr class="inherit_header pub_types_a00034"><td colspan="2" onclick="javascript:toggleInherit('pub_types_a00034')"><img src="closed.png" alt="-"/> Public Types inherited from <a class="el" href="a00034.html">tbb::concurrent_bounded_queue< T, A ></a></td></tr><tr class="memitem:a6eb564625fef03dd9a5881d5d4e52f9f inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a6eb564625fef03dd9a5881d5d4e52f9f"></a>typedef T </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a6eb564625fef03dd9a5881d5d4e52f9f">value_type</a></td></tr><tr class="memdesc:a6eb564625fef03dd9a5881d5d4e52f9f inherit pub_types_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Element type in the queue. <br/></td></tr><tr class="separator:a6eb564625fef03dd9a5881d5d4e52f9f inherit pub_types_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:acbfceb845de1c770e2b56409f09b0364 inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="acbfceb845de1c770e2b56409f09b0364"></a>typedef A </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a></td></tr><tr class="memdesc:acbfceb845de1c770e2b56409f09b0364 inherit pub_types_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Allocator type. <br/></td></tr><tr class="separator:acbfceb845de1c770e2b56409f09b0364 inherit pub_types_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a5fa4002bcd265d9d3ed305e3b686f1da inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a5fa4002bcd265d9d3ed305e3b686f1da"></a>typedef T & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a5fa4002bcd265d9d3ed305e3b686f1da">reference</a></td></tr><tr class="memdesc:a5fa4002bcd265d9d3ed305e3b686f1da inherit pub_types_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Reference type. <br/></td></tr><tr class="separator:a5fa4002bcd265d9d3ed305e3b686f1da inherit pub_types_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:af838e520ce0db2c22369748c019b11cb inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="af838e520ce0db2c22369748c019b11cb"></a>typedef const T & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#af838e520ce0db2c22369748c019b11cb">const_reference</a></td></tr><tr class="memdesc:af838e520ce0db2c22369748c019b11cb inherit pub_types_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Const reference type. <br/></td></tr><tr class="separator:af838e520ce0db2c22369748c019b11cb inherit pub_types_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ae73fa352d781bdb9d01bfb77f2a8bc28 inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top">typedef std::ptrdiff_t </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#ae73fa352d781bdb9d01bfb77f2a8bc28">size_type</a></td></tr><tr class="memdesc:ae73fa352d781bdb9d01bfb77f2a8bc28 inherit pub_types_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Integral type for representing size of the queue. <a href="#ae73fa352d781bdb9d01bfb77f2a8bc28">More...</a><br/></td></tr><tr class="separator:ae73fa352d781bdb9d01bfb77f2a8bc28 inherit pub_types_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a72725361e050c5a981035a20ef1b773e inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a72725361e050c5a981035a20ef1b773e"></a>typedef std::ptrdiff_t </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a72725361e050c5a981035a20ef1b773e">difference_type</a></td></tr><tr class="memdesc:a72725361e050c5a981035a20ef1b773e inherit pub_types_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Difference type for iterator. <br/></td></tr><tr class="separator:a72725361e050c5a981035a20ef1b773e inherit pub_types_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a42dfb71b1e4bdc0da3c1217d0d40ddd5 inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a42dfb71b1e4bdc0da3c1217d0d40ddd5"></a>typedef <br class="typebreak"/>internal::concurrent_queue_iterator<br class="typebreak"/>< <a class="el" href="a00034.html">concurrent_bounded_queue</a>, T > </td><td class="memItemRight" valign="bottom"><b>iterator</b></td></tr><tr class="separator:a42dfb71b1e4bdc0da3c1217d0d40ddd5 inherit pub_types_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a18049841284051e18b854692bd04602c inherit pub_types_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a18049841284051e18b854692bd04602c"></a>typedef <br class="typebreak"/>internal::concurrent_queue_iterator<br class="typebreak"/>< <a class="el" href="a00034.html">concurrent_bounded_queue</a>, <br class="typebreak"/>const T > </td><td class="memItemRight" valign="bottom"><b>const_iterator</b></td></tr><tr class="separator:a18049841284051e18b854692bd04602c inherit pub_types_a00034"><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:adc192aba16ef123aebbc4ada0fb53708"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="adc192aba16ef123aebbc4ada0fb53708"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00039.html#adc192aba16ef123aebbc4ada0fb53708">concurrent_queue</a> (const A &a=A())</td></tr><tr class="memdesc:adc192aba16ef123aebbc4ada0fb53708"><td class="mdescLeft"> </td><td class="mdescRight">Construct empty queue. <br/></td></tr><tr class="separator:adc192aba16ef123aebbc4ada0fb53708"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:aa7d1fb274d89c0109fa72d9d87ed329d"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aa7d1fb274d89c0109fa72d9d87ed329d"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00039.html#aa7d1fb274d89c0109fa72d9d87ed329d">concurrent_queue</a> (const <a class="el" href="a00039.html">concurrent_queue</a> &src, const A &a=A())</td></tr><tr class="memdesc:aa7d1fb274d89c0109fa72d9d87ed329d"><td class="mdescLeft"> </td><td class="mdescRight">Copy constructor. <br/></td></tr><tr class="separator:aa7d1fb274d89c0109fa72d9d87ed329d"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a93a2e58af05f73a763cc23c32d4de010"><td class="memTemplParams" colspan="2"><a class="anchor" id="a93a2e58af05f73a763cc23c32d4de010"></a>template<typename InputIterator > </td></tr><tr class="memitem:a93a2e58af05f73a763cc23c32d4de010"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00039.html#a93a2e58af05f73a763cc23c32d4de010">concurrent_queue</a> (InputIterator b, InputIterator e, const A &a=A())</td></tr><tr class="memdesc:a93a2e58af05f73a763cc23c32d4de010"><td class="mdescLeft"> </td><td class="mdescRight">[begin,end) constructor <br/></td></tr><tr class="separator:a93a2e58af05f73a763cc23c32d4de010"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a129cde9f5f101ddd623619c838be07f3"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00039.html#a129cde9f5f101ddd623619c838be07f3">push_if_not_full</a> (const T &source)</td></tr><tr class="memdesc:a129cde9f5f101ddd623619c838be07f3"><td class="mdescLeft"> </td><td class="mdescRight">Enqueue an item at tail of queue if queue is not already full. <a href="#a129cde9f5f101ddd623619c838be07f3">More...</a><br/></td></tr><tr class="separator:a129cde9f5f101ddd623619c838be07f3"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a8d6825341ca673ea316202474a021174"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00039.html#a8d6825341ca673ea316202474a021174">pop_if_present</a> (T &destination)</td></tr><tr class="memdesc:a8d6825341ca673ea316202474a021174"><td class="mdescLeft"> </td><td class="mdescRight">Attempt to dequeue an item from head of queue. <a href="#a8d6825341ca673ea316202474a021174">More...</a><br/></td></tr><tr class="separator:a8d6825341ca673ea316202474a021174"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ad648858b6ba8bd3b4ad8f886de855c42"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ad648858b6ba8bd3b4ad8f886de855c42"></a>iterator </td><td class="memItemRight" valign="bottom"><b>begin</b> ()</td></tr><tr class="separator:ad648858b6ba8bd3b4ad8f886de855c42"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a6539cec6179a0f51ad78d69aed406b86"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a6539cec6179a0f51ad78d69aed406b86"></a>iterator </td><td class="memItemRight" valign="bottom"><b>end</b> ()</td></tr><tr class="separator:a6539cec6179a0f51ad78d69aed406b86"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a171c35afe03799768bd08ab6bfe438d5"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a171c35afe03799768bd08ab6bfe438d5"></a>const_iterator </td><td class="memItemRight" valign="bottom"><b>begin</b> () const </td></tr><tr class="separator:a171c35afe03799768bd08ab6bfe438d5"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:aec0ba8d8052b1669468ea5bb7345927c"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aec0ba8d8052b1669468ea5bb7345927c"></a>const_iterator </td><td class="memItemRight" valign="bottom"><b>end</b> () const </td></tr><tr class="separator:aec0ba8d8052b1669468ea5bb7345927c"><td class="memSeparator" colspan="2"> </td></tr><tr class="inherit_header pub_methods_a00034"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_a00034')"><img src="closed.png" alt="-"/> Public Member Functions inherited from <a class="el" href="a00034.html">tbb::concurrent_bounded_queue< T, A ></a></td></tr><tr class="memitem:a85f8a800cae02b601f36ad7a655a0126 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a85f8a800cae02b601f36ad7a655a0126"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a85f8a800cae02b601f36ad7a655a0126">concurrent_bounded_queue</a> (const <a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a> &a=<a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a>())</td></tr><tr class="memdesc:a85f8a800cae02b601f36ad7a655a0126 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Construct empty queue. <br/></td></tr><tr class="separator:a85f8a800cae02b601f36ad7a655a0126 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:aad6fd2353d64c2c31d074cd99df58c02 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aad6fd2353d64c2c31d074cd99df58c02"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#aad6fd2353d64c2c31d074cd99df58c02">concurrent_bounded_queue</a> (const <a class="el" href="a00034.html">concurrent_bounded_queue</a> &src, const <a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a> &a=<a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a>())</td></tr><tr class="memdesc:aad6fd2353d64c2c31d074cd99df58c02 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Copy constructor. <br/></td></tr><tr class="separator:aad6fd2353d64c2c31d074cd99df58c02 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:afcfdc998e106fdb7b2dfa5df880cd9cf inherit pub_methods_a00034"><td class="memTemplParams" colspan="2"><a class="anchor" id="afcfdc998e106fdb7b2dfa5df880cd9cf"></a>template<typename InputIterator > </td></tr><tr class="memitem:afcfdc998e106fdb7b2dfa5df880cd9cf inherit pub_methods_a00034"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00034.html#afcfdc998e106fdb7b2dfa5df880cd9cf">concurrent_bounded_queue</a> (InputIterator begin, InputIterator end, const <a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a> &a=<a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a>())</td></tr><tr class="memdesc:afcfdc998e106fdb7b2dfa5df880cd9cf inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">[begin,end) constructor <br/></td></tr><tr class="separator:afcfdc998e106fdb7b2dfa5df880cd9cf inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ab1291bf6837ecfb8836c24dde5dd80b5 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ab1291bf6837ecfb8836c24dde5dd80b5"></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#ab1291bf6837ecfb8836c24dde5dd80b5">~concurrent_bounded_queue</a> ()</td></tr><tr class="memdesc:ab1291bf6837ecfb8836c24dde5dd80b5 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Destroy queue. <br/></td></tr><tr class="separator:ab1291bf6837ecfb8836c24dde5dd80b5 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ae5e9051772bbc93b2ccb8fd0a98a21f5 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ae5e9051772bbc93b2ccb8fd0a98a21f5"></a>void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#ae5e9051772bbc93b2ccb8fd0a98a21f5">push</a> (const T &source)</td></tr><tr class="memdesc:ae5e9051772bbc93b2ccb8fd0a98a21f5 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Enqueue an item at tail of queue. <br/></td></tr><tr class="separator:ae5e9051772bbc93b2ccb8fd0a98a21f5 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a87926c31967a918ce80690a9ed5d6fa8 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a87926c31967a918ce80690a9ed5d6fa8">pop</a> (T &destination)</td></tr><tr class="memdesc:a87926c31967a918ce80690a9ed5d6fa8 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Dequeue item from head of queue. <a href="#a87926c31967a918ce80690a9ed5d6fa8">More...</a><br/></td></tr><tr class="separator:a87926c31967a918ce80690a9ed5d6fa8 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a77a755d94cabf5208905d10d5b57419c inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a77a755d94cabf5208905d10d5b57419c"></a>void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a77a755d94cabf5208905d10d5b57419c">abort</a> ()</td></tr><tr class="memdesc:a77a755d94cabf5208905d10d5b57419c inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Abort all pending queue operations. <br/></td></tr><tr class="separator:a77a755d94cabf5208905d10d5b57419c inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a03d93a240841a21788396bebd71c51bd inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a03d93a240841a21788396bebd71c51bd">try_push</a> (const T &source)</td></tr><tr class="memdesc:a03d93a240841a21788396bebd71c51bd inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Enqueue an item at tail of queue if queue is not already full. <a href="#a03d93a240841a21788396bebd71c51bd">More...</a><br/></td></tr><tr class="separator:a03d93a240841a21788396bebd71c51bd inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a3086cb4dcdeee245ef5cf34f72fb3e10 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a3086cb4dcdeee245ef5cf34f72fb3e10">try_pop</a> (T &destination)</td></tr><tr class="memdesc:a3086cb4dcdeee245ef5cf34f72fb3e10 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Attempt to dequeue an item from head of queue. <a href="#a3086cb4dcdeee245ef5cf34f72fb3e10">More...</a><br/></td></tr><tr class="separator:a3086cb4dcdeee245ef5cf34f72fb3e10 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a9d6c20fd8c193c12b6a7b0c3101fd966 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00034.html#ae73fa352d781bdb9d01bfb77f2a8bc28">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a9d6c20fd8c193c12b6a7b0c3101fd966">size</a> () const </td></tr><tr class="memdesc:a9d6c20fd8c193c12b6a7b0c3101fd966 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Return number of pushes minus number of pops. <a href="#a9d6c20fd8c193c12b6a7b0c3101fd966">More...</a><br/></td></tr><tr class="separator:a9d6c20fd8c193c12b6a7b0c3101fd966 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a8c59578f28c5fb4718b0eff43776e879 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a8c59578f28c5fb4718b0eff43776e879"></a>bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a8c59578f28c5fb4718b0eff43776e879">empty</a> () const </td></tr><tr class="memdesc:a8c59578f28c5fb4718b0eff43776e879 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Equivalent to <a class="el" href="a00034.html#a9d6c20fd8c193c12b6a7b0c3101fd966" title="Return number of pushes minus number of pops. ">size()</a><=0. <br/></td></tr><tr class="separator:a8c59578f28c5fb4718b0eff43776e879 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a526487063242569685af8c8d778d39e0 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a526487063242569685af8c8d778d39e0"></a><a class="el" href="a00034.html#ae73fa352d781bdb9d01bfb77f2a8bc28">size_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a526487063242569685af8c8d778d39e0">capacity</a> () const </td></tr><tr class="memdesc:a526487063242569685af8c8d778d39e0 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Maximum number of allowed elements. <br/></td></tr><tr class="separator:a526487063242569685af8c8d778d39e0 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a768699675813575eec08c1f43afda395 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a768699675813575eec08c1f43afda395">set_capacity</a> (<a class="el" href="a00034.html#ae73fa352d781bdb9d01bfb77f2a8bc28">size_type</a> new_capacity)</td></tr><tr class="memdesc:a768699675813575eec08c1f43afda395 inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">Set the capacity. <a href="#a768699675813575eec08c1f43afda395">More...</a><br/></td></tr><tr class="separator:a768699675813575eec08c1f43afda395 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:aaeba11bbcd368a7a3a6e6e2dd3082c9c inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aaeba11bbcd368a7a3a6e6e2dd3082c9c"></a><a class="el" href="a00034.html#acbfceb845de1c770e2b56409f09b0364">allocator_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#aaeba11bbcd368a7a3a6e6e2dd3082c9c">get_allocator</a> () const </td></tr><tr class="memdesc:aaeba11bbcd368a7a3a6e6e2dd3082c9c inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">return allocator object <br/></td></tr><tr class="separator:aaeba11bbcd368a7a3a6e6e2dd3082c9c inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a246be3920e079ea4847933f106baa98f inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a246be3920e079ea4847933f106baa98f"></a>void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00034.html#a246be3920e079ea4847933f106baa98f">clear</a> ()</td></tr><tr class="memdesc:a246be3920e079ea4847933f106baa98f inherit pub_methods_a00034"><td class="mdescLeft"> </td><td class="mdescRight">clear the queue. not thread-safe. <br/></td></tr><tr class="separator:a246be3920e079ea4847933f106baa98f inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:ac0c931eaa1ddc30025e49d06cc383703 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ac0c931eaa1ddc30025e49d06cc383703"></a>iterator </td><td class="memItemRight" valign="bottom"><b>unsafe_begin</b> ()</td></tr><tr class="separator:ac0c931eaa1ddc30025e49d06cc383703 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a634cece9742cbaba56ba6f7777568e4c inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a634cece9742cbaba56ba6f7777568e4c"></a>iterator </td><td class="memItemRight" valign="bottom"><b>unsafe_end</b> ()</td></tr><tr class="separator:a634cece9742cbaba56ba6f7777568e4c inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a2ed2f8130fd679e89327cb292fb25510 inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a2ed2f8130fd679e89327cb292fb25510"></a>const_iterator </td><td class="memItemRight" valign="bottom"><b>unsafe_begin</b> () const </td></tr><tr class="separator:a2ed2f8130fd679e89327cb292fb25510 inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr><tr class="memitem:a873d62f59fd79959c0204f5fb44c774d inherit pub_methods_a00034"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a873d62f59fd79959c0204f5fb44c774d"></a>const_iterator </td><td class="memItemRight" valign="bottom"><b>unsafe_end</b> () const </td></tr><tr class="separator:a873d62f59fd79959c0204f5fb44c774d inherit pub_methods_a00034"><td class="memSeparator" colspan="2"> </td></tr></table><table class="memberdecls"><tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="friends"></a>Friends</h2></td></tr><tr class="memitem:a1f5eec0de2e660ea5372d19393f0920b"><td class="memTemplParams" colspan="2"><a class="anchor" id="a1f5eec0de2e660ea5372d19393f0920b"></a>template<typename Container , typename Value > </td></tr><tr class="memitem:a1f5eec0de2e660ea5372d19393f0920b"><td class="memTemplItemLeft" align="right" valign="top">class </td><td class="memTemplItemRight" valign="bottom"><b>internal::concurrent_queue_iterator</b></td></tr><tr class="separator:a1f5eec0de2e660ea5372d19393f0920b"><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, class A = cache_aligned_allocator<T>><br/>class tbb::deprecated::concurrent_queue< T, A ></h3>
<p>A high-performance thread-safe blocking concurrent bounded queue. </p><p>This is the pre-PPL TBB concurrent queue which support boundedness and blocking semantics. Note that method names agree with the PPL-style concurrent queue. Multiple threads may each push and pop concurrently. Assignment construction is not allowed. </p></div><h2 class="groupheader">Member Function Documentation</h2><a class="anchor" id="a8d6825341ca673ea316202474a021174"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , class 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="a00039.html">tbb::deprecated::concurrent_queue</a>< T, A >::pop_if_present </td> <td>(</td> <td class="paramtype">T & </td> <td class="paramname"><em>destination</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>Attempt to dequeue an item from head of queue. </p><p>Does not wait for item to become available. Returns true if successful; false otherwise. </p><dl class="deprecated"><dt><b><a class="el" href="a00240.html#_deprecated000001">Deprecated:</a></b></dt><dd>Use <a class="el" href="a00034.html#a3086cb4dcdeee245ef5cf34f72fb3e10" title="Attempt to dequeue an item from head of queue. ">try_pop()</a> </dd></dl>
<p>References <a class="el" href="a00034.html#a3086cb4dcdeee245ef5cf34f72fb3e10">tbb::concurrent_bounded_queue< T, A >::try_pop()</a>.</p>
</div></div><a class="anchor" id="a129cde9f5f101ddd623619c838be07f3"></a><div class="memitem"><div class="memproto"><div class="memtemplate">template<typename T , class 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="a00039.html">tbb::deprecated::concurrent_queue</a>< T, A >::push_if_not_full </td> <td>(</td> <td class="paramtype">const T & </td> <td class="paramname"><em>source</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>Enqueue an item at tail of queue if queue is not already full. </p><p>Does not wait for queue to become not full. Returns true if item is pushed; false if queue was already full. </p>
<p>References <a class="el" href="a00034.html#a03d93a240841a21788396bebd71c51bd">tbb::concurrent_bounded_queue< T, A >::try_push()</a>.</p>
</div></div><hr/>The documentation for this class was generated from the following file:<ul><li>concurrent_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.
|
