summaryrefslogtreecommitdiff
path: root/doc/html/circular_buffer.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/circular_buffer.html')
-rw-r--r--doc/html/circular_buffer.html12
1 files changed, 5 insertions, 7 deletions
diff --git a/doc/html/circular_buffer.html b/doc/html/circular_buffer.html
index 40771b5277..518f78c3ee 100644
--- a/doc/html/circular_buffer.html
+++ b/doc/html/circular_buffer.html
@@ -57,8 +57,6 @@
<dd><dl>
<dt><span class="section"><a href="boost_circular_buffer_c___reference.html#header.boost.circular_buffer_hpp">Header &lt;boost/circular_buffer.hpp&gt;</a></span></dt>
<dt><span class="section"><a href="boost_circular_buffer_c___reference.html#header.boost.circular_buffer.base_hpp">Header &lt;boost/circular_buffer/base.hpp&gt;</a></span></dt>
-<dt><span class="section"><a href="boost_circular_buffer_c___reference.html#header.boost.circular_buffer.debug_hpp">Header &lt;boost/circular_buffer/debug.hpp&gt;</a></span></dt>
-<dt><span class="section"><a href="boost_circular_buffer_c___reference.html#header.boost.circular_buffer.details_hpp">Header &lt;boost/circular_buffer/details.hpp&gt;</a></span></dt>
<dt><span class="section"><a href="boost_circular_buffer_c___reference.html#header.boost.circular_buffer.space_optimized_hpp">Header &lt;boost/circular_buffer/space_optimized.hpp&gt;</a></span></dt>
</dl></dd>
<dt><span class="section"><a href="circular_buffer/s14.html">Index</a></span></dt>
@@ -96,8 +94,8 @@
is a STL compliant container.
</p>
<p>
- It is a kind of sequence similar to <a href="http://www.sgi.com/tech/stl/List.html" target="_top">std::list</a>
- or <a href="http://www.sgi.com/tech/stl/Deque.html" target="_top">std::deque</a>.
+ It is a kind of sequence similar to <a href="https://www.boost.org/sgi/stl/List.html" target="_top">std::list</a>
+ or <a href="https://www.boost.org/sgi/stl/Deque.html" target="_top">std::deque</a>.
It supports random access iterators, constant time insert and erase operations
at the beginning or the end of the buffer and interoperability with std algorithms.
</p>
@@ -117,14 +115,14 @@
<span class="inlinemediaobject"><img src="../../libs/circular_buffer/doc/images/circular_buffer.png"></span>
</p>
<p>
- There is also a <code class="computeroutput"><a class="link" href="boost/circular_idm46366252757920.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>
+ There is also a <code class="computeroutput"><a class="link" href="boost/circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>
version available.
</p>
<p>
<span class="inlinemediaobject"><img src="../../libs/circular_buffer/doc/images/space_optimized.png"></span>
</p>
<p>
- <code class="computeroutput"><a class="link" href="boost/circular_idm46366252757920.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>
+ <code class="computeroutput"><a class="link" href="boost/circular_idm45097335975600.html" title="Class template circular_buffer_space_optimized">circular_buffer_space_optimized</a></code>
is an adaptation of the <code class="computeroutput"><a class="link" href="boost/circular_buffer.html" title="Class template circular_buffer">circular_buffer</a></code>
which <span class="bold"><strong>does not allocate memory all at once when created</strong></span>,
instead it allocates memory as needed.
@@ -150,7 +148,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: April 09, 2019 at 19:43:22 GMT</small></p></td>
+<td align="left"><p><small>Last revised: August 14, 2019 at 12:10:19 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>