-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path_concurrent_queue_8h_source.html
More file actions
executable file
·90 lines (88 loc) · 25.2 KB
/
Copy path_concurrent_queue_8h_source.html
File metadata and controls
executable file
·90 lines (88 loc) · 25.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
<!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.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>CortexRobot: /temp/des/CameraTest_nofreev_branch/Algorithm/Utilities/include/ConcurrentQueue.h Source File</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="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.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! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">CortexRobot
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_28e1bb8382970ac72e8ae3b23df4a891.html">temp</a></li><li class="navelem"><a class="el" href="dir_7ee3436e08fefa5a3e5de148816e60bf.html">des</a></li><li class="navelem"><a class="el" href="dir_9f521f3c0054d89524661d351ceeeed2.html">CameraTest_nofreev_branch</a></li><li class="navelem"><a class="el" href="dir_11fc880b39daecaf26a43a29a4b0ffd7.html">Algorithm</a></li><li class="navelem"><a class="el" href="dir_773312c600152413d9716f561a3186bd.html">Utilities</a></li><li class="navelem"><a class="el" href="dir_8bb549aa6bf54e7c03ce0538a966e428.html">include</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">ConcurrentQueue.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="_concurrent_queue_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Copyright (c) 2013 Juan Palacios juan.palacios.puyana@gmail.com</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Redistribution and use in source and binary forms, with or without</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// modification, are permitted provided that the following conditions are met :</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// 1. Redistributions of source code must retain the above copyright notice, this</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// list of conditions and the following disclaimer.</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// 2. Redistributions in binary form must reproduce the above copyright notice,</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// this list of conditions and the following disclaimer in the documentation</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// and/or other materials provided with the distribution.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">//</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// DISCLAIMED.IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#ifndef CONCURRENT_QUEUE_</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#define CONCURRENT_QUEUE_</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <queue></span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <thread></span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <mutex></span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <condition_variable></span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html"> 32</a></span> <span class="keyword">class </span><a class="code" href="class_concurrent_queue.html">ConcurrentQueue</a></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#a6412cc45f2c19f1090611fbd1930b8e2"> 36</a></span>  T <a class="code" href="class_concurrent_queue.html#a6412cc45f2c19f1090611fbd1930b8e2">pop</a>()</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  std::unique_lock<std::mutex> mlock(<a class="code" href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8">mutex_</a>);</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">while</span> (<a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.empty())</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  {</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <a class="code" href="class_concurrent_queue.html#aad10a6cd8e6bd855f9ce3016ae00af21">cond_empty_</a>.wait(mlock);</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">auto</span> val = <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.front();</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.pop();</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  mlock.unlock();</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="class_concurrent_queue.html#a1e3988ea948474a36adf481b2ef22427">cond_full_</a>.notify_one();</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#aea31b1614387c25cad7268d872a2da95"> 50</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_concurrent_queue.html#aea31b1614387c25cad7268d872a2da95">pop</a>(T& item)</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  std::unique_lock<std::mutex> mlock(<a class="code" href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8">mutex_</a>);</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">while</span> (<a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.empty())</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="class_concurrent_queue.html#aad10a6cd8e6bd855f9ce3016ae00af21">cond_empty_</a>.wait(mlock);</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  item = <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.front();</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.pop();</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  mlock.unlock();</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <a class="code" href="class_concurrent_queue.html#a1e3988ea948474a36adf481b2ef22427">cond_full_</a>.notify_one();</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#a84613f1f45d45784579bbe866d28b162"> 63</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_concurrent_queue.html#a84613f1f45d45784579bbe866d28b162">push</a>(<span class="keyword">const</span> T& item)</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  std::unique_lock<std::mutex> mlock(<a class="code" href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8">mutex_</a>);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">while</span> (<a class="code" href="class_concurrent_queue.html#a7a7b6c501d759cd09d3f80e05e0923de">capacity_</a> > 0 && <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.size() >= <a class="code" href="class_concurrent_queue.html#a7a7b6c501d759cd09d3f80e05e0923de">capacity_</a>)</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="class_concurrent_queue.html#a1e3988ea948474a36adf481b2ef22427">cond_full_</a>.wait(mlock);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.push(item);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  mlock.unlock();</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="class_concurrent_queue.html#aad10a6cd8e6bd855f9ce3016ae00af21">cond_empty_</a>.notify_one();</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div><div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#a241a17101be9bd0eb31c02b2ba0f8cac"> 76</a></span>  <span class="keywordtype">void</span> <a class="code" href="class_concurrent_queue.html#a241a17101be9bd0eb31c02b2ba0f8cac">set_capacity</a>(<span class="keywordtype">int</span> capacity)</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  std::unique_lock<std::mutex> mlock(<a class="code" href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8">mutex_</a>);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="class_concurrent_queue.html#a7a7b6c501d759cd09d3f80e05e0923de">capacity_</a> = capacity;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#ad46199753ce77c58b3b256074c1df5e2"> 82</a></span>  <span class="keywordtype">bool</span> <a class="code" href="class_concurrent_queue.html#ad46199753ce77c58b3b256074c1df5e2">empty</a>()</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  std::unique_lock<std::mutex> mlock(<a class="code" href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8">mutex_</a>);</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>.empty();</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <a class="code" href="class_concurrent_queue.html#abc6293a3ab77c14e30c0942f1c89bf12">ConcurrentQueue</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="code" href="class_concurrent_queue.html#abc6293a3ab77c14e30c0942f1c89bf12">ConcurrentQueue</a>(<span class="keyword">const</span> <a class="code" href="class_concurrent_queue.html">ConcurrentQueue</a>&) = <span class="keyword">delete</span>; <span class="comment">// disable copying</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="class_concurrent_queue.html">ConcurrentQueue</a>& <a class="code" href="class_concurrent_queue.html#a5f04bea6f04c04332063bbbdcfb9ae67">operator=</a>(<span class="keyword">const</span> <a class="code" href="class_concurrent_queue.html">ConcurrentQueue</a>&) = <span class="keyword">delete</span>; <span class="comment">// disable assignment</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340"> 93</a></span>  std::queue<T> <a class="code" href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">queue_</a>;</div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8"> 94</a></span>  std::mutex <a class="code" href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8">mutex_</a>;</div><div class="line"><a name="l00095"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#aad10a6cd8e6bd855f9ce3016ae00af21"> 95</a></span>  std::condition_variable <a class="code" href="class_concurrent_queue.html#aad10a6cd8e6bd855f9ce3016ae00af21">cond_empty_</a>;</div><div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#a1e3988ea948474a36adf481b2ef22427"> 96</a></span>  std::condition_variable <a class="code" href="class_concurrent_queue.html#a1e3988ea948474a36adf481b2ef22427">cond_full_</a>;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// If capacity greater than one, the queue will block on push if there are too many elements in it</span></div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="class_concurrent_queue.html#a7a7b6c501d759cd09d3f80e05e0923de"> 98</a></span>  <span class="keywordtype">int</span> <a class="code" href="class_concurrent_queue.html#a7a7b6c501d759cd09d3f80e05e0923de">capacity_</a> = 0;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> };</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="class_concurrent_queue_html_aaf844a4e9f4ece93e2eec8f3e27c72d8"><div class="ttname"><a href="class_concurrent_queue.html#aaf844a4e9f4ece93e2eec8f3e27c72d8">ConcurrentQueue::mutex_</a></div><div class="ttdeci">std::mutex mutex_</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00094">ConcurrentQueue.h:94</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_a1e3988ea948474a36adf481b2ef22427"><div class="ttname"><a href="class_concurrent_queue.html#a1e3988ea948474a36adf481b2ef22427">ConcurrentQueue::cond_full_</a></div><div class="ttdeci">std::condition_variable cond_full_</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00096">ConcurrentQueue.h:96</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_a6412cc45f2c19f1090611fbd1930b8e2"><div class="ttname"><a href="class_concurrent_queue.html#a6412cc45f2c19f1090611fbd1930b8e2">ConcurrentQueue::pop</a></div><div class="ttdeci">T pop()</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00036">ConcurrentQueue.h:36</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_aea31b1614387c25cad7268d872a2da95"><div class="ttname"><a href="class_concurrent_queue.html#aea31b1614387c25cad7268d872a2da95">ConcurrentQueue::pop</a></div><div class="ttdeci">void pop(T &item)</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00050">ConcurrentQueue.h:50</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_aad10a6cd8e6bd855f9ce3016ae00af21"><div class="ttname"><a href="class_concurrent_queue.html#aad10a6cd8e6bd855f9ce3016ae00af21">ConcurrentQueue::cond_empty_</a></div><div class="ttdeci">std::condition_variable cond_empty_</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00095">ConcurrentQueue.h:95</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_aadadd9774301ab089cfc41bc325a0340"><div class="ttname"><a href="class_concurrent_queue.html#aadadd9774301ab089cfc41bc325a0340">ConcurrentQueue::queue_</a></div><div class="ttdeci">std::queue< T > queue_</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00093">ConcurrentQueue.h:93</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_ad46199753ce77c58b3b256074c1df5e2"><div class="ttname"><a href="class_concurrent_queue.html#ad46199753ce77c58b3b256074c1df5e2">ConcurrentQueue::empty</a></div><div class="ttdeci">bool empty()</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00082">ConcurrentQueue.h:82</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_a241a17101be9bd0eb31c02b2ba0f8cac"><div class="ttname"><a href="class_concurrent_queue.html#a241a17101be9bd0eb31c02b2ba0f8cac">ConcurrentQueue::set_capacity</a></div><div class="ttdeci">void set_capacity(int capacity)</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00076">ConcurrentQueue.h:76</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_a84613f1f45d45784579bbe866d28b162"><div class="ttname"><a href="class_concurrent_queue.html#a84613f1f45d45784579bbe866d28b162">ConcurrentQueue::push</a></div><div class="ttdeci">void push(const T &item)</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00063">ConcurrentQueue.h:63</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_abc6293a3ab77c14e30c0942f1c89bf12"><div class="ttname"><a href="class_concurrent_queue.html#abc6293a3ab77c14e30c0942f1c89bf12">ConcurrentQueue::ConcurrentQueue</a></div><div class="ttdeci">ConcurrentQueue()=default</div></div>
<div class="ttc" id="class_concurrent_queue_html"><div class="ttname"><a href="class_concurrent_queue.html">ConcurrentQueue</a></div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00032">ConcurrentQueue.h:32</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_a7a7b6c501d759cd09d3f80e05e0923de"><div class="ttname"><a href="class_concurrent_queue.html#a7a7b6c501d759cd09d3f80e05e0923de">ConcurrentQueue::capacity_</a></div><div class="ttdeci">int capacity_</div><div class="ttdef"><b>Definition:</b> <a href="_concurrent_queue_8h_source.html#l00098">ConcurrentQueue.h:98</a></div></div>
<div class="ttc" id="class_concurrent_queue_html_a5f04bea6f04c04332063bbbdcfb9ae67"><div class="ttname"><a href="class_concurrent_queue.html#a5f04bea6f04c04332063bbbdcfb9ae67">ConcurrentQueue::operator=</a></div><div class="ttdeci">ConcurrentQueue & operator=(const ConcurrentQueue &)=delete</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.13
</small></address>
</body>
</html>