Livox-SDK
117 lines
26 KiB
HTML
117 lines
26 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Livox SDK API: sdk_core/include/third_party/spdlog/spdlog/details/mpmc_blocking_q.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="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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="projectlogo"><img alt="Logo" src="1.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Livox SDK API
|
|
 <span id="projectnumber">V1.1.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('mpmc__blocking__q_8h_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- 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 class="header">
|
|
<div class="headertitle">
|
|
<div class="title">mpmc_blocking_q.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="mpmc__blocking__q_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="preprocessor">#pragma once</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">//</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Copyright(c) 2018 Gabi Melman.</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Distributed under the MIT License (http://opensource.org/licenses/MIT)</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">//</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// multi producer-multi consumer blocking queue.</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// enqueue(..) - will block until room found to put the new message.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// enqueue_nowait(..) - will return immediately with false if no room left in</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// the queue.</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// dequeue_for(..) - will block until the queue is not empty or timeout have</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// passed.</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include "<a class="code" href="circular__q_8h.html">spdlog/details/circular_q.h</a>"</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <condition_variable></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <mutex></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">namespace </span><a class="code" href="namespacespdlog.html">spdlog</a> {</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">namespace </span>details {</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="keyword">template</span><<span class="keyword">typename</span> T></div><div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html"> 24</a></span> <span class="keyword">class </span><a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html">mpmc_blocking_queue</a></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="keyword">public</span>:</div><div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#abb22a6f25c5fd96af5b163dc93eec397"> 27</a></span>  <span class="keyword">using</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#abb22a6f25c5fd96af5b163dc93eec397">item_type</a> = T;</div><div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#ace609561c8f631202988ec49f95422fa"> 28</a></span>  <span class="keyword">explicit</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#ace609561c8f631202988ec49f95422fa">mpmc_blocking_queue</a>(<span class="keywordtype">size_t</span> max_items)</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  : q_(max_items)</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>  }</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef __MINGW32__</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// try to enqueue and block if no room left</span></div><div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a3795640b651fcb2de66a21ef2bc221f1"> 35</a></span>  <span class="keywordtype">void</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a3795640b651fcb2de66a21ef2bc221f1">enqueue</a>(T &&item)</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  {</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> lock(queue_mutex_);</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  pop_cv_.wait(lock, [<span class="keyword">this</span>] { <span class="keywordflow">return</span> !this->q_.full(); });</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  q_.push_back(std::move(item));</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  push_cv_.notify_one();</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// enqueue immediately. overrun oldest message in the queue if no room left.</span></div><div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a1280489c9035a705f50f04905a5ed394"> 46</a></span>  <span class="keywordtype">void</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a1280489c9035a705f50f04905a5ed394">enqueue_nowait</a>(T &&item)</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</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>  std::unique_lock<std::mutex> lock(queue_mutex_);</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  q_.push_back(std::move(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>  push_cv_.notify_one();</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</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>  <span class="comment">// try to dequeue item. if no item found. wait upto timeout and try again</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// Return true, if succeeded dequeue item, false otherwise</span></div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#af4015ea1657b393755f34d76c97a28d1"> 57</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#af4015ea1657b393755f34d76c97a28d1">dequeue_for</a>(T &popped_item, std::chrono::milliseconds wait_duration)</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  std::unique_lock<std::mutex> lock(queue_mutex_);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (!push_cv_.wait_for(lock, wait_duration, [<span class="keyword">this</span>] { return !this->q_.empty(); }))</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  {</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  q_.pop_front(popped_item);</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>  pop_cv_.notify_one();</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</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> <span class="preprocessor">#else</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// apparently mingw deadlocks if the mutex is released before cv.notify_one(),</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// so release the mutex at the very end each function.</span></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>  <span class="comment">// try to enqueue and block if no room left</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordtype">void</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a3795640b651fcb2de66a21ef2bc221f1">enqueue</a>(T &&item)</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> lock(queue_mutex_);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  pop_cv_.wait(lock, [<span class="keyword">this</span>] { <span class="keywordflow">return</span> !this->q_.full(); });</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  q_.push_back(std::move(item));</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  push_cv_.notify_one();</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</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>  <span class="comment">// enqueue immediately. overrun oldest message in the queue if no room left.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">void</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a1280489c9035a705f50f04905a5ed394">enqueue_nowait</a>(T &&item)</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>  std::unique_lock<std::mutex> lock(queue_mutex_);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  q_.push_back(std::move(item));</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  push_cv_.notify_one();</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</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="comment">// try to dequeue item. if no item found. wait upto timeout and try again</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Return true, if succeeded dequeue item, false otherwise</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">bool</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#af4015ea1657b393755f34d76c97a28d1">dequeue_for</a>(T &popped_item, std::chrono::milliseconds wait_duration)</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  std::unique_lock<std::mutex> lock(queue_mutex_);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (!push_cv_.wait_for(lock, wait_duration, [<span class="keyword">this</span>] { return !this->q_.empty(); }))</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> <span class="keyword">false</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>  q_.pop_front(popped_item);</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  pop_cv_.notify_one();</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a15e3d12dff953034d5aad5590b8282cd"> 108</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a15e3d12dff953034d5aad5590b8282cd">overrun_counter</a>()</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::unique_lock<std::mutex> lock(queue_mutex_);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> q_.overrun_counter();</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::mutex queue_mutex_;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::condition_variable push_cv_;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  std::condition_variable pop_cv_;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="classspdlog_1_1details_1_1circular__q.html">spdlog::details::circular_q<T></a> q_;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> };</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> } <span class="comment">// namespace details</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> } <span class="comment">// namespace spdlog</span></div><div class="ttc" id="classspdlog_1_1details_1_1mpmc__blocking__queue_html_a1280489c9035a705f50f04905a5ed394"><div class="ttname"><a href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a1280489c9035a705f50f04905a5ed394">spdlog::details::mpmc_blocking_queue::enqueue_nowait</a></div><div class="ttdeci">void enqueue_nowait(T &&item)</div><div class="ttdef"><b>Definition:</b> <a href="mpmc__blocking__q_8h_source.html#l00046">mpmc_blocking_q.h:46</a></div></div>
|
|
<div class="ttc" id="classspdlog_1_1details_1_1mpmc__blocking__queue_html_ace609561c8f631202988ec49f95422fa"><div class="ttname"><a href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#ace609561c8f631202988ec49f95422fa">spdlog::details::mpmc_blocking_queue::mpmc_blocking_queue</a></div><div class="ttdeci">mpmc_blocking_queue(size_t max_items)</div><div class="ttdef"><b>Definition:</b> <a href="mpmc__blocking__q_8h_source.html#l00028">mpmc_blocking_q.h:28</a></div></div>
|
|
<div class="ttc" id="classspdlog_1_1details_1_1mpmc__blocking__queue_html_af4015ea1657b393755f34d76c97a28d1"><div class="ttname"><a href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#af4015ea1657b393755f34d76c97a28d1">spdlog::details::mpmc_blocking_queue::dequeue_for</a></div><div class="ttdeci">bool dequeue_for(T &popped_item, std::chrono::milliseconds wait_duration)</div><div class="ttdef"><b>Definition:</b> <a href="mpmc__blocking__q_8h_source.html#l00057">mpmc_blocking_q.h:57</a></div></div>
|
|
<div class="ttc" id="classspdlog_1_1details_1_1mpmc__blocking__queue_html"><div class="ttname"><a href="classspdlog_1_1details_1_1mpmc__blocking__queue.html">spdlog::details::mpmc_blocking_queue</a></div><div class="ttdef"><b>Definition:</b> <a href="mpmc__blocking__q_8h_source.html#l00024">mpmc_blocking_q.h:24</a></div></div>
|
|
<div class="ttc" id="namespacespdlog_html"><div class="ttname"><a href="namespacespdlog.html">spdlog</a></div><div class="ttdef"><b>Definition:</b> <a href="async_8h_source.html#l00027">async.h:27</a></div></div>
|
|
<div class="ttc" id="classspdlog_1_1details_1_1mpmc__blocking__queue_html_a15e3d12dff953034d5aad5590b8282cd"><div class="ttname"><a href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a15e3d12dff953034d5aad5590b8282cd">spdlog::details::mpmc_blocking_queue::overrun_counter</a></div><div class="ttdeci">size_t overrun_counter()</div><div class="ttdef"><b>Definition:</b> <a href="mpmc__blocking__q_8h_source.html#l00108">mpmc_blocking_q.h:108</a></div></div>
|
|
<div class="ttc" id="classspdlog_1_1details_1_1mpmc__blocking__queue_html_a3795640b651fcb2de66a21ef2bc221f1"><div class="ttname"><a href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#a3795640b651fcb2de66a21ef2bc221f1">spdlog::details::mpmc_blocking_queue::enqueue</a></div><div class="ttdeci">void enqueue(T &&item)</div><div class="ttdef"><b>Definition:</b> <a href="mpmc__blocking__q_8h_source.html#l00035">mpmc_blocking_q.h:35</a></div></div>
|
|
<div class="ttc" id="classspdlog_1_1details_1_1circular__q_html"><div class="ttname"><a href="classspdlog_1_1details_1_1circular__q.html">spdlog::details::circular_q</a></div><div class="ttdef"><b>Definition:</b> <a href="circular__q_8h_source.html#l00014">circular_q.h:14</a></div></div>
|
|
<div class="ttc" id="classspdlog_1_1details_1_1mpmc__blocking__queue_html_abb22a6f25c5fd96af5b163dc93eec397"><div class="ttname"><a href="classspdlog_1_1details_1_1mpmc__blocking__queue.html#abb22a6f25c5fd96af5b163dc93eec397">spdlog::details::mpmc_blocking_queue< item_type >::item_type</a></div><div class="ttdeci">item_type item_type</div><div class="ttdef"><b>Definition:</b> <a href="mpmc__blocking__q_8h_source.html#l00027">mpmc_blocking_q.h:27</a></div></div>
|
|
<div class="ttc" id="circular__q_8h_html"><div class="ttname"><a href="circular__q_8h.html">circular_q.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_5f1136fe404e0a548faf586fae339a6a.html">sdk_core</a></li><li class="navelem"><a class="el" href="dir_fef6b6f1028f30fedf17225feaaa02fe.html">include</a></li><li class="navelem"><a class="el" href="dir_7bb3e31efd6b819bbb0704cee4a66d41.html">third_party</a></li><li class="navelem"><a class="el" href="dir_cf58c3a45797022668a1e269b5315a33.html">spdlog</a></li><li class="navelem"><a class="el" href="dir_248a80cf6760c7a1ab13394a1c16f7b2.html">spdlog</a></li><li class="navelem"><a class="el" href="dir_7d093cd833acfccb787639923feedd9d.html">details</a></li><li class="navelem"><a class="el" href="mpmc__blocking__q_8h.html">mpmc_blocking_q.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|