1<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> 2<html> 3<head> 4<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 5<title>More Examples</title> 6<link rel="stylesheet" href="../../../doc/src/boostbook.css" type="text/css"> 7<meta name="generator" content="DocBook XSL Stylesheets V1.79.1"> 8<link rel="home" href="../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset"> 9<link rel="up" href="../circular_buffer.html" title="Chapter 8. Boost.Circular Buffer"> 10<link rel="prev" href="implementation.html" title="Implementation"> 11<link rel="next" href="headers.html" title="Header Files"> 12</head> 13<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> 14<table cellpadding="2" width="100%"><tr> 15<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../boost.png"></td> 16<td align="center"><a href="../../../index.html">Home</a></td> 17<td align="center"><a href="../../../libs/libraries.htm">Libraries</a></td> 18<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> 19<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> 20<td align="center"><a href="../../../more/index.htm">More</a></td> 21</tr></table> 22<hr> 23<div class="spirit-nav"> 24<a accesskey="p" href="implementation.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../circular_buffer.html"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers.html"><img src="../../../doc/src/images/next.png" alt="Next"></a> 25</div> 26<div class="section"> 27<div class="titlepage"><div><div><h2 class="title" style="clear: both"> 28<a name="circular_buffer.examples"></a><a class="link" href="examples.html" title="More Examples">More Examples</a> 29</h2></div></div></div> 30<h4> 31<a name="circular_buffer.examples.h0"></a> 32 <span class="phrase"><a name="circular_buffer.examples.summing_all_the_values_in_a_circ"></a></span><a class="link" href="examples.html#circular_buffer.examples.summing_all_the_values_in_a_circ">Summing 33 all the values in a circular buffer</a> 34 </h4> 35<p> 36 This example shows several functions, including summing all valid values. 37 </p> 38<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">circular_buffer</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 39<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">numeric</span><span class="special">></span> 40<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">assert</span><span class="special">.</span><span class="identifier">h</span><span class="special">></span> 41 42<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="comment">/*argc*/</span><span class="special">,</span> <span class="keyword">char</span><span class="special">*</span> <span class="comment">/*argv*/</span><span class="special">[])</span> 43<span class="special">{</span> 44 <span class="comment">// Create a circular buffer of capacity 3.</span> 45 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">circular_buffer</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">cb</span><span class="special">(</span><span class="number">3</span><span class="special">);</span> 46 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">()</span> <span class="special">==</span> <span class="number">3</span><span class="special">);</span> 47 <span class="comment">// Check is empty.</span> 48 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">==</span> <span class="number">0</span><span class="special">);</span> 49 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">empty</span><span class="special">());</span> 50 51 <span class="comment">// Insert some elements into the circular buffer.</span> 52 <span class="identifier">cb</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">1</span><span class="special">);</span> 53 <span class="identifier">cb</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">2</span><span class="special">);</span> 54 55 <span class="comment">// Assertions to check push_backs have expected effect.</span> 56 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">[</span><span class="number">0</span><span class="special">]</span> <span class="special">==</span> <span class="number">1</span><span class="special">);</span> 57 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">[</span><span class="number">1</span><span class="special">]</span> <span class="special">==</span> <span class="number">2</span><span class="special">);</span> 58 <span class="identifier">assert</span><span class="special">(!</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">full</span><span class="special">());</span> 59 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">==</span> <span class="number">2</span><span class="special">);</span> 60 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">()</span> <span class="special">==</span> <span class="number">3</span><span class="special">);</span> 61 62 <span class="comment">// Insert some other elements.</span> 63 <span class="identifier">cb</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">3</span><span class="special">);</span> 64 <span class="identifier">cb</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="number">4</span><span class="special">);</span> 65 66 <span class="comment">// Evaluate the sum of all elements.</span> 67 <span class="keyword">int</span> <span class="identifier">sum</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">cb</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="number">0</span><span class="special">);</span> 68 69 <span class="comment">// Assertions to check state.</span> 70 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">sum</span> <span class="special">==</span> <span class="number">9</span><span class="special">);</span> 71 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">[</span><span class="number">0</span><span class="special">]</span> <span class="special">==</span> <span class="number">2</span><span class="special">);</span> 72 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">[</span><span class="number">1</span><span class="special">]</span> <span class="special">==</span> <span class="number">3</span><span class="special">);</span> 73 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">[</span><span class="number">2</span><span class="special">]</span> <span class="special">==</span> <span class="number">4</span><span class="special">);</span> 74 <span class="identifier">assert</span><span class="special">(*</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">==</span> <span class="number">2</span><span class="special">);</span> 75 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">front</span><span class="special">()</span> <span class="special">==</span> <span class="number">2</span><span class="special">);</span> 76 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">back</span><span class="special">()</span> <span class="special">==</span> <span class="number">4</span><span class="special">);</span> 77 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">full</span><span class="special">());</span> 78 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">==</span> <span class="number">3</span><span class="special">);</span> 79 <span class="identifier">assert</span><span class="special">(</span><span class="identifier">cb</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">()</span> <span class="special">==</span> <span class="number">3</span><span class="special">);</span> 80 81 <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span> 82<span class="special">}</span> 83</pre> 84<p> 85 The <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code> has 86 a capacity of three <code class="computeroutput"><span class="keyword">int</span></code>. Therefore, 87 the size of the buffer will never exceed three. The <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">accumulate</span></code> 88 algorithm evaluates the sum of the stored elements. The semantics of the <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code> can be inferred from 89 the assertions. 90 </p> 91<p> 92 You can see the full example code at <a href="../../../libs/circular_buffer/example/circular_buffer_sum_example.cpp" target="_top">circular_buffer_sum_example.cpp</a>. 93 </p> 94<h4> 95<a name="circular_buffer.examples.h1"></a> 96 <span class="phrase"><a name="circular_buffer.examples.bounded_buffer_example"></a></span><a class="link" href="examples.html#circular_buffer.examples.bounded_buffer_example">Bounded 97 Buffer Example</a> 98 </h4> 99<p> 100 The bounded buffer is normally used in a producer-consumer mode: producer threads 101 produce items and store them in the container and consumer threads remove these 102 items and process them. The bounded buffer has to guarantee that 103 </p> 104<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 105<li class="listitem"> 106 producers do not insert items into the container when the container is 107 full, 108 </li> 109<li class="listitem"> 110 consumers do not try to remove items when the container is empty, 111 </li> 112<li class="listitem"> 113 each produced item is consumed by exactly one consumer. 114 </li> 115</ul></div> 116<p> 117 This example shows how the <code class="computeroutput"><span class="identifier">circular_buffer</span></code> 118 can be utilized as an underlying container of the bounded buffer. 119 </p> 120<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">circular_buffer</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 121<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">thread</span><span class="special">/</span><span class="identifier">mutex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 122<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">thread</span><span class="special">/</span><span class="identifier">condition</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 123<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">thread</span><span class="special">/</span><span class="identifier">thread</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 124<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">call_traits</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 125<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bind</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> 126 127<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">timer</span><span class="special">/</span><span class="identifier">timer</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for auto_cpu_timer</span> 128<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span> 129 130<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span> 131<span class="keyword">class</span> <span class="identifier">bounded_buffer</span> 132<span class="special">{</span> 133<span class="keyword">public</span><span class="special">:</span> 134 135 <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">circular_buffer</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="identifier">container_type</span><span class="special">;</span> 136 <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">container_type</span><span class="special">::</span><span class="identifier">size_type</span> <span class="identifier">size_type</span><span class="special">;</span> 137 <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">container_type</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">value_type</span><span class="special">;</span> 138 <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">call_traits</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">>::</span><span class="identifier">param_type</span> <span class="identifier">param_type</span><span class="special">;</span> 139 140 <span class="keyword">explicit</span> <span class="identifier">bounded_buffer</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">capacity</span><span class="special">)</span> <span class="special">:</span> <span class="identifier">m_unread</span><span class="special">(</span><span class="number">0</span><span class="special">),</span> <span class="identifier">m_container</span><span class="special">(</span><span class="identifier">capacity</span><span class="special">)</span> <span class="special">{}</span> 141 142 <span class="keyword">void</span> <span class="identifier">push_front</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">call_traits</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">>::</span><span class="identifier">param_type</span> <span class="identifier">item</span><span class="special">)</span> 143 <span class="special">{</span> <span class="comment">// `param_type` represents the "best" way to pass a parameter of type `value_type` to a method.</span> 144 145 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mutex</span><span class="special">::</span><span class="identifier">scoped_lock</span> <span class="identifier">lock</span><span class="special">(</span><span class="identifier">m_mutex</span><span class="special">);</span> 146 <span class="identifier">m_not_full</span><span class="special">.</span><span class="identifier">wait</span><span class="special">(</span><span class="identifier">lock</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">bounded_buffer</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">>::</span><span class="identifier">is_not_full</span><span class="special">,</span> <span class="keyword">this</span><span class="special">));</span> 147 <span class="identifier">m_container</span><span class="special">.</span><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">item</span><span class="special">);</span> 148 <span class="special">++</span><span class="identifier">m_unread</span><span class="special">;</span> 149 <span class="identifier">lock</span><span class="special">.</span><span class="identifier">unlock</span><span class="special">();</span> 150 <span class="identifier">m_not_empty</span><span class="special">.</span><span class="identifier">notify_one</span><span class="special">();</span> 151 <span class="special">}</span> 152 153 <span class="keyword">void</span> <span class="identifier">pop_back</span><span class="special">(</span><span class="identifier">value_type</span><span class="special">*</span> <span class="identifier">pItem</span><span class="special">)</span> <span class="special">{</span> 154 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mutex</span><span class="special">::</span><span class="identifier">scoped_lock</span> <span class="identifier">lock</span><span class="special">(</span><span class="identifier">m_mutex</span><span class="special">);</span> 155 <span class="identifier">m_not_empty</span><span class="special">.</span><span class="identifier">wait</span><span class="special">(</span><span class="identifier">lock</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">bounded_buffer</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">>::</span><span class="identifier">is_not_empty</span><span class="special">,</span> <span class="keyword">this</span><span class="special">));</span> 156 <span class="special">*</span><span class="identifier">pItem</span> <span class="special">=</span> <span class="identifier">m_container</span><span class="special">[--</span><span class="identifier">m_unread</span><span class="special">];</span> 157 <span class="identifier">lock</span><span class="special">.</span><span class="identifier">unlock</span><span class="special">();</span> 158 <span class="identifier">m_not_full</span><span class="special">.</span><span class="identifier">notify_one</span><span class="special">();</span> 159 <span class="special">}</span> 160 161<span class="keyword">private</span><span class="special">:</span> 162 <span class="identifier">bounded_buffer</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">bounded_buffer</span><span class="special">&);</span> <span class="comment">// Disabled copy constructor.</span> 163 <span class="identifier">bounded_buffer</span><span class="special">&</span> <span class="keyword">operator</span> <span class="special">=</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">bounded_buffer</span><span class="special">&);</span> <span class="comment">// Disabled assign operator.</span> 164 165 <span class="keyword">bool</span> <span class="identifier">is_not_empty</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">m_unread</span> <span class="special">></span> <span class="number">0</span><span class="special">;</span> <span class="special">}</span> 166 <span class="keyword">bool</span> <span class="identifier">is_not_full</span><span class="special">()</span> <span class="keyword">const</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">m_unread</span> <span class="special"><</span> <span class="identifier">m_container</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">();</span> <span class="special">}</span> 167 168 <span class="identifier">size_type</span> <span class="identifier">m_unread</span><span class="special">;</span> 169 <span class="identifier">container_type</span> <span class="identifier">m_container</span><span class="special">;</span> 170 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mutex</span> <span class="identifier">m_mutex</span><span class="special">;</span> 171 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">condition</span> <span class="identifier">m_not_empty</span><span class="special">;</span> 172 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">condition</span> <span class="identifier">m_not_full</span><span class="special">;</span> 173<span class="special">};</span> <span class="comment">//</span> 174</pre> 175<p> 176 The bounded_buffer relies on <a href="../../../doc/html/thread.html" target="_top">Boost.Thread</a> 177 and <a href="../../../libs/bind/index.html" target="_top">Boost.Bind</a> libraries and 178 <a href="../../../libs/utility/call_traits.htm" target="_top">Boost.call_traits utility</a>. 179 </p> 180<p> 181 The <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html#idm45227213078704-bb">push_front()</a></code> 182 method is called by the producer thread in order to insert a new item into 183 the buffer. The method locks the mutex and waits until there is a space for 184 the new item. (The mutex is unlocked during the waiting stage and has to be 185 regained when the condition is met.) If there is a space in the buffer available, 186 the execution continues and the method inserts the item at the end of the 187 <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code>. Then it 188 increments the number of unread items and unlocks the mutex (in case an exception 189 is thrown before the mutex is unlocked, the mutex is unlocked automatically 190 by the destructor of the scoped_lock). At last the method notifies one of the 191 consumer threads waiting for a new item to be inserted into the buffer. 192 </p> 193<p> 194 The <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html#idm45227213033936-bb">pop_back()</a></code> 195 method is called by the consumer thread in order to read the next item from 196 the buffer. The method locks the mutex and waits until there is an unread item 197 in the buffer. If there is at least one unread item, the method decrements 198 the number of unread items and reads the next item from the <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code>. 199 Then it unlocks the mutex and notifies one of the producer threads waiting 200 for the buffer to free a space for the next item. 201 </p> 202<p> 203 The <code class="computeroutput"><span class="identifier">bounded</span> <span class="identifier">buffer</span><span class="special">::</span><span class="identifier">pop_back</span><span class="special">()</span></code> method <span class="bold"><strong>does not remove 204 the item</strong></span> but the item is left in the circular_buffer which then 205 <span class="bold"><strong>replaces it with a new one</strong></span> (inserted by a 206 producer) when the circular_buffer is full. This technique is more effective 207 than removing the item explicitly by calling the <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html#idm45227213033936-bb">circular_buffer::pop_back()</a></code> 208 method of the <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code>. 209 </p> 210<p> 211 This claim is based on the assumption that an assignment (replacement) of a 212 new item into an old one is more effective than a destruction (removal) of 213 an old item and a consequent inplace construction (insertion) of a new item. 214 </p> 215<p> 216 For comparison of bounded buffers based on different containers compile and 217 run <a href="../../../libs/circular_buffer/test/bounded_buffer_comparison.cpp" target="_top">bounded_buffer_comparison.cpp</a>. 218 The test should reveal the bounded buffer based on the <code class="computeroutput"><a class="link" href="../boost/circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code> 219 is most effective closely followed by the <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">deque</span></code> based 220 bounded buffer. (In reality, the result may differ sometimes because the test 221 is always affected by external factors such as immediate CPU load.) 222 </p> 223<p> 224 You can see the full test code at <a href="../../../libs/circular_buffer/test/bounded_buffer_comparison.cpp" target="_top">bounded_buffer_comparison.cpp</a>, 225 and an example of output is 226 </p> 227<pre class="programlisting"><span class="identifier">Description</span><span class="special">:</span> <span class="identifier">Autorun</span> <span class="string">"J:\Cpp\Misc\Debug\bounded_buffer_comparison.exe"</span> 228<span class="identifier">bounded_buffer</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="number">5.15</span> <span class="identifier">s</span> 229 230<span class="identifier">bounded_buffer_space_optimized</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="number">5.71</span> <span class="identifier">s</span> 231 232<span class="identifier">bounded_buffer_deque_based</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="number">15.57</span> <span class="identifier">s</span> 233 234<span class="identifier">bounded_buffer_list_based</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="number">17.33</span> <span class="identifier">s</span> 235 236<span class="identifier">bounded_buffer</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="number">24.49</span> <span class="identifier">s</span> 237 238<span class="identifier">bounded_buffer_space_optimized</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="number">28.33</span> <span class="identifier">s</span> 239 240<span class="identifier">bounded_buffer_deque_based</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="number">29.45</span> <span class="identifier">s</span> 241 242<span class="identifier">bounded_buffer_list_based</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="number">31.29</span> <span class="identifier">s</span> 243</pre> 244<p> 245 . 246 </p> 247</div> 248<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 249<td align="left"></td> 250<td align="right"><div class="copyright-footer">Copyright © 2003-2013 Jan Gaspar<p> 251 Distributed under the Boost Software License, Version 1.0. (See accompanying 252 file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) 253 </p> 254</div></td> 255</tr></table> 256<hr> 257<div class="spirit-nav"> 258<a accesskey="p" href="implementation.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../circular_buffer.html"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers.html"><img src="../../../doc/src/images/next.png" alt="Next"></a> 259</div> 260</body> 261</html> 262
